Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,051 papers · 148 categories

Trend · papers per month

count% of corpus
0111 · Nov 201819922001200920182026
2 results for “l0-penalization”
A Generic Branch-and-Bound Algorithm for ℓ0\ell_0-Penalized Problems with Supplementary Materialmath.OC

A new Branch-and-Bound solver tackles L0-penalized problems with flexible loss functions.

problem Solving L0-penalized optimization problems with a broader class of loss functions.
method Generic Branch-and-Bound procedure with closed-form expressions for key quantities.
result El0ps solver achieves state-of-the-art performance and extends computational feasibility.
Branch-and-BoundL0-penalizedflexible loss functionsclosed-form expressionsstate-of-the-art performance
2025-06-04abs ↗pdf ↗
High Dimensional Classification through ℓ0\ell_0-Penalized Empirical Risk Minimizationstat.ME

The paper develops a classification method using penalties on feature selection for high-dimensional data.

problem High-dimensional binary classification with many irrelevant features.
method Empirical risk minimization with l0-penalization for feature selection.
result The method achieves a sparse solution close to true sparsity with high probability and converges to low misclassification risk.
high dimensional classificationempirical risk minimizationfeature selectionl0-penalizationsparse solution
2018-11-23abs ↗pdf ↗