Papers
Topics
Authors
Recent
Search
2000 character limit reached

Learning the Efficient Frontier

Published 27 Sep 2023 in cs.LG and cs.CE | (2309.15775v2)

Abstract: The efficient frontier (EF) is a fundamental resource allocation problem where one has to find an optimal portfolio maximizing a reward at a given level of risk. This optimal solution is traditionally found by solving a convex optimization problem. In this paper, we introduce NeuralEF: a fast neural approximation framework that robustly forecasts the result of the EF convex optimization problem with respect to heterogeneous linear constraints and variable number of optimization inputs. By reformulating an optimization problem as a sequence to sequence problem, we show that NeuralEF is a viable solution to accelerate large-scale simulation while handling discontinuous behavior.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (49)
  1. Differentiable convex optimization layers. Advances in neural information processing systems, 32, 2019.
  2. Learning convex optimization models. IEEE/CAA Journal of Automatica Sinica, 8(8):1355–1364, 2021.
  3. I. Akkizidis and L. Kalyvas. Final basel III modelling: Implementation, impact and implications. Springer, 2018.
  4. B. Amos and J. Z. Kolter. Optnet: Differentiable optimization as a layer in neural networks. In International Conference on Machine Learning, pages 136–145. PMLR, 2017.
  5. Computational complexity analysis for monte carlo approximations of classically scaled population processes. Multiscale Modeling & Simulation, 16(3):1206–1226, 2018.
  6. Monte carlo methods for security pricing. Journal of economic dynamics and control, 21(8-9):1267–1321, 1997.
  7. P. Brandimarte. Handbook in Monte Carlo simulation: applications in financial engineering, risk management, and economics. John Wiley & Sons, 2014.
  8. Language models are few-shot learners. Advances in neural information processing systems, 33:1877–1901, 2020a.
  9. Language models are few-shot learners. Advances in neural information processing systems, 33:1877–1901, 2020b.
  10. R. E. Caflisch. Monte carlo and quasi-monte carlo methods. Acta numerica, 7:1–49, 1998.
  11. Two-dimensional batch linear programming on the gpu. Journal of Parallel and Distributed Computing, 126:152–160, 2019.
  12. P. Charoenphaibul and N. Juneam. Gpu-accelerated method for simulating efficient portfolios in the mean-variance analysis. In 2020 17th International Joint Conference on Computer Science and Software Engineering (JCSSE), pages 171–176. IEEE, 2020.
  13. Exploiting gpu/simd architectures for solving linear-quadratic mpc problems. arXiv preprint arXiv:2209.13049, 2022.
  14. S. Diamond and S. Boyd. Cvxpy: A python-embedded modeling language for convex optimization. The Journal of Machine Learning Research, 17(1):2909–2913, 2016.
  15. A neural network solves, explains, and generates university math problems by program synthesis and few-shot learning at human level. Proceedings of the National Academy of Sciences, 119(32):e2123433119, 2022.
  16. Modern portfolio theory, 1950 to date. Journal of banking & finance, 21(11-12):1743–1759, 1997.
  17. Some acceleration methods for monte carlo simulation of rare events. Reliability Engineering & System Safety, 144:296–310, 2015.
  18. Z. Feinstein and B. Rudloff. Deep learning the efficient frontier of convex vector optimization problems. arXiv preprint arXiv:2205.07077, 2022.
  19. A. Fernández and S. Gómez. Portfolio selection using neural networks. Computers & operations research, 34(4):1177–1191, 2007.
  20. Homogeneous linear inequality constraints for neural network activations. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops, pages 748–749, 2020.
  21. Quasi-monte carlo for finance applications. ANZIAM Journal, 50:C308–C323, 2008.
  22. P. Glasserman. Monte Carlo methods in financial engineering, volume 53. Springer, 2004.
  23. Measuring mathematical problem solving with the MATH dataset. In Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks 1, Neurips Datasets and Benchmarks 2021, December 2021, virtual, 2021.
  24. Axial attention in multidimensional transformers. arXiv preprint arXiv:1912.12180, 2019.
  25. J. C. Hull. Options futures and other derivatives. Pearson Education India, 2003.
  26. T. Ibaraki and N. Katoh. Resource allocation problems: algorithmic approaches. MIT press, 1988.
  27. P. Jäckel. Monte Carlo methods in finance, volume 2. J. Wiley, 2002.
  28. R. Kannan and J. R. Luedtke. A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs. Mathematical Programming Computation, 13(4):705–751, 2021.
  29. J. D. M.-W. C. Kenton and L. K. Toutanova. Bert: Pre-training of deep bidirectional transformers for language understanding. In Proceedings of NAACL-HLT, pages 4171–4186, 2019.
  30. Reformer: The efficient transformer. In International Conference on Learning Representations, 2020.
  31. Pomo: Policy optimization with multiple optima for reinforcement learning. Advances in Neural Information Processing Systems, 33:21188–21198, 2020.
  32. Quantifying the carbon emissions of machine learning. arXiv preprint arXiv:1910.09700, 2019.
  33. Solving quantitative reasoning problems with language models. In Advances in Neural Information Processing Systems, 2022.
  34. I. Loshchilov and F. Hutter. Decoupled weight decay regularization. In 7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, May 6-9, 2019, 2019.
  35. Learning to iteratively solve routing problems with dual-aspect collaborative transformer. Advances in Neural Information Processing Systems, 34:11096–11107, 2021.
  36. Organizational commitment profiles and job satisfaction among greek private and public sector employees. International journal of cross cultural management, 7(1):77–99, 2007.
  37. The fundamental review of the trading book: implications for portfolio and risk management in the banking sector. Journal of Money, Credit and Banking, 2022.
  38. D. L. McLeish. Monte Carlo simulation and finance, volume 276. John Wiley & Sons, 2011.
  39. N. Metropolis and S. Ulam. The monte carlo method. Journal of the American statistical association, 44(247):335–341, 1949.
  40. H. Pan and R. Kondor. Permutation equivariant layers for higher order interactions. In International Conference on Artificial Intelligence and Statistics, pages 5987–6001. PMLR, 2022.
  41. Pointnet: Deep learning on point sets for 3d classification and segmentation. In Proceedings of the IEEE conference on computer vision and pattern recognition, pages 652–660, 2017.
  42. Searching for activation functions. In 6th International Conference on Learning Representations, ICLR 2018, Vancouver, BC, Canada, April 30 - May 3, 2018, Workshop Track Proceedings, 2018.
  43. Codecarbon: estimate and track carbon emissions from machine learning computing. Cited on, page 20, 2021.
  44. Gpu acceleration of admm for large-scale quadratic programming. Journal of Parallel and Distributed Computing, 144:55–67, 2020.
  45. Sequence to sequence learning with neural networks. Advances in neural information processing systems, 27, 2014.
  46. Attention is all you need. Advances in neural information processing systems, 30, 2017.
  47. Order matters: Sequence to sequence for sets. arXiv preprint arXiv:1511.06391, 2015.
  48. X. Warin. Deep learning for efficient frontier calculation in finance. Journal of Computational Finance, 26(1), 2022.
  49. Deep sets. Advances in neural information processing systems, 30, 2017.
Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.