arXiv (All)
open access
The Sample Complexity of Multiple Change Point Identification under Bandit Feedback
We study multiple change point localization under bandit feedback. An unknown piecewise-constant function on a compact interval can be queried sequentially at adaptively chosen inputs, and each query returns a noisy evaluation of the function. The goal is to identify a prescribed number of discontin
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
- Dynamic LoRA-Experts and Prototype-Ensemble Matching for Class-Incremental Learning#1145006
- Sampling frequency impact on countermovement jump metrics#245135
- Gradient boundaries through confidence intervals for forced alignment estimates using model ensembles#141751
- Unsupervised Learning of Local Updates for Maximum Independent Set in Dynamic Graphs#147090
- Blind Random Search with Noisy Loss Measurements: Averaging, Thresholding, and Almost Sure Convergence#927906
Record · ID 1413670
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