arXiv (All)
open access
The Hessian Screening Rule
Predictor screening rules, which discard predictors before fitting a model, have had considerable impact on the speed with which sparse regression problems, such as the lasso, can be solved. In this paper we present a new screening rule for solving the lasso path: the Hessian Screening Rule. The rul
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Complexity of Lasso with Normalized Data, Geometry and Combinatorics#652011
- Complexity of Lasso with Normalized Data, Geometry and Combinatorics#650558
- lasso#278117
- Readout Scaling Shapes Sparse Feature Recovery#1354986
- Data-driven Smooth-to-hard Spectral Regularization for General Linear Inverse Problems#1357319
Record · ID 1342264
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive