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,695 papers · 148 categories

Trend · papers per month

10213141 · May 202619922001200920172026
48 results for grid congestion

Graph neural networks improve topology control of power grids.

problem Grid congestion due to renewable energy and electrification.
method Investigated the effect of graph representation on GNN effectiveness for topology control.
result Heterogeneous graph representation outperforms homogeneous in topology control tasks.

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.

Vehicular Ad-hoc NETworks (VANET) can efficiently detect traffic congestion, but detection is not enough because congestion can be further classified as recurrent and non-recurrent congestion (NRC). In particular, NRC in an urban network is mainly caused by incidents, workzones, special events and adverse weather. We p…

2019-04-26abs ↗pdf ↗

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.

The smart grid vision entails advanced information technology and data analytics to enhance the efficiency, sustainability, and economics of the power grid infrastructure. Aligned to this end, modern statistical learning tools are leveraged here for electricity market inference. Day-ahead price forecasting is cast as a…

2013-10-02abs ↗pdf ↗

Non-availability of reliable and sustainable electric power is a major problem in the developing world. Renewable energy sources like solar are not very lucrative in the current stage due to various uncertainties like weather, storage, land use among others. There also exists various other issues like mis-commitment of…

2017-11-08abs ↗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.

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.

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.

This paper connects deep neural networks to game theory, revealing their congestion game properties.

problem Understanding the behavior of deep neural networks using game theory.
method Analyzing deep neural networks as congestion games and applying game theory results.
result Deep neural networks exhibit congestion game properties, linking them to game theory.

Overprocuring reserves can improve network efficiency by using excess reserves for congestion management.

problem Optimizing energy and reserve allocation between zones to minimize costs and ensure deliverability.
method Developed allocation models for co-allocating traded energy and reserve products, considering both deterministic and stochastic flows.
result Excess reserve supplies can be used for congestion management, leading to additional network benefits.

This paper proposes MM-DAGs for analyzing traffic congestion, learning multiple DAGs jointly.

problem Analyzing multi-modal traffic data with overlapping and distinct variables.
method Developed MM-DAGs for multi-task, multi-modal DAG learning, using multi-modal regression and CD measure.
result Proved the effectiveness of MM-DAGs in traffic congestion analysis.

Service-induced congestion in memory-constrained LLM serving

problem Service-induced congestion in memory-constrained large language model (LLM) serving
method Developing a discrete-time dynamical model of memory-constrained LLM inference
result The system converges to a unique worst-case limit cycle that is asymptotically stable outside a Lebesgue-measure-zero exact-capture set, with throughput losses as large as 50%.

Study on-chain peak shaving to reduce Ethereum transaction costs.

problem Reducing transaction costs in blockchain networks, especially during congested periods.
method Analyzing transaction-level data from multiple firms across various industries to understand scheduling responses and cost management strategies.
result Firms' scheduling responses to congestion vary, leading to different fee savings and residual costs.

Proposes three decentralized multi-agent reinforcement learning algorithms to reduce network congestion.

problem Finding a joint policy maximizing long-term return in a decentralized multi-agent system.
method Three fully decentralized multi-agent natural actor-critic (MAN) algorithms using linear function approximations.
result The proposed algorithms achieve performance comparable to or better than standard methods in reducing network congestion.

Backdoor attacks on DRL-based traffic controllers cause stop-and-go waves or crashes.

problem Vulnerability of DRL-based traffic controllers to machine learning attacks.
method Developed a trigger design methodology based on traffic physics principles.
result Backdoored models can cause stop-and-go traffic waves or AV crashes when triggered.

This paper gives a critical account of the minority game literature. The minority game is a simple congestion game: players need to choose between two options, and those who have selected the option chosen by the minority win. The learning model proposed in this literature seems to differ markedly from the learning mod…

2007-06-29abs ↗pdf ↗

We present a grid diagram analogue of Carter, Rieger and Saito's smooth movie theorem. Specifically, we give definitions for grid movies, grid movie isotopies and present a definition of grid planar isotopy as a particular subset of the grid diagram moves: stabilization, destabilization and commutation. We show that gr…

2013-03-07abs ↗pdf ↗

In this paper we present a Recurrent neural networks (RNN) based architecture that achieves an AUCROC of 0.9147 for predicting the onset of Congestive Heart Failure (CHF) 15 months in advance using a 12-month observation window on a large cohort of 216,394 patients. We believe this to be the largest study in CHF onset …

2019-02-07abs ↗pdf ↗

The paper introduces triple grid diagrams to construct Lagrangian surfaces in complex projective space.

problem Constructing Lagrangian surfaces in complex projective space.
method Defining and analyzing triple grid diagrams to determine Lagrangian caps and surfaces.
result Triple grid diagrams can determine closed Lagrangian surfaces in CP2\mathbb{CP}^2 under certain conditions.

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.

Half grid diagrams prove every link can be represented by a special type of grid diagram.

problem Representing links using grid diagrams and related invariants.
method Defining half grid diagrams and constructing canonical pairs, proving equivalence to Jones' construction, relating to classical link invariants.
result Established a new method to relate the oriented Thompson index to classical link invariants and provided bounds for knot invariants.

Grid homology properties for MOY graphs studied.

problem Defining and studying properties of grid homology for MOY graphs.
method Defined grid homology from Harvey and O'Donnol's work. Studied properties using oriented skein relation, edge contraction, and parallel edge unification.
result Properties of grid homology for MOY graphs were studied and defined.