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

Trend · papers per month

12.5%25.0%37.5%50.0% · May 199319922001200920172026
48 results for Transportation Systems

Survey of deep RL in intelligent transportation systems.

problem Optimizing traffic signals and autonomous driving using deep RL.
method Comprehensive review of deep RL applications in traffic control and autonomous driving.
result Summarizes existing works in deep RL-based transportation applications.

The paper studies optimal transport in linear quadratic systems and derives interpolation inequalities.

problem Optimal transport problem in Linear Quadratic optimal control systems.
method Well-posedness of the Monge problem, regularity of optimal transport map, displacement interpolation of measures.
result Derivation of general interpolation inequalities for entropy functionals.

We explore the use of deep learning and deep reinforcement learning for optimization problems in transportation. Many transportation system analysis tasks are formulated as an optimization problem - such as optimal control problems in intelligent transportation systems and long term urban planning. Often transportation…

2018-06-14abs ↗pdf ↗

Method predicts how probability distributions evolve over time.

problem Predicting how systems described by probability distributions evolve under different conditions.
method Wasserstein Parallel Transport
result Wasserstein Parallel Transport provides counterfactual comparisons of distributional dynamics.

New nonlinear smoothers improve state estimation in chaotic systems.

problem Improving state estimation in chaotic dynamical systems with non-Gaussian behavior.
method Developed nonlinear backward ensemble transport smoothers with parameterization and regularization of transport maps.
result Nonlinear smoothers yield lower estimation error than conventional methods for comparable model evaluations.

A new method improves Bayesian filtering in nonlinear systems.

problem Bayesian filtering in nonlinear dynamical systems with non-Gaussian posteriors.
method Transport maps with block-triangular structure and gradient flows for MMD minimization.
result Accurate approximation of non-Gaussian posteriors without particle collapse.

New metric compares noisy neural trajectories using optimal transport.

problem Existing metrics fail to capture differences in noisy, dynamic neural responses.
method Proposed an optimal transport distance metric for Gaussian processes.
result Metric effectively compares neural dynamics in different systems.

Researchers develop neural optimal transport with Lagrangian costs for efficient computation.

problem Optimal transport between measures with Lagrangian costs for systems with geometric constraints.
method Neural network approach to compute geodesics and optimal transport maps efficiently.
result Efficient computation of geodesics and optimal transport maps without ODE solvers.

Polestar optimizes public transportation routes for efficiency and user satisfaction.

problem Difficulty in finding optimal public transportation routes due to complex networks and dynamic situations.
method Developed a Public Transportation Graph (PTG) and a route search algorithm with station binding and ranking modules.
result Demonstrated superior efficiency and user satisfaction compared to existing systems.

New proof of Schwarzschild stability using geometric gauge.

problem Linear stability of Schwarzschild spacetime under gravitational perturbations.
method Employing a new geometric gauge and exploiting the structure of transport equations.
result Established both orbital and asymptotic stability for linearised quantities.

Optimal transport strategy reduces gender bias in job recommendation systems.

problem Mitigating gender biases in AI-driven job recommendation systems.
method Model agnostic optimal transport strategy applied to multi-class neural networks.
result Reduced undesirable algorithmic biases in job recommendation tasks.

Discontinuous Finite Element Methods (DFEM) have been widely used for solving SnS_n radiation transport problems in participative and non-participative media. In the DFEM SnS_n methodology, the transport equation is discretized into a set of algebraic equations that have to be solved for each spatial cell and angular d…

2019-06-06abs ↗pdf ↗

Predicting transportation modes from GPS (Global Positioning System) records is a hot topic in the trajectory mining domain. Each GPS record is called a trajectory point and a trajectory is a sequence of these points. Trajectory mining has applications including but not limited to transportation mode detection, tourism…

2018-07-28abs ↗pdf ↗

This paper improves transportation efficiency by teaching automated vehicles to cooperate.

problem Improving efficiency and safety of transportation systems with automated vehicles.
method Multi-agent graph reinforcement learning with attention mechanism.
result Automated vehicles can achieve better performance when learning to cooperate with each other.

Geometric programming approach for traffic equilibrium problems.

problem Optimizing traffic equilibrium in transportation systems.
method Finslerian dynamical model for nonlinear complementarity problems.
result Effective solution for various equilibrium problems in transportation.

Study on equilibrium points of dynamical systems with multiple integrals.

problem Understanding the equilibrium points of dynamical systems with multiple independent first integrals.
method Analyzes the equilibrium locus as a smooth manifold and fiber bundle with a natural connection.
result Parallel transport exists for the connection and can measure eigenvalue variations.

A new metric compares dynamical systems using operator eigenvalues.

problem Comparing and interpolating nonlinear dynamical systems from trajectory data.
method Representing systems as distributions of operator eigenvalues and projectors, defining a spectral-Grassmann Wasserstein metric.
result The proposed metric outperforms standard operator-based distances in machine learning applications.

New approach to concentration inequalities for unbounded state space dynamical systems.

problem Concentration inequalities for unbounded state space dynamical systems.
method Functional analytic framework, transport-entropy inequality.
result Exponential concentration inequalities for sampling from stationary distribution.

Adversarial attacks degrade DRL-based EV energy management systems.

problem Adversarial attacks on DRL-based energy management systems of electric vehicles.
method Generated adversarial examples to degrade DRL performance using low-dimensional state representations.
result Adversarial attacks can significantly degrade DRL-based EV energy management systems.

The paper solves the optimal transport problem between algebraic hypersurfaces.

problem Optimal deformation of projective hypersurfaces.
method Measure theory and optimal transport, embedding into measure space, constrained dynamical formulation.
result Introduction of an inner Wasserstein distance finer than the Fubini-Study distance.

Paper generalizes tensor-train approximation for complex random variables.

problem Characterizing intractable high-dimensional random variables.
method Extends inverse Rosenblatt transform to general reference measures and integrates into deep variable transformation framework.
result Deep inverse Rosenblatt transport significantly expands tensor approximations for complex random variables.

Adaptive algorithm improves nonlinear data assimilation for non-Gaussian systems.

problem Challenges of non-Gaussian statistics in data assimilation.
method Triangular measure transport with P-spline basis functions and an information criterion.
result Automatic selection of parsimonious parametrization for efficient adaptation.

MF-PID uses interacting samples to efficiently transport probability mass.

problem Efficiently transporting probability mass in generative models.
method Introducing Mean-Field Path-Integral Diffusion (MF-PID) where samples become interacting agents.
result MF-PID achieves 19-24% reductions in control energy for demand-response control of energy systems.

We investigated the feature map inside deep neural networks (DNNs) by tracking the transport map. We are interested in the role of depth (why do DNNs perform better than shallow models?) and the interpretation of DNNs (what do intermediate layers do?) Despite the rapid development in their application, DNNs remain anal…

2016-05-10abs ↗pdf ↗

CAST predicts distribution-valued time series by stabilizing and transporting simplex-supported successors.

problem Forecasting distribution-valued time series with structural failure modes.
method CAST (Causal Anchored Simplex Transport) uses successors retrieved from causal context, stabilized with a persistence anchor, and locally transported on ordered supports.
result CAST outperforms baselines on eleven public and simulated benchmarks, achieving best average rank on both one-step KL and autoregressive rollout JSD.

We propose a version of the non-relativistic quantum mechanics in which the pure states of a quantum system are described as sections of a Hilbert (generally infinitely-dimensional) fibre bundle over the space-time. There evolution is governed via (a kind of) a parallel transport in this bundle. Some problems concernin…

1998-03-29abs ↗pdf ↗

Framework for worst-case generation using Wasserstein space optimization.

problem Evaluating robustness and stress-testing systems under distribution shifts.
method Min-max optimization over continuous probability distributions in Wasserstein space.
result Global convergence guarantees for the proposed Gradient Descent Ascent scheme.