mlsanityData to 7 Oct 2026

skscope: Fast Sparsity-Constrained Optimization in Python

arXiv 2403.18540 ↗First posted 27 Mar 2024stat.ML cs.LG stat.COcited by 1

Not on the map. Why?

Abstract (arXiv)

Applying iterative solvers on sparsity-constrained optimization (SCO) requires tedious mathematical deduction and careful programming/debugging that hinders these solvers' broad impact. In the paper, the library skscope is introduced to overcome such an obstacle. With skscope, users can solve the SCO by just programming the objective function. The convenience of skscope is demonstrated through two examples in the paper, where sparse linear regression and trend filtering are addressed with just four lines of code. More importantly, skscope's efficient implementation allows state-of-the-art solvers to quickly attain the sparse solution regardless of the high dimensionality of parameter space. Numerical experiments reveal the available solvers in skscope can achieve up to 80x speedup on the competing relaxation solutions obtained via the benchmarked convex solver. skscope is published on the Python Package Index (PyPI) and Conda, and its source code is available at: https://github.com/abess-team/skscope.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 7 of its 23 references that are in the map. First posted on arXiv 27 Mar 2024.

Builds on

7 of 23 references.

References · 7

  1. 2015Automatic differentiation in machine learning: a surveycited by 846
  2. 2016CVXPY: A Python-Embedded Modeling Language for Convex Optimizationcited by 633
  3. 2016A Tight Bound of Hard Thresholdingcited by 16
  4. 2021abess: A Fast Best Subset Selection Library in Python and Rcited by 16
  5. 2019Global and Quadratic Convergence of Newton Hard-Thresholding Pursuitcited by 9
  6. 2013Forward-Backward Greedy Algorithms for General Convex Smooth Functions over A Cardinality Constraintcited by 4
  7. 2023Best-Subset Selection in Generalized Linear Models: A Fast and Consistent Algorithm via Splicing Techniquecited by 3

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.