BackboneLearn: A Library for Scaling Mixed-Integer Optimization-Based Machine Learning
Abstract: We present BackboneLearn: an open-source software package and framework for scaling mixed-integer optimization (MIO) problems with indicator variables to high-dimensional problems. This optimization paradigm can naturally be used to formulate fundamental problems in interpretable supervised learning (e.g., sparse regression and decision trees), in unsupervised learning (e.g., clustering), and beyond; BackboneLearn solves the aforementioned problems faster than exact methods and with higher accuracy than commonly used heuristics. The package is built in Python and is user-friendly and easily extensible: users can directly implement a backbone algorithm for their MIO problem at hand. The source code of BackboneLearn is available on GitHub (link: https://github.com/chziakas/backbone_learn).
- Strong optimal classification trees. arXiv preprint arXiv:2103.15965, 2021.
- Safe screening rules for l0-regression from perspective relaxations. In International conference on machine learning, pages 421–430. PMLR, 2020.
- The backbone method for ultra-high dimensional sparse machine learning. Machine Learning, 111(6):2161–2212, 2022.
- Machine learning under a modern optimization lens. Dynamic Ideas LLC Charlestown, MA, 2019.
- Learning sparse nonlinear dynamics via mixed-integer optimization. Nonlinear Dynamics, 111(7):6585–6604, 2023.
- Compressed sensing: A discrete optimization approach. arXiv preprint arXiv:2306.04647, 2023.
- Online vehicle routing: The edge of optimization in large-scale applications. Operations Research, 67(1):143–162, 2019.
- Slowly varying regression under sparsity. arXiv preprint arXiv:2102.10773, 2021.
- Dimensionality reduction via sparse support vector machines. Journal of Machine Learning Research, 3(Mar):1229–1243, 2003.
- Sparse pca with multiple components. arXiv preprint arXiv:2209.14790, 2022.
- Safe screening for logistic regression with l0–l2 regularization. arXiv, 2202, 2022.
- Cbc user guide. In Emerging theory, methods, and applications, pages 257–277. INFORMS, 2005.
- Optimization problems for machine learning: A survey. European Journal of Operational Research, 290(3):807–828, 2021.
- A cutting plane algorithm for a clustering problem. Mathematical Programming, 45:59–96, 1989.
- Finding neurons in a haystack: Case studies with sparse probing. arXiv preprint arXiv:2305.01610, 2023.
- Sparse regression at scale: Branch-and-bound rooted in first-order optimization. Mathematical Programming, 196(1-2):347–388, 2022.
- L0learn: A scalable package for sparse learning using l0 regularization. Journal of Machine Learning Research, 24(205):1–8, 2023.
- Permanent-magnet optimization for stellarators as sparse regression. Physical Review Applied, 18(4):044006, 2022.
- Quant-bnb: A scalable branch-and-bound method for optimal decision trees with continuous features. In International Conference on Machine Learning, pages 15255–15277. PMLR, 2022.
- Pulp: a linear programming toolkit for python. The University of Auckland, Auckland, New Zealand, 65, 2011.
- Scikit-learn: Machine learning in python. Journal of Machine Learning Research, 12:2825–2830, 2011.
- Odtlearn: A package for learning optimal decision trees for prediction and prescription. arXiv preprint arXiv:2307.15691, 2023.
- Regularization and variable selection via the elastic net. Journal of the Royal Statistical Society Series B: Statistical Methodology, 67(2):301–320, 2005.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.