LLM Agents for Combinatorial Efficient Frontiers: Investment Portfolio Optimization
Simon Paquette-Greenbaum, Jiangbo Yu

TL;DR
This paper introduces a novel agentic framework for combinatorial portfolio optimization, specifically addressing the CCPO problem, and demonstrates its effectiveness in matching state-of-the-art algorithms while reducing workflow complexity.
Contribution
The study develops a new agentic framework for CCPO that automates complex workflows and matches top algorithms, simplifying portfolio optimization processes.
Findings
Framework matches state-of-the-art algorithms
Reduces effort in workflow and algorithm development
Maintains acceptable error levels in complex problems
Abstract
Investment portfolio optimization is a task conducted in all major financial institutions. The Cardinality Constrained Mean-Variance Portfolio Optimization (CCPO) problem formulation is ubiquitous for portfolio optimization. The challenge of this type of portfolio optimization, a mixed-integer quadratic programming (MIQP) problem, arises from the intractability of solutions from exact solvers, where heuristic algorithms are used to find approximate portfolio solutions. CCPO entails many laborious and complex workflows and also requires extensive effort pertaining to heuristic algorithm development, where the combination of pooled heuristic solutions results in improved efficient frontiers. Hence, common approaches are to develop many heuristic algorithms. Agentic frameworks emerge as a promising candidate for many problems within combinatorial optimization, as they have been shown to be…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRisk and Portfolio Optimization · Constraint Satisfaction and Optimization · Stock Market Forecasting Methods
