Image de couverture de livre

A New Branch-and-Bound Pruning Framework for $\ell_0$-Regularized Problems

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Guyard, Theo, Herzet, Cédric, Elvira, Clément, Arslan, Ayşe-Nur
Format:	Preprint
Publié:	2024
Sujets:	Optimization and Control Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Generic Branch-and-Bound Algorithm for $\ell_0$-Penalized Problems with Supplementary Material
par: Elvira, Clément, et autres
Publié: (2025)

El0ps: An Exact L0-regularized Problems Solver
par: Guyard, Théo, et autres
Publié: (2025)

One to beat them all: "RYU" -- a unifying framework for the construction of safe balls
par: Tran, Thu-Le, et autres
Publié: (2023)

PACE: Prune-And-Compress Ensemble Models
par: Akkerman, Fabian, et autres
Publié: (2026)

Sparse Deep Learning Models with the $\ell_1$ Regularization
par: Shen, Lixin, et autres
Publié: (2024)

$\ell_0$ factor analysis
par: Wang, Linyang, et autres
Publié: (2024)

Non-linear Multi-objective Optimization with Probabilistic Branch and Bound
par: Huang, Hao, et autres
Publié: (2025)

Machine Learning Augmented Branch and Bound for Mixed Integer Linear Programming
par: Scavuzzo, Lara, et autres
Publié: (2024)

Disjunctive Branch-and-Bound for Certifiably Optimal Low-Rank Matrix Completion
par: Bertsimas, Dimitris, et autres
Publié: (2023)

De-singularity Subgradient for the $q$-th-Powered $\ell_p$-Norm Weber Location Problem
par: Lai, Zhao-Rong, et autres
Publié: (2024)

From Sequential Nodes to GPU Batches: Parallel Branch and Bound for Optimal $k$-Sparse GLMs
par: Liu, Jiachang, et autres
Publié: (2026)

An Efficient Spatial Branch-and-Bound Algorithm for Global Optimization of Gaussian Process Posterior Mean Functions
par: Tang, Wei-Ting, et autres
Publié: (2026)

Stability of Data-Dependent Ridge-Regularization for Inverse Problems
par: Neumayer, Sebastian, et autres
Publié: (2024)

Dynamic Range Reduction via Branch-and-Bound
par: Gerlach, Thore, et autres
Publié: (2024)

Mirror and Preconditioned Gradient Descent in Wasserstein Space
par: Bonet, Clément, et autres
Publié: (2024)

A Rolling-Space Branch-and-Price Algorithm for the Multi-Compartment Vehicle Routing Problem with Multiple Time Windows
par: Raqabi, El Mehdi Er, et autres
Publié: (2026)

Efficiently Escaping Saddle Points under Generalized Smoothness via Self-Bounding Regularity
par: Cao, Daniel Yiming, et autres
Publié: (2025)

Complexity of Classical Acceleration for $\ell_1$-Regularized PageRank
par: Fountoulakis, Kimon, et autres
Publié: (2026)

CORL: Reinforcement Learning of MILP Policies Solved via Branch and Bound
par: Anand, Akhil S, et autres
Publié: (2025)

Computation of Least Trimmed Squares: A Branch-and-Bound framework with Hyperplane Arrangement Enhancements
par: Meng, Xiang, et autres
Publié: (2026)

A Stochastic-Gradient-based Interior-Point Algorithm for Solving Smooth Bound-Constrained Optimization Problems
par: Curtis, Frank E., et autres
Publié: (2023)

AdaSwitch: An Adaptive Switching Meta-Algorithm for Learning-Augmented Bounded-Influence Problems
par: Chen, Xi, et autres
Publié: (2025)

Learning Difference-of-Convex Regularizers for Inverse Problems: A Flexible Framework with Theoretical Guarantees
par: Zhang, Yasi, et autres
Publié: (2025)

Heuristic Optimal Transport in Branching Networks
par: Andrecut, M.
Publié: (2023)

Matching the Statistical Query Lower Bound for $k$-Sparse Parity Problems with Sign Stochastic Gradient Descent
par: Kou, Yiwen, et autres
Publié: (2024)

A Semidefinite Programming-Based Branch-and-Cut Algorithm for Biclustering
par: Sudoso, Antonio M.
Publié: (2024)

Implicit Bias of AdamW: $\ell_\infty$ Norm Constrained Optimization
par: Xie, Shuo, et autres
Publié: (2024)

An Iteratively Reweighted Method for Sparse Optimization on Nonconvex $\ell_{p}$ Ball
par: Wang, Hao, et autres
Publié: (2021)

Learning Regularization Functionals for Inverse Problems: A Comparative Study
par: Hertrich, Johannes, et autres
Publié: (2025)

New Lower Bounds for Stochastic Non-Convex Optimization through Divergence Decomposition
par: Saad, El Mehdi, et autres
Publié: (2025)

Hybrid Reinforcement Learning Framework for Mixed-Variable Problems
par: Zhai, Haoyan, et autres
Publié: (2024)

A Minimax-MDP Framework with Future-imposed Conditions for Learning-augmented Problems
par: Chen, Xin, et autres
Publié: (2025)

Towards An Efficient Approach for the Nonconvex $\ell_p$ Ball Projection: Algorithm and Analysis
par: Yang, Xiangyu, et autres
Publié: (2021)

Subspace Newton's Method for $\ell_0$-Regularized Optimization Problems with Box Constraint
par: Ye, Yuge, et autres
Publié: (2025)

Extragradient Method for $(L_0, L_1)$-Lipschitz Root-finding Problems
par: Choudhury, Sayantan, et autres
Publié: (2025)

Rethinking the Capacity of Graph Neural Networks for Branching Strategy
par: Chen, Ziang, et autres
Publié: (2024)

Learning Spatially Adaptive $\ell_1$-Norms Weights for Convolutional Synthesis Regularization
par: Kofler, Andreas, et autres
Publié: (2025)

Estimating Higher-Order Mixed Memberships via the $\ell_{2,\infty}$ Tensor Perturbation Bound
par: Agterberg, Joshua, et autres
Publié: (2022)

Cauchy-Schwarz Regularizers
par: Taner, Sueda, et autres
Publié: (2025)

Generalization Guarantees for Learning Branch-and-Cut Policies in Integer Programming
par: Cheng, Hongyu, et autres
Publié: (2025)