Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,982 papers · 148 categories

Trend · papers per month

481216 · Mar 202019922001200920172026
48 results for Urban Congestion

Because of the prominent position of urban rail in reducing urban transport-related problems, such as congestion and air pollution, insights into the costs of possible new urban rail projects is very relevant for those involved with cost estimations, policy makers, cost-benefit analysts, and other target groups. Knowle…

2013-03-20abs ↗pdf ↗

GraphSVR forecasts urban air pollution robustly across stations and seasons.

problem Nonlinear, nonstationary, spatiotemporally dependent urban air pollution forecasting challenges.
method Combines graph convolutional learning and support vector regression.
result GraphSVR improves predictive accuracy and maintains stable performance across seasons and outlier-prone episodes.

This study develops methods to coordinate travel routes to reduce congestion.

problem Coordination of travel routes to reduce urban traffic congestion.
method Developed mathematical approaches to quantify coordination potential and adaptive centroid-based clustering algorithm (ACCA).
result ACCA efficiently forms proper coordination groups for CB-CRM, improving efficiency with minimal performance loss.

Proposes a dynamic model for urban traffic volume prediction.

problem Urban traffic volume prediction for better traffic management and driver planning.
method Combines bidirectional LSTM, attention mechanism, and external features.
result Improves prediction precision by 3-7 percent on NYC-Taxi and NYC-Bike datasets.

Paper predicts urban dispersal events using deep survival analysis on mobility data.

problem Predicting abnormal dispersal events in urban areas to mitigate congestion and safety risks.
method Formulated as a survival analysis problem, developed a two-stage deep learning framework (DILSA).
result DILSA predicts dispersal events with F1-score of 0.7 and average time error of 18 minutes.

Agent-based simulation assesses tradable credit schemes for congestion reduction.

problem Simplistic modeling of TCS impacts in transportation research.
method Agent- and activity-based simulation framework within SimMobility.
result TCS stabilizes network and market performance over time, reducing congestion.

Survey of deep learning applications in traffic congestion detection, prediction, and alleviation.

problem Improving transportation network service by detecting, predicting, and alleviating traffic congestion.
method Comprehensive review of deep learning applications in transportation, focusing on challenges specific to congestion.
result Identification of challenges and gaps in current research on deep learning for traffic congestion.

Model traffic congestion events using multi-modal data and attention-based neural networks.

problem Capture non-homogeneous temporal and directional spatial dependencies in traffic congestion events.
method Attention-based neural networks for point processes, adapted tail-up model for spatial statistics.
result Superior performance compared to state-of-the-art methods on synthetic and real data.

The paper tackles Nash-regret minimization in congestion games with bandit feedback.

problem Minimizing Nash-regret in congestion games with bandit feedback.
method Proposes centralized and decentralized algorithms for congestion games with bandit feedback, and a centralized algorithm for Markov congestion games.
result Sample complexity depends polynomially on the number of players and facilities, not the size of the action set.

Study of congestion in negative curvature manifolds using fair-division algorithms.

problem Estimating and predicting the size and location of congestion core in negative curvature manifolds.
method Introducing a novel fair-division algorithm to estimate congestion core.
result Demonstrated the effectiveness of fair-division algorithms in estimating congestion core.

New method estimates traffic congestion delays using statistical causality.

problem Accurate estimation of traffic congestion delays during accidents.
method Proposes a novel time delay estimation method using lag-specific transfer entropy (TE) and Markov bootstrap techniques.
result Validated the method's efficacy using simulated and real data.

Wasserstein GANs with Gradient Penalty compute a different optimal transport problem called congested transport.

problem Training generative models to produce high-quality synthetic data.
method Wasserstein GANs with Gradient Penalty (WGAN-GP) approach to calculate the Wasserstein 1 distance.
result WGAN-GP computes the minimum of the congested transport problem, not the Wasserstein 1 distance.

Intelligent Transportation Systems (ITSs) are envisioned to play a critical role in improving traffic flow and reducing congestion, which is a pervasive issue impacting urban areas around the globe. Rapidly advancing vehicular communication and edge cloud computation technologies provide key enablers for smart traffic …

2018-12-03abs ↗pdf ↗

NAC-FL optimizes model updates in FL systems by adapting compression to network congestion.

problem Federated Learning systems face congestion and delays in data exchanges.
method NAC-FL dynamically adjusts client compression based on network congestion.
result NAC-FL reduces training time and achieves robust performance improvements.

New framework analyzes LLM personalization trade-offs under congestion.

problem Tension between personalization and resource sharing in LLMs.
method Developed a statistical-economic framework to model user incentives.
result Congestion can flip rankings of SFT and ICL, and offers both methods never hurt profits.

Predicts morning traffic congestion using social media data from the previous evening.

problem Challenges in predicting early morning traffic dynamics.
method Mining Twitter messages to understand evening/midnight work and rest patterns.
result People's tweeting patterns before the morning commute are associated with traffic congestion.

Survey of urban flows prediction methods using various datasets.

problem Predicting urban flows influenced by human activities, weather, events, and holidays.
method Analysis of four main factors, preparation of multi-sources spatial-temporal data, detailed comparison of five categories of prediction methods.
result Facilitates researchers to choose suitable methods and datasets for urban flows prediction.

Graph embeddings from commute networks identify socioeconomic disparities in urban areas.

problem Urban delineation and socioeconomic group identification.
method Graph Neural Network (GNN) for modeling commute networks and deriving node embeddings.
result GNNs effectively capture socioeconomic disparities between urban communities.

We address two shortcomings in online travel time estimation methods for congested urban traffic. The first shortcoming is related to the determination of the number of mixture modes, which can change dynamically, within day and from day to day. The second shortcoming is the wide-spread use of Gaussian probability dens…

2018-04-22abs ↗pdf ↗

Decentralized algorithm reduces regret and converges to Nash equilibrium in online congestion games.

problem Online congestion games with exponential action sets and strict Nash equilibria.
method CongestEXP algorithm using exponential weights method.
result CongestEXP achieves O(kFT)O(kF\sqrt{T}) regret bound and almost exponential convergence to strict Nash equilibrium.

Proposes a model to understand urban dynamics from mega-metropolises.

problem Understanding residents mobility patterns in mega-metropolises.
method Neighbor-Regularized and context-aware Non-negative Tensor Factorization (NR-cNTF).
result NR-cNTF accurately captures city rhythms and spatial communities.

Understanding the causes of crime is a longstanding issue in researcher's agenda. While it is a hard task to extract causality from data, several linear models have been proposed to predict crime through the existing correlations between crime and urban metrics. However, because of non-Gaussian distributions and multic…

2017-12-08abs ↗pdf ↗

Dynamic linear models improve travel time prediction for congested freeways.

problem Accurate travel time prediction for congested freeways.
method Dynamic linear models (DLMs) with time-varying parameters.
result Significant improvements in travel time prediction accuracy, especially for short-term predictions.

Model predicts traffic speed using urban incidents.

problem Accurately predicting traffic speed in urban areas.
method Deep Incident-Aware Graph Convolutional Network (DIGC-Net).
result Model outperforms competing benchmarks in traffic speed prediction.

Novel graph model forecasts urban traffic with reduced spatial complexity.

problem Challenges in traffic forecasting due to spatio-temporal complexity, especially in urban environments.
method MW-TGC network model that combines spatial and temporal dependencies using multi-weighted adjacency matrices and graph convolution operations.
result MW-TGC network outperforms other models in urban-core and urban-mix sites, reducing variance in heterogeneous environments.