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

121243364485 · Jun 202019922001200920172026
48 results for Dynamic Weight Rebalancing

Dynamic-weight AMMs outperform traditional CEX rebalancing in tokenized funds, especially on L2s.

problem Improving asset allocation efficiency in decentralized finance (DeFi) protocols.
method Block-level arbitrage analysis and long-term performance benchmarks on two live pools.
result Dynamic-weight AMMs can achieve performance comparable to or better than traditional CEX rebalancing, especially on Layer 2 (L2) networks.

SLERP interpolation optimizes dynamic weight rebalancing in AMMs.

problem Optimizing dynamic weight rebalancing in automated market makers (AMMs).
method Riemannian geometry and SLERP interpolation.
result SLERP interpolation minimizes the KL divergence loss in dynamic weight rebalancing.

This paper introduces a new metric to improve the performance of AMMs over centralised exchanges.

problem Lack of a precise metric to compare AMM performance with centralised exchanges.
method Introduces Rebalancing-versus-Rebalancing (RVR) to measure AMM performance more accurately.
result AMMs can offer superior execution and rebalancing efficiency compared to centralised exchanges, even with low fees.

Optimal rebalancing strategy improves AMM pool performance by 25%.

problem Optimizing the sequence of weights in dynamic AMM pools to minimize rebalancing costs.
method Using optimal interpolation and a cheap-to-compute approximation to achieve nearly optimal rebalancing.
result Approximately-optimal weight changes lead to significant increases in pool performance (up to 25%) under various conditions.

DeepAries optimizes rebalancing intervals and asset allocations for better portfolio performance.

problem Fixed rebalancing intervals lead to unnecessary transactions and poor risk-adjusted returns.
method Adaptive deep reinforcement learning with Transformer state encoder and PPO.
result DeepAries outperforms traditional strategies in risk-adjusted returns, transaction costs, and drawdowns.

Hybrid classical-quantum framework optimizes portfolio rebalancing with reduced transaction costs.

problem Optimizing portfolio rebalancing with reduced transaction costs and lookahead bias.
method Combining Ledoit-Wolf shrinkage covariance estimation, hierarchical correlation clustering, entropy-regularised Genetic Algorithm, minimum-variance and equal-weight benchmarks, QUBO formulation, and QAOA for solving the combinatorial optimisation problem.
result GA + QAOA strategy outperforms classical methods with reduced rebalances and transaction costs.

Hybrid model uses GNNs and pathfinding to optimize portfolio rebalancing costs.

problem Optimizing transaction costs in dynamic portfolio rebalancing.
method Combines GNNs for cost prediction and Dijkstra's algorithm for pathfinding.
result Significantly reduces transaction costs in financial asset graphs.

Maximizes probability of completing investment schedules with optimal portfolio weights.

problem Optimizing probability of completing investment schedules with optimal portfolio weights.
method Computing maximum probability and optimal portfolio weight functions for various rebalancing schedules.
result Noticeable improvements in probability to complete schedules with optimal portfolio weights.

Bayesian approach for constructing and rebalancing sparse index-tracking portfolios.

problem Sparse tracking of a reference index with uncertainty quantification.
method Sparse linear regression with Laplace prior, empirical-Bayes calibration, Langevin-type MCMC, threshold-based rules.
result Posterior uncertainty on tracking error, portfolio composition, and rebalancing moves.

This paper investigates the equilibrium interactions between trading targets and private information in a multi-period Kyle (1985) market. There are two investors who each follow dynamic trading strategies: A strategic portfolio rebalancer who engages in order splitting to reach a cumulative trading target and an uncon…

2015-02-07abs ↗pdf ↗

New algorithm improves online binary classification with constant time complexity.

problem Online binary classification with rebalancing.
method Non-iteratively reweighted recursive least-squares.
result Exacts converges to batch formulation and outperforms existing algorithms.

Investigates how rebalancing frequency and transaction costs affect log-optimal portfolios.

problem Impact of rebalancing frequency and transaction costs on log-optimal portfolios.
method Proved equivalence to concave program, derived optimality conditions, tested using intraday and daily data.
result Transaction costs can cause bankruptcy for frequency-dependent log-optimal portfolios, approximating to quadratic concave program.

Leveraged ETFs can outperform their targets in certain market conditions, contrary to the volatility drag hypothesis.

problem The long-term performance decay of leveraged ETFs due to volatility drag.
method Unified framework incorporating AR(1) and AR-GARCH models, continuous-time regime switching, and flexible rebalancing frequencies.
result Return dynamics, including return autocorrelation, volatility clustering, and regime persistence, determine LETF performance.

Paper develops a robust HVA measure for dynamic hedging under liquidity stress.

problem Valuation of dynamic hedging under liquidity stress.
method Defines robust HVA as worst-case expected loss over a relative-entropy neighborhood of loss distributions for no-trade bands.
result Wider no-trade bands lower rebalancing costs but increase hedge-error risk.

Model predicts trading strategies based on latent demand and price impact.

problem Predicting strategic trading behavior of investors with private targets.
method Equilibrium model of dynamic trading, learning, and pricing by strategic investors.
result Trading strategies are a combination of target following, liquidity provision, and front-running based on latent demand and price pressure.

Develops a robust hedging valuation adjustment measure for dynamic hedging under liquidity-demand stress.

problem Dynamic hedging under liquidity-demand stress
method Define robust HVA as the worst-case expected loss over a relative-entropy neighborhood of the loss distribution generated by simulated rebalancing and maturity-unwind trades.
result Distinguishes fixed-radius convention from fixed benchmark-stress convention and shows wider no-trade bands lower rebalancing costs but raise hedge-error risk.

Asymmetry PRISM outperforms CPU and GPU solvers for institutional rebalancing.

problem Institutional rebalancing with deadline constraints
method Asymmetry PRISM
result Asymmetry PRISM-CPU is 4.5x to 24.1x faster than the fastest completed reference row in the same lane.

MuonEq improves training of matrix-valued parameters by rebalancing momentum before orthogonalization.

problem Training matrix-valued parameters with orthogonalized-update optimizers like Muon.
method MuonEq introduces three lightweight pre-orthogonalization equilibration schemes: two-sided row/column normalization (RC), row normalization (R), and column normalization (C).
result Row/column normalization acts as a zeroth-order surrogate for whitening and improves the geometry seen by orthogonalization.

The paper explores IL and LVR in AMMs, identifying three regimes and the effect of fees.

problem The relationship between impermanent loss and loss-versus-rebalancing in AMMs.
method Statistical analysis, focus on fees, block times, and continuous time limit.
result Three regimes identified: identical, distinct distribution functions, and distinct averages.

Paper explains adversarial training's robust overfitting through a minimax game perspective.

problem Adversarial training suffers from robust overfitting after learning rate decay.
method Viewing adversarial training as a dynamic minimax game, analyzing how LR decay breaks balance and leads to overfitting.
result ReBalanced Adversarial Training (ReBAT) alleviates robust overfitting without sacrificing robustness.

A flexible calendar rebalancing approach for Indian stock portfolios.

problem Optimizing stock portfolio performance in the Indian stock market.
method Calendar rebalancing of sector-specific portfolios based on historical stock prices.
result The proposed calendar rebalancing approach improves portfolio performance over the test period.

We study T. Cover's rebalancing option (Ordentlich and Cover 1998) under discrete hindsight optimization in continuous time. The payoff in question is equal to the final wealth that would have accrued to a $\$1$ deposit into the best of some finite set of (perhaps levered) rebalancing rules determined in hindsight. A r…

2019-03-03abs ↗pdf ↗

Enhances portfolio performance using deep reinforcement learning and future rewards.

problem Improving existing high-performing portfolio strategies through dynamic rebalancing.
method Proximal Policy Optimization (PPO) and Oracle agents for dynamic rebalancing; Regret-based Sharpe reward function; Transaction cost scheduler; Future-looking reward function; Circular block bootstrap training.
result Significantly enhanced portfolio performance compared to traditional strategies and baselines.

This paper derives a robust on-line equity trading algorithm that achieves the greatest possible percentage of the final wealth of the best pairs rebalancing rule in hindsight. A pairs rebalancing rule chooses some pair of stocks in the market and then perpetually executes rebalancing trades so as to maintain a target …

2018-10-04abs ↗pdf ↗

Algorithm recommends trades based on crypto asset prices and market conditions.

problem Optimizing trades in volatile crypto markets to minimize gas fees and slippage.
method Cascading Waterfall Round Robin Mechanism considering gas fees and slippage.
result Algorithmic approach reduces market noise and ensures sound trade execution.

A neural network approach solves dynamic portfolio optimization without dynamic programming.

problem Dynamic portfolio optimization with multiple constraints and high rebalancing frequency.
method Parsimonious neural network without dynamic programming, avoiding high-dimensional expectations.
result Proves convergence to theoretical optimal solution under general conditions.

An algorithm was recently introduced by INTECH for the purposes of estimating the trading-profit contribution of systematic rebalancing to the relative return of rules-based investment strategies. We apply this methodology to analyze the size factor through the use of equal-weighted portfolios. These strategies combine…

2016-01-28abs ↗pdf ↗

Maximizing withdrawal success in a pooled annuity fund with multiple annuitants.

problem Optimizing withdrawal success in a pooled annuity fund with homogeneous annuitants.
method Maximizing the probability of completing withdrawals until death over portfolio weight functions.
result Increasing the number of annuitants can significantly increase the maximum probability of withdrawal success.

Theoretical and empirical study on SMOTE rebalancing strategy for imbalanced data.

problem Handling imbalanced tabular data sets using SMOTE and its variants.
method Derive non-asymptotic upper bounds on SMOTE density, adapt SMOTE based on theoretical findings.
result SMOTE tends to copy original minority samples asymptotically and vanishes near minority class boundaries.

Developing an Agent-Based Model to Mitigate Adverse Selection in Uniswap v3 Liquidity Providers

problem Adverse selection in Uniswap v3 liquidity providers
method Agent-Based Model incorporating blockchain microstructure and volatility dynamics
result Dynamic fee schedules improve hedged Profit and Loss for liquidity providers

We consider a financial model with permanent price impact. Continuous time trading dynamics are derived as the limit of discrete rebalancing policies. We then study the problem of super-hedging a European option. Our main result is the derivation of a quasi-linear pricing equation. It holds in the sense of viscosity so…

2015-03-18abs ↗pdf ↗

Deep learning predicts M&A events in industry networks.

problem Predicting M&A behaviors in competitive industries with complex interdependencies.
method Temporal Dynamic Industry Network (TDIN) model using temporal point processes and deep learning.
result Effective M&A event prediction and actionable recommendations.

The goal of this paper is to explore the relationship between momentum effects and liquidity in cryptocurrency markets. Portfolios based on momentum-liquidity bivariate sorts are formed and rebalanced on a varying number of cryptocurrencies through time. We find a strong momentum effect in the most liquid cryptocurrenc…

2019-04-01abs ↗pdf ↗

In this paper, we solve portfolio rebalancing problem when security returns are represented by uncertain variables considering transaction costs. The performance of the proposed model is studied using constant-proportion portfolio insurance (CPPI) as rebalancing strategy. Numerical results showed that uncertain paramet…

2018-12-18abs ↗pdf ↗

RAmmStein optimizes liquidity management in AMMs by learning to rebalance efficiently.

problem Optimal control of concentrated liquidity in decentralized exchanges.
method Formulates as an optimal control problem, uses Deep Reinforcement Learning with HJB-QVI.
result Achieves highest net ROI (1.60%) compared to greedy strategies, reduces rebalancing frequency by 85%.