Sparse regression at scale: branch-and-bound rooted in first-order optimization

Sparse regression at scale: branch-and-bound rooted in first-order optimization

Bibliographic Details
Main Authors:	Hazimeh, Hussein, Mazumder, Rahul, Saab, Ali
Other Authors:	Massachusetts Institute of Technology. Operations Research Center
Format:	Article
Language:	English
Published:	Springer Science and Business Media LLC 2022
Online Access:	https://hdl.handle.net/1721.1/144218

Similar Items

Learning Sparse Classifiers: Continuous and Mixed Integer Optimization Perspectives
by: Dedieu, Antoine, et al.
Published: (2022)

Learning Hierarchical Interactions at Scale: A Convex Optimization Approach
by: Hazimeh, Hussein, et al.
Published: (2021)

AdaBoost and Forward Stagewise Regression are First-Order Convex Optimization Methods
by: Freund, Robert M., et al.
Published: (2014)

Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithms
by: Hazimeh, Hussein, et al.
Published: (2021)

Sparse Learning using Discrete Optimization: Scalable Algorithms and Statistical Insights
by: Hazimeh, Hussein
Published: (2022)

Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA
by: Dey, Santanu S, et al.
Published: (2022)

A Branch-and-Bound Algorithm for Quadratically-Constrained Sparse Filter Design
by: Wei, Dennis, et al.
Published: (2014)

Improved bounds on Gaussian MAC and sparse regression via Gaussian inequalities
by: Zadik, Ilias, et al.
Published: (2021)

Flexible Modeling and Multitask Learning using Differentiable Tree Ensembles
by: Ibrahim, Shibal, et al.
Published: (2022)

Least quantile regression via modern optimization
by: Mazumder, Rahul, et al.
Published: (2015)

The Discrete Dantzig Selector: Estimating Sparse Linear Models via Mixed Integer Linear Optimization
by: Mazumder, Rahul, et al.
Published: (2019)

Convergence-order analysis of branch-and-bound algorithms for constrained problems
by: Barton, Paul I, et al.
Published: (2018)

Optimal temporal planning at reactive time scales via dynamic backtracking branch and bound
by: Effinger, Robert T
Published: (2007)

Optimal Temporal Planning at Reactive Time Scales via Dynamic Backtracking Branch and Bound
by: Effinger, Robert
Published: (2018)

Sparse PCA from sparse linear regression
by: Bresler, Guy, et al.
Published: (2022)

Sparse PCA from sparse linear regression
by: Bresler, Guy, et al.
Published: (2021)

Completeness for First-order Properties on Sparse Structures with Algorithmic Applications
by: Gao, Jiawei, et al.
Published: (2021)

Benefits of branches in sparsely connected networks
by: Landry, Madison
Published: (2022)

Lower bounds for sparse recovery
by: Indyk, Piotr, et al.
Published: (2011)

Approximate sparse linear regression
by: Har-Peled, S, et al.
Published: (2021)

Sparse hierarchical regression with polynomials
by: Bertsimas, Dimitris, et al.
Published: (2021)

Bounded Width Branching Programs
by: Barrington, David A.
Published: (2023)

The Tree Ensemble Layer: Differentiability meets Conditional Computation
by: Hazimeh, Hussein, et al.
Published: (2022)

Algorithms and lower bounds for sparse recovery
by: Price, Eric (Eric C.)
Published: (2011)

First-order linear ordinary differential equation for regression modelling
by: Sie, Long Kek, et al.
Published: (2024)

First-order linear ordinary differential equation for regression modelling
by: Sie, Long Kek, et al.
Published: (2023)

First-order linear ordinary differential equation for regression modelling
by: Sie, Long Kek, et al.
Published: (2023)

On the Power of Preconditioning in Sparse Linear Regression
by: Kelner, Jonathan A, et al.
Published: (2022)

Sparse high-dimensional isotonic regression
by: Gamarnik, David, et al.
Published: (2021)

Sparse high-dimensional isotonic regression
by: Gamarnik, David, et al.
Published: (2021)

Subset Selection with Shrinkage: Sparse Linear Modeling When the SNR Is Low
by: Mazumder, Rahul, et al.
Published: (2022)

Branch-and bound strategies for dynamic programming
by: Morin, Thomas L., et al.
Published: (2009)

Branch and bound methods for combinatorial problems.
by: Little, John D. C.
Published: (2009)

Branch-and-bound strategies for dynamic programming
by: Morin, Thomas L., et al.
Published: (2009)

Linear regression with partially mismatched data: local search with theoretical guarantees
by: Mazumder, Rahul, et al.
Published: (2022)

Sparse Regression: Scalable Algorithms and Empirical Performance
by: Bertsimas, Dimitris, et al.
Published: (2022)

Sparse regression over clusters: SparClur
by: Bertsimas, Dimitris, et al.
Published: (2022)

Spatial variation decomposition via sparse regression
by: Zhang, Wangyang, et al.
Published: (2014)

Branch and bound method for multiobjective pairing selection
by: Kariwala, Vinay, et al.
Published: (2010)

Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods
by: Das Gupta, Shuvomoy, et al.
Published: (2024)