arXiv:2606. 17489v1 Announce Type: cross Abstract: Large Language Models (LLMs) are increasingly deployed in edge-cloud inference systems to handle diverse user tasks with heterogeneous accuracy, latency, and cost profiles.
By Yin Huang, Qingsong Liu, Jie Xu
arXiv:2607. 10694v1 Announce Type: cross Abstract: We study the problem of optimal continual fine-tuning for a pre-trained Foundation Model deployed at a resource-limited device.
By Thomas Tsouparopoulos, Iordanis Koutsopoulos
arXiv:2609.21523v1 Announce Type: new
Abstract: A system may be compressed before its downstream task is fully known. We ask how much retained state is then necessary and how much can be saved by lim...
By Ronald Katende
The paper introduces Lag, a mean‑field optimal index policy for online assignment problems with reusable resources, such as peer review, call routing, ridesharing, emergency dispatch, and crowdsourcing. By modeling the problem as a contextual restless multi‑armed bandit and deriving an occupancy‑measure linear program, the authors obtain Lag from the dual and prove it is asymptotically optimal in a scaling regime where server copies and arrivals grow together. Experiments on peer‑review and call‑center data show Lag achieves 83–99% of the LP upper bound and outperforms greedy assignment by up to 36% in synthetic settings.
By Keerthana Gurushankar
arXiv:2004. 06321v2 Announce Type: replace Abstract: We study the sequential batch learning problem in linear contextual bandits with finite action sets, where the decision maker is constrained to split incoming individuals into (at most) a fixed number of batches and can only observe outcomes for the individuals within a batch at the batch's end.
By Yanjun Han, Zhengqing Zhou, Zihao Hu, Jose Blanchet, Peter W. Glynn, Yinyu Ye, Zhengyuan Zhou
arXiv:2610.41129v1 Announce Type: new
Abstract: AI agents increasingly carry out delegated tasks in parallel, with one person overseeing several of them at once. In practice, an agent often lacks inf...
By Hanzhao Wang, Shengjie Liu, Zhengchao Wang
arXiv:2608. 19993v1 Announce Type: new Abstract: Loading reusable skill documents into a bounded context window is now the primary way large language model (LLM) agents acquire task-specific capabilities, which makes skill selection a first-order determinant of task performance and token cost.
By Yu Chen, Ruishuo Chen, Xun Wang, Zhuoran Li, Longbo Huang
arXiv:2608. 20316v1 Announce Type: new Abstract: Heterogeneous AI systems composed of multiple models, architectures, harnesses, or inference-time settings can improve quality and efficiency by routing queries to the specialist who can answer most effectively at the lowest cost.
By Adam Fisch, Shubhendu Trivedi, Fantine Huot, William W. Cohen, Michael Kaisers, Mirella Lapata, Kate Larson, Jacob Eisenstein
Ballad is an online bandit algorithm that orchestrates a pool of large language models (LLMs) to improve automated heuristic discovery for NP‑hard combinatorial optimization problems. By selecting models adaptively, propagating credit through a DAG of heuristic genealogy, and discounting stale observations, Ballad matches or exceeds the best single LLM while reducing API costs by up to 65.6%. The study challenges the assumption that larger, more expensive models always yield better heuristics, showing that a well‑managed ensemble can outperform any individual model.
By Samidha Verma, Ankit Anand, Sayan Ranu
The paper introduces “PACE”, a training‑free framework that tackles bottlenecks in Retrieval‑Augmented Generation by frontloading evidence and adaptively budgeting reranking. It first reorders candidate documents based on marginal evidence coverage—prioritizing query‑relevant, complementary, and chain‑forming documents—providing a $(1-1/e)$ approximation guarantee. Then it dynamically adjusts the reranking budget according to the relative pressure of the reranker and the language model, improving evidence recall and reducing p95 latency in multi‑hop QA workloads.
By Weibin Cai, Reza Zafarani
Probabilistic Focal Search (PFS) augments traditional Focal Search by probabilistically choosing between the standard heuristic-guided expansion and expanding the minimum‑f node in OPEN. This strategy advances the lower bound, enlarges the FOCAL frontier, and can dramatically reduce node expansions—up to 90% in some benchmarks such as N‑Puzzle and TSP—especially when long f_min plateaus delay useful FOCAL admissions. An anytime variant, APFS, outperforms other tested anytime algorithms on the Generalized Covering TSP, and the same probabilistic scheduler transfers to Dynamic Potential Search as Probabilistic Dynamic Potential Search (PDPS), though its effectiveness varies by domain and bound.
By Minh Vu Duc, Trung Le Huu, H\`a Minh Ho\`ang, Trung Thanh Nguyen, Phuong Khanh Nguyen, Huynh Thi Thanh Binh
arXiv:2608. 04333v1 Announce Type: new Abstract: Large language model (LLM) configuration evaluation is challenging due to limited evaluation budgets, varying costs, and multiple competing objectives.
By Bo Xue, Zhi Hong, Jiayi Li, Yuanyu Wan, Ji Cheng, Shuang Qiu