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

94188281375 · Jun 202019922001200920172026
48 results for Trajectory Term

WayDCM predicts trajectories considering long-term goals, improving accuracy.

problem Predicting future trajectories of dynamic agents in complex environments.
method WayDCM combines DCM and NN to predict intermediate goals and trajectories, considering long-term goals.
result WayDCM outperforms previous methods on the Waymo Open dataset.

Paper uses deep imitation learning to predict aircraft trajectories accurately.

problem Inefficient and costly Air Traffic Management system limits predictability.
method Generative Adversarial Imitation Learning framework with trajectory clustering and classification.
result Accurate predictions for entire trajectory stages, pre- and tactical.

Variational inference improves training of generative flow networks.

problem Training generative flow networks efficiently and accurately.
method Define variational objectives in terms of KL divergences and optimize convex combinations.
result Variational inference methods can reduce the variance of gradients in training generative flow networks.

Stochastic gradient descent's long-term fluctuations are described by a diffusion limit.

problem Long-term behavior of stochastic gradient descent in non-smooth settings.
method Functional central limit theorem applied to rescaled trajectory of SGD.
result Characterization of long-term fluctuations around the minimizer.

Improved generalization bounds for SGD in non-convex learning.

problem Understanding generalization properties of SGD in non-convex settings.
method Introducing Type II perturbed SGD (T2pm-SGD) to analyze generalization error bounds.
result Tighter generalization error bounds for SGD in non-convex learning, especially for sub-Gaussian and bounded loss functions.

Proposes a CNN-based method for better trajectory owner prediction.

problem Improves trajectory owner prediction for better personalized recommendations and urban planning.
method Connects POIs in a graph, encodes POIs into vectors, transforms trajectories into matrices, and uses a CNN to detect features and predict owners.
result Significantly outperforms existing methods in various metrics.

The paper provides uniform length estimates for trajectories on flat cone surfaces.

problem Estimating the length of trajectories on flat cone surfaces.
method Using self-intersection numbers and constants depending only on the flat metric, the paper focuses on convex flat cone spheres with a positive curvature gap and a fixed number of singularities.
result Uniform two-sided estimates for trajectory lengths on convex flat cone spheres are obtained.

Graph neural network predicts vehicle interactions and trajectories for autonomous driving.

problem Predicting future motion of vehicles in traffic scenes.
method Graph neural network that jointly predicts interaction modes and 5-second future trajectories.
result Jointly predicting trajectories and interaction modes leads to lower trajectory error.

Paper proposes a reinforcement learning method for trading using expert trajectories.

problem Inability of existing methods to handle long-term goals and delayed rewards in futures trading.
method Modeling futures trading as MDP, using reinforcement learning with expert trajectories and multiple short-term alpha factors.
result The proposed method outperforms traditional and deep learning methods in trading performance.

Improves neural relational inference for dynamic multi-agent trajectories.

problem Limited accuracy of NRI in short output sequences for relational inference in multi-agent trajectories.
method Proposes DYnamic multi-AgentRelational Inference (DYARI) model to handle changing interactions over time.
result DYARI model outperforms NRI in dynamic relational inference tasks.

End-to-end framework optimizes constrained trajectories using data-driven methods.

problem Optimizing trajectories under constraints with limited dynamics knowledge.
method Data-driven approach decomposes trajectories into function basis, uses maximum a posteriori for optimization, and incorporates linear constraints.
result Commanding results in aeronautics and sailing route optimization.

A method for representing and comparing categorical trajectories using multivariate functional principal components.

problem Statistical description and comparison of categorical trajectories.
method Transforming categorical trajectories into binary indicator functions and applying multivariate functional principal components analysis.
result Consistent estimators of mean trajectories and covariance functions are obtained under weak regularity assumptions.

Proposes a method to learn system dynamics and region of attraction from trajectories.

problem Learning accurate dynamics and region of attraction from system trajectories.
method Uses local stability information as a prior to learn vector field and region of attraction.
result Efficient sampling and accurate estimate of dynamics in inner approximation of region of attraction.

The study analyzes the performance of a nonparametric estimator for dynamical systems.

problem Analyzing the performance of a nonparametric estimator for dynamical systems.
method Nonparametric least squares estimator (LSE) and information-theoretic methods.
result Rate-optimal error bounds for nonparametric hypotheses classes.

This work tackles long-term visual planning by goal-conditioned hierarchical predictors.

problem Current learning approaches fail on long-horizon tasks due to lack of goal information and coarse-to-fine planning.
method Formulate goal-conditioned predictors (GCPs) and hierarchical models to predict trajectories between observations.
result GCPs enable effective long-term planning with much longer horizons than before.

Characterizes metabelian distributions and geodesics in sub-Riemannian manifolds.

problem Characterizing metabelian distributions and geodesics in sub-Riemannian manifolds.
method Characterization of metabelian distributions in terms of principal bundle structures. Proof of geodesic properties for rank-2 distributions.
result For rank-2 metabelian distributions, geodesics are of class C1C^1.

TD learning reduces prediction error in Markov chain problems.

problem Estimating value functions in Markov chains with temporal inconsistency.
method Temporal difference learning minimizes temporal inconsistency between successive estimates.
result TD learning can significantly reduce mean-squared error in value estimates.

In Hindsight Experience Replay (HER), a reinforcement learning agent is trained by treating whatever it has achieved as virtual goals. However, in previous work, the experience was replayed at random, without considering which episode might be the most valuable for learning. In this paper, we develop an energy-based fr…

2018-10-02abs ↗pdf ↗

TFM trains Neural SDEs without backpropagation, improving clinical time series modeling.

problem Modeling irregularly sampled time series in medicine.
method Trajectory Flow Matching (TFM) using flow matching for generative modeling.
result TFM improves performance on clinical time series datasets.

Learning weights in a spiking neural network with hidden neurons, using local, stable and online rules, to control non-linear body dynamics is an open problem. Here, we employ a supervised scheme, Feedback-based Online Local Learning Of Weights (FOLLOW), to train a network of heterogeneous spiking neurons with hidden l…

2017-12-29abs ↗pdf ↗

This study models target trajectories using stochastic processes for efficient tracking.

problem Efficiently modeling and predicting target trajectories in continuous time.
method Decomposes trajectory modeling into deterministic and stochastic components using Gaussian or Student's-tt processes.
result Demonstrates superior performance in tracking maneuvering targets compared to existing methods.

A new algorithm for offline RL with trajectory-wise reward reduces bias and variance errors.

problem Offline RL with trajectory-wise reward incurs large bias and variance errors.
method PARTED algorithm that decomposes trajectory return into proxy rewards and performs pessimistic value iteration.
result PARTED achieves provably efficient suboptimality bounds in general MDPs with trajectory-wise reward.

Enhances RL by controlling policy stochasticity through trajectory entropy constraints.

problem Non-stationary Q-value estimation and short-sighted entropy tuning in maximum entropy RL.
method Proposes TECRL framework with separate Q-functions for reward and entropy, enforcing a trajectory entropy constraint.
result DSAC-E algorithm achieves higher returns and better stability on OpenAI Gym benchmarks.

This paper explores a simple regularizer for reinforcement learning by proposing Generative Adversarial Self-Imitation Learning (GASIL), which encourages the agent to imitate past good trajectories via generative adversarial imitation learning framework. Instead of directly maximizing rewards, GASIL focuses on reproduc…

2018-12-03abs ↗pdf ↗

We consider the problem of finding optimal strategies that maximize the average growth-rate of multiplicative stochastic processes. For a geometric Brownian motion the problem is solved through the so-called Kelly criterion, according to which the optimal growth rate is achieved by investing a constant given fraction o…

2015-10-17abs ↗pdf ↗