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

Trend · papers per month

336699132 · May 202619922001200920172026
48 results for short trajectory

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.

DISCO predicts system states from short trajectories using an evolved operator.

problem Predicting next states of dynamical systems governed by unknown PDEs.
method DISCO uses a hypernetwork to generate parameters of a smaller operator network for state prediction.
result DISCO achieves state-of-the-art performance with fewer training epochs and generalizes well.

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.

Paper proposes a reinforcement learning method for trading using expert trajectories.

problem Inability of existing methods to handle long-term goals and delayed rewards in futures trading.
method Modeling futures trading as MDP, using reinforcement learning with expert trajectories and multiple short-term alpha factors.
result The proposed method outperforms traditional and deep learning methods in trading performance.

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.

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.

Algorithm recovers graph from Glauber dynamics trajectory without mixing.

problem Learning Gaussian graphical models from a single Glauber dynamics trajectory.
method Three components: conditional variance estimation, pairwise influence test, robust median aggregation.
result Polynomial-time recovery of conditional independence graph from a single trajectory.

A method for inferring motility models and heterogeneity from particle trajectories.

problem Understanding motility patterns from discrete trajectory data of biological agents.
method Maximum likelihood approach for second-order Langevin models with population heterogeneity.
result The proposed method outperforms alternative approaches for short trajectories.

This research predicts vehicle movements by analyzing their intentions relative to road lanes.

problem Accurately forecasting vehicles' future movements for safe autonomous driving.
method LSTM networks with attention mechanisms applied to spatio-temporal graphs of road lanes.
result The model outperforms other state-of-the-art models in several metrics.

Paper proposes a new descriptor for early trajectory characterization in matrix iterations.

problem Comparing early behavior of high-dimensional trajectories in nonlinear matrix iterations.
method Develops a two-channel fuzzy coordinate system using F-transform for compact representation.
result The descriptor achieves high R^2 values (mean = 0.6480) in approximating convergence lengths.

PODNet discovers plannable options from unstructured demonstrations.

problem Learning from unstructured, multi-objective demonstrations.
method Custom categorical variational autoencoder, recurrent option inference network, option-conditioned policy network, and option dynamics model.
result PODNet enables learning from demonstration for multiple tasks and planning.

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 ↗

We propose a minimal theory of non-linear price impact based on a linear (latent) order book approximation, inspired by diffusion-reaction models and general arguments. Our framework allows one to compute the average price trajectory in the presence of a meta-order, that consistently generalizes previously proposed pro…

2014-11-29abs ↗pdf ↗

Enhances RL by controlling policy stochasticity through trajectory entropy constraints.

problem Non-stationary Q-value estimation and short-sighted entropy tuning in maximum entropy RL.
method Proposes TECRL framework with separate Q-functions for reward and entropy, enforcing a trajectory entropy constraint.
result DSAC-E algorithm achieves higher returns and better stability on OpenAI Gym benchmarks.

We present effective numerical algorithms for locally recovering unknown governing differential equations from measurement data. We employ a set of standard basis functions, e.g., polynomials, to approximate the governing equation with high accuracy. Upon recasting the problem into a function approximation problem, we …

2018-09-24abs ↗pdf ↗

We present a generalization of the Simultaneous Long-Short (SLS) trading strategy described in recent control literature wherein we allow for different parameters across the short and long sides of the controller; we refer to this new strategy as Generalized SLS (GSLS). Furthermore, we investigate the conditions under …

2018-06-14abs ↗pdf ↗

Minimal hypersurfaces can't always be connected by mean curvature flow.

problem Existence of connecting mean curvature flows for minimal hypersurfaces.
method Minimal hypersurface analogue of gradient flow trajectories between critical points.
result Additional topological and variational obstructions to connecting mean curvature flows.

Paper learns interaction laws from multiple trajectories of heterogeneous systems.

problem Estimating unknown interaction laws from multiple trajectories of heterogeneous systems.
method Nonparametric learning of interaction kernels based on pairwise distances, with convergence guarantees in L2L^2 space.
result Estimators converge at optimal min-max rate for 1-dimensional nonparametric regression.

Deep learning approximates SPDE solutions from noise trajectories.

problem Approximating solutions to stochastic partial differential equations (SPDEs).
method Uses neural networks to approximate SPDE solutions based on noise realizations.
result Accurately estimates SPDE solutions and functionals like mean and variance.

This paper proposes recurrent neuron networks (RNNs) for a fingerprinting indoor localization using WiFi. Instead of locating user's position one at a time as in the cases of conventional algorithms, our RNN solution aims at trajectory positioning and takes into account the relation among the received signal strength i…

2019-03-27abs ↗pdf ↗

Proposes deep optimal feedback control for continuous-time systems with action constraints.

problem Learning optimal feedback control laws for robotic applications.
method Exploits Hamilton-Jacobi-Bellman equation and deep differential networks to learn optimal value function and feedback policy.
result Enables learning an optimal feedback control law that generates an optimal trajectory from any point in state-space without replanning.

Deep learning predicts adhesive forces in soft viscoelastic contacts quickly and accurately.

problem Predicting the full time-resolved force trajectory of adhesive soft viscoelastic contacts is computationally expensive and impractical.
method Trained a deep learning model to predict the full force evolution from a prescribed displacement history, using FMS representation and various architectures.
result Best-performing model predicts complete force trajectory with low error metrics and fast inference time.

Hybrid approach combines transformer and Bayesian filtering for robust multiple particle tracking.

problem Challenges in tracking multiple particles in noisy scenes due to combinatorial explosion of hypotheses.
method Attention-Bayesian hybrid framework using transformer for association and Bayesian filtering for pruning hypotheses.
result Improved tracking accuracy and robustness against spurious detections.

Early SGD hyperparameters affect deep neural network training, showing a break-even point.

problem Understanding how early SGD hyperparameters influence deep neural network training.
method Analysis of stochastic gradient descent (SGD) hyperparameters and their effects on the optimization trajectory.
result A break-even point exists where SGD implicitly regularizes the loss surface and improves gradient conditioning.

Neural network outperforms traditional methods in chaotic dynamics classification.

problem Classifying chaotic and regular dynamics of the Chirikov standard map.
method Trained a convolutional neural network on finite-length trajectories compared to traditional Lyapunov exponent computation.
result Neural network outperforms traditional methods for short periods, converging faster and more robustly.

This paper proposes a new algorithm for learning guidance rewards in RL.

problem Long-term temporal credit assignment in sparse or delayed reward environments.
method Surrogate RL objective with trajectory-space smoothing to learn guidance rewards.
result Guidance rewards can be learned without additional neural networks and have intuitive interpretation.

Statistical fields model explains capital allocation and accumulation among firms and investors.

problem Understanding capital allocation and accumulation dynamics among firms and investors.
method Applied statistical fields formalism to heterogeneous agents divided into firms and investors.
result Capital accumulation depends on various factors including long-term returns, competition, and stock price volatility.

condLSTM-Q predicts COVID-19 deaths at county level with quantile forecasts.

problem Predicting COVID-19 mortality at fine geographical scales.
method Conditional Long Short-Term Memory networks with quantile output.
result Fine-scale quantile predictions inform about death toll distribution.