← Search

Laks V. S. Lakshmanan

5 accepted papers

2025

BEST-Route: Adaptive LLM Routing with Test-Time Optimal Compute

ICML 2025poster

Large language models (LLMs) are powerful tools but are often expensive to deploy at scale. LLM query routing mitigates this by dynamically assigning queries to models of varying cost and quality to obtain a desired tradeoff. Prior query routing approaches generate only one response from the select…

Cited by 0SourcePDFScholar
2025

Hyperparametric Robust and Dynamic Influence Maximization

AAAI 2025technical

We study the problem of robust influence maximization in dynamic diffusion networks. In line with recent works, we consider the scenario where the network can undergo insertion and removal of nodes and edges, in discrete time steps, and the influence weights are determined by the features of the cor…

2025

OCCAM: Towards Cost-Efficient and Accuracy-Aware Classification Inference

ICLR 2025poster

Classification tasks play a fundamental role in various applications, spanning domains such as healthcare, natural language processing and computer vision. With the growing popularity and capacity of machine learning models, people can easily access trained classifiers as a service online or offline…

Cited by 0SourcePDFScholar
2024

DetoxLLM: A Framework for Detoxification with Explanations

EMNLP 2024main

Prior works on detoxification are scattered in the sense that they do not cover all aspects of detoxification needed in a real-world scenario. Notably, prior works restrict the task of developing detoxification models to only a seen subset of platforms, leaving the question of how the models would p…

2024

Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing

ICLR 2024poster

Large language models (LLMs) excel in most NLP tasks but also require expensive cloud servers for deployment due to their size, while smaller models that can be deployed on lower cost (e.g., edge) devices, tend to lag behind in terms of response quality. Therefore in this work we propose a hybrid in…