An Empirical Experiment on Deep Learning Models for Predicting Traffic
Data
- URL: http://arxiv.org/abs/2105.05504v1
- Date: Wed, 12 May 2021 08:28:12 GMT
- Title: An Empirical Experiment on Deep Learning Models for Predicting Traffic
Data
- Authors: Hyunwook Lee, Cheonbok Park, Seungmin Jin, Hyeshin Chu, Jaegul Choo,
Sungahn Ko
- Abstract summary: Deep learning models have been proposed to aid decision-makers in the traffic control domain.
It is difficult to figure out which models provide state-of-the-art performance.
It is also difficult to determine which models would work when traffic conditions change abruptly.
- Score: 18.103216508546645
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: To tackle ever-increasing city traffic congestion problems, researchers have
proposed deep learning models to aid decision-makers in the traffic control
domain. Although the proposed models have been remarkably improved in recent
years, there are still questions that need to be answered before deploying
models. For example, it is difficult to figure out which models provide
state-of-the-art performance, as recently proposed models have often been
evaluated with different datasets and experiment environments. It is also
difficult to determine which models would work when traffic conditions change
abruptly (e.g., rush hour). In this work, we conduct two experiments to answer
the two questions. In the first experiment, we conduct an experiment with the
state-of-the-art models and the identical public datasets to compare model
performance under a consistent experiment environment. We then extract a set of
temporal regions in the datasets, whose speeds change abruptly and use these
regions to explore model performance with difficult intervals. The experiment
results indicate that Graph-WaveNet and GMAN show better performance in
general. We also find that prediction models tend to have varying performances
with data and intervals, which calls for in-depth analysis of models on
difficult intervals for real-world deployment.
Related papers
- Evaluating the Generalization Ability of Spatiotemporal Model in Urban Scenario [11.208740750755025]
We propose a Spatiotemporal Out-of-Distribution (ST-OOD) benchmark, which comprises six urban scenario: bike-sharing, 311 services, pedestrian traffic speed, traffic flow, ride-hailing demand, and bike-sharing.
We extensively evaluate state-of-the-arttemporal models and find that their performance degrades significantly in out-of-distribution settings, with most models performing even worse than a simple Multi-Layer Perceptron (MLP)
Our results showed that a slight dropout rate could significantly improve generalization performance on most datasets, with minimal impact on in-distribution performance.
arXiv Detail & Related papers (2024-10-07T04:15:48Z) - Time Series Continuous Modeling for Imputation and Forecasting with Implicit Neural Representations [15.797295258800638]
We introduce a novel modeling approach for time series imputation and forecasting, tailored to address the challenges often encountered in real-world data.
Our method relies on a continuous-time-dependent model of the series' evolution dynamics.
A modulation mechanism, driven by a meta-learning algorithm, allows adaptation to unseen samples and extrapolation beyond observed time-windows.
arXiv Detail & Related papers (2023-06-09T13:20:04Z) - Non-Invasive Fairness in Learning through the Lens of Data Drift [88.37640805363317]
We show how to improve the fairness of Machine Learning models without altering the data or the learning algorithm.
We use a simple but key insight: the divergence of trends between different populations, and, consecutively, between a learned model and minority populations, is analogous to data drift.
We explore two strategies (model-splitting and reweighing) to resolve this drift, aiming to improve the overall conformance of models to the underlying data.
arXiv Detail & Related papers (2023-03-30T17:30:42Z) - Exploring the Effects of Data Augmentation for Drivable Area
Segmentation [0.0]
We focus on investigating the benefits of data augmentation by analyzing pre-existing image datasets.
Our results show that the performance and robustness of existing state of the art (or SOTA) models can be increased dramatically.
arXiv Detail & Related papers (2022-08-06T03:39:37Z) - Exploring Strategies for Generalizable Commonsense Reasoning with
Pre-trained Models [62.28551903638434]
We measure the impact of three different adaptation methods on the generalization and accuracy of models.
Experiments with two models show that fine-tuning performs best, by learning both the content and the structure of the task, but suffers from overfitting and limited generalization to novel answers.
We observe that alternative adaptation methods like prefix-tuning have comparable accuracy, but generalize better to unseen answers and are more robust to adversarial splits.
arXiv Detail & Related papers (2021-09-07T03:13:06Z) - STAR: Sparse Transformer-based Action Recognition [61.490243467748314]
This work proposes a novel skeleton-based human action recognition model with sparse attention on the spatial dimension and segmented linear attention on the temporal dimension of data.
Experiments show that our model can achieve comparable performance while utilizing much less trainable parameters and achieve high speed in training and inference.
arXiv Detail & Related papers (2021-07-15T02:53:11Z) - On the Efficacy of Adversarial Data Collection for Question Answering:
Results from a Large-Scale Randomized Study [65.17429512679695]
In adversarial data collection (ADC), a human workforce interacts with a model in real time, attempting to produce examples that elicit incorrect predictions.
Despite ADC's intuitive appeal, it remains unclear when training on adversarial datasets produces more robust models.
arXiv Detail & Related papers (2021-06-02T00:48:33Z) - Deep Convolution for Irregularly Sampled Temporal Point Clouds [39.51507835155255]
We consider the problem of modeling the dynamics of continuous spatial-temporal processes represented by irregular samples through both space and time.
We propose a new deep model that is able to directly learn and predict over this irregularly sampled data, without voxelization.
We present experiments on real-world weather station data and battles between large armies in StarCraft II.
arXiv Detail & Related papers (2021-05-01T00:54:32Z) - Models, Pixels, and Rewards: Evaluating Design Trade-offs in Visual
Model-Based Reinforcement Learning [109.74041512359476]
We study a number of design decisions for the predictive model in visual MBRL algorithms.
We find that a range of design decisions that are often considered crucial, such as the use of latent spaces, have little effect on task performance.
We show how this phenomenon is related to exploration and how some of the lower-scoring models on standard benchmarks will perform the same as the best-performing models when trained on the same training data.
arXiv Detail & Related papers (2020-12-08T18:03:21Z) - Dataset Cartography: Mapping and Diagnosing Datasets with Training
Dynamics [118.75207687144817]
We introduce Data Maps, a model-based tool to characterize and diagnose datasets.
We leverage a largely ignored source of information: the behavior of the model on individual instances during training.
Our results indicate that a shift in focus from quantity to quality of data could lead to robust models and improved out-of-distribution generalization.
arXiv Detail & Related papers (2020-09-22T20:19:41Z) - Progressive Growing of Neural ODEs [7.558546277131641]
We propose a progressive learning paradigm of NODEs for long-term time series forecasting.
Specifically, following the principle of curriculum learning, we gradually increase the complexity of data and network capacity as training progresses.
Our experiments with both synthetic data and real traffic data (PeMS Bay Area traffic data) show that our training methodology consistently improves the performance of vanilla NODEs by over 64%.
arXiv Detail & Related papers (2020-03-08T01:15:01Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.