Large-scale portfolio optimization with variational neural annealing

Abstract

Portfolio optimization is a routine asset management operation conducted in financial institutions around the world. However, under real-world constraints such as turnover limits and transaction costs, its formulation becomes a mixed-integer nonlinear program that current mixed-integer optimizers often struggle to solve. We propose mapping this problem onto a classical Ising-like Hamiltonian and solving it with Variational Neural Annealing (VNA), via its classical formulation implemented using autoregressive neural networks. We demonstrate that VNA can identify near-optimal solutions for portfolios comprising more than 2,000 assets and yields performance comparable to that of state-of-the-art optimizers, such as Mosek, while exhibiting faster convergence on hard instances. Finally, we present a dynamical finite-size scaling analysis applied to the S&P 500, Russell 1000, and Russell 3000 indices, revealing universal behavior and polynomial annealing time scaling of the VNA algorithm on portfolio optimization problems.

16 pages, 13 figures, 1 table

References in corpus (27)

• A variational eigenvalue solver on a quantum processor
• The density-matrix renormalization group in the age of matrix product states
• Ising formulations of many NP problems
• Quantum computing for finance: overview and prospects
• Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer
• A Review on Quantum Approximate Optimization Algorithm and its Variants
• Quantum Computing for Finance: State of the Art and Future Prospects
• Quantum computing for finance
• Quantum critical dynamics in a 5000-qubit programmable spin glass
• Reverse Quantum Annealing Approach to Portfolio Optimization Problems
• Challenges and Opportunities in Quantum Optimization
• Solving the Optimal Trading Trajectory Problem Using a Quantum Annealer
• Deep Learning for Portfolio Optimization
• Dynamic Portfolio Optimization with Real Datasets Using Quantum Processors and Quantum-Inspired Tensor Networks
• Benchmarking the performance of portfolio optimization with QAOA
• Universal nonequilibrium quantum dynamics in imaginary time
• Dynamic scaling at classical phase transitions approached through non-equilibrium quenching
• Investigating Topological Order using Recurrent Neural Networks
• Scaling Advantage in Approximate Optimization with Quantum Annealing
• Real-time Trading System based on Selections of Potentially Profitable, Uncorrelated, and Balanced Stocks by NP-hard Combinatorial Optimization
• Supplementing Recurrent Neural Networks with Annealing to Solve Combinatorial Optimization Problems
• Pushing the Boundary of Quantum Advantage in Hard Combinatorial Optimization with Probabilistic Computers
• Message Passing Variational Autoregressive Network for Solving Intractable Ising Models
• Sparse Autoregressive Neural Networks for Classical Spin Systems
• Recurrent neural network wave functions for Rydberg atom arrays on kagome lattice
• Efficient Optimization of Variational Autoregressive Networks with Natural Gradient
• Lattice Protein Folding with Variational Annealing