Paper: arXiv 2308.02820
Authors: Xianhua Peng, Chenyin Gong, Xue Dong He
Abstract
We propose the first discrete-time infinite-horizon dynamic formulation of the financial index tracking problem under both return-based tracking error and value-based tracking error. The formulation overcomes the limitations of existing models by incorporating the intertemporal dynamics of market information variables not limited to prices, allowing exact calculation of transaction costs, accounting for the tradeoff between overall tracking error and transaction costs, allowing effective use of data in a long time period, etc. The formulation also allows novel decision variables of cash injection or withdraw. We propose to solve the portfolio rebalancing equation using a Banach fixed point iteration, which allows to accurately calculate the transaction costs specified as nonlinear functions of trading volumes in practice. We propose an extension of deep reinforcement learning (RL) method to solve the dynamic formulation. Our RL method resolves the issue of data limitation resulting from the availability of a single sample path of financial data by a novel training scheme. A comprehensive empirical study based on a 17-year-long testing set demonstrates that the proposed method outperforms a benchmark method in terms of tracking accuracy and has the potential for earning extra profit through cash withdraw strategy.
Complexity vs Empirical Score
- Math Complexity: 8.0/10
- Empirical Rigor: 7.0/10
- Quadrant: Holy Grail — high math complexity, high empirical rigor
Why this score: The paper employs advanced mathematics including Banach fixed point iteration, infinite-horizon dynamic programming, and deep RL theory, while also presenting a comprehensive 17-year empirical study with transaction cost modeling and benchmark comparisons.
Research Flowchart
flowchart TD
A["Research Goal<br>Formulate Dynamic<br>Index Tracking Problem"] --> B["Data & Setup<br>17-Year Equity Data<br>Transactions Costs"]
B --> C{"Core Methodology"}
C --> D["Dynamic Formulation<br>Infinite-Horizon RL<br>Cash Injection/Withdraw"]
C --> E["Banach Fixed Point<br>Iterative Solver"]
D --> F["RL Algorithm<br>Training Scheme<br>Data Augmentation"]
E --> G["Computational Process<br>Estimate Costs &<br>Optimize Portfolio"]
F --> G
G --> H["Key Findings & Outcomes<br>1. Outperforms Benchmarks<br>2. Lower Tracking Error<br>3. Extra Profit via Cash"]
Evidence Card
What the authors claim, on what data, and who has checked it. Read from the paper's own text by a language model: every quote is verbatim, nothing was re-run. How to read this card
Proposes
The paper proposes a discrete-time infinite‑horizon dynamic formulation for index tracking and an extension of deep reinforcement learning to solve it.
Source sentence
We propose the first discrete-time infinite-horizon dynamic formulation of the financial index tracking problem under both return-based tracking error and value-based tracking error.
Assumes 4
- Portfolio weights are selected at time t and kept constant until the next rebalancing within the period [t, t+1). model
Source sentence
We assume that at each time t = 0, 1, 2, . . . , the fund manager selects portfolio weights wt ∈Ft, and then rebalances the portfolio at each rebalancing time t + k M , k = 0, 1, . . . , M −1, such that wt+ k M = wt for all k = 0, 1, . . . , M −1.
- The fund manager’s trading strategy is adapted to the filtration generated by market information Ft. market
Source sentence
Let the σ-field Ft represent the set of market information available at time t, i.e., Ft = σ{Is, p1,s, p2,s, . . . , pN,s, Xs; ∀s ≤t}, where Xs represents market information other than prices at time s.
- Transaction cost at each rebalancing is a known nonlinear function of trade volume with parameters from Interactive Brokers. execution
Source sentence
The transaction cost is ξ1i per share, with a minimum of ξ3i and a maximum of ξ2i of the trade value.
- Only one sample path of financial data is available; training uses random start dates to generate multiple episodes. data
Source sentence
The basic idea is to obtain enough quarterly or semiyearly data from daily data by randomly selecting the starting date of the first time period of each episode during training.
Data
equities · daily
- CRSP daily stock data market-prices commercial
Source sentence
The data of prices, trading volumes, and T-Bill rates are obtained from the Center for Research in Security Prices, LLC (CRSP).
Costs
Modeled
Nonlinear cost per share ξ1i, proportional fee ξ2i (0.5%), and minimum fee ξ3i (1.0 USD) as used by Interactive Brokers; also includes SEC and FINRA regulatory fees.
Source sentence
The transaction cost in the US market also includes SEC transaction fee and FINRA trading activity fee.
Finds 3
- The RL method achieves smaller mean return tracking error than the benchmark on a 17‑year out‑of‑sample test. performance
Source sentence
Our RL method achieves smaller mean return tracking error than a benchmark method on the testing set for return tracking of the indices.
- For value tracking, the RL method reduces mean value tracking error by an order of magnitude and yields a positive mean cash withdraw. performance
Source sentence
For value tracking of indices, our RL method not only achieves one magnitude smaller mean value tracking error than the benchmark method, but also produces a positive mean cash withdraw.
- Out‑of‑sample evaluation uses a rolling‑window approach over a 17‑year testing period, longer than prior studies. other
Source sentence
We are the first to test the out-of-sample performance of an index tracking strategy using a 17-year-long testing set, which is much longer than those in the existing literature.
Checked by others
No other paper in the archive has been found to support or contradict these findings (compared with 15 related papers). Coverage is partial, so this is neither replication nor refutation.
1 paper in the archive
Extracted 2026-11-14 · same card as JSON · A language model chose these items: check the source sentence before relying on one.