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

Trend · papers per month

4794140187 · Jun 202019922001200920172026
48 results for Trajectory Collection

Paper finds optimal shapes for minimizing average lengths of billiard trajectories in specific polygons.

problem Finding optimal shapes to minimize the average length of billiard trajectories.
method Used techniques from Teichmüller theory.
result Optimal shapes minimize average lengths of billiard trajectories in specific polygons.

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.

New method learns particle system potentials from unlabeled data.

problem Learning potentials of interacting particle systems from unlabeled data with trajectory information missing.
method Introduces a self-test loss function based on stochastic evolution equation.
result Method outperforms baseline methods in robust estimation of large, high-dimensional systems.

Policy optimization is an effective reinforcement learning approach to solve continuous control tasks. Recent achievements have shown that alternating online and offline optimization is a successful choice for efficient trajectory reuse. However, deciding when to stop optimizing and collect new trajectories is non-triv…

2018-09-17abs ↗pdf ↗

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.

In Reinforcement Learning (RL), an agent explores the environment and collects trajectories into the memory buffer for later learning. However, the collected trajectories can easily be imbalanced with respect to the achieved goal states. The problem of learning from imbalanced data is a well-known problem in supervised…

2019-02-20abs ↗pdf ↗

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.

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.

Medical researchers are coming to appreciate that many diseases are in fact complex, heterogeneous syndromes composed of subpopulations that express different variants of a related complication. Time series data extracted from individual electronic health records (EHR) offer an exciting new way to study subtle differen…

2016-06-29abs ↗pdf ↗

The paper translates economic models into a field formalism to study capital accumulation and its fluctuations.

problem Understanding capital accumulation and its fluctuations in a complex economic system.
method Developed a field formalism to preserve interactions and microeconomic features, applying it to a microeconomic framework of investors and firms.
result Capital accumulation patterns can emerge at the macro-scale and affect neighboring sectors, leading to permanent fluctuations.

Paper resolves the debate on process vs. outcome supervision in reinforcement learning.

problem Distinguishing between process and outcome supervision in reinforcement learning.
method Developed a technical tool (Change of Trajectory Measure Lemma) to show equivalence between outcome and process supervision under standard data coverage assumptions.
result Reinforcement learning through outcome supervision is statistically equivalent to process supervision, up to polynomial factors in horizon.

Consider a data set collected by (individuals-features) pairs in different times. It can be represented as a tensor of three dimensions (Individuals, features and times). The tensor biclustering problem computes a subset of individuals and a subset of features whose signal trajectories over time lie in a low-dimensiona…

2019-03-10abs ↗pdf ↗

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 ↗

Topological entropy measures the number of distinguishable orbits in a dynamical system, thereby quantifying the complexity of chaotic dynamics. One approach to computing topological entropy in a two-dimensional space is to analyze the collective motion of an ensemble of system trajectories taking into account how traj…

2018-08-30abs ↗pdf ↗

Study shows similarities and differences in crypto and equity dynamics during pandemic.

problem Comparing cryptocurrency and equity market dynamics during the pandemic.
method New methodologies applied to study cryptocurrency and equity market dynamics, including recently introduced methods for trajectory and anomaly analysis.
result Cryptocurrencies exhibit stronger collective dynamics and correlation, while equities show greater persistence in anomalies over time.

Reinforcement learning algorithms are known to be sample inefficient, and often performance on one task can be substantially improved by leveraging information (e.g., via pre-training) on other related tasks. In this work, we propose a technique to achieve such knowledge transfer in cases where agent trajectories conta…

2019-10-14abs ↗pdf ↗

Measures collectivity in financial covariances and correlations to reveal trends and precursors.

problem Capturing collective motion in financial markets to predict trends and precursors.
method Measures collectivity using the largest eigenvalue and average sector collectivity.
result Identifies collective signals around major financial events and captures trends in covariances and correlations.

The paper learns particle swarming models from data using Gaussian processes.

problem Understanding the link between individual interaction rules and swarming behavior.
method Proposes a learning approach using Gaussian processes to model latent radial interaction functions and scalar parameters in non-collective friction forces.
result Establishes that a coercivity condition is sufficient for recoverability and provides a finite-sample analysis showing optimal convergence rates.

Bayesian method infers local rules for collective animal movement.

problem Learn local rules governing long-term group behaviors.
method Bayesian Inverse Reinforcement Learning with Linearly-Solvable Markov Decision Process.
result Recover true costs and find value of collective movement.

The study finds the best elliptical trajectory for planets using a variation of the hodograph theorem.

problem Finding the best elliptical trajectory for planets.
method Using a variation of the circular hodograph theorem, the study finds the best fitting ellipse for planetary trajectories by minimizing the sum of square distances from the points to the plane.
result The study finds that the best fitting ellipse for planetary trajectories minimizes the sum of square distances from the points to the plane.

Tracking large numbers of densely-arranged, interacting objects is challenging due to occlusions and the resulting complexity of possible trajectory combinations, as well as the sparsity of relevant, labeled datasets. Here we describe a novel technique of collective tracking in the model environment of a 2D honeybee hi…

2018-12-31abs ↗pdf ↗

PlanGAN uses GANs to plan efficient trajectories for multi-goal tasks in sparse reward environments.

problem Learning with sparse rewards in multi-goal environments.
method PlanGAN combines GANs to generate trajectories leading to specified goals, then combines these into a planning algorithm.
result PlanGAN achieves comparable performance to model-free RL but is 4-8 times more sample efficient.

Meta-algorithm for efficient reinforcement learning from human preferences.

problem Learning from human preference comparisons in Markov decision processes.
method Randomized exploration and experimental design for batch comparison queries.
result Meta-algorithm achieves both regret and last-iterate guarantees with minimal preference queries.

This paper presents a novel context-based approach for pedestrian motion prediction in crowded, urban intersections, with the additional flexibility of prediction in similar, but new, environments. Previously, Chen et. al. combined Markovian-based and clustering-based approaches to learn motion primitives in a grid-bas…

2018-06-25abs ↗pdf ↗

Particle- and agent-based systems are a ubiquitous modeling tool in many disciplines. We consider the fundamental problem of inferring interaction kernels from observations of agent-based dynamical systems given observations of trajectories, in particular for collective dynamical systems exhibiting emergent behaviors w…

2019-12-23abs ↗pdf ↗

HAMBO estimates policy performance by hallucinating worst-case trajectories, providing valid lower bounds.

problem Conservative off-policy evaluation of policies in real-world applications.
method HAMBO hallucinates worst-case trajectories based on learned model uncertainty.
result Valid lower bounds on policy performance, converging to true expected return under regular conditions.

NOs can learn any finite collection of classes in functional data.

problem Learning finite collections of classes in infinite-dimensional spaces.
method Proved sample-based neural operators can learn any finite collection of classes in an infinite-dimensional reproducing kernel Hilbert space.
result NOs can learn any finite collection of classes in an infinite-dimensional reproducing kernel Hilbert space, even when the classes are not convex or connected.

A tutorial on various methods for clustering longitudinal data.

problem Identifying groups with different trends in longitudinal data.
method Group-based trajectory modeling, growth mixture modeling, longitudinal k-means.
result Strengths, limitations, and model extensions of the methods are discussed.

This work proposes a new feature for transportation mode classification using GPS trajectories.

problem Classifying transportation modes from GPS trajectories to optimize urban mobility.
method The Ordinal Pattern Transition Graph and its self-transition probability are used for classification.
result The proposed feature outperforms existing methods in transportation mode classification.

Estimates causal effects from patient trajectories using DeepACE model.

problem Estimating causal effects from observational data in medical practice.
method DeepACE model using iterative G-computation formula and sequential targeting procedure.
result DeepACE achieves state-of-the-art performance in estimating time-varying ACEs.