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

3978117156 · Jun 202619922001200920172026
48 results for constant rebalanced portfolios

Survey of universal portfolio techniques for minimizing investment regret.

problem Minimizing investment regret in algorithmic trading.
method Explains various universal portfolio techniques and their proofs.
result Coverage of fundamental concepts and algorithms in regret minimization.

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.

A constant rebalanced portfolio is an asset allocation algorithm which keeps the same distribution of wealth among a set of assets along a period of time. Recently, there has been work on on-line portfolio selection algorithms which are competitive with the best constant rebalanced portfolio determined in hindsight. By…

2013-01-30abs ↗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 ↗

A new approach to continuous-time universal portfolios using pathwise Itô calculus.

problem Continuous-time version of Cover's universal portfolio strategies.
method Pathwise Itô calculus approach to establish existence and properties of universal portfolio strategies.
result The universal portfolio strategy's portfolio value process is the average of all values of constant rebalanced strategies.

Algorithm beats best constant rebalancing portfolio in long-term investment.

problem Poor performance of learning algorithms in online portfolio optimization.
method Leverages serial dependence in asset returns without distributional assumptions.
result Strategy asymptotically grows to highest rate among all strategies.

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.

This note provides a neat and enjoyable expansion and application of the magnificent Ordentlich-Cover theory of "universal portfolios." I generalize Cover's benchmark of the best constant-rebalanced portfolio (or 1-linear trading strategy) in hindsight by considering the best bilinear trading strategy determined in hin…

2019-07-23abs ↗pdf ↗

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.

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

This paper introduces a new process for portfolio rebalancing that is more equitable than existing methods.

problem Improving portfolio rebalancing processes in finance to be more equitable.
method Introduces a new market-invariant process for portfolio rebalancing, proving its superiority over existing methods.
result The market-invariant process is more equitable than the banker and linear processes, as demonstrated by empirical results.

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.

Pipeline decomposes portfolio optimization problems into smaller, solvable subproblems.

problem Large-scale portfolio optimization with constraints.
method Decomposition pipeline with preprocessing, clustering, and risk rebalancing.
result Pipeline reduces problem size by 80% and computation time.

The paper optimizes portfolios with transaction costs in a large asset universe.

problem Optimizing portfolios with transaction costs in a large asset universe.
method Mean-variance optimization with nonconvex penalty for proportional and quadratic transaction costs.
result The proposed models show satisfactory performance and highlight the importance of transaction costs.

This paper optimizes portfolios using TDA and financial news sentiment.

problem Effective portfolio diversification through understanding asset similarity.
method Integrates TDA with FinBERT sentiment scores for dynamic rebalancing.
result Outperforms traditional methods in returns and risk-adjusted performance.

The study optimizes investment portfolios using deep learning models for variance-covariance estimation.

problem Estimating an appropriate variance-covariance matrix in Modern Portfolio Theory.
method Employed LSTM-RNN and probabilistic deep learning models (DeepVAR, GPVAR) for multivariate forecasting and portfolio optimization.
result LSTM-RNN models generally yield the best performance in terms of information ratio and annualized returns.

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.

In a pathbreaking paper, Cover and Ordentlich (1998) solved a max-min portfolio game between a trader (who picks an entire trading algorithm, θ()θ(\cdot)) and "nature," who picks the matrix XX of gross-returns of all stocks in all periods. Their (zero-sum) game has the payoff kernel Wθ(X)/D(X)W_θ(X)/D(X), where Wθ(X)W_θ(X) is the…

2018-10-04abs ↗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.

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.

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.

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.

We consider a market consisting of one safe and one risky asset, which offer constant investment opportunities. Taking into account both proportional transaction costs and linear price impact, we derive optimal rebalancing policies for representative investors with constant relative risk aversion and a long horizon.

2014-02-21abs ↗pdf ↗

This paper models AMM positions using CI options to calculate LVR and provide actionable guidance.

problem Calculating and managing adverse-selection costs in automated market makers (AMMs).
method Modeling AMM positions as perpetual American CI options to replicate delta and calculate LVR.
result LVR is identical to theta of CI options, and AMM positions have approximately constant LVR over long windows.

This paper extends Kelly Criterion to include rebalancing frequency for optimal portfolio selection.

problem Optimizing a portfolio with multiple assets and varying rebalancing frequency.
method Using Kelly Criterion, the paper derives necessary and sufficient conditions for the frequency-based Kelly optimal portfolio.
result Proves the necessity and sufficiency of conditions for the frequency-based Kelly optimal portfolio.

Deep learning models improve stock market portfolio returns.

problem Optimizing portfolio returns using deep learning methods.
method Deep neural networks (feedforward and LSTM) applied to stock market excess returns forecasting.
result Deep learning models deliver significant gains in portfolio certainty equivalent returns and Sharpe ratios.

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 ↗

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.

Proposes an efficient method for sparse index tracking with 0\ell_0-norm constraints.

problem Constructing a sparse portfolio to track a financial index.
method Formulates a new problem using 0\ell_0-norm constraints, develops an efficient algorithm based on primal-dual splitting.
result Demonstrates effectiveness through experiments on S&P500 and Russell3000 datasets.

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.

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 ↗

Developed a monotone numerical method for MV portfolio optimization under jump-diffusion models.

problem Efficiently optimizing portfolios with jump-diffusion dynamics and investment constraints.
method Strictly monotone numerical integration method using Fourier transforms and composite quadrature rules.
result Proven to be \ell_{\infty}-stable and pointwise consistent, converging to the MV optimization solution.

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 ↗

We consider a two-person trading game in continuous time whereby each player chooses a constant rebalancing rule bb that he must adhere to over [0,t][0,t]. If Vt(b)V_t(b) denotes the final wealth of the rebalancing rule bb, then Player 1 (the `numerator player') picks bb so as to maximize E[Vt(b)/Vt(c)]\mathbb{E}[V_t(b)/V_t(c)], whil…

2019-06-05abs ↗pdf ↗

This paper prices and replicates the financial derivative whose payoff at TT is the wealth that would have accrued to a $\$1$ deposit into the best continuously-rebalanced portfolio (or fixed-fraction betting scheme) determined in hindsight. For the single-stock Black-Scholes market, Ordentlich and Cover (1998) only p…

2018-10-05abs ↗pdf ↗

We introduce a pathwise approach to analyze the relative performance of an equity portfolio with respect to a benchmark market portfolio. In this energy-entropy framework, the relative performance is decomposed into three components: a volatility term, a relative entropy term measuring the distance between the portfoli…

2013-08-25abs ↗pdf ↗