skscope:fast sparsity-constrained optimization in Python

Wang, Zezhi; Zhu, Junxian; Wang, Xueqin; Zhu, JinORCID logo; Peng, Huiyang; Chen, Peng; Wang, Anran; and Zhang, Xiaoke (2024) skscope:fast sparsity-constrained optimization in Python Journal of Machine Learning Research, 25: 290. ISSN 1532-4435
Copy

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.

picture_as_pdf

picture_as_pdf
subject
Published Version
Available under Creative Commons: Attribution 4.0

Download

Atom BibTeX OpenURL ContextObject in Span OpenURL ContextObject Dublin Core MPEG-21 DIDL Data Cite XML EndNote HTML Citation METS MODS RIOXX2 XML Reference Manager Refer ASCII Citation
Export

Downloads