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

306191121 · May 202619922001200920172026
48 results for extremal trajectories

Study on Heisenberg group's Lorentzian problems using Pontryagin's principle.

problem Lorentzian problems on the Heisenberg group.
method Applied Pontryagin's maximum principle to obtain extremal trajectories.
result Parameterization of abnormal and normal extremal trajectories, investigation of reachability sets and existence of optimal trajectories.

Let E be the Engel group and D be a rank 2 bracket generating left invariant distribution with a Lorentzian metric, which is a nondegenerate metric of index 1. In this paper, we first prove that timelike normal extremals are locally maximizing. Second, we obtain a parametrization of timelike, spacelike, lightlike norma…

2015-07-27abs ↗pdf ↗

We provide lower bounds on the number of periodic Finsler billiard trajectories inside a quadratically convex smooth closed hypersurface MM in a dd-dimensional Finsler space with possibly irreversible Finsler metric. An example of such a system is a billiard in a sufficiently weak magnetic field. The rr-periodic Fin…

2017-12-21abs ↗pdf ↗

ELM combines machine learning and feature engineering for anomalous diffusion detection.

problem Quantitative characterization of anomalous diffusion from single trajectories.
method Extreme Learning Machine (ELM) combined with feature engineering.
result ELM achieves satisfactory performance in AnDi challenge tasks.

Study of a series of Lorentzian structures on SL(2,R) with SO(1,1) symmetry.

problem Global optimality of extremal trajectories in a series of Lorentzian structures.
method Analysis of a one-parametric series of left-invariant Lorentzian structures on SL(2,R) with SO(1,1) symmetry.
result Properties of the Lorentzian structures deform to those of the sub-Lorentzian structure in a limit case.

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 ↗

This paper is a continuation of the work by the same authors on the Cartan group equipped with the sub-Finsler \ell_\infty norm. We start by giving a detailed presentation of the structure of bang-bang extremal trajectories. Then we prove upper bounds on the number of switchings on bang-bang minimizers. We prove that…

2018-10-12abs ↗pdf ↗

Deep learning models can infer individual trajectories from sparse data.

problem Learning individual dynamics from limited data points.
method Combining variational autoencoders (VAEs) with ordinary differential equations (ODEs) for dynamic modeling.
result Deep learning can recover individual trajectories from sparse data, but requires careful adaptation.

New method learns cell trajectories and network interactions from single-cell data.

problem Network inference in systems biology from steady-state data.
method Min-entropy estimation for stochastic dynamics, leveraging both temporal and perturbational data.
result Jointly learns cellular trajectories and network interactions.

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.

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.

Generalizes pseudo-product structures with abnormal extremals.

problem Finiteness of symmetry algebras for non-degenerate pseudo-product structures.
method Modified universal prolongation of graded nilpotent Lie algebras and generalized finiteness criterion.
result Distributions with singularly transitive properties have finite-dimensional symmetries.

Diffusion models' sampling paths lie in a low-dimensional subspace, resembling boomerangs.

problem Understanding the geometric structure of diffusion-based generative models.
method Characterization of deterministic sampling trajectories using low-dimensional subspace and kernel-estimated data modeling.
result Sampling trajectories in diffusion models are confined to a low-dimensional subspace and exhibit a boomerang shape.

Mode connectivity is a recently introduced frame- work that empirically establishes the connected- ness of minima by finding a high accuracy curve between two independently trained models. To investigate the limits of this setup, we examine the efficacy of this technique in extreme cases where the input models are trai…

2018-06-18abs ↗pdf ↗

Paper examines adversarial attacks on weather forecasting models, focusing on TC trajectory prediction.

problem Adversarial attacks can mislead downstream TC trajectory predictions in DLWF models.
method Proposes Cyc-Attack, a method using a surrogate model and skewness-aware loss function to generate adversarial TC paths.
result Cyc-Attack achieves higher true positive rates and lower false alarm rates compared to conventional methods.

Study shows reinforcement learning is possible with once-per-episode feedback.

problem Challenges of reinforcement learning with sparse feedback.
method Introduced a model where trajectory labels are generated by an unknown parametric model and developed an algorithm for sublinear regret.
result Achieved sublinear regret with a statistically and computationally efficient algorithm.

We consider the optimal control problem for null curves in de Sitter 3-space defined by a functional which is linear in the curvature of the trajectory. We show how techniques based on the method of moving frames and exterior differential systems, coupled with the reduction procedure for systems with a Lie group of sym…

2007-10-02abs ↗pdf ↗

Study of ants' movement rules on a 6D space, revealing distribution structures and singular trajectories.

problem Understanding the movement patterns of ants in a 6D space.
method Analyzing mechanical system rules to derive distribution structures and singular trajectories.
result Distributions and singular trajectories of ants' movement rules in a 6D space.

A new framework uses stochastic optimal control to estimate rare events more accurately.

problem Estimating rare events like chemical reactions in biomolecules is computationally challenging.
method The approach casts committor estimation as a stochastic optimal control problem, developing direct and off-policy Value Matching losses.
result The framework yields more accurate committor estimates, reaction rates, and equilibrium constants.

The left-invariant sub-Riemannian problem on the Engel group is considered. The problem gives the nilpotent approximation to generic nonholonomic systems in four-dimensional space with two-dimensional control, for instance to a system which describes motion of mobile robot with a trailer. The global optimality of extre…

2014-08-28abs ↗pdf ↗

We accelerate CNF by reducing ODE truncation errors with polynomial regularization.

problem High computation cost of CNF due to large truncation errors in solving ODEs.
method Add polynomial regularization to approximate ODE trajectories with polynomial functions.
result 42.3% to 71.3% reduction of NFE on density estimation, 19.3% to 32.1% on variational auto-encoder.

New method learns dynamics from sparse data using geometric constraints.

problem Learning dynamics from sparse, undersampled data.
method Reformulates inference as a stochastic control problem, using geometry-driven path augmentation.
result Accurately recovers stochastic dynamics from extremely undersampled data.

CDLF predicts product life-cycles in cold-start phases with high accuracy.

problem Forecasting new products in early phases when data is scarce.
method Conditional Diffusion Life-cycle Forecaster (CDLF) combining static descriptors, reference trajectories, and new observations.
result CDLF outperforms classical models in accuracy and probabilistic forecasting.

Reduces necessary conditions for collision avoidance on curved spaces.

problem Finding non-intersecting trajectories for multiple agents on curved spaces.
method Reduction by Lie group symmetries of variational collision avoidance problems.
result Derives necessary conditions for reduced extremals.

Machine Learning (ML) inspired algorithms provide a flexible set of tools for analyzing and forecasting chaotic dynamical systems. We here analyze the performance of one algorithm for the prediction of extreme events in the two-dimensional Hénon map at the classical parameters. The task is to determine whether a trajec…

2020-02-20abs ↗pdf ↗

Diffusion models simulate molecular dynamics with adjustable accuracy.

problem Simulating molecular dynamics with high accuracy and efficiency.
method Diffusion models as Euler-Maruyama integrators for Langevin dynamics, learning forces from static snapshots.
result Diffusion models generate molecular trajectories with temporal correlations similar to MD simulations.

RDLI integrates domain logic and context grounding to detect crypto anomalies under scarce labels.

problem Extreme label scarcity and evasion strategies in crypto networks.
method Relational Domain Logic Integration (RDLI) with Retrieval Grounded Context (RGC).
result RDLI outperforms GNN baselines by 28.9% in F1 score under 0.01% label scarcity.

Lagrangian data assimilation is a complex problem in oceanic and atmospheric modeling. Tracking drifters in large-scale geophysical flows can involve uncertainty in drifter location, complex inertial effects, and other factors which make comparing them to simulated Lagrangian trajectories from numerical models extremel…

2018-10-31abs ↗pdf ↗

Deep reinforcement learning techniques have demonstrated superior performance in a wide variety of environments. As improvements in training algorithms continue at a brisk pace, theoretical or empirical studies on understanding what these networks seem to learn, are far behind. In this paper we propose an interpretable…

2018-09-15abs ↗pdf ↗

Paper proposes RRD to learn proxy rewards for sparse delayed rewards in episodic reinforcement learning.

problem Learning from sparse and delayed rewards in reinforcement learning.
method Randomized Return Decomposition (RRD) algorithm to redistribute rewards.
result Substantial improvement over baseline algorithms in experiments.

New measure EC assesses node contributions in nonlinear, time-varying systems.

problem Existing node contribution measures assume linear, time-invariant dynamics, failing for complex, real-world systems.
method Defined 'emergent contribution (EC)' as a dynamical leverage measure from Jacobians of differentiable models.
result EC diverges from average controllability under persistent regime switching and sign reversal, identifying limits of local linearization.

This paper deals with the notion of quadratic differential in spherical CR geometry (or more generally on strictly pseudoconvex CR manifolds). We get to this notion by studying a splitting of Rumin complex and discuss its first features such as trajectories and length. We also define several differential operators on q…

2018-07-20abs ↗pdf ↗

Deep neural networks are typically trained by optimizing a loss function with an SGD variant, in conjunction with a decaying learning rate, until convergence. We show that simple averaging of multiple points along the trajectory of SGD, with a cyclical or constant learning rate, leads to better generalization than conv…

2018-03-14abs ↗pdf ↗

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…

2019-05-06abs ↗pdf ↗