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.

169,051 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Sep 199219922001200920182026
48 results for Natural movements

ChatGPT struggles in predicting stock movements, underperforming traditional methods.

problem Predicting stock market movements using ChatGPT.
method Zero-shot analysis of ChatGPT's multimodal stock prediction capabilities.
result ChatGPT underperforms traditional methods and state-of-the-art models in predicting stock movements.

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.

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.

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.

A new framework predicts stock movements using news sentiment and relational data.

problem Predicting stock prices from textual information is challenging due to market uncertainty and natural language complexity.
method Multi-Graph Recurrent Network (MGRN) combining textual sentiment from financial news and relational data.
result The model outperforms benchmarks in predicting stock movements.

LARA forecasts financial asset trends by refining noisy labels and extracting profitable samples.

problem Low signal-to-noise ratio and stochastic nature of financial data lead to poor predictions.
method LARA combines LA-Attention and RA-Labeling to refine and extract profitable samples.
result LARA significantly outperforms existing methods on Qlib platform.

Predict stock movement by considering cross effects among stocks.

problem Challenges in predicting stock price movement due to cross effects among stocks.
method Multi-GCGRU framework combining GCN and GRU, encoding cross effects from financial domain knowledge and data-driven relationships.
result Our model outperforms other baselines in predicting stock movement.

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.

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.

Enhanced deep learning model predicts stock price movement using LOB data.

problem Challenges in predicting stock price movement from high-dimensional, volatile LOB data.
method Siamese architecture with multi-head attention and LSTM modules.
result Significant improvement in stock price prediction performance over strong baselines.

DanSmp predicts stock movement using a hybrid-relational MKG and dual attention networks.

problem Predicting stock price trends in volatile financial markets.
method Constructs a bi-typed MKG with hybrid-relations and uses DanSmp, a dual attention network, to learn momentum spillover signals.
result DanSmp improves stock prediction accuracy using the MKG.

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.

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 ↗

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.

Proposes a THGNN for dynamic financial time series prediction.

problem Challenges in predicting stock market price movements.
method Temporal and heterogeneous graph neural network (THGNN) approach.
result Significantly improved prediction performance compared to state-of-the-art methods.

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.

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.

PreBit predicts Bitcoin price movements using social media and financial data.

problem Predicting extreme price movements of Bitcoin due to its volatility and speculative trading.
method Hybrid model combining FinBERT embeddings of Twitter content with candlestick data and technical indicators.
result The hybrid model can predict significant market movements with a profitable trading strategy.

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.

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.

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.

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 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)}).

Automated GMA using accelerometers detects abnormal infant movements with human-level accuracy.

problem Undetected perinatal stroke leads to lifelong disability.
method Wearable accelerometers and Discriminative Pattern Discovery (DPD) for automated GMA.
result Automated method correctly identifies abnormal movements with human-level accuracy.

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.

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