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

Trend · papers per month

68136204272 · Jun 202019922001200920172026
48 results for minimizing movement

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 ↗

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.

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.

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 ↗

Paper proves existence of solutions for complex surface diffusion equation.

problem Existence of solutions for anisotropic surface diffusion with elasticity.
method Cahn-Taylor minimizing movement scheme for three-dimensional analysis.
result Proves existence of classical solutions without curvature regularization.

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 algorithm reduces costs in wind energy systems by minimizing decision changes.

problem Costs associated with decision changes in wind energy systems.
method Episodic CBO with movement costs using Gaussian Process and mirror descent.
result Our algorithm consistently outperforms standard CBO in altitude optimization.

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 deep learning method for option pricing in jump-diffusion models.

problem Option pricing in jump-diffusion models with high-dimensional assets.
method Implicit-explicit minimizing movement time-stepping approach using deep ANNs.
result Consistent and asymptotically correct solutions for large underlyings.

Study shows thresholding scheme converges for mean curvature flow of convex sets.

problem Analyzing convergence of thresholding scheme for mean curvature flow.
method Time discretization using Merriman, Bence and Osher's scheme, focusing on two-phase mean convex settings.
result Time-integrated energy of approximation converges to limit's energy in minimizing movements interpretation.

We derive generalization error bounds for stationary univariate autoregressive (AR) models. We show that imposing stationarity is enough to control the Gaussian complexity without further regularization. This lets us use structural risk minimization for model selection. We demonstrate our methods by predicting interest…

2011-03-04abs ↗pdf ↗

Framework uses optimal transport for neural architecture search.

problem Optimizing neural architectures in deep learning.
method Semi-discrete optimization using optimal transport.
result Gradient flow and minimizing movement scheme converge to reaction-diffusion equations.

New theorem shows shapes close to balls, flow converges to balls in 2D and 3D.

problem Understanding the asymptotic behavior of volume-preserving mean curvature flow.
method Proved a new quantitative Alexandrov theorem and used it to show flow convergence.
result Weak solutions of volume-preserving mean curvature flow converge to disjoint balls in R^2 and R^3.

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.

We study the evolution of closed inextensible planar curves under a second order flow that decreases the pp-elastic energy. A short time existence result for p(1,)p \in (1,\infty) is obtained via a minimizing movements method. For p=2p = 2, that is in the case of the classic elastic energy, long-time existence is retrieve…

2018-11-15abs ↗pdf ↗

Based on a recent theorem due to the authors, it is shown how the extreme tail dependence between an asset and a factor or index or between two assets can be easily calibrated. Portfolios constructed with stocks with minimal tail dependence with the market exhibit a remarkable degree of decorrelation with the market at…

2002-05-30abs ↗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.

In this article we discuss the distribution of asset price movements by the market potential function. From the principle of free energy minimization we analyze two different kinds of market potentials. We obtain a U-shaped potential when market reversion (i.e. contrarian investors) is dominant. On the other hand, if t…

2014-03-13abs ↗pdf ↗

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.

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.

This paper uses GAN and ERMSE to improve stock price movement prediction accuracy.

problem Predicting stock price movement direction is challenging due to complex, incomplete, and fuzzy information.
method The paper proposes a deep learning model using GAN and ERMSE to forecast stock market trends.
result The GAN model outperformed LSTM in predicting stock price movement direction with a 4.35% improvement.

Brain-Machine Interfaces (BMIs) have recently emerged as a clinically viable option to restore voluntary movements after paralysis. These devices are based on the ability to extract information about movement intent from neural signals recorded using multi-electrode arrays chronically implanted in the motor cortices of…

2018-09-28abs ↗pdf ↗

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

Stock selection improved with a novel neural model capturing continuous stock dynamics.

problem Lack of continuous stock dynamics prediction and implicit cross-domain dependencies.
method StockODE, a latent variable model with NRODEs and hierarchical hypergraph for continuous stock volatility and inter-domain dependencies.
result Significantly outperforms baselines, improving Sharpe Ratio by up to 18.57%.

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.

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.