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

Trend · papers per month

2555107651,020 · Jun 202019922001200920172026
48 results for movement generation

Taureau uses Twitter sentiment analysis to predict stock market movement.

problem Predicting stock market movement using public opinion on Twitter.
method Obtained historical tweets, filtered and labeled, generated word embeddings, assessed sentiment scores, correlated with stock price movement, designed and evaluated predictive model.
result Taureau can predict stock price movement from lagged sentiment scores.

MPANF improves naive forecast by incorporating directional information.

problem Challenging to surpass naive forecast in financial time series.
method Combines naive forecast with movement prediction and accuracy.
result MPANF generally outperforms common benchmarks.

Wearable smart suit tracks infant movements with high accuracy.

problem Early detection of atypical motor development in infants.
method Developed a multi-sensor smart suit for data collection, trained a deep CNN algorithm for automatic posture and movement classification.
result Setup achieves human equivalent accuracy in infant posture and movement classification.

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.

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.

Framework infers coordination strategies from movement data.

problem Inferring individual movement strategies from group data.
method Formalizes Coordination Strategy Inference Problem; provides methodology to infer strategies.
result Framework accurately infers strategies in simulated and real-world datasets.

Deep convolutional architecture identifies eye movements for biometric faster and more accurately.

problem Biometric identification of eye movements for authentication.
method Developed a deep convolutional architecture to process raw eye-tracking signals.
result Achieved a lower error rate by one order of magnitude and faster identification time by two orders of magnitude.

New algorithm reduces dynamic regret in time-varying movement costs.

problem Dynamic regret in online convex optimization with time-varying movement costs.
method Introduced a novel algorithm for time-varying movement costs, achieving comparator-adaptive dynamic regret bound.
result Established first comparator-adaptive dynamic regret bound of O~((M2+MPT)(T+tλt))\widetilde{\mathcal{O}}(\sqrt{(M^2+MP_T)(T+\sum_t λ_t)}).

We recast the Calabi flow in DeGiorgi's language of minimizing movements. We establish the long time existence of minimizing movements for K-energy with arbitrary initial condition. Furthermore we establish some a priori regularity of these solutions, and that sufficiently regular minimizing movements are smooth soluti…

2012-08-13abs ↗pdf ↗

We show that K-energy minimizing movements agree with smooth solutions to Calabi flow as long as the latter exist. As corollaries we conclude that in a general Kahler class long time solutions of Calabi flow minimize both K-energy and Calabi energy. Lastly, by applying convergence results from the theory of minimizing …

2013-01-16abs ↗pdf ↗

The study models market price movement based on investors' expectations.

problem Understanding the dynamics of investors' expectations and market price movement.
method Developed a non-linear evolutionary equation linking investors' expectations and market asset price movement.
result Model predictions co-integrated with asset time series, suggesting potential for price movement forecasting.

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 ↗

Paper proves minimizing movements match smooth droplet flow in 3D.

problem Consistency of minimizing movements with smooth mean curvature flow.
method Proved minimizing movements coincide with smooth droplet flow.
result Minimizing movements and smooth mean curvature flow are consistent in 3D.

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 ↗

New algorithm SFHC achieves near-optimal costs with predictions for non-convex optimization.

problem Online optimization with non-convex hitting costs and movement costs.
method Synchronized Fixed Horizon Control (SFHC) algorithm with conditions on hitting and movement costs.
result Synchronized Fixed Horizon Control (SFHC) achieves a 1+O(1/w)1+O(1/w) competitive ratio for near-optimal costs.

The study introduces a new stickiness parameter for stock prices using a non-linear model.

problem Understanding how closely individual stocks follow a stock index's price movements.
method Developed a non-linear pricing model inspired by tectonic plate movements to measure stickiness.
result Defined a stickiness parameter for stock price returns using a novel model.

NoTMF forecasts sparse urban road movement speeds with nonstationary temporal matrix factorization.

problem Sparse and nonstationary movement speed data from urban roads.
method Nonstationary Temporal Matrix Factorization (NoTMF) model.
result NoTMF outperforms baseline models in forecasting urban road movement speeds.

New method for evolving surfaces using generalized power mean curvature flow.

problem Evolve surfaces with volume penalization replaced by a generalized term.
method Generalized minimizing movement scheme converging to geometric evolution equation.
result Minimizing movements coincide with smooth classical solutions and preserve mean convexity.

New theoretical approaches about forecasting stock markets are proposed. A mathematization of the stock market in terms of arithmetical relations is given, where some simple (non-differential, non-fractal) expressions are also suggested as general stock price formuli in closed forms which are able to generate a variety…

2005-03-21abs ↗pdf ↗

Alternative proof of weak solutions to mean curvature flow using minimizing movements.

problem Existence of weak solutions to mean curvature flow and volume preserving mean curvature flow.
method Proposes a new existence proof using a minimizing movements scheme and a novel proxy for distance.
result Unconditional convergence towards a De Giorgi solution for the minimizing movements scheme.

Machine learning struggles to predict binary options movements due to randomness.

problem Predicting binary options movements using machine learning.
method Tested multiple machine learning models (RF, LR, GB, kNN) and neural networks (MLP, LSTM) on EUR/USD currency pairs.
result None of the models surpassed the ZeroR baseline accuracy, indicating randomness in binary options.

The Autoencoder Reconstruction Ratio detects increased asset co-movements.

problem Detecting changes in asset co-movements for risk management.
method Uses a deep sparse denoising autoencoder to measure asset returns with latent variables.
result Lower ARR values indicate periods of market weakness and increased volatility.

Enhances stock movement prediction using Higher Order Transformers for multimodal time-series data.

problem Predicting stock movements in financial markets with complex dynamics.
method Introduced Higher Order Transformers, extending self-attention and transformer architecture to capture complex market dynamics. Employed low-rank tensor decomposition and kernel attention to manage computational complexity. Integrated technical and fundamental analysis from historical prices and tweets.
result Demonstrated effectiveness of the method on the Stocknet dataset, improving stock movement prediction.

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%.

This paper predicts weekly stock market movements using machine learning and introduces a new benchmark.

problem Predicting stock market movements using daily data and various ML models.
method Focuses on weekly movements, introduces random traders as a benchmark, uses additional features, and adjusts training datasets.
result Trained models, especially MLP, show good performance across different trends.

GCNET predicts stock price movements using graph convolutional networks.

problem Predicting stock price movements using interrelated stocks data.
method GCNET models stock relations as an influence network, uses graph convolutional networks for prediction.
result GCNET significantly improves prediction accuracy and MCC measures.