Improves RL from historical data by stitching trajectories.
problem Lack of high-quality data for offline RL.
method Trajectory Stitching (TS) to augment historical data with synthetic actions.
result Improves RL policy performance over baseline.
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
48 results for “trajectory stitching”
Improves BC policies by generating new plausible trajectories.
problem Sub-optimal data quality in BC leads to poor policy performance.
method Trajectory Stitching (TS) generates new plausible transitions.
result TS significantly improves behavioural policies over original data.
This paper challenges the conventional wisdom about temporal difference learning's superiority in stitching experience.
problem The effectiveness of temporal difference learning in stitching experience across different reinforcement learning methods.
method Empirical study comparing Monte Carlo and temporal difference learning methods in stitching experience.
result Monte Carlo methods can also achieve experience stitching, challenging the conventional wisdom.
A new method for learning gradient flows from population dynamics.
problem Reconstructing population dynamics from limited data.
method Residual approach to enforce continuity equations, combining with data-fitting divergence.
result Demonstrated state-of-the-art performance across trajectory inference benchmarks.
Model stitching compares neural representations, revealing insights not captured by CKA.
problem Understanding internal neural representations.
method Model stitching connects neural network layers to study representations.
result Good networks trained differently can be stitched without performance drop.
Policy analysts wish to visualize a range of policies for large simulator-defined Markov Decision Processes (MDPs). One visualization approach is to invoke the simulator to generate on-policy trajectories and then visualize those trajectories. When the simulator is expensive, this is not practical, and some method is r…
CitySim: A Drone-Based Vehicle Trajectory Dataset for Safety Oriented Research and Digital Twinscs.CV
CitySim dataset captures vehicle trajectories for safety research.
problem Lack of fine-grain vehicle trajectories for safety-oriented research.
method Five-step procedure: video stabilization, object filtering, stitching, detection, and error filtering.
result CitySim dataset improves safety evaluations and facilitates digital-twin research.
Recovering manifold geometry from geodesic intersections.
problem Recovering the geometry of a Riemannian manifold from geodesic intersection lengths.
method Applying stitching data to solve the delayed collision data problem.
result Geometry of the manifold can be recovered from geodesic intersection lengths.
A new approach selects tuning parameters for embedding methods.
problem Difficulty in selecting tuning parameters for embedding methods.
method Minimize a stress notion to supervise tuning parameter selection.
result Uncover a new bias--variance tradeoff phenomenon.
How to detect the spacetime curvature without rulers and clocks. II. Three-dimensional spacetimegr-qc
Detect spacetime curvature without rulers and clocks in 3D.
problem Detecting spacetime curvature without traditional measurement tools.
method Generalized results from 2D to 3D spacetime, proving well-stitched spacetime for conformally flat cases.
result A 3D spacetime is well-stitched if and only if it is conformally flat, providing a tool for curvature detection.
How not to Stitch Representations to Measure Similarity: Task Loss Matching versus Direct Matchingcs.LG
Task loss matching misrepresents similarity between neural network layers.
problem Measuring similarity between neural network layers using task loss matching.
method Task loss matching vs. direct matching; comparison with CCA and CKA.
result Direct matching provides a better similarity index than task loss matching.
The paper proposes a learning-theoretic perspective on representation alignment.
problem Understanding how AI models' representations become aligned as they scale.
method Reviewing and connecting different notions of alignment, focusing on stitching.
result Relating properties of stitching to kernel alignment of representations.
Many real-world applications require robust algorithms to learn point processes based on a type of incomplete data --- the so-called short doubly-censored (SDC) event sequences. We study this critical problem of quantitative asynchronous event sequence analysis under the framework of Hawkes processes by leveraging the …
This thesis tackles data imperfections in ML, proposing methods to prevent discrimination and spurious feature learning.
problem Data imperfections in ML training data, leading to deployment failures.
method Fair representation learning, spurious feature detection, and data augmentation for reinforcement learning.
result Methods to make ML models more robust to data imperfections.
A parametric point process model is developed, with modeling based on the assumption that sequential observations often share latent phenomena, while also possessing idiosyncratic effects. An alternating optimization method is proposed to learn a "registered" point process that accounts for shared structure, as well as…
Proposes a continuous, differentiable model from local adaptive models.
problem Inadequate continuity and differentiability in over-parameterized models.
method A global continuous and differentiable model constructed from weighted averages of locally learned models.
result Achieves faster statistical convergence and improved performance in various settings.
Let and be two -dimensional smooth manifolds with boundary. Suppose we glue and along some boundary components (which are, therefore, diffeomorphic). Call the result If we have a group acting continuously on and also acting continuously on such that the actions are comp…
We study the problem of discriminative sub-trajectory mining. Given two groups of trajectories, the goal of this problem is to extract moving patterns in the form of sub-trajectories which are more similar to sub-trajectories of one group and less similar to those of the other. We propose a new method called Statistica…
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.
Pattern Ensembling for Spatial Trajectory Reconstructionphysics.data-an
Pattern ensembling fills in missing or inaccurate trajectory data.
problem Incompleteness, missing information, and inaccuracies in geolocation data.
method Probabilistically ensemble similar trajectory patterns from the vicinity.
result Reconstructs missing or unreliable trajectory segments effectively.
Study shows magnetic trajectories in Berger spheres are homogeneous.
problem Homogeneity of contact magnetic trajectories in Berger spheres.
method Proved every contact magnetic trajectory is a product of a homogeneous geodesic and a charged Reeb flow.
result Contact magnetic trajectories in Berger spheres are homogeneous.
Improved trajectory prediction for team sports using sparse outputs.
problem Challenging to train deep learning models for player trajectory prediction.
method Sparse trajectory prediction and constant acceleration interpolation.
result Interpolation improves performance for all tested models.
WS-II algorithm segments trajectories with high accuracy.
problem Trajectory segmentation for diverse data sources.
method Supervised learning with sliding window analysis.
result WS-II outperforms other methods in all datasets.
A framework clusters vehicle motion trajectories efficiently.
problem Costly manual annotation of vehicle motion data.
method Five-stage framework: align, embed, extract, embed, cluster.
result Framework achieves promising results on real-world dataset.
This paper generalizes graph representation for diverse data types.
problem Representing and querying hybrid data types in a unified way.
method Introducing a directed Tensor-Typed Multi-Graph with embeddings.
result Unified representation for visual, linguistic, and auditory data.
In this paper we propose a new parameter-free method for trajectory classification which finds the best trajectory partition and dimension combination for robust trajectory classification. Preliminary experiments show that our approach is very promising.
TrajGAIL: Generating Urban Vehicle Trajectories using Generative Adversarial Imitation Learningcs.LG
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.
This work presents a novel approach for robust PCA with total variation regularization for foreground-background separation and denoising on noisy, moving camera video. Our proposed algorithm registers the raw (possibly corrupted) frames of a video and then jointly processes the registered frames to produce a decomposi…
Many AI problems, in robotics and other domains, are goal-directed, essentially seeking a trajectory leading to some goal state. In such problems, the way we choose to represent a trajectory underlies algorithms for trajectory prediction and optimization. Interestingly, most all prior work in imitation and reinforcemen…
Method detects trajectory outliers using Hodge Laplacian embeddings.
problem Detecting outliers in trajectory data on simplicial complexes.
method Flow-embeddings using Hodge 1-Laplacian of simplicial complexes.
result Classifies trajectories based on topological behavior.
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…
Study on billiard trajectories with fixed bounces.
problem Counting periodic trajectories with specific bounces.
method Analyzes two-dimensional dispersive billiard systems.
result Asymptotic growth of primitive periodic trajectories.
Representation learning of pedestrian trajectories transforms variable-length timestamp-coordinate tuples of a trajectory into a fixed-length vector representation that summarizes spatiotemporal characteristics. It is a crucial technique to connect feature-based data mining with trajectory data. Trajectory representati…
Method predicts NBA players' multi-modal movement trajectories.
problem Understanding NBA players' decision-making during games.
method LSTM-based architecture with multi-modal loss function.
result Method outperforms state-of-the-art in predicting realistic trajectories.
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…
Physics-informed diffusion model detects anomalous trajectories in GPS data.
problem Detecting fake GPS trajectories in international waters.
method Physics-informed diffusion model integrating kinematic constraints.
result Higher prediction accuracy and lower error rate for anomaly detection.
Multiscale Euclidean Network Trajectories: Second-Moment Geometry, Attribution, and Change Pointsstat.ML
Develops MENT for interpreting and detecting changes in network trajectories.
problem Distortion of network geometry and invalidation of temporal comparisons in dynamic network analysis.
method Develops Multiscale Euclidean Network Trajectories (MENT) framework based on second-moment geometry.
result Validates and interprets network trajectories through isotropic normalization and orthogonal transformations.
Study links in knitted textiles using knot theory.
problem Identify and classify links in knitted textiles.
method Correspondence between links in thickened torus and 2-periodic weft-knitted textiles, using link invariants and ribbon knots.
result New stitch patterns and links in knitted textiles identified.
Gaussian processes model geospatial trajectories with uncertainty.
problem Interpolating and predicting complex spatiotemporal data.
method Gaussian process models trajectories as multidimensional Gaussian distributions.
result Gaussian processes provide a flexible and probabilistic way to interpolate geospatial data.
The paper defines and analyzes conformal trajectories in 3D space forms.
problem Understanding trajectories in curved 3D spaces.
method Defined conformal trajectories and studied their properties in , , and .
result Conformal trajectories in and have constant curvature and torsion.
Trajectory owner prediction is the basis for many applications such as personalized recommendation, urban planning. Although much effort has been put on this topic, the results archived are still not good enough. Existing methods mainly employ RNNs to model trajectories semantically due to the inherent sequential attri…
We present CoverNet, a new method for multimodal, probabilistic trajectory prediction for urban driving. Previous work has employed a variety of methods, including multimodal regression, occupancy maps, and 1-step stochastic policies. We instead frame the trajectory prediction problem as classification over a diverse s…
TRAKNN: Efficient Trajectory Aware Spatiotemporal kNN for Rare Meteorological Trajectory Detectionstat.ML
TRAKNN detects rare atmospheric trajectories efficiently.
problem Detecting rare atmospheric anomalies over long periods.
method Unsupervised, recurrence-based kNN algorithm.
result Rare trajectories correspond to physical anomalies.
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.
Homogeneous magnetic trajectories in a special linear group proven.
problem Proving homogeneity of magnetic trajectories in a specific group.
method Using contact magnetic curves and geodesics.
result Every contact magnetic trajectory is a product of a homogeneous geodesic and a charged Reeb flow.
The study finds billiard trajectories with infinitely many reflections in certain cones.
problem Existence of billiard trajectories with infinitely many reflections.
method Analysis of convex cones and elliptic cones in .
result Existence of convex cones with billiard trajectories having infinitely many reflections.
We study the existence of closed trajectories of a particle model on null curves in anti-de Sitter 3-space defined by a functional which is linear in the curvature of the particle path. Explicit expressions for the trajectories are found and the existence of infinitely many closed trajectories is proved.