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

Trend · papers per month

1.5%3.0%4.5%6.0% · Aug 202419922001200920172026
48 results for probabilistic movement primitives

Paper reduces movement primitive dimensionality in parameter space.

problem High dimensionality of movement primitives makes policy optimization expensive.
method Investigates dimensionality reduction in parameter space, identifying principal movements.
result Dimensionality reduction in parameter space is more effective than in configuration space.

Probabilistic representations of movement primitives open important new possibilities for machine learning in robotics. These representations are able to capture the variability of the demonstrations from a teacher as a probability distribution over trajectories, providing a sensible region of exploration and the abili…

2018-08-31abs ↗pdf ↗

Robotics learns new skills faster by reusing past movements.

problem Learning new motor skills is time-consuming and requires exploration of a large space of motor configurations.
method Combines probabilistic movement primitives with relative entropy policy search for skill initialization and adaptation.
result Quality of learned skills improves and the number of required iterations to learn a new task can be reduced by more than 60%.

ProMoD models human race drivers with probabilistic movement primitives and neural networks.

problem Challenging task of modeling human driver behavior due to variability and complexity.
method Modular framework with Probabilistic Movement Primitives, clothoids, and neural networks.
result Significant advantages in imitation accuracy and robustness compared to other algorithms.

Proposes deep mixture models for probabilistic price movement forecasting in high-frequency trading.

problem Probabilistic forecasting of price movements in high-frequency trading.
method Deep recurrent neural networks with probabilistic mixture models.
result Outperforms benchmark models in both metric-based and simulated trading scenarios.

Contextual policy search allows adapting robotic movement primitives to different situations. For instance, a locomotion primitive might be adapted to different terrain inclinations or desired walking speeds. Such an adaptation is often achievable by modifying a small number of hyperparameters. However, learning, when …

2015-11-13abs ↗pdf ↗

Deep learning identifies functional primitives in stroke rehabilitation.

problem Measuring the necessary dose of rehabilitation training for stroke recovery.
method Automatic identification of functional primitives using IMUs and deep learning.
result Convolutional neural network achieved 70% accuracy in primitive classification.

Simplifies efficient estimation via automatic differentiation and probabilistic programming.

problem Constructing efficient estimators for complex statistical models.
method Automatic differentiation applied to statistical functionals, avoiding the need to derive efficient influence functions.
result Users can generate efficient estimators with minimal code, simplifying the process for non-experts.

We introduce and demonstrate a new approach to inference in expressive probabilistic programming languages based on particle Markov chain Monte Carlo. Our approach is simple to implement and easy to parallelize. It applies to Turing-complete probabilistic programming languages and supports accurate inference in models …

2015-07-03abs ↗pdf ↗

Learning and inference movement is a very challenging problem due to its high dimensionality and dependency to varied environments or tasks. In this paper, we propose an effective probabilistic method for learning and inference of basic movements. The motion planning problem is formulated as learning on a directed grap…

2018-05-18abs ↗pdf ↗

Develops inference combinators for probabilistic programs using neural networks.

problem Creating efficient proposals for probabilistic program inference.
method Inference combinators using neural network parameterization of proposals.
result Correct by construction variational methods tailored to specific models.

Machine learning models adapt to motor learning but face challenges.

problem Adapting machine learning to handle motor variability and differentiate new movements from known ones.
method Parameter adaptation, transfer and meta-learning, reinforcement learning.
result Challenges in applying machine learning models for motor learning support systems.

The twisted torus knots lie on the standard genus 2 Heegaard surface for S3S^3, as do the primitive/primitive and primitive/Seifert knots. It is known that primitive/primitive knots are fibered, and that not all primitive/Seifert knots are fibered. Since there is a wealth of primitive/Seifert knots that are twisted tor…

2011-11-07abs ↗pdf ↗

Proposes using diffusion models for probabilistic stock market predictions.

problem Uncertainties in financial data make deterministic models ineffective for stock market predictions.
method Utilizes Denoising Diffusion Probabilistic Models (DDPM) and Masked Relational Transformer (MRT).
result Achieves state-of-the-art performance in stock movement prediction and portfolio management.

The paper tracks patient recovery using graphs of joint movement data.

problem Tracking individual patient recovery trajectories in physical therapy.
method Bayesian learning of Random Geometric Graphs from joint movement data.
result Optimal exercise routines can be recommended based on patient recovery data.

Samplets and multiwavelets constructed from scattered data converge to specific densities in the limit.

problem Constructing data-adapted multiresolution analyses and multiwavelets with flexible vanishing moments.
method Probabilistic framework for samplet construction; convergence to multiwavelets with broken polynomial densities.
result Samplet construction converges to multiwavelets in the infinite data limit.

For a genus two Heegaard splitting of a lens space, the primitive disk complex is defined to be the full subcomplex of the disk complex for one of the handlebodies of the splitting spanned by all vertices of primitive disks. In this work, we describe the complete combinatorial structure of the primitive disk complex fo…

2012-06-27abs ↗pdf ↗

We show that the exterior derivative operator on a symplectic manifold has a natural decomposition into two linear differential operators, analogous to the Dolbeault operators in complex geometry. These operators map primitive forms into primitive forms and therefore lead directly to the construction of primitive cohom…

2010-11-04abs ↗pdf ↗

Study primitive decompositions for harmonic forms on almost Kähler manifolds.

problem Decomposing harmonic forms on almost Kähler manifolds.
method Proved primitive decompositions for Bott-Chern and Aeppli harmonic forms in specific bidegrees.
result Optimal bidegrees for primitive decompositions of harmonic forms.

In this article, we prove that every arithmetic locally symmetric orbifold of classical type without Euclidean or compact factors has arbitrarily long arithmetic progressions in its primitive length spectrum. Moreover, we show the stronger property that every primitive length occurs in arbitrarily long arithmetic progr…

2016-02-04abs ↗pdf ↗

A twisted torus knot is a knot obtained from a torus knot by twisting adjacent strands by full twists. The twisted torus knots lie in FF, the genus 2 Heegaard surface for S3S^3. Primitive/primitive and primitive/Seifert knots lie in FF in a particular way. Dean gives sufficient conditions for the parameters of the tw…

2017-01-13abs ↗pdf ↗

Given a genus-gg Heegaard splitting of the 33-sphere with g3g \ge 3, we show that the primitive disk complex for the splitting is not weakly closed under disk surgery operation. That is, there exist two primitive disks in one of the handlebodies of the splitting such that any disk surgery on one along the other one y…

2018-12-26abs ↗pdf ↗

A new probabilistic polygonal curve representation using Gaussian Mixture Models.

problem Capturing curves with uncertainty in both tangent and normal directions.
method Probabilistic polygonal approximation with Gaussian Mixture Model (GMM).
result The GMM accurately captures the local geometry and uncertainty of curves.

Semantically understanding complex drivers' encountering behavior, wherein two or multiple vehicles are spatially close to each other, does potentially benefit autonomous car's decision-making design. This paper presents a framework of analyzing various encountering behaviors through decomposing driving encounter data …

2018-07-27abs ↗pdf ↗

We call a pair (K, m) of a knot K in the 3-sphere S^3 and an integer m a Seifert fibered surgery if m-surgery on K yields a Seifert fiber space. For most known Seifert fibered surgeries (K, m), K can be embedded in a genus 2 Heegaard surface of S^3 in a primitive/Seifert position, the concept introduced by Dean as a na…

2011-10-17abs ↗pdf ↗

Two Riemannian manifolds are called eigenvalue equivalent when their sets of eigenvalues of the Laplace-Beltrami operator are equal (ignoring multiplicities). They are (primitive) length equivalent when the sets of lengths of their (primitive) closed geodesics are equal. We give a general construction of eigenvalue equ…

2006-06-14abs ↗pdf ↗