← Search

Bhavya Kailkhura

52 accepted papers

2026

Get RICH or Die Scaling: Profitably Trading Inference Compute for Robustness

ICLR 2026poster

Models are susceptible to adversarially out-of-distribution (OOD) data despite large training-compute investments into their robustification. Zaremba et al. (2025) make progress on this problem at test time, showing LLM reasoning improves satisfaction of model specifications designed to thwart attac…

Cited by 0SourceScholar
2026

LongCoT: Benchmarking Long-Horizon Chain-of-Thought Reasoning

ICML 2026poster

As language models are increasingly deployed for complex autonomous tasks, their ability to reason accurately over longer horizons becomes critical. An essential component of this ability is planning and managing a long, complex chain-of-thought (CoT). We introduce LongCoT, a scalable benchmark of 2…

Cited by 0SourceScholar
2026

Position: Zeroth-Order Optimization in Deep Learning Is Underexplored, Not Underpowered

ICML 2026spotlight

Zeroth-order (ZO) optimization, learning from finite differences of function evaluations without backpropagation, has recently regained attention in deep learning due to its memory efficiency and applicability to gray- or black-box pipelines. Yet, ZO methods are often dismissed as fundamentally unsc…

Cited by 0SourceScholar
2026

STAR-1: Safer Alignment of Reasoning LLMs with 1K Data

AAAI 2026technical

This paper introduces STAR-1, a high-quality, just-1k-scale safety dataset specifically designed for large reasoning models (LRMs) like DeepSeek-R1. Built on three core principles --- diversity, deliberative reasoning, and rigorous filtering --- STAR-1 aims to address the critical needs for safety a

Cited by 0SourcePDFScholar
2025

Act Only When It Pays: Efficient Reinforcement Learning for LLM Reasoning via Selective Rollouts

NeurIPS 2025poster

Reinforcement learning, such as PPO and GRPO, has powered recent breakthroughs in LLM reasoning. Scaling rollout to sample more prompts enables models to selectively use higher-quality data for training, which can stabilize RL training and improve model performance, but at the cost of significant co…

Cited by 0SourcecodeScholar
2025

BOOM: Benchmarking Out-Of-distribution Molecular Property Predictions of Machine Learning Models

NeurIPS 2025poster

Data-driven molecular discovery leverages artificial intelligence/machine learning (AI/ML) and generative modeling to filter and design novel molecules. Discovering novel molecules requires accurate out-of-distribution (OOD) predictions, but ML models struggle to generalize OOD. Currently, no system…

Cited by 0SourcecodeScholar
2025

Constrained Discrete Diffusion

NeurIPS 2025poster

Discrete diffusion models are a class of generative models that construct sequences by progressively denoising samples from a categorical noise distribution. Beyond their rapidly growing ability to generate coherent natural language, these models present a new and important opportunity to enforce se…

Cited by 0SourceScholar
2025

ELFS: Label-Free Coreset Selection with Proxy Training Dynamics

ICLR 2025poster

High-quality human-annotated data is crucial for modern deep learning pipelines, yet the human annotation process is both costly and time-consuming. Given a constrained human labeling budget, selecting an informative and representative data subset for labeling can significantly reduce human annotati…

Cited by 0SourcePDFScholar
2025

Extracting and Understanding the Superficial Knowledge in Alignment

NAACL 2025long

Alignment of large language models (LLMs) with human values and preferences, often achieved through fine-tuning based on human feedback, is essential for ensuring safe and responsible AI behaviors. However, the process typically requires substantial data and computation resources. Recent studies hav…

2025

GRNFormer: A Biologically-Guided Framework for Integrating Gene Regulatory Networks into RNA Foundation Models

ACL 2025finding

Foundation models for single-cell RNA sequencing (scRNA-seq) have shown promising capabilities in capturing gene expression patterns. However, current approaches face critical limitations: they ignore biological prior knowledge encoded in gene regulatory relationships and fail to leverage multi-omic…

Cited by 0SourcePDFScholar
2025

Layer-Level Self-Exposure and Patch: Affirmative Token Mitigation for Jailbreak Attack Defense

NAACL 2025long

As large language models (LLMs) are increasingly deployed in diverse applications, including chatbot assistants and code generation, aligning their behavior with safety and ethical standards has become paramount. However, jailbreak attacks, which exploit vulnerabilities to elicit unintended or harmf…

2025

Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approach

NeurIPS 2025spotlight

We study a novel language model architecture that is capable of scaling test-time computation by implicitly reasoning in latent space. Our model works by iterating a recurrent block, thereby unrolling to arbitrary depth at test-time. This stands in contrast to mainstream reasoning models that scale…

Cited by 0SourcecodeScholar
2025

Speculative Diffusion Decoding: Accelerating Language Generation through Diffusion

NAACL 2025long

Speculative decoding has emerged as a widely adopted method to accelerate large language model inference without sacrificing the quality of the model outputs. While this technique has facilitated notable speed improvements by enabling parallel sequence verification, its efficiency remains inherently…

Cited by 11SourcePDFScholar
2025

The Common Pile v0.1: An 8TB Dataset of Public Domain and Openly Licensed Text

NeurIPS 2025poster

Large language models (LLMs) are typically trained on enormous quantities of unlicensed text, a practice that has led to scrutiny due to possible intellectual property infringement and ethical concerns. Training LLMs on openly licensed text presents a first step towards addressing these issues, but…

Cited by 0SourceScholar
2025

Trajectory Balance with Asynchrony: Decoupling Exploration and Learning for Fast, Scalable LLM Post-Training

NeurIPS 2025poster

Reinforcement learning (RL) is a critical component of large language model (LLM) post-training. However, on-policy algorithms used for post-training are not naturally robust to a diversified content of experience replay buffers, which asynchronous off-policy actors can efficiently populate in paral…

Cited by 0SourcecodeScholar
2025

TruthPrInt: Mitigating Large Vision-Language Models Object Hallucination Via Latent Truthful-Guided Pre-Intervention

ICCV 2025poster

Object Hallucination (OH) has been acknowledged as one of the major trustworthy challenges in Large Vision-Language Models (LVLMs). Recent advancements in Large Language Models (LLMs) indicate that internal states, such as hidden states, encode the "overall truthfulness" of generated responses. Howe…

2024

Adversarial Robustness Limits via Scaling-Law and Human-Alignment Studies

ICML 2024poster

This paper revisits the simple, long-studied, yet still unsolved problem of making image classifiers robust to imperceptible perturbations. Taking CIFAR10 as an example, SOTA clean accuracy is about $100$%, but SOTA robustness to $\ell_{\infty}$-norm bounded perturbations barely exceeds $70$%. To un…

2024

Decoding Compressed Trust: Scrutinizing the Trustworthiness of Efficient LLMs Under Compression

ICML 2024poster

Compressing high-capability Large Language Models (LLMs) has emerged as a favored strategy for resource-efficient inferences. While state-of-the-art (SoTA) compression methods boast impressive advancements in preserving benign task performance, the potential risks of compression in terms of safety a…

2024

DeepZero: Scaling Up Zeroth-Order Optimization for Deep Model Training

ICLR 2024poster

Zeroth-order (ZO) optimization has become a popular technique for solving machine learning (ML) problems when first-order (FO) information is difficult or impossible to obtain. However, the scalability of ZO optimization remains an open problem: Its use has primarily been limited to relatively small…

2024

GTBench: Uncovering the Strategic Reasoning Capabilities of LLMs via Game-Theoretic Evaluations

NeurIPS 2024poster

As Large Language Models (LLMs) are integrated into critical real-world applications, their strategic and logical reasoning abilities are increasingly crucial. This paper evaluates LLMs' reasoning abilities in competitive environments through game-theoretic tasks, e.g., board and card games that req…

Cited by 50SourcePDFScholar
2024

Leveraging Hierarchical Feature Sharing for Efficient Dataset Condensation

ECCV 2024poster

"Given a real-world dataset, data condensation (DC) aims to synthesize a small synthetic dataset that captures the knowledge of a natural dataset while being usable for training models with comparable accuracy. Recent works propose to enhance DC with data parameterization, which condenses data into…

Cited by 6SourcePDFScholar
2024

NEFTune: Noisy Embeddings Improve Instruction Finetuning

ICLR 2024poster

We show that language model finetuning can be improved, sometimes dramatically, with a simple augmentation. NEFTune adds noise to the embedding vectors during training. Standard finetuning of LLaMA-2-7B using Alpaca achieves $29.79$\% on AlpacaEval, which rises to $64.69$\% using noisy embeddings.…

2024

Position: TrustLLM: Trustworthiness in Large Language Models

ICML 2024poster

Large language models (LLMs) have gained considerable attention for their excellent natural language processing capabilities. Nonetheless, these LLMs present many challenges, particularly in the realm of trustworthiness. This paper introduces TrustLLM, a comprehensive study of trustworthiness in LLM…

Cited by 95SourcePDFScholar
2024

RankMean: Module-Level Importance Score for Merging Fine-tuned LLM Models

ACL 2024findings

Traditionally, developing new language models (LMs) capable of addressing multiple tasks involves fine-tuning pre-trained LMs using a wide collection of datasets, a process that often incurs significant computational expenses. Model merging emerges as a cost-effective alternative, allowing the integ…

2024

ReTA: Recursively Thinking Ahead to Improve the Strategic Reasoning of Large Language Models

NAACL 2024long

Current logical reasoning evaluations of Large Language Models (LLMs) primarily focus on single-turn and static environments, such as arithmetic problems. The crucial problem of multi-turn, strategic reasoning is under-explored. In this work, we analyze the multi-turn strategic reasoning of LLMs thr…

2024

SOUL: Unlocking the Power of Second-Order Optimization for LLM Unlearning

EMNLP 2024main

Large Language Models (LLMs) have highlighted the necessity of effective unlearning mechanisms to comply with data regulations and ethical AI practices. LLM unlearning aims at removing undesired data influences and associated model capabilities without compromising utility beyond the scope of unlear…

2024

Shifting Attention to Relevance: Towards the Predictive Uncertainty Quantification of Free-Form Large Language Models

ACL 2024long

Large Language Models (LLMs) show promising results in language generation and instruction following but frequently “hallucinate”, making their outputs less reliable. Despite Uncertainty Quantification’s (UQ) potential solutions, implementing it accurately within LLMs is challenging. Our research in…

2024

Training Dynamics of Transformers to Recognize Word Co-occurrence via Gradient Flow Analysis

NeurIPS 2024poster

Understanding the training dynamics of transformers is important to explain the impressive capabilities behind large language models. In this work, we study the dynamics of training a shallow transformer on a task of recognizing co-occurrence of two designated words. In the literature of studying t…

Cited by 1SourcePDFScholar
2024

Transformers Can Do Arithmetic with the Right Embeddings

NeurIPS 2024poster

The poor performance of transformers on arithmetic tasks seems to stem in large part from their inability to keep track of the exact position of each digit inside of a large span of digits. We mend this problem by adding an embedding to each digit that encodes its position relative to the start of t…

2023

Neural Image Compression: Generalization, Robustness, and Spectral Biases

NeurIPS 2023poster

Recent advances in neural image compression (NIC) have produced models that are starting to outperform classic codecs. While this has led to growing excitement about using NIC in real-world applications, the successful adoption of any machine learning system in the wild requires it to generalize (an…

2022

A Spectral View of Randomized Smoothing under Common Corruptions: Benchmarking and Improving Certified Robustness

ECCV 2022poster

"Certified robustness guarantee gauges a model’s resistance to test-time attacks and can assess the model’s readiness for deployment in the real world. In this work, we explore a new problem setting to critically examine how the adversarial robustness guarantees change when state-of-the-art randomiz…

Cited by 20SourcePDFScholar
2022

COPA: Certifying Robust Policies for Offline Reinforcement Learning against Poisoning Attacks

ICLR 2022poster

As reinforcement learning (RL) has achieved near human-level performance in a variety of tasks, its robustness has raised great attention. While a vast body of research has explored test-time (evasion) attacks in RL and corresponding defenses, its robustness against training-time (poisoning) attacks…

2022

Models Out of Line: A Fourier Lens on Distribution Shift Robustness

NeurIPS 2022accept

Improving the accuracy of deep neural networks on out-of-distribution (OOD) data is critical to an acceptance of deep learning in real world applications. It has been observed that accuracies on in-distribution (ID) versus OOD data follow a linear trend and models that outperform this baseline are e…

Cited by 0SourcePDFScholar
2022

On the Certified Robustness for Ensemble Models and Beyond

ICLR 2022poster

Recent studies show that deep neural networks (DNN) are vulnerable to adversarial examples, which aim to mislead DNNs by adding perturbations with small magnitude. To defend against such attacks, both empirical and theoretical defense approaches have been extensively studied for a single ML model. I…

Cited by 60SourcePDFScholar
2021

A Winning Hand: Compressing Deep Networks Can Improve Out-of-Distribution Robustness

NeurIPS 2021poster

Successful adoption of deep learning (DL) in the wild requires models to be: (1) compact, (2) accurate, and (3) robust to distributional shifts. Unfortunately, efforts towards simultaneously meeting these requirements have mostly been unsuccessful. This raises an important question: Is the inability…

2021

Attribute-Guided Adversarial Training for Robustness to Natural Perturbations

AAAI 2021technical

While existing work in robust deep learning has focused on small pixel-level norm-based perturbations, this may not account for perturbations encountered in several real world settings. In many such cases although test data might not be available, broad specifications about the types of perturbation…

2021

Can Shape Structure Features Improve Model Robustness Under Diverse Adversarial Settings?

ICCV 2021poster

Recent studies show that convolutional neural networks (CNNs) are vulnerable under various settings, including adversarial attacks, common corruptions, and backdoor attacks. Motivated by the findings that human visual system pays more attention to global structure (e.g., shapes) for recognition whil…

Cited by 26PDFcodeScholar
2021

Deep kernels with probabilistic embeddings for small-data learning

UAI 2021poster

Gaussian Processes (GPs) are known to provide accurate predictions and uncertainty estimates even with small amounts of labeled data by capturing similarity between data points through their kernel function. However traditional GP kernels are not very effective at capturing similarity between high d…

2021

G-PATE: Scalable Differentially Private Data Generator via Private Aggregation of Teacher Discriminators

NeurIPS 2021poster

Recent advances in machine learning have largely benefited from the massive accessible training data. However, large-scale data sharing has raised great privacy concerns. In this work, we propose a novel privacy-preserving data Generative model based on the PATE framework (G-PATE), aiming to train a…

2021

How Robust Are Randomized Smoothing Based Defenses to Data Poisoning?

CVPR 2021poster

Predictions of certifiably robust classifiers remain constant in a neighborhood of a point, making them resilient to test-time attacks with a guarantee. In this work, we present a previously unrecognized threat to robust machine learning models that highlights the importance of training-data quality…

Cited by 41PDFcodeScholar
2021

Multi-Prize Lottery Ticket Hypothesis: Finding Accurate Binary Neural Networks by Pruning A Randomly Weighted Network

ICLR 2021poster

Recently, Frankle & Carbin (2019) demonstrated that randomly-initialized dense networks contain subnetworks that once found can be trained to reach test accuracy comparable to the trained dense network. However, finding these high performing trainable subnetworks is expensive, requiring iterative pr…

2021

Scalability vs. Utility: Do We Have To Sacrifice One for the Other in Data Importance Quantification?

CVPR 2021poster

Quantifying the importance of each training point to a learning task is a fundamental problem in machine learning and the estimated importance scores have been leveraged to guide a range of data workflows such as data summarization and domain adaption. One simple idea is to use the leave-one-out err…

Cited by 79PDFcodeScholar
2021

Understanding the Limits of Unsupervised Domain Adaptation via Data Poisoning

NeurIPS 2021poster

Unsupervised domain adaptation (UDA) enables cross-domain learning without target domain labels by transferring knowledge from a labeled source domain whose distribution differs from that of the target. However, UDA is not always successful and several accounts of `negative transfer' have been repor…

2020

A Statistical Mechanics Framework for Task-Agnostic Sample Design in Machine Learning

NeurIPS 2020poster

In this paper, we present a statistical mechanics framework to understand the effect of sampling properties of training data on the generalization gap of machine learning (ML) algorithms. We connect the generalization gap to the spatial properties of a sample design characterized by the pair correla…

2020

Adversarial Mutual Information for Text Generation

ICML 2020poster

Recent advances in maximizing mutual information (MI) between the source and target have demonstrated its effectiveness in text generation. However, previous works paid little attention to modeling the backward network of MI (i.e., dependency from the target to the source), which is crucial to the t…

2020

Automatic Perturbation Analysis for Scalable Certified Robustness and Beyond

NeurIPS 2020poster

Linear relaxation based perturbation analysis (LiRPA) for neural networks, which computes provable linear bounds of output neurons given a certain amount of input perturbation, has become a core component in robustness verification and certified defense. The majority of LiRPA-based methods focus on…

2020

Mix-n-Match : Ensemble and Compositional Methods for Uncertainty Calibration in Deep Learning

ICML 2020poster

This paper studies the problem of post-hoc calibration of machine learning classifiers. We introduce the following desiderata for uncertainty calibration: (a) accuracy-preserving, (b) data-efficient, and (c) high expressive power. We show that none of the existing methods satisfy all three requireme…

2020

Towards an Efficient and General Framework of Robust Training for Graph Neural Networks

ICASSP 2020accepted

Graph Neural Networks (GNNs) have made significant advances on several fundamental inference tasks. As a result, there is a surge of interest in using these models for making potentially important decisions in high-regret applications. However, despite GNNs' impressive performance, it has been obser…

Cited by 0SourceScholar
2019

On the Design of Black-Box Adversarial Examples by Leveraging Gradient-Free Optimization and Operator Splitting Method

ICCV 2019poster

Robust machine learning is currently one of the most prominent topics which could potentially help shaping a future of advanced AI platforms that not only perform well in average cases but also in worst cases or adverse situations. Despite the long-term vision, however, existing studies on black-box…

Cited by 82PDFcodeScholar
2018

Human-Machine Inference Networks for Smart Decision Making: Opportunities and Challenges

ICASSP 2018accepted

The emerging paradigm of Human-Machine Inference Networks (HuMaINs) combines complementary cognitive strengths of humans and machines in an intelligent manner to tackle various inference tasks and achieves higher performance than either humans or machines by themselves. While inference performance o…

Cited by 0SourceScholar
2018

Zeroth-Order Stochastic Variance Reduction for Nonconvex Optimization

NeurIPS 2018poster

As application demands for zeroth-order (gradient-free) optimization accelerate, the need for variance reduced and faster converging approaches is also intensifying. This paper addresses these challenges by presenting: a) a comprehensive theoretical analysis of variance reduced zeroth-order (ZO) op…

2016

Theoretical guarantees for poisson disk sampling using pair correlation function

ICASSP 2016accepted

In this paper, we study the problem of generating uniform random point samples on a domain of d dimensional space based on a minimum distance criterion between point samples (Poisson-disk sampling or PDS). First, we formally define PDS via the pair correlation function (PCF) to quantitatively evalua…

Cited by 0SourceScholar