arXiv (All)
open access
New Lower Bound and Upper Bounds on the Regret for Online Sparse Linear Regression
We study online sparse linear regression (OSLR) where any algorithm is restricted to accessing only $b$ out of $d$ attributes per instance for prediction and $b_0\geq 0$ additional attributes after prediction, which was proved to be NP-hard. Previous work focused on designing computationally efficie
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
- Lower Bounds for Linear-Oracle Online Learning#1142976
- Resource-Adaptive Stochastic Gradient Descent for Online Linear Programming without Re-solving#1064807
- Efficient Linear Bandits via Cluster-Aware Sketching#1064138
- Reserve-Aware Contrast Certificates for Conservative Bandits with Uncertain Baselines#1144073
- Posterior Tempering Explains Variance Inflation in Linear and Generalized Linear Thompson Sampling#822407
Record · ID 1248831
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