2 papers
cs.CL2026
Pyramid MoA: A Probabilistic Framework for Cost-Optimized Anytime Inference
Arindam Khaled
We observe that LLM cascading and routing implicitly solves an anytime computation problem -- a class of algorithms, well-studied in classical AI, that improve solutions as additio…
cs.AI2013
Solving Limited-Memory Influence Diagrams Using Branch-and-Bound Search
Arindam Khaled, Eric A. Hansen, Changhe Yuan
A limited-memory influence diagram (LIMID) generalizes a traditional influence diagram by relaxing the assumptions of regularity and no-forgetting, allowing a wider range of decisi…