English
Related papers

Related papers: CARROT: A Cost Aware Rate Optimal Router

200 papers

Large reasoning models (LRMs) have heterogeneous inference energy costs based on which model is used and how much it reasons. To reduce energy, it is important to choose the right LRM and operate it in the right way. As a result, the…

Artificial Intelligence · Computer Science 2026-04-28 Austin R. Ellis-Mohr , Max Hartman , Lav R. Varshney

The proliferation of Large Language Models (LLMs) has established LLM routing as a standard service delivery mechanism, where users select models based on cost, Quality of Service (QoS), among other things. However, optimal pricing in LLM…

Computer Science and Game Theory · Computer Science 2025-11-14 Zhendong Guo , Wenchao Bai , Jiahui Jin

Large language models (LLMs) have shown impressive capabilities, but still struggle with complex reasoning tasks requiring multiple steps. While prompt-based methods like Chain-of-Thought (CoT) can improve LLM reasoning at inference time,…

Artificial Intelligence · Computer Science 2024-11-25 Haolin Chen , Yihao Feng , Zuxin Liu , Weiran Yao , Akshara Prabhakar , Shelby Heinecke , Ricky Ho , Phil Mui , Silvio Savarese , Caiming Xiong , Huan Wang

The reward model (RM) plays a crucial role in aligning Large Language Models (LLMs) with human preferences through Reinforcement Learning, where the Bradley-Terry (BT) objective has been recognized as simple yet powerful, specifically for…

Machine Learning · Computer Science 2025-10-14 Zhuo Li , Yuege Feng , Dandan Guo , Jinpeng Hu , Anningzhe Gao , Xiang Wan

Large reasoning models (LRMs) like OpenAI-o1 have shown impressive capabilities in natural language reasoning. However, these models frequently demonstrate inefficiencies or inaccuracies when tackling complex mathematical operations. While…

Computation and Language · Computer Science 2025-10-24 Chengpeng Li , Zhengyang Tang , Ziniu Li , Mingfeng Xue , Keqin Bao , Tian Ding , Ruoyu Sun , Benyou Wang , Xiang Wang , Junyang Lin , Dayiheng Liu

Quantum computers have the potential to outperform classical computers in important tasks such as optimization and number factoring. They are characterized by limited connectivity, which necessitates the routing of their computational bits,…

Quantum Physics · Physics 2024-10-08 Wei Tang , Yiheng Duan , Yaroslav Kharkov , Rasool Fakoor , Eric Kessler , Yunong Shi

Sampling-based planning algorithms like Rapidly-exploring Random Tree (RRT) are versatile in solving path planning problems. RRT* offers asymptotic optimality but requires growing the tree uniformly over the free space, which leaves room…

Robotics · Computer Science 2024-03-08 Zhe Huang , Hongyu Chen , John Pohovey , Katherine Driggs-Campbell

While recent advances in large language models (LLMs) have significantly enhanced performance across diverse natural language tasks, the high computational and financial costs associated with their deployment remain substantial barriers.…

Computation and Language · Computer Science 2025-04-16 Soham Shah , Kumar Shridhar , Surojit Chatterjee , Souvik Sen

Query optimization is a critical task in database systems, focused on determining the most efficient way to execute a query from an enormous set of possible strategies. Traditional approaches rely on heuristic search methods and cost…

Databases · Computer Science 2025-03-11 Zhiming Yao , Haoyang Li , Jing Zhang , Cuiping Li , Hong Chen

As large language models (LLMs) evolve into autonomous agents that execute long-horizon workflows, invoking a high-capability model at every step becomes economically unsustainable. While model routing is effective for single-turn queries,…

Computation and Language · Computer Science 2026-02-26 Caiqi Zhang , Menglin Xia , Xuchao Zhang , Daniel Madrigal , Ankur Mallick , Samuel Kessler , Victor Ruehle , Saravan Rajmohan

While Large Language Models (LLMs) have revolutionized artificial intelligence, fine-tuning LLMs is extraordinarily computationally expensive, preventing smaller businesses and research teams with limited GPU resources from engaging with…

Machine Learning · Computer Science 2025-08-26 Daniel Frees , Aditri Bhagirath , Moritz Bolling

Large language models (LLMs), such as GPT3.5, GPT4 and LLAMA2 perform surprisingly well and outperform human experts on many tasks. However, in many domain-specific evaluations, these LLMs often suffer from hallucination problems due to…

Computation and Language · Computer Science 2024-04-19 Yuqi Wang , Boran Jiang , Yi Luo , Dawei He , Peng Cheng , Liangcai Gao

Large language models (LLMs) achieve remarkable performance across domains but remain prone to hallucinations and inconsistencies. Retrieval-augmented generation (RAG) mitigates these issues by augmenting model inputs with relevant…

Machine Learning · Computer Science 2026-04-10 Akash Dhasade , Rachid Guerraoui , Anne-Marie Kermarrec , Diana Petrescu , Rafael Pires , Mathis Randl , Martijn de Vos

Large language models have achieved remarkable success in various tasks but suffer from high computational costs during inference, limiting their deployment in resource-constrained applications. To address this issue, we propose a novel…

Computation and Language · Computer Science 2025-09-11 Wenhao Zheng , Yixiao Chen , Weitong Zhang , Souvik Kundu , Yun Li , Zhengzhong Liu , Eric P. Xing , Hongyi Wang , Huaxiu Yao

Large Language Model (LLM)-driven Multi-Agent Systems (MAS) have demonstrated strong capability in complex reasoning and tool use, and heterogeneous agent pools further broaden the quality--cost trade-off space. Despite these advances,…

Artificial Intelligence · Computer Science 2026-03-16 Xudong Wang , Chaoning Zhang , Jiaquan Zhang , Chenghao Li , Qigan Sun , Sung-Ho Bae , Peng Wang , Ning Xie , Jie Zou , Yang Yang , Hengtao Shen

Achieving robust networks is a challenging problem due to its NP-hard nature and complex solution space. Current methods, from handcrafted feature extraction to deep learning, have made progress but remain rigid, requiring manual design and…

Artificial Intelligence · Computer Science 2024-10-24 He Yu , Jing Liu

Best-of-$n$ is a widely used test-time scaling approach for LLM inference. Yet despite evidence that LLMs exhibit complementary strengths across tasks, traditionally best-of-$n$ relies on a single model to generate responses. We propose…

Machine Learning · Computer Science 2025-12-08 Jonathan Geuter , Gregor Kornhardt

Routing a query through an appropriate LLM is challenging, particularly when user preferences are expressed in natural language and model attributes are only partially observable. We propose a constraint-based interpretation of…

Artificial Intelligence · Computer Science 2026-03-17 Son Nguyen , Xinyuan Liu , Ransalu Senanayake

Large Language Models (LLMs) gain substantial reasoning and decision-making capabilities from thought structures. However, existing methods such as Tree of Thought and Retrieval Augmented Thoughts often fall short in complex tasks due to…

Computation and Language · Computer Science 2024-12-24 Jinghan Zhang , Xiting Wang , Weijieying Ren , Lu Jiang , Dongjie Wang , Kunpeng Liu

We consider a vehicle routing problem which seeks to minimize cost subject to service level constraints on several groups of deliveries. This problem captures some essential challenges faced by a logistics provider which operates…

Optimization and Control · Mathematics 2017-06-13 Teobaldo Bulhões , Minh Hoàng Hà , Rafael Martinelli , Thibaut Vidal