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

3917831,1741,565 · Jun 202019922001200920172026
48 results for trajectory learning

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.

Generative model learns vehicle trajectory distributions for better data generalization.

problem Data sparsity and privacy issues in urban vehicle trajectory analysis.
method Generative adversarial imitation learning framework for urban vehicle trajectory generation.
result TrajGAIL model produces synthetic trajectories similar to real ones, achieving significant performance gains.

Analyzing the urban trajectory in cities has become an important topic in data mining. How can we model the human mobility consisting of stay and travel from the raw trajectory data? How can we infer such a mobility model from the single trajectory information? How can we further generalize the mobility inference to ac…

2020-01-21abs ↗pdf ↗

A new reinforcement learning method reduces action complexity for robust control.

problem Deep reinforcement learning's susceptibility to spurious correlations.
method Minimizing trajectory entropy to encourage simple, predictable actions.
result Trajectory Entropy Reinforcement Learning achieves superior performance and robustness.

Algorithm learns mixtures of Markov chains and MDPs from short trajectories.

problem Learning mixtures of Markov chains and MDPs from short unlabeled trajectories.
method Subspace estimation, spectral clustering, EM algorithm, model estimation, classification.
result 96.6% average accuracy on a mixture of two MDPs in gridworld, outperforming EM algorithm with random initialization.

DETECT clusters mobility behaviors from trajectories using deep learning.

problem Clustering similar mobility behaviors in large, complex trajectory data.
method DETECT uses deep learning to cluster mobility behaviors from trajectories, transforming and summarizing them to identify similar behaviors.
result DETECT effectively clusters mobility behaviors from real-world datasets.

SafeMIL learns safer policies by avoiding risky behavior from non-preferred trajectories.

problem Learning safe imitation policies from non-preferred trajectories in risky environments.
method SafeMIL uses Multiple Instance Learning to learn a cost function from non-preferred trajectories.
result SafeMIL learns a safer policy that avoids non-preferred behaviors without sacrificing reward performance.

Deep Reinforcement Learning has shown tremendous success in solving several games and tasks in robotics. However, unlike humans, it generally requires a lot of training instances. Trajectories imitating to solve the task at hand can help to increase sample-efficiency of deep RL methods. In this paper, we present a simp…

2018-11-28abs ↗pdf ↗

New method learns behavioral representations from mobility data.

problem Analyzing behavioral similarity of moving individuals from CDR trajectories.
method mob2vec framework combining segmentation, generalization, and unsupervised learning.
result Mob2vec generates low-dimensional vector representations preserving mobility behavior similarities.

Trajectory optimization using a learned model of the environment is one of the core elements of model-based reinforcement learning. This procedure often suffers from exploiting inaccuracies of the learned model. We propose to regularize trajectory optimization by means of a denoising autoencoder that is trained on the …

2019-03-28abs ↗pdf ↗

Study learns dynamics of linear systems from multiple short trajectories.

problem Learning dynamics of autonomous linear systems from multiple short trajectories.
method Finite sample analysis for stable and unstable systems, adjusting trajectory length for marginally stable systems.
result Learning rate of O(1N)\mathcal{O}(\frac{1}{\sqrt{N}}) for both stable and unstable systems.

Study of supervised learning from multiple non-independent sequences.

problem Efficient learning from many non-independent sequences.
method Generalizes conditions for efficient learning from independent examples and single auto-correlated sequences.
result Error rate changes from Θ(n/mT)Θ(n / m T) to Ω(n2/m2T)Ω(n^2 / m^2 T) as the number of trajectories increases.

Analyzing the temporal behavior of nodes in time-varying graphs is useful for many applications such as targeted advertising, community evolution and outlier detection. In this paper, we present a novel approach, STWalk, for learning trajectory representations of nodes in temporal graphs. The proposed framework makes u…

2017-11-11abs ↗pdf ↗

New method improves learning from multiple correlated data trajectories.

problem Learning from multiple correlated data trajectories without mixing assumptions.
method Hellinger localization framework for maximum likelihood estimation.
result Instance-optimal bounds that scale with full data budget under broad conditions.

Bayesian method estimates dynamics from near-optimal trajectories.

problem Estimating dynamics from near-optimal expert trajectories in reinforcement learning.
method Constraint-based Bayesian approach integrating expert near-optimality.
result Significant improvements in decision-making and transfer success.

Paper characterizes optimal learning trajectories for high-dimensional nonlinear models.

problem Characterizing optimal learning trajectories in high-dimensional nonlinear models.
method Exploits maximum principle and dynamic programming for an optimal control problem of a gradient system.
result Constructs optimal learning trajectories leading to optimal model parameters.

We present a method for learning options from segmented demonstration trajectories. The trajectories are first segmented into skills using nonparametric Bayesian clustering and a reward function for each segment is then learned using inverse reinforcement learning. From this, a set of inferred trajectories for the demo…

2020-01-19abs ↗pdf ↗

Learning to solve complex goal-oriented tasks with sparse terminal-only rewards often requires an enormous number of samples. In such cases, using a set of expert trajectories could help to learn faster. However, Imitation Learning (IL) via supervised pre-training with these trajectories may not perform as well and gen…

2019-11-03abs ↗pdf ↗

Study benchmarks methods for learning non-Cartesian k-space trajectories and reconstruction.

problem Benchmarking methods for learning non-Cartesian k-space trajectories and reconstruction.
method Comparing PILOT, BJORK, and HybLearn schemes to learn non-Cartesian k-space trajectories and reconstruction.
result HybLearn scheme outperforms other methods in learning and comparing non-Cartesian k-space trajectories and reconstruction.

DGFS improves sampling from complex densities by optimizing partial trajectories.

problem Sampling from intractable high-dimensional density functions.
method DGFS uses a flow function to break down the training process into short partial trajectory segments, leveraging intermediate learning signals.
result DGFS achieves more accurate estimates of the normalization constant.

End-to-end model predicts multiagent trajectories using game theory and neural nets.

problem Predicting trajectories of interacting agents in complex scenarios.
method Hybrid neural net with game-theoretic reasoning, using implicit layers to map preferences to Nash equilibria.
result Trains an interpretable model that predicts future trajectories and transfers to decision making.

Study uses vehicle trajectory data to predict traffic incidents on highways.

problem Early detection of traffic incidents to reduce secondary crashes.
method Machine learning algorithms (Logistic Regression, Random Forest, Extreme Gradient Boost, Artificial Neural Network) applied to vehicle trajectory data.
result Random Forest model performs best for incident prediction.

Visual observations of dynamic phenomena, such as human actions, are often represented as sequences of smoothly-varying features . In cases where the feature spaces can be structured as Riemannian manifolds, the corresponding representations become trajectories on manifolds. Analysis of these trajectories is challengin…

2016-03-07abs ↗pdf ↗

Enhanced decision-making through Dreamer's anticipatory trajectories and Online Decision Transformer.

problem Efficiently integrating world models with decision transformers.
method Combining Dreamer's trajectory forecasting with Online Decision Transformer's adaptive learning.
result Notable improvements in sample efficiency and reward maximization.

We address the problem of abnormal event detection from trajectory data. In this paper, a new adversarial approach is proposed for building a deep neural network binary classifier, trained in an unsupervised fashion, that can distinguish normal from abnormal trajectory-based events without the need for setting manual d…

2019-03-26abs ↗pdf ↗

Trajectory-level supervision allows efficient offline reinforcement learning.

problem Offline reinforcement learning
method Developing a statistical theory for offline policy optimization from trajectory-level labels
result Proving a high-probability guarantee of order O~(H2Csa(π)/n)\widetilde O(H^2\sqrt{C_{sa}(\pi^\star)/n})

Meta-learning improves drone trajectory design for dynamic wireless networks.

problem Designing optimal trajectories for energy-constrained drones in dynamic network environments.
method Proposes a meta-learning algorithm to adaptively tune a reinforcement learning solution for trajectory design.
result Meta-tuned RL yields faster convergence and improved communication performance compared to baseline algorithms.

This paper compares deep learning and knowledge-based methods for pedestrian trajectory prediction.

problem Predicting pedestrian trajectories in crowded scenes is challenging due to external factors.
method Comprehensive comparison of deep learning and knowledge-based models.
result Deep learning models outperform knowledge-based models in local trajectory prediction.

Current reinforcement learning (RL) algorithms can be brittle and difficult to use, especially when learning goal-reaching behaviors from sparse rewards. Although supervised imitation learning provides a simple and stable alternative, it requires access to demonstrations from a human supervisor. In this paper, we study…

2019-12-12abs ↗pdf ↗

MOCK learns complex systems from trajectories efficiently.

problem Learning nonparametric differential equations from high-dimensional data.
method MOCK uses multivariate occupation kernel functions to learn vector fields linearly.
result MOCK outperforms other methods on various datasets.

Safe active learning for time-series models with Gaussian processes.

problem Learning time-series models while respecting safety constraints.
method Employing Gaussian processes with a nonlinear exogenous input structure, the approach dynamically explores the input space to generate data for model learning.
result The approach effectively learns time-series models under safety constraints, as demonstrated in a technical application.