KOASAS: KAIST Open Access Self-Archiving System
metadata only
Improved Regret Bounds of (Multinomial) Logistic Bandits via Regret-to-Confidence-Set Conversion
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
- Risk Management with Benchmarking#942363
- Bandit Multiclass PAC Learning: Corrected Lower Bounds, Exact Families, and a Confidence Direct-Sum Phenomenon#1077621
- Provable Anytime Ensemble Sampling Algorithms in Nonlinear Contextual Bandits#1052033
- Certifiable Near-Optimality: A Simple Framework for Unifying Search and Refutation for (Semi)random CSPs#1142968
- The Price of Privacy For Approximating Max-CSP#1109784
Record · ID 436425
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