← Search

Krishnamurthy Dj Dvijotham

20 accepted papers

2026

No, of Course I Can! Deeper Fine-Tuning Attacks That Bypass Token-Level Safety Mechanisms

ICLR 2026poster

Leading language model (LM) providers like OpenAI and Anthopic allow customers to fine-tune frontier LMs for specific use cases. To prevent abuse, these providers apply filters to block fine-tuning on overtly harmful data. In this setting, we make three contributions: First, while past work has show…

Cited by 0SourceScholar
2025

BigDocs: An Open Dataset for Training Multimodal Models on Document and Code Tasks

ICLR 2025poster

Multimodal AI has the potential to significantly enhance document-understanding tasks, such as processing receipts, understanding workflows, extracting data from documents, and summarizing reports. Code generation tasks that require long-structured outputs can also be enhanced by multimodality. Desp…

Cited by 0SourcePDFScholar
2025

Keeping up with dynamic attackers: Certifying robustness to adaptive online data poisoning

AISTATS 2025poster

The rise of foundation models fine-tuned on human feedback from potentially untrusted users has increased the risk of adversarial data poisoning, necessitating the study of robustness of learning algorithms against such attacks. Existing research on provable certified robustness against data poisoni…

Cited by 0SourcecodeScholar
2024

Confidence-aware Reward Optimization for Fine-tuning Text-to-Image Models

ICLR 2024poster

Fine-tuning text-to-image models with reward functions trained on human feedback data has proven effective for aligning model behavior with human intent. However, excessive optimization with such reward models, which serve as mere proxy objectives, can compromise the performance of fine-tuned models…

2024

Correlated Noise Provably Beats Independent Noise for Differentially Private Learning

ICLR 2024poster

Differentially private learning algorithms inject noise into the learning process. While the most common private learning algorithm, DP-SGD, adds independent Gaussian noise in each iteration, recent work on matrix factorization mechanisms has shown empirically that introducing correlations in the no…

Cited by 18SourcePDFScholar
2024

Efficient Error Certification for Physics-Informed Neural Networks

ICML 2024poster

Recent work provides promising evidence that Physics-Informed Neural Networks (PINN) can efficiently solve partial differential equations (PDE). However, previous works have failed to provide guarantees on the *worst-case* residual error of a PINN across the spatio-temporal domain - a measure akin t…

Cited by 3SourcePDFScholar
2024

Expressive Losses for Verified Robustness via Convex Combinations

ICLR 2024poster

In order to train networks for verified adversarial robustness, it is common to over-approximate the worst-case loss over perturbation regions, resulting in networks that attain verifiability at the expense of standard performance. As shown in recent work, better trade-offs between accuracy and robu…

2024

Monotone, Bi-Lipschitz, and Polyak-Łojasiewicz Networks

ICML 2024poster

This paper presents a new *bi-Lipschitz* invertible neural network, the BiLipNet, which has the ability to smoothly control both its *Lipschitzness* (output sensitivity to input perturbations) and *inverse Lipschitzness* (input distinguishability from different outputs). The second main contribution…

Cited by 5SourcePDFScholar
2024

Private Gradient Descent for Linear Regression: Tighter Error Bounds and Instance-Specific Uncertainty Estimation

ICML 2024poster

We provide an improved analysis of standard differentially private gradient descent for linear regression under the squared error loss. Under modest assumptions on the input, we characterize the distribution of the iterate at each time step. Our analysis leads to new results on the algorithm's accur…

Cited by 5SourcePDFScholar
2024

Rich Human Feedback for Text-to-Image Generation

CVPR 2024poster

Recent Text-to-Image (T2I) generation models such as Stable Diffusion and Imagen have made significant progress in generating high-resolution images based on text descriptions. However many generated images still suffer from issues such as artifacts/implausibility misalignment with text descriptions…

2024

Stealing part of a production language model

ICML 2024oral

We introduce the first model-stealing attack that extracts precise, nontrivial information from black-box production language models like OpenAI's ChatGPT or Google's PaLM-2. Specifically, our attack recovers the embedding projection layer (up to symmetries) of a transformer model, given typical API…

Cited by 84SourcePDFScholar
2023

(Certified!!) Adversarial Robustness for Free!

ICLR 2023poster

In this paper we show how to achieve state-of-the-art certified adversarial robustness to 2-norm bounded perturbations by relying exclusively on off-the-shelf pretrained models. To do so, we instantiate the denoised smoothing approach of Salman et al. by combining a pretrained denoising diffusion pr…

2023

Learning to Receive Help: Intervention-Aware Concept Embedding Models

NeurIPS 2023spotlight

Concept Bottleneck Models (CBMs) tackle the opacity of neural architectures by constructing and explaining their predictions using a set of high-level concepts. A special property of these models is that they permit concept interventions, wherein users can correct mispredicted concepts and thus impr…

2023

Provably Bounding Neural Network Preimages

NeurIPS 2023spotlight

Most work on the formal verification of neural networks has focused on bounding the set of outputs that correspond to a given set of inputs (for example, bounded perturbations of a nominal input). However, many use cases of neural network verification require solving the inverse problem, or over-app…

2023

Pushing the Accuracy-Group Robustness Frontier with Introspective Self-play

ICLR 2023poster

Standard empirical risk minimization (ERM) training can produce deep neural network (DNN) models that are accurate on average but under-perform in under-represented population subgroups, especially when there are imbalanced group distributions in the long-tailed training data. Therefore, approaches…

Cited by 2SourcePDFScholar
2023

Training Private Models That Know What They Don’t Know

NeurIPS 2023poster

Training reliable deep learning models which avoid making overconfident but incorrect predictions is a longstanding challenge. This challenge is further exacerbated when learning has to be differentially private: protection provided to sensitive data comes at the price of injecting additional random…

Cited by 5SourcePDFScholar
2022

A Fine-Grained Analysis on Distribution Shift

ICLR 2022oral

Robustness to distribution shifts is critical for deploying machine learning models in the real world. Despite this necessity, there has been little work in defining the underlying mechanisms that cause these shifts and evaluating the robustness of algorithms across multiple, different distribution…

2022

Learning Optimal Conformal Classifiers

ICLR 2022spotlight

Modern deep learning based classifiers show very high accuracy on test data but this does not provide sufficient guarantees for safe deployment, especially in high-stake AI applications such as medical diagnosis. Usually, predictions are obtained without a reliable uncertainty estimate or a formal g…

2021

Make Sure You're Unsure: A Framework for Verifying Probabilistic Specifications

NeurIPS 2021spotlight

Most real world applications require dealing with stochasticity like sensor noise or predictive uncertainty, where formal specifications of desired behavior are inherently probabilistic. Despite the promise of formal verification in ensuring the reliability of neural networks, progress in the direc…

2021

Overcoming the Convex Barrier for Simplex Inputs

NeurIPS 2021poster

Recent progress in neural network verification has challenged the notion of a convex barrier, that is, an inherent weakness in the convex relaxation of the output of a neural network. Specifically, there now exists a tight relaxation for verifying the robustness of a neural network to $\ell_\infty$…

Cited by 8SourcePDFScholar