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

Trend · papers per month

54108162216 · Jun 202019922001200920172026
48 results for movement costs

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

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.

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.

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.

E2GC optimizes energy efficiency in DNNs by balancing computational and data movement costs.

problem Imbalance between computational complexity and data reuse in GConv leads to suboptimal energy efficiency.
method Developed an optimum group size model and proposed E2GC module with constant group size.
result E2GC modules improve energy efficiency by 10.8% and 4.73% on P100 and P4000 GPUs, respectively.

SCaLE tackles dynamic regret in noisy bandit feedback with switching costs.

problem Unbounded metric movement costs in bandit online convex optimization.
method SCaLE algorithm for high-dimensional dynamic quadratic hitting costs and 2\ell_2-norm switching costs, with spectral regret analysis.
result First algorithm achieving sub-linear dynamic regret without hitting cost knowledge.

Study liquidity provision in decentralized exchanges considering risk aversion and replication costs.

problem Economic viability of liquidity provision in decentralized exchanges (DEXs).
method Formulated strategic interactions as a sequential game with risk-averse LP, traders, and arbitrageurs.
result DEX liquidity depth is crucial for risk management, influenced by risk aversion and replication costs.

GPT-4 improves stock price prediction from microblogging sentiments.

problem Improving stock price prediction using sentiment analysis of microblogs.
method Developed a novel method for contextual sentiment analysis using GPT-4, fine-tuning prompts for better accuracy.
result GPT-4 outperformed BERT in predicting stock price movements, achieving a peak accuracy of 71.47%.

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 ↗

We devise an optimal allocation strategy for the execution of a predefined number of stocks in a given time frame using the technique of discrete-time Stochastic Control Theory for a defined market model. This market structure allows an instant execution of the market orders and has been analyzed based on the assumptio…

2019-09-24abs ↗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.

The study uses LSTM and random forests to forecast stock price movements for intraday trading.

problem Forecasting directional movements of stock prices for intraday trading.
method Employed random forests and LSTM networks to analyze S&P 500 constituent stocks.
result Multi-feature setting provided higher daily returns (0.64% using LSTM, 0.54% using random forests) compared to single-feature setting.

Investment strategies derived from commodity futures curves exploit dynamics in price movements.

problem Modeling and predicting the term structure of commodity futures prices.
method Employed the Nelson-Siegel framework to model term structure, and developed investment strategies based on changes in slope and curvature parameters.
result Significant profits generated from systematic strategies based on the change in slope, unrelated to risk factors and robust to transaction costs.

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 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 ↗

SmartDeal reduces energy and storage costs for deep neural networks.

problem Heavy parameterization of deep neural networks leads to inefficient use of DRAM.
method SmartDeal decomposes weights into a small basis matrix and a structurally sparse coefficient matrix, quantized to power-of-2.
result Up to 2.44x energy efficiency improvement in inference and 10.56x reduction in training energy.

New algorithm achieves logarithmic regret for adversarial online control.

problem Online linear-quadratic control in systems with adversarial disturbances.
method Characterization of optimal offline control law, reduced to online learning with approximate advantage functions.
result First algorithm with logarithmic regret for arbitrary adversarial disturbance sequences.

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.

Non-negative Matrix Factorization (NMF) is a key kernel for unsupervised dimension reduction used in a wide range of applications, including topic modeling, recommender systems and bioinformatics. Due to the compute-intensive nature of applications that must perform repeated NMF, several parallel implementations have b…

2019-04-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.

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.

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.

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.

Risk hedging can reduce operational costs by adjusting prices and production levels in response to asset price movements.

problem How risk hedging impacts operational decisions in response to asset price movements.
method Developed and solved a risk-management model integrating risk hedging into a price-setting newsvendor problem.
result Hedging generally reduces optimal price and VPQ, but may increase VPQ under certain conditions.

Study introduces a new investment strategy model using lazy factor and probability weights.

problem Optimizing investment strategies in volatile markets with transaction costs.
method Combines Price Portfolio Forecasting and Mean-Variance Models with Transaction Costs, using probability weights as laziness factor coefficients.
result Model demonstrates adaptability and generalizability in transforming investment strategies.