arXiv (All)
open access
Corruption-Robust Sparse Linear Contextual Bandits with Knapsack Constraints
We study sparse linear contextual bandits with knapsack constraints under joint reward and consumption corruption. Consumption corruption creates a challenge beyond corrupted rewards: it affects not only statistical estimates, but also the recorded budget, resource prices, and stopping decisions tha
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
- Scaling Bayesian Bandit Encoding with Shared Learning#973879
- Path-Space Robust Bayesian Portfolio Selection#1155242
- REDRUM: Robust Estimation and Design for the Random Utility Model#251680
- Betting on your beliefs… to the death: a computational study of the Kelly Rule in stochastic markets#202072
- Replication Data for: EDSAF: Event-Driven Surrogate-Assisted Framework for Real-time Optimization#685271
Record · ID 1132390
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