SearcharxivSearch

arXiv · 2303.13282

Accurate solution of the Index Tracking problem with a hybrid simulated annealing algorithm

Abstract

An actively managed portfolio almost never beats the market in the long term. Thus, many investors often resort to passively managed portfolios whose aim is to follow a certain financial index. The task of building such passive portfolios aiming also to minimize the transaction costs is called Index Tracking (IT), where the goal is to track the index by holding only a small subset of assets in the index. As such, it is an NP-hard problem and becomes unfeasible to solve exactly for indices with more than 100 assets. In this work, we present a novel hybrid simulated annealing method that can efficiently solve the IT problem for large indices and is flexible enough to adapt to financially relevant constraints. By tracking the S&P-500 index between the years 2011 and 2018 we show that our algorithm is capable of finding optimal solutions in the in-sample period of past returns and can be tuned to provide optimal returns in the out-of-sample period of future returns. Finally, we focus on the task of holding an IT portfolio during one year and rebalancing the portfolio every month. Here, our hybrid simulated annealing algorithm is capable of producing financially optimal portfolios already for small subsets of assets and using reasonable computational resources, making it an appropriate tool for financial managers.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Álvaro Rubio-García, Samuel Fernández-Lorenzo, Juan José García-Ripoll, Diego Porras. 2023-03-23. Accurate solution of the Index Tracking problem with a hybrid simulated annealing algorithm. https://arxiv.org/abs/2303.13282

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Universal sampling of spin systems across quenched disorder

Statistical physics extracts macroscopic laws by averaging over the many microscopic degrees of freedom of a system. Disordered systems demand a second and far harder average, one over the quenched randomness itself. The classic analytical routes, the replica and cavity methods, become uncontrolled outside mean-field or tree-like limits, and conventional numerical algorithms like parallel tempering require expensive, independent equilibration for every disorder realization. In this work, we introduce a universal neural variational framework that amortizes inference across the disorder ensemble, eliminating both the need for per-instance Markov chain equilibration and the cost of retraining instance-specific variational ansatzes. Built on an encoder-decoder Transformer architecture, after training once, it produces an explicit approximation to the Boltzmann distribution given previously unseen disorder realizations without further optimization. We validate this framework on 2D Edwards-Anderson models, and apply it to the random-bond Ising model, successfully capturing the Binder cumulant crossings near the Nishimori multicritical point. These results shift the object of variational inference from the single instance to the disorder ensemble, opening a route to frustrated many-body systems where instance-by-instance computation is prohibitive.

cond-mat.stat-mech

Information-Theoretic Characterization of Macroscopic Chaos Emerging from the Chemical Master Equation

Open chemical reaction networks exhibit stochastic concentration dynamics at finite system sizes, whereas their macroscopic limit is governed by deterministic rate equations that can display chaos. In this Letter, we show theoretically that a rate of information loss constructed from two-time mutual information recovers the Kolmogorov-Sinai entropy in the deterministic limit. We verify this result through numerical simulations of a Markov jump process for a three-species system involving seven reactions.

cond-mat.stat-mech

Orientational order on non-orientable domains

We study the statistical properties of passive and active many-body systems with orientational degrees of freedom on non-orientable domains. By rephrasing topological constraints as non-local symmetry relations on an orientable double-cover, we show that non-orientability eliminates global rotational soft modes without acting like an external field. In a passive XY model, this results in topological caging, where orientational fluctuations that exhibit conventional diffusive behavior on a torus saturate on a Klein bottle to a finite value that we compute exactly in the thermodynamic limit. In models of active self-propelled particles with orientational degrees of freedom, topological caging persists despite continuously changing interaction neighborhoods. In an active Ising spin model, non-orientability enforces the coexistence of ordered anti-parallel domains with vanishing global polar order, a state that is absent on orientable domains.

cond-mat.stat-mech