Papers › Approximating Optimal Asset Allocations using Simulated Bifurcation

Approximating Optimal Asset Allocations using Simulated Bifurcation

6 Aug 2021arXiv:2108.03092archive 2025-07-28

Thomas Bouquet, Mehdi Hmyene, François Porcher, Lorenzo Pugliese, Jad Zeroual

This paper investigates the application of Simulated Bifurcation algorithms to approximate optimal asset allocations. It will provide the reader with an explanation of the physical principles underlying the method and a Python implementation of the latter applied to 441 assets belonging to the S&P500 index. In addition, the paper tackles the problem of the selection of an optimal sub-allocation; in this particular case, we find an adequate solution in an unrivaled timescale.

PaperPDFCode

Code

bqth29/simulated-bifurcation-algorithm officialmentioned in papermentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections