arXiv (All)
open access
Smooth Information Criterion for Variable Selection in Generalised Linear Models
Variable selection using information criteria has an explicit statistical target but requires discrete search over candidate models. The smooth information criterion (SIC) replaces the discontinuous model-dimension term by a differentiable approximation, with an $ε$-telescoping continuation strategy
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
- Is Completeness Necessary? Estimation in Nonidentified Linear Models#1000651
- A Smoothed Discrepancy Principle for Random Feature Methods and Neural Networks#1034987
- Compressed Active Subspaces for Scalable Bayesian Inference#1014132
- How Wrong Can a Good Predictor Be? Diverging Updates with Vanishing Predictive KL#998685
- Physically-Relevant Information Learning in High-Dimensional Time-Derivatives Spaces#343499
Record · ID 1078245
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