← Search

Somesh Jha

38 accepted papers

2026

ARMOR: Aligning Secure and Safe Large Language Models via Meticulous Reasoning

ICLR 2026poster

Large Language Models have shown impressive generative capabilities across diverse tasks, but their safety remains a critical concern. Existing post-training alignment methods, such as SFT and RLHF, reduce harmful outputs yet leave LLMs vulnerable to jailbreak attacks, especially advanced optimizati…

Cited by 8SourceScholar
2026

ATLAS: Constraints-Aware Multi-Agent Collaboration for Real-World Travel Planning

ICLR 2026poster

While Large Language Models (LLMs) have shown remarkable advancements in reasoning and tool use, they often fail to generate optimal, grounded solutions under complex constraints. Real-world travel planning exemplifies these challenges, evaluating agents’ abilities to handle constraints that are exp…

Cited by 12SourceScholar
2026

Through the Stealth Lens: Attention-Aware Defenses Against Poisoning in RAG

ICML 2026poster

Retrieval-augmented generation (RAG) systems are vulnerable to attacks that inject poisoned passages into the retrieved context, even at low corruption rates. We show that existing attacks are not designed to be stealthy, allowing reliable detection and mitigation. We formalize a distinguishability-…

Cited by 0SourceScholar
2025

AutoDAN-Turbo: A Lifelong Agent for Strategy Self-Exploration to Jailbreak LLMs

ICLR 2025spotlight

Jailbreak attacks serve as essential red-teaming tools, proactively assessing whether LLMs can behave responsibly and safely in adversarial environments. Despite diverse strategies (e.g., cipher, low-resource language, persuasions, and so on) that have been proposed and shown success, these strategi…

2025

CONDA: Adaptive Concept Bottleneck for Foundation Models Under Distribution Shifts

ICLR 2025poster

Advancements in foundation models (FMs) have led to a paradigm shift in machine learning. The rich, expressive feature representations from these pre-trained, large- scale FMs are leveraged for multiple downstream tasks, usually via lightweight fine-tuning of a shallow fully-connected network follow…

Cited by 0SourcePDFScholar
2025

Can Watermarks be Used to Detect LLM IP Infringement For Free?

ICLR 2025poster

The powerful capabilities of LLMs stem from their rich training data and high-quality labeled datasets, making the training of strong LLMs a resource-intensive process, which elevates the importance of IP protection for such LLMs. Compared to gathering high-quality labeled data, directly sampling ou…

Cited by 1SourcePDFScholar
2025

Functional Homotopy: Smoothing Discrete Optimization via Continuous Parameters for LLM Jailbreak Attacks

ICLR 2025poster

Optimization methods are widely employed in deep learning to address and mitigate undesired model responses. While gradient-based techniques have proven effective for image models, their application to language models is hindered by the discrete nature of the input space. This study introduces a nov…

Cited by 0SourcePDFScholar
2025

On the Difficulty of Constructing a Robust and Publicly-Detectable Watermark

AISTATS 2025poster

This work investigates the theoretical boundaries of creating publicly-detectable schemes to enable the provenance of watermarked imagery. Metadata-based approaches like C2PA provide unforgeability and public-detectability. ML techniques offer robust retrieval and watermarking. However, no existing…

Cited by 0SourceScholar
2025

Validating Mechanistic Interpretations: An Axiomatic Approach

ICML 2025poster

Mechanistic interpretability aims to reverse engineer the computation performed by a neural network in terms of its internal components. Although there is a growing body of research on mechanistic interpretation of neural networks, the notion of a *mechanistic interpretation* itself is often ad-hoc.…

Cited by 0SourcePDFScholar
2025

What Really is a Member? Discrediting Membership Inference via Poisoning

NeurIPS 2025poster

Membership inference tests aim to determine whether a particular data point was included in a language model's training set. However, recent works have shown that such tests often fail under the strict definition of membership based on exact matching, and have suggested relaxing this definition to i…

Cited by 0SourceScholar
2024

Do Large Code Models Understand Programming Concepts? Counterfactual Analysis for Code Predicates

ICML 2024poster

Large Language Models' success in text generation has also made them better at code generation and coding tasks. While a lot of work has demonstrated their remarkable performance on tasks such as code completion and editing, it is still unclear as to why. We help bridge this gap by exploring to what…

Cited by 4SourcePDFScholar
2024

On the Scalability and Memory Efficiency of Semidefinite Programs for Lipschitz Constant Estimation of Neural Networks

ICLR 2024poster

Lipschitz constant estimation plays an important role in understanding generalization, robustness, and fairness in deep learning. Unlike naive bounds based on the network weight norm product, semidefinite programs (SDPs) have shown great promise in providing less conservative Lipschitz bounds with p…

2024

PRP: Propagating Universal Perturbations to Attack Large Language Model Guard-Rails

ACL 2024long

Large language models (LLMs) are typically aligned to be harmless to humans. Unfortunately, recent work has shown that such models are susceptible to automated jailbreak attacks that induce them to generate harmful content. More recent LLMs often incorporate an additional layer of defense, a Guard M…

2024

Two Heads are Actually Better than One: Towards Better Adversarial Robustness via Transduction and Rejection

ICML 2024poster

Both transduction and rejection have emerged as important techniques for defending against adversarial perturbations. A recent work by Goldwasser et. al showed that rejection combined with transduction can give *provable* guarantees (for certain problems) that cannot be achieved otherwise. Neverthel…

2023

Adaptation with Self-Evaluation to Improve Selective Prediction in LLMs

EMNLP 2023long findings

Large language models (LLMs) have recently shown great advances in a variety of tasks, including natural language understanding and generation. However, their use in high-stakes decision-making scenarios is still limited due to the potential for errors. *Selective prediction* is a technique that can…

Cited by 0SourceScholar
2023

Concept-based Explanations for Out-of-Distribution Detectors

ICML 2023poster

Out-of-distribution (OOD) detection plays a crucial role in ensuring the safe deployment of deep neural network (DNN) classifiers. While a myriad of methods have focused on improving the performance of OOD detectors, a critical gap remains in interpreting their decisions. We help bridge this gap by…

2023

Few-Shot Domain Adaptation For End-to-End Communication

ICLR 2023top-25%

The problem of end-to-end learning of a communication system using an autoencoder -- consisting of an encoder, channel, and decoder modeled using neural networks -- has recently been shown to be an effective approach. A challenge faced in the practical adoption of this learning approach is that unde…

2023

Grounding Neural Inference with Satisfiability Modulo Theories

NeurIPS 2023spotlight

Recent techniques that integrate solver layers into Deep Neural Networks (DNNs) have shown promise in bridging a long-standing gap between inductive learning and symbolic reasoning techniques. In this paper we present a set of techniques for integrating Satisfiability Modulo Theories (SMT) solvers i…

Cited by 3SourcePDFScholar
2023

Robust and Actively Secure Serverless Collaborative Learning

NeurIPS 2023poster

Collaborative machine learning (ML) is widely used to enable institutions to learn better models from distributed data. While collaborative approaches to learning intuitively protect user data, they remain vulnerable to either the server, the clients, or both, deviating from the protocol. Indeed, be…

Cited by 4SourcePDFScholar
2023

Stratified Adversarial Robustness with Rejection

ICML 2023poster

Recently, there is an emerging interest in adversarially training a classifier with a rejection option (also known as a selective classifier) for boosting adversarial robustness. While rejection can incur a cost in many applications, existing studies typically associate zero cost with rejecting pert…

2023

The Trade-off between Universality and Label Efficiency of Representations from Contrastive Learning

ICLR 2023top-25%

Pre-training representations (a.k.a. foundation models) has recently become a prevalent learning paradigm, where one first pre-trains a representation using large-scale unlabeled data, and then learns simple predictors on top of the representation using small labeled data from the downstream tasks.…

2022

Overparameterization from Computational Constraints

NeurIPS 2022accept

Overparameterized models with millions of parameters have been hugely successful. In this work, we ask: can the need for large models be, at least in part, due to the \emph{computational} limitations of the learner? Additionally, we ask, is this situation exacerbated for \emph{robust} learning? We…

Cited by 3SourcePDFScholar
2022

Robust Learning against Relational Adversaries

NeurIPS 2022accept

Test-time adversarial attacks have posed serious challenges to the robustness of machine-learning models, and in many settings the adversarial perturbation need not be bounded by small $\ell_p$-norms. Motivated by attacks in program analysis and security tasks, we investigate $\textit{relational adv…

Cited by 8SourcePDFScholar
2022

Towards Evaluating the Robustness of Neural Networks Learned by Transduction

ICLR 2022poster

There has been emerging interest in using transductive learning for adversarial robustness (Goldwasser et al., NeurIPS 2020; Wu et al., ICML 2020; Wang et al., ArXiv 2021). Compared to traditional defenses, these defense mechanisms "dynamically learn" the model based on test-time input; and theoreti…

2021

A General Framework For Detecting Anomalous Inputs to DNN Classifiers

ICML 2021oral

Detecting anomalous inputs, such as adversarial and out-of-distribution (OOD) inputs, is critical for classifiers (including deep neural networks or DNNs) deployed in real-world applications. While prior works have proposed various methods to detect such anomalous samples using information from the…

2021

A Separation Result Between Data-oblivious and Data-aware Poisoning Attacks

NeurIPS 2021poster

Poisoning attacks have emerged as a significant security threat to machine learning algorithms. It has been demonstrated that adversaries who make small changes to the training set, such as adding specially crafted data points, can hurt the performance of the output model. Most of these attacks requ…

Cited by 3SourcePDFScholar
2021

CaPC Learning: Confidential and Private Collaborative Learning

ICLR 2021poster

Machine learning benefits from large training datasets, which may not always be possible to collect by any single entity, especially when using privacy-sensitive data. In many contexts, such as healthcare and finance, separate parties may wish to collaborate and learn from each other's data but are…

2021

Detecting Errors and Estimating Accuracy on Unlabeled Data with Self-training Ensembles

NeurIPS 2021poster

When a deep learning model is deployed in the wild, it can encounter test data drawn from distributions different from the training data distribution and suffer drop in performance. For safe deployment, it is essential to estimate the accuracy of the pre-trained model on the test data. However, the…

2021

Sample Complexity of Robust Linear Classification on Separated Data

ICML 2021spotlight

We consider the sample complexity of learning with adversarial robustness. Most prior theoretical results for this problem have considered a setting where different classes in the data are close together or overlapping. We consider, in contrast, the well-separated case where there exists a classifie…

Cited by 27SourcePDFScholar
2020

CAUSE: Learning Granger Causality from Event Sequences using Attribution Methods

ICML 2020poster

We study the problem of learning Granger causality between event types from asynchronous, interdependent, multi-type event sequences. Existing work suffers from either limited model flexibility or poor model explainability and thus fails to uncover Granger causality across a wide variety of event se…

2020

Concise Explanations of Neural Networks using Adversarial Training

ICML 2020poster

We show new connections between adversarial learning and explainability for deep neural networks (DNNs). One form of explanation of the output of a neural network model in terms of its input features, is a vector of feature-attributions, which can be generated by various techniques such as Integrate…

2020

Data-Dependent Differentially Private Parameter Learning for Directed Graphical Models

ICML 2020poster

Directed graphical models (DGMs) are a class of probabilistic models that are widely used for predictive analysis in sensitive domains such as medical diagnostics. In this paper, we present an algorithm for differentially-private learning of the parameters of a DGM. Our solution optimizes for the ut…

Cited by 12SourcePDFScholar
2019

Attribution-Based Confidence Metric For Deep Neural Networks

NeurIPS 2019poster

We propose a novel confidence metric, namely, attribution-based confidence (ABC) for deep neural networks (DNNs). ABC metric characterizes whether the output of a DNN on an input can be trusted. DNNs are known to be brittle on inputs outside the training distribution and are, hence, susceptible to…

Cited by 88SourcePDFScholar
2018

Analyzing the Robustness of Nearest Neighbors to Adversarial Examples

ICML 2018oral

Motivated by safety-critical applications, test-time attacks on classifiers via adversarial examples has recently received a great deal of attention. However, there is a general lack of understanding on why adversarial examples arise; whether they originate due to inherent properties of data or due…