arXiv (All)
open access
Low-Rank Single-Index Bandits with Unknown Links: From Matrices to Tensors
Low-rank matrix and tensor bandits exploit structured interactions but typically assume a known reward link. Recent single-index bandit methods accommodate unknown links without directly exploiting matrix or tensor rank. We address this gap by studying stochastic matrix and tensor bandits with an un
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
- Reserve-Aware Contrast Certificates for Conservative Bandits with Uncertain Baselines#1144073
- Low-Rank Adaptation Redux for Large Models#126498
- Efficient Cost-Aware LLM Evaluation via Bayesian Bandit Gittins Indices#1061282
- Training seeds and model-selection stability in recommender-system evaluation#924376
- Training seeds and model-selection stability in recommender-system evaluation#920145
Record · ID 1117737
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