← Search

Anoop Deoras

15 accepted papers

2025

Approximately Aligned Decoding

NeurIPS 2025poster

It is common to reject undesired outputs of Large Language Models (LLMs); however, current methods to do so require an excessive amount of computation to re-sample after a rejection, or distort the distribution of outputs by constraining the output to highly improbable tokens. We present a method, A…

Cited by 0SourceScholar
2025

CodeAssistBench (CAB): Dataset & Benchmarking for Multi-turn Chat-Based Code Assistance

NeurIPS 2025poster

Programming assistants powered by large language models have transformed software development, yet most benchmarks focus narrowly on code generation tasks. Recent efforts like InfiBench and StackEval attempt to address this gap using Stack Overflow data but remain limited to single-turn interactions…

Cited by 0SourcecodeScholar
2025

Enhancing Language Model Agents using Diversity of Thoughts

ICLR 2025poster

A popular approach to building agents using Language Models (LMs) involves iteratively prompting the LM, reflecting on its outputs, and updating the input prompts until the desired task is achieved. However, our analysis reveals two key shortcomings in the existing methods: $(i)$ limited exploration…

Cited by 1SourcePDFScholar
2025

LibEvolutionEval: A Benchmark and Study for Version-Specific Code Generation

NAACL 2025long

Recent advancements in code completion models have primarily focused on local file contexts. However, these studies do not fully capture the complexity of real-world software development, which often requires the use of rapidly-evolving public libraries. To address this gap, we introduce LibEvolutio…

Cited by 1SourcePDFScholar
2024

Automated Evaluation of Retrieval-Augmented Language Models with Task-Specific Exam Generation

ICML 2024oral

We propose a new method to measure the task-specific accuracy of Retrieval-Augmented Large Language Models (RAG). Evaluation is performed by scoring the RAG on an automatically-generated synthetic exam composed of multiple choice questions based on the corpus of documents associated with the task. O…

2024

BASS: Batched Attention-optimized Speculative Sampling

ACL 2024findings

Speculative decoding has emerged as a powerful method to improve latency and throughput in hosting large language models. However, most existing implementations focus on generating a single sequence. Real-world generative AI applications often require multiple responses and how to perform speculativ…

2024

CodeFort: Robust Training for Code Generation Models

EMNLP 2024finding

Code generation models are not robust to small perturbations, which often lead to incorrect generations and significantly degrade the performance of these models. Although improving the robustness of code generation models is crucial to enhancing user experience in real-world applications, existing…

Cited by 1SourcePDFScholar
2024

Collage: Light-Weight Low-Precision Strategy for LLM Training

ICML 2024poster

Large models training is plagued by the intense compute cost and limited hardware memory. A practical solution is low-precision representation but is troubled by loss in numerical accuracy and unstable training rendering the model less useful. We argue that low-precision floating points can perform…

2024

Fewer Truncations Improve Language Modeling

ICML 2024poster

In large language model training, input documents are typically concatenated together and then split into sequences of equal length to avoid padding tokens. Despite its efficiency, the concatenation approach compromises data integrity—it inevitably breaks many documents into incomplete pieces, leadi…

Cited by 20SourcePDFScholar
2024

LeDex: Training LLMs to Better Self-Debug and Explain Code

NeurIPS 2024poster

In the domain of code generation, self-debugging is crucial. It allows LLMs to refine their generated code based on execution feedback. This is particularly important because generating correct solutions in one attempt proves challenging for complex tasks. Prior works on self-debugging mostly focus…

Cited by 4SourcePDFScholar
2023

Fixed-Budget Best-Arm Identification with Heterogeneous Reward Variances

UAI 2023poster

We study the problem of best-arm identification (BAI) in the fixed-budget setting with heterogeneous reward variances. We propose two variance-adaptive BAI algorithms for this setting: SHVar for known reward variances and SHAdaVar for unknown reward variances. Our algorithms rely on non-uniform budg…

Cited by 9SourcePDFScholar
2023

Personalized federated domain adaptation for item-to-item recommendation

UAI 2023poster

Item-to-Item (I2I) recommendation is an important function that suggests replacement or complement options for an item based on their functional similarities or synergies. To capture such item relationships effectively, the recommenders need to understand why subsets of items are co-viewed or co-pur…

2022

Learning Personalized Item-to-Item Recommendation Metric via Implicit Feedback

AISTATS 2022poster

This paper studies the item-to-item recommendation problem in recommender systems from a new perspective of metric learning via implicit feedback. We develop and investigate a personalizable deep metric model that captures both the internal contents of items and how they were interacted with by user…

Cited by 5SourcePDFScholar