← Search

Maziar Sanjabi

24 accepted papers

2025

CoT-ICL Lab: A Synthetic Framework for Studying Chain-of-Thought Learning from In-Context Demonstrations

ACL 2025long

We introduce CoT-ICL Lab, a framework and methodology to generate synthetic tokenized datasets and systematically study chain-of thought (CoT) in-context learning (ICL) in language models. CoT-ICL Lab allows fine grained control over the complexity of in-context examples by decoupling (1) the causal…

2024

Differentially Private Representation Learning via Image Captioning

ICML 2024poster

Differentially private (DP) machine learning is considered the gold-standard solution for training a model from sensitive data while still preserving privacy. However, a major barrier to achieving this ideal is its sub-optimal privacy-accuracy trade-off, which is particularly visible in DP represent…

2024

Distilling Knowledge from Text-to-Image Generative Models Improves Visio-Linguistic Reasoning in CLIP

EMNLP 2024main

Image-text contrastive models like CLIP have wide applications in zero-shot classification, image-text retrieval, and transfer learning. However, they often struggle on compositional visio-linguistic tasks (e.g., attribute-binding or object-relationships) where their performance is no better than ra…

Cited by 1SourcePDFScholar
2024

Measuring Self-Supervised Representation Quality for Downstream Classification Using Discriminative Features

AAAI 2024technical

Self-supervised learning (SSL) has shown impressive results in downstream classification tasks. However, there is limited work in understanding their failure modes and interpreting their learned representations. In this paper, we study the representation space of state-of-the-art self-supervised mod…

Cited by 7SourcePDFScholar
2024

RESPROMPT: Residual Connection Prompting Advances Multi-Step Reasoning in Large Language Models

NAACL 2024long

Chain-of-thought (CoT) has impressively unlocked the reasoning potential of large language models (LLMs). Yet, it falls short when tackling problems that require multiple reasoning steps. This limitation arises from the complex nature of multi-step reasoning processes: later stages often depend not…

2024

Text-to-Sticker: Style Tailoring Latent Diffusion Models for Human Expression

ECCV 2024poster

"We introduce Style Tailoring, a recipe to finetune Latent Diffusion Models (LDMs) in a distinct domain with high visual quality, prompt alignment and scene diversity. We choose sticker image generation as the target domain, as the images significantly differ from photorealistic samples typically ge…

Cited by 5SourcePDFScholar
2024

ViP: A Differentially Private Foundation Model for Computer Vision

ICML 2024oral

Artificial intelligence (AI) has seen a tremendous surge in capabilities thanks to the use of foundation models trained on internet-scale data. On the flip side, the uncurated nature of internet-scale data also poses significant privacy and legal risks, as they often contain personal information or…

2023

Analyzing Privacy Leakage in Machine Learning via Multiple Hypothesis Testing: A Lesson From Fano

ICML 2023poster

Differential privacy (DP) is by far the most widely accepted framework for mitigating privacy risks in machine learning. However, exactly how small the privacy parameter $\epsilon$ needs to be to protect against certain privacy risks in practice is still not well-understood. In this work, we study d…

Cited by 20SourcePDFScholar
2023

COFFEE: Counterfactual Fairness for Personalized Text Generation in Explainable Recommendation

EMNLP 2023long main

As language models become increasingly integrated into our digital lives, Personalized Text Generation (PTG) has emerged as a pivotal component with a wide range of applications. However, the bias inherent in user written text, often used for PTG model training, can inadvertently associate different…

Cited by 0SourceScholar
2023

Defending Against Patch-Based Backdoor Attacks on Self-Supervised Learning

CVPR 2023poster

Recently, self-supervised learning (SSL) was shown to be vulnerable to patch-based data poisoning backdoor attacks. It was shown that an adversary can poison a small part of the unlabeled data so that when a victim trains an SSL model on it, the final model will have a backdoor that the adversary ca…

2023

Identifying Interpretable Subspaces in Image Representations

ICML 2023poster

We propose Automatic Feature Explanation using Contrasting Concepts (FALCON), an interpretability framework to explain features of image representations. For a target feature, FALCON captions its highly activating cropped images using a large captioning dataset (like LAION-400m) and a pre-trained vi…

2023

Where to Begin? On the Impact of Pre-Training and Initialization in Federated Learning

ICLR 2023top-25%

An oft-cited challenge of federated learning is the presence of heterogeneity. \emph{Data heterogeneity} refers to the fact that data from different clients may follow very different distributions. \emph{System heterogeneity} refers to client devices having different system capabilities. A considera…

2022

Detection, Disambiguation, Re-ranking: Autoregressive Entity Linking as a Multi-Task Problem

ACL 2022findings

We propose an autoregressive entity linking model, that is trained with two auxiliary tasks, and learns to re-rank generated samples at inference time. Our proposed novelties address two weaknesses in the literature. First, a recent method proposes to learn mention detection and then entity candidat…

Cited by 0SourcePDFScholar
2022

ER-Test: Evaluating Explanation Regularization Methods for Language Models

EMNLP 2022finding

By explaining how humans would solve a given task, human rationales can provide strong learning signal for neural language models (NLMs). Explanation regularization (ER) aims to improve NLM generalization by pushing the NLM’s machine rationales (Which input tokens did the NLM focus on?) to align wit…

2022

Federated Learning with Partial Model Personalization

ICML 2022spotlight

We consider two federated learning algorithms for training partially personalized models, where the shared and personal parameters are updated either simultaneously or alternately on the devices. Both algorithms have been proposed in the literature, but their convergence properties are not fully und…

2022

UNIREX: A Unified Learning Framework for Language Model Rationale Extraction

ICML 2022spotlight

An extractive rationale explains a language model’s (LM’s) prediction on a given task instance by highlighting the text inputs that most influenced the prediction. Ideally, rationale extraction should be faithful (reflective of LM’s actual behavior) and plausible (convincing to humans), without comp…

2021

Alternating Direction Method of Multipliers for Quantization

AISTATS 2021poster

Quantization of the parameters of machine learning models, such as deep neural networks, requires solving constrained optimization problems, where the constraint set is formed by the Cartesian product of many simple discrete sets. For such optimization problems, we study the performance of the Alter…

Cited by 12SourcePDFScholar
2021

MSD: Saliency-aware Knowledge Distillation for Multimodal Understanding

EMNLP 2021finding

To reduce a model size but retain performance, we often rely on knowledge distillation (KD) which transfers knowledge from a large “teacher” model to a smaller “student” model. However, KD on multimodal datasets such as vision-language tasks is relatively unexplored, and digesting multimodal informa…

Cited by 8SourcePDFScholar
2019

Solving a Class of Non-Convex Min-Max Games Using Iterative First Order Methods

NeurIPS 2019poster

Recent applications that arise in machine learning have surged significant interest in solving min-max saddle point games. This problem has been extensively studied in the convex-concave regime for which a global equilibrium solution can be computed efficiently. In this paper, we study the problem i…

2018

On the Convergence and Robustness of Training GANs with Regularized Optimal Transport

NeurIPS 2018poster

Generative Adversarial Networks (GANs) are one of the most practical methods for learning data distributions. A popular GAN formulation is based on the use of Wasserstein distance as a metric between probability distributions. Unfortunately, minimizing the Wasserstein distance between the data distr…

Cited by 173SourcePDFScholar