arXiv (All)
open access
High-dimensional Linear Bandits with Knapsacks
We investigate the contextual bandits with knapsack (CBwK) problem in a high-dimensional linear setting, where the feature dimension can be very large. Our goal is to harness sparsity to obtain sharper regret guarantees. To this end, we first develop an online variant of the hard thresholding algori
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
- Mixing Makes Markovian Contexts Cheap for Linear Bandits#973089
- Active Context Selection Improves Simple Regret in Contextual Bandits#204787
- A Direct Approach for Handling Contextual Bandits with Latent State Dynamics#2619
- Diversified Multinomial Logit Contextual Bandits#1118649
- Flow-Corrected Thompson Sampling for Non-Stationary Contextual Bandits#1048713
Record · ID 974143
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