pith. sign in

arxiv: 2403.18540 · v3 · pith:FSXN5G6Qnew · submitted 2024-03-27 · 📊 stat.ML · cs.LG· stat.CO

skscope: Fast Sparsity-Constrained Optimization in Python

classification 📊 stat.ML cs.LGstat.CO
keywords skscopesolversavailablecodejustoptimizationprogrammingpython
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Zero-shot Concept Bottleneck Models

    cs.LG 2025-02 unverdicted novelty 7.0

    Z-CBMs achieve zero-shot interpretable predictions by retrieving concepts from a million-vocabulary web bank via cross-modal search and regressing labels with sparse linear regression.