arXiv Machine Learning

SMaRT: Online Reusable Resource Assignment and an Application to Mediation in the Kenyan Judiciary

arXiv:2602. 18431v2 Announce Type: replace-cross Abstract: Motivated by the problem of assigning mediators to cases in the Kenyan judicial system, we study an online resource allocation problem where incoming tasks (cases) must be immediately assigned to available, capacity-constrained resources (mediators).

arXiv Machine Learning
Oct 15

Lag: A Mean-Field Optimal Policy for Online Assignment with Reusable Resources

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 Machine Learning
Aug 18

Sequential Batch Learning in Finite-Action Linear Contextual Bandits

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 AI
Aug 21

Pandora's AI Model Routing Box: Efficient Allocation with Costly Value Estimation

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
arXiv AI
3d ago

Ballad: Bandit-Based LLM Routing for Automated Heuristic Discovery

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
arXiv Computation and Language
Aug 27

Less can be More: Relieving RAG Bottlenecks via Evidence Frontloading and Pressure-Adaptive Budgeting

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
arXiv AI
Sep 12

Probabilistic Focal Search: Accelerating Bounded-Suboptimal Search via Lower-Bound Advancement

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