← Search

Lav R. Varshney

17 accepted papers

2025

ITBench: Evaluating AI Agents across Diverse Real-World IT Automation Tasks

ICML 2025oral

Realizing the vision of using AI agents to automate critical IT tasks depends on the ability to measure and understand effectiveness of proposed solutions. We introduce ITBench, a framework that offers a systematic methodology for benchmarking AI agents to address real-world IT automation tasks. Our…

2025

Many LLMs Are More Utilitarian Than One

NeurIPS 2025poster

Moral judgment is integral to large language models' (LLMs) social reasoning. As multi-agent systems gain prominence, it becomes crucial to understand how LLMs function when collaborating compared to operating as individual agents. In human moral judgment, group deliberation leads to a Utilitarian B…

Cited by 0SourcecodeScholar
2023

Efficient Equivariant Transfer Learning from Pretrained Models

NeurIPS 2023poster

Efficient transfer learning algorithms are key to the success of foundation models on diverse downstream tasks even with limited data. Recent works of Basu et al. (2023) and Kaba et al. (2022) propose group averaging (equitune) and optimization-based methods, respectively, over features from group-t…

2023

Equi-Tuning: Group Equivariant Fine-Tuning of Pretrained Models

AAAI 2023technical

We introduce equi-tuning, a novel fine-tuning method that transforms (potentially non-equivariant) pretrained models into group equivariant models while incurring minimum L_2 loss between the feature representations of the pretrained and the equivariant models. Large pretrained models can be equi-tu…

Cited by 27SourcePDFScholar
2023

Learning Optimal Features via Partial Invariance

AAAI 2023technical

Learning models that are robust to distribution shifts is a key concern in the context of their real-life applicability. Invariant Risk Minimization (IRM) is a popular framework that aims to learn robust models from multiple environments. The success of IRM requires an important assumption: the unde…

2021

Adversarial Linear Contextual Bandits with Graph-Structured Side Observations

AAAI 2021technical

This paper studies the adversarial graphical contextual bandits, a variant of adversarial multi-armed bandits that leverage two categories of the most common side information: contexts and side observations. In this setting, a learning agent repeatedly chooses from a set of K actions after being pre…

Cited by 9SourcePDFScholar
2021

BERTology Meets Biology: Interpreting Attention in Protein Language Models

ICLR 2021poster

Transformer architectures have proven to learn useful representations for protein classification and generation tasks. However, these representations present challenges in interpretability. In this work, we demonstrate a set of methods for analyzing protein Transformer models through the lens of att…

2021

Evaluating State-of-the-Art Classification Models Against Bayes Optimality

NeurIPS 2021poster

Evaluating the inherent difficulty of a given data-driven classification problem is important for establishing absolute benchmarks and evaluating progress in the field. To this end, a natural quantity to consider is the \emph{Bayes error}, which measures the optimal classification error theoreticall…

Cited by 12SourcePDFScholar
2021

MIROSTAT: A NEURAL TEXT DECODING ALGORITHM THAT DIRECTLY CONTROLS PERPLEXITY

ICLR 2021poster

Neural text decoding algorithms strongly influence the quality of texts generated using language models, but popular algorithms like top-k, top-p (nucleus), and temperature-based sampling may yield texts that have objectionable repetition or incoherence. Although these methods generate high-quality…

Cited by 63SourcecodeScholar
2021

Near-Optimal Algorithms for Piecewise-Stationary Cascading Bandits

ICASSP 2021accepted

Cascading bandit (CB) is a popular model for web search and online advertising. However, the stationary CB model may be too simple to cope with real-world problems, where user preferences may change over time. Considering piecewise-stationary environments, two efficient algorithms, GLRT-CascadeUCB a…

Cited by 0SourceScholar
2019

Safety in the Face of Unknown Unknowns: Algorithm Fusion in Data-driven Engineering Systems

ICASSP 2019accepted

Most current machine learning algorithms make highly confident yet incorrect classifications when faced with unexpected test samples from an unknown distribution different from training; such epistemic uncertainty (unknown unknowns) can have catastrophic safety implications. In this conceptual paper…

Cited by 0SourceScholar
2018

Probability Reweighting in Social Learning: Optimality and Suboptimality

ICASSP 2018accepted

This work explores sequential Bayesian binary hypothesis testing in the social learning setup under expertise diversity. We consider a two-agent (say advisor-learner) sequential binary hypothesis test where the learner infers the hypothesis based on the decision of the advisor, a prior private signa…

Cited by 0SourceScholar
2017

Towards Deep Interpretability (MUS-ROVER II): Learning Hierarchical Representations of Tonal Music

ICLR 2017poster

Music theory studies the regularity of patterns in music to capture concepts underlying music styles and composers' decisions. This paper continues the study of building \emph{automatic theorists} (rovers) to learn and represent music concepts that lead to human interpretable knowledge and further l…

Cited by 20SourceScholar