aiqbench analysis
This research introduces a novel online contextual Pandora's Box model to optimize the adaptive querying and selection of LLM APIs, addressing the specific feedback structure where rewards are only observed after deployment. By directly modeling reservation indices via generalized method of moments and UCB-style confidence bounds, the proposed policy achieves dimension-dependent regret bounds without requiring full distribution estimation. This approach offers a rigorous theoretical framework for reducing costs in multi-API orchestration scenarios where output-mediated feedback complicates standard learning dynamics.
Online Pandora's Box for Contextual LLM Cascading
arXiv:2606.07392v1 Announce Type: cross Abstract: Motivated by Large Language Model (LLM) cascading, we propose an online contextual Pandora's Box model for adaptively querying and selecting LLM APIs. In each period, a decision-maker observes a request context and faces a two-phase decision problem. In the query phase, the decision-maker sequentially queries APIs, where each query reveals a generated output and the decision-maker incurs an (output-dependent) cost. In the selection phase, the decision-maker selects one of the generated outputs to deploy and observes only the downstream reward of the deployed output. This output-mediated feedback structure differs from classical online contextual Pandora's Box models, in which opening a box directly reveals its reward. Rather than estimating the full conditional output and cost distributions of each API, we directly model the reservation index and develop a learning approach for the query phase. Specifically, we impose a parametric structure on the contextual reservation index functions induced by the classical Weitzman's policy. Our policy combines generalized method of moments (GMM) type estimation of these reservation indices with UCB-style confidence bounds for both these indices and the shared output-level reward evaluator. Under regularity conditions, we prove that the resulting policy achieves dimension-dependent $\widetilde O(\sqrt T)$ cumulative regret over a horizon of $T$ periods.
Abstract:Motivated by Large Language Model (LLM) cascading, we propose an online contextual Pandora's Box model for adaptively querying and selecting LLM APIs. In each period, a decision-maker observes a request context and faces a two-phase decision problem. In the query phase, the decision-maker sequentially queries APIs, where each query reveals a generated output and the decision-maker incurs an (output-dependent) cost. In the selection phase, the decision-maker selects one of the generated outputs to deploy and observes only the downstream reward of the deployed output. This output-mediated feedback structure differs from classical online contextual Pandora's Box models, in which opening a box directly reveals its reward. Rather than estimating the full conditional output and cost distributions of each API, we directly model the reservation index and develop a learning approach for the query phase. Specifically, we impose a parametric structure on the contextual reservation index functions induced by the classical Weitzman's policy. Our policy combines generalized method of moments (GMM) type estimation of these reservation indices with UCB-style confidence bounds for both these indices and the shared output-level reward evaluator. Under regularity conditions, we prove that the resulting policy achieves dimension-dependent $\widetilde O(\sqrt T)$ cumulative regret over a horizon of $T$ periods.
Artificial Intelligence (cs.AI); Machine Learning (cs.LG); Econometrics (econ.EM); Machine Learning (stat.ML)
arXiv:2606.07392 [cs.AI]
(or arXiv:2606.07392v1 [cs.AI] for this version)
https://doi.org/10.48550/arXiv.2606.07392 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 303 words
Related coverage
Online Pandora's Box for Contextual LLM Cascading
arXiv · Aug 27, 2026
Deep-learning Causal Retrieval Optimization for Efficient e-commerce Distribution in Pinterest
arXiv · Jul 22, 2026
Policy Optimization and Statistical Inference for Online Contextual Matrix Games
arXiv · Aug 20, 2026
Sequential Batch Learning in Finite-Action Linear Contextual Bandits
arXiv · Aug 19, 2026