arXiv (OAI)
open access
Neural Bandit Based Optimal LLM Selection for a Pipeline of Subtasks
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
- Linear-Query Deterministic Approximation for Non-monotone Submodular Maximization under a Knapsack Constraint#1061314
- Policy Regret for Embedding Model Routing: Contextual Bandits with Low-Rank Experts#1104450
- ADHint: Adaptive Hints with Difficulty Priors for Reinforcement Learning#665607
- ADHint: Adaptive Hints with Difficulty Priors for Reinforcement Learning#664107
- Efficient Cost-Aware LLM Evaluation via Bayesian Bandit Gittins Indices#1061282
Record · ID 158769
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