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

210421631841 · Jun 202019922001200920172026
48 results for Training trajectory

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.

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 ↗

The paper investigates how neural network weights evolve to monitor training progress.

problem Monitoring the training progress of neural networks in a cost-effective manner.
method Investigates the evolution of neural network weights in weight space.
result DNN models evolve on unique, smooth trajectories in weight space that can be used to track training progress.

Reasoning models generate differently based on problem difficulty, not just length.

problem Understanding how reasoning models handle different problem difficulties.
method Examined hidden-state trajectories across competitive programming, mathematics, and Boolean satisfiability.
result Corrected trajectory geometry shows difficulty-dependent differences in reasoning models, with stronger effects in the code domain.

The study analyzes optimization trajectories in neural networks to reveal redundancy and redundancy-reducing strategies.

problem Understanding the directional structure and redundancy in neural network optimization.
method Introducing natural notions of complexity for optimization trajectories and analyzing their directional nature.
result Training only scalar batchnorm parameters can match the performance of training the entire network, indicating potential for hybrid optimization schemes.

Cohen et al. (2021) show GD trajectories align on a bifurcation diagram.

problem Understanding the Edge of Stability (EoS) phenomenon in gradient descent.
method Empirical studies and rigorous mathematical proofs for two-layer networks and single-neuron networks.
result GD trajectories align on a specific bifurcation diagram independent of initialization.

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.

Study shows different trajectory prediction models generalize better under OoD conditions.

problem Comparing trajectory prediction models' robustness across different datasets.
method Training models on Argoverse 2 and testing on Waymo Open Motion, and vice versa, with various augmentation strategies.
result Smallest model with highest inductive bias performs best in OoD generalization.

In this paper, we focus on the development of a method that detects abnormal trajectories of road users at traffic intersections. The main difficulty with this is the fact that there are very few abnormal data and the normal ones are insufficient for the training of any kinds of machine learning model. To tackle these …

2018-08-25abs ↗pdf ↗

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 ↗

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 ↗

We consider the problem of recovering an expert's reward function with inverse reinforcement learning (IRL) when there are missing/incomplete state-action pairs or observations in the demonstrated trajectories. This issue of missing trajectory data or information occurs in many situations, e.g., GPS signals from vehicl…

2019-11-16abs ↗pdf ↗

CCM improves context for Meta-RL by contrastive learning.

problem Improving context for Meta-RL to enable task generalization.
method CCM framework using contrastive learning for context encoding and information-gain-based trajectory collection.
result CCM outperforms state-of-the-art algorithms in benchmarks and sparse-reward environments.

Improved neural PDEs trained on augmented data enhance model accuracy and efficiency.

problem Training neural PDEs on limited data to accurately represent complex systems.
method Space-filling sampling of local states to generate augmented training data.
result Data-augmented neural PDEs outperform traditional emulators in accuracy and stability.

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 ↗

Navigating complex urban environments safely is a key to realize fully autonomous systems. Predicting future locations of vulnerable road users, such as pedestrians and cyclists, thus, has received a lot of attention in the recent years. While previous works have addressed modeling interactions with the static (obstacl…

2019-10-15abs ↗pdf ↗

New bounds on trajectory safety in training models with Langevin Dynamics.

problem Bounding the probability of a model's trajectory staying away from a designated failure region.
method Analyzes Langevin dynamics on smooth, strongly convex loss landscapes, introducing shape-free and local relaxation bounds.
result The in-set probability relaxes to the static value after a burn-in time of order d, using only the global spectral gap of the loss.

New algorithm improves RL performance across different environments.

problem Improving reinforcement learning performance across various environments.
method Designing a fully model-free DRRL algorithm that learns from a single trajectory.
result Demonstrates superior robustness and sample efficiency compared to existing methods.

KOMET identifies Koopman operators from model parameter trajectories to adapt to evolving data distributions.

problem Adaptation of parametric models to non-stationary environments.
method Data-driven framework using Koopman operator identification and Extended Dynamic Mode Decomposition (EDMD).
result KOMET achieves high autonomous-rollout accuracies of 0.981 to 1.000 over 100 time steps on various drifting datasets.

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.

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.

Generative model learns to mimic time-series behavior to generate accurate trajectories.

problem Learning generative models for time-series data with accurate multi-step trajectories.
method Contrastive imitation framework combining autoregressive and adversarial elements.
result The method generates accurate and useful samples from real-world datasets.

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.