EDBT 2026 Demo / reviewers in the wild / expert
John Thickstun
dblp:190/7644
· DBLP profile ↗
10ranked-venue papers
2as first author
6since 2021 · last 2025
0000-0003-1268-8677ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 9 · 1 first-author · 6 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
9 papers |
Generative modeling · 41% Language models and text generation · 21% Trustworthy machine learning · 17% | |
| Computer graphics and multimedia
3 papers |
Image and video processing · 85% Audio and music processing · 15% | |
| Theoretical computer science
1 paper |
Information theory · 100% |
Topics — the 27 heaviest of 29, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Generative modeling
diffusion model |
2.4 | 4 | 2025 | Linearly Constrained Diffusion Implicit Models · NeurIPS 2025 Diffusion-LM Improves Controllable Text Generation · NeurIPS 2022 Parallel and Flexible Sampling from Autoregressive Models via Langevin Dynamics · ICML 2021 |
Natural language and speech › Language models and text generation
controllable text generation |
1.2 | 2 | 2023 | Backpack Language Models · ACL (1) 2023 Diffusion-LM Improves Controllable Text Generation · NeurIPS 2022 |
Machine learning › Trustworthy machine learning
interpretability |
1.1 | 2 | 2023 | Backpack Language Models · ACL (1) 2023 An Information Bottleneck Approach for Controlling Conciseness in Rationale Extraction · EMNLP (1) 2020 |
Machine learning › Generative modeling › diffusion model › inverse problem solving
diffusion-based inverse problem solving |
0.9 | 1 | 2025 | Linearly Constrained Diffusion Implicit Models · NeurIPS 2025 |
Image and video processing
image restoration |
0.9 | 1 | 2025 | Linearly Constrained Diffusion Implicit Models · NeurIPS 2025 |
Image and video processing
super-resolution |
0.9 | 1 | 2025 | Linearly Constrained Diffusion Implicit Models · NeurIPS 2025 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
distribution comparison |
0.7 | 1 | 2023 | MAUVE Scores for Generative Models: Theory and Practice · J. Mach. Learn. Res. 2023 |
Machine learning › Generative modeling
generative model evaluation |
0.7 | 1 | 2023 | MAUVE Scores for Generative Models: Theory and Practice · J. Mach. Learn. Res. 2023 |
Natural language and speech › Language models and text generation › language modeling
language model architecture |
0.7 | 1 | 2023 | Backpack Language Models · ACL (1) 2023 |
Machine learning › Trustworthy machine learning
language model interpretability |
0.7 | 1 | 2023 | Backpack Language Models · ACL (1) 2023 |
Machine learning › Representation and self-supervised learning › word representation
sense embeddings |
0.7 | 1 | 2023 | Backpack Language Models · ACL (1) 2023 |
Computer vision › Vision and language › vision-language generation
fine-grained control |
0.6 | 1 | 2022 | Diffusion-LM Improves Controllable Text Generation · NeurIPS 2022 |
Machine learning › Generative modeling
autoregressive model |
0.5 | 1 | 2021 | Parallel and Flexible Sampling from Autoregressive Models via Langevin Dynamics · ICML 2021 |
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods › markov chain monte carlo
langevin dynamics |
0.5 | 1 | 2021 | Parallel and Flexible Sampling from Autoregressive Models via Langevin Dynamics · ICML 2021 |
Natural language and speech › Language models and text generation › text generation
open-ended text generation |
0.5 | 1 | 2021 | MAUVE: Measuring the Gap Between Neural Text and Human Text using Divergence Frontiers · NeurIPS 2021 |
Machine learning › Generative modeling › diffusion model
parallel sampling |
0.5 | 1 | 2021 | Parallel and Flexible Sampling from Autoregressive Models via Langevin Dynamics · ICML 2021 |
Information theory › information measures › divergence measures
kullback-leibler divergence |
0.5 | 1 | 2021 | MAUVE: Measuring the Gap Between Neural Text and Human Text using Divergence Frontiers · NeurIPS 2021 |
Machine learning › Trustworthy machine learning › interpretability › rationalization
rationale extraction |
0.4 | 1 | 2020 | An Information Bottleneck Approach for Controlling Conciseness in Rationale Extraction · EMNLP (1) 2020 |
Audio and music processing
music information retrieval |
0.3 | 1 | 2017 | Learning Features of Music From Scratch · ICLR (Poster) 2017 |
Image and video processing › image restoration
denoising |
0.3 | 1 | 2025 | Linearly Constrained Diffusion Implicit Models · NeurIPS 2025 |
Image and video processing › image restoration
image deblurring |
0.3 | 1 | 2025 | Linearly Constrained Diffusion Implicit Models · NeurIPS 2025 |
Image and video processing › image restoration
image inpainting |
0.3 | 1 | 2025 | Linearly Constrained Diffusion Implicit Models · NeurIPS 2025 |
Natural language and speech › Language models and text generation
text generation evaluation |
0.2 | 1 | 2023 | MAUVE Scores for Generative Models: Theory and Practice · J. Mach. Learn. Res. 2023 |
Audio and music processing
source separation |
0.1 | 1 | 2021 | Parallel and Flexible Sampling from Autoregressive Models via Langevin Dynamics · ICML 2021 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
bayesian inference |
0.1 | 1 | 2020 | Source Separation with Deep Generative Priors · ICML 2020 |
Natural language and speech › Language models and text generation
natural language understanding |
0.1 | 1 | 2020 | An Information Bottleneck Approach for Controlling Conciseness in Rationale Extraction · EMNLP (1) 2020 |
Machine learning › Probabilistic and Bayesian machine learning › sampling
posterior sampling |
0.1 | 1 | 2020 | Source Separation with Deep Generative Priors · ICML 2020 |
Methods — techniques the papers use, named apart from their topics
projection step adaptation · 1.7diffusion model · 1.7divergence frontiers · 1.7langevin dynamics · 1.4quantization · 1.0markov chain monte carlo · 1.0vector quantization · 0.7classifier-based estimation · 0.7non-autoregressive generation · 0.6gradient-based decoding · 0.6deep learning · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Linearly Constrained Diffusion Implicit ModelsabstractWe introduce Linearly Constrained Diffusion Implicit Models (CDIM), a fast and accurate approach to solving noisy linear inverse problems using diffusion models. Traditional diffusion-based inverse methods rely on numerous projection steps to enforce measurement consistency in addition to unconditional denoising steps. CDIM achieves a 10–50× reduction in projection steps by dynamically adjusting the number and size of projection steps to align a residual measurement energy with its theoretical distribution under the forward diffusion process. This adaptive alignment preserves measurement consistency while substantially accelerating constrained inference.
For noise-free linear inverse problems, CDIM exactly satisfies the measurement constraints with few projection steps, even when existing methods fail. We demonstrate CDIM’s effectiveness across a range of applications, including super-resolution, denoising, inpainting, deblurring, and 3D point cloud reprojection. Vivek Jayaram, Ira Kemelmacher-Shlizerman, Steven M. Seitz, John Thickstun |
NeurIPS | 4 |
| 2023 | Backpack Language ModelsabstractWe present Backpacks: a new neural architecture that marries strong modeling performance with an interface for interpretability and control.Backpacks learn multiple non-contextual sense vectors for each word in a vocabulary, and represent a word in a sequence as a contextdependent, non-negative linear combination of sense vectors in this sequence.We find that, after training, sense vectors specialize, each encoding a different aspect of a word.We can interpret a sense vector by inspecting its (non-contextual, linear) projection onto the output space, and intervene on these interpretable hooks to change the model's behavior in predictable ways.We train a 170M-parameter Backpack language model on OpenWebText, matching the loss of a GPT-2 small (124Mparameter) Transformer.On lexical similarity evaluations, we find that Backpack sense vectors outperform even a 6B-parameter Transformer LM's word embeddings.Finally, we present simple algorithms that intervene on sense vectors to perform controllable text generation and debiasing.For example, we can edit the sense vocabulary to tend more towards a topic, or localize a source of gender bias to a sense vector and globally suppress that sense. John Hewitt, John Thickstun, Christopher D. Manning, Percy Liang |
ACL (1) | 2 |
| 2023 | MAUVE Scores for Generative Models: Theory and PracticeabstractGenerative artificial intelligence has made significant strides, producing text indistinguishable from human prose and remarkably photorealistic images. Automatically measuring how close the generated data distribution is to the target distribution is central to diagnosing existing models and developing better ones. We present MAUVE, a family of comparison measures between pairs of distributions such as those encountered in the generative modeling of text or images. These scores are statistical summaries of divergence frontiers capturing two types of errors in generative modeling. We explore three approaches to statistically estimate these scores: vector quantization, non-parametric estimation, and classifier-based estimation. We provide statistical bounds for the vector quantization approach. Empirically, we find that the proposed scores paired with a range of $f$-divergences and statistical estimation methods can quantify the gaps between the distributions of human-written text and those of modern neural language models by correlating with human judgments and identifying known properties of the generated texts. We demonstrate in the vision domain that MAUVE can identify known properties of generated images on par with or better than existing metrics. In conclusion, we present practical recommendations for using MAUVE effectively with language and image modalities. Krishna Pillutla, John Thickstun, Sean Welleck, Swabha Swayamdipta, Rowan Zellers, Sewoong Oh, Yejin Choi 0001, Zaïd Harchaoui |
J. Mach. Learn. Res. | 3 |
| 2022 | Diffusion-LM Improves Controllable Text GenerationabstractControlling the behavior of language models (LMs) without re-training is a major open problem in natural language generation. While recent works have demonstrated successes on controlling simple sentence attributes (e.g., sentiment), there has been little progress on complex, fine-grained controls (e.g., syntactic structure). To address this challenge, we develop a new non-autoregressive language model based on continuous diffusions that we call Diffusion-LM. Building upon the recent successes of diffusion models in continuous domains, Diffusion-LM iteratively denoises a sequence of Gaussian vectors into word vectors, yielding a sequence of intermediate latent variables. The continuous, hierarchical nature of these intermediate variables enables a simple gradient-based algorithm to perform complex, controllable generation tasks. We demonstrate successful control of Diffusion-LM for six challenging fine-grained control tasks, significantly outperforming prior work. Xiang Li 0063, John Thickstun, Ishaan Gulrajani, Percy Liang, Tatsunori B. Hashimoto |
NeurIPS | 2 |
| 2021 | Parallel and Flexible Sampling from Autoregressive Models via Langevin DynamicsabstractThis paper introduces an alternative approach to sampling from autoregressive models. Autoregressive models are typically sampled sequentially, according to the transition dynamics defined by the model. Instead, we propose a sampling procedure that initializes a sequence with white noise and follows a Markov chain defined by Langevin dynamics on the global log-likelihood of the sequence. This approach parallelizes the sampling process and generalizes to conditional sampling. Using an autoregressive model as a Bayesian prior, we can steer the output of a generative model using a conditional likelihood or constraints. We apply these techniques to autoregressive models in the visual and audio domains, with competitive results for audio source separation, super-resolution, and inpainting. Vivek Jayaram, John Thickstun |
ICML | 2 |
| 2021 | MAUVE: Measuring the Gap Between Neural Text and Human Text using Divergence FrontiersabstractAs major progress is made in open-ended text generation, measuring how close machine-generated text is to human language remains a critical open problem. We introduce Mauve, a comparison measure for open-ended text generation, which directly compares the learnt distribution from a text generation model to the distribution of human-written text using divergence frontiers. Mauve scales up to modern text generation models by computing information divergences in a quantized embedding space. Through an extensive empirical study on three open-ended generation tasks, we find that Mauve identifies known properties of generated text, scales naturally with model size, and correlates with human judgments, with fewer restrictions than existing distributional evaluation metrics. Krishna Pillutla, Swabha Swayamdipta, Rowan Zellers, John Thickstun, Sean Welleck, Yejin Choi 0001, Zaïd Harchaoui |
NeurIPS | 4 |
| 2020 | An Information Bottleneck Approach for Controlling Conciseness in Rationale ExtractionabstractDecisions of complex models for language understanding can be explained by limiting the inputs they are provided to a relevant subsequence of the original text -a rationale.Models that condition predictions on a concise rationale, while being more interpretable, tend to be less accurate than models that are able to use the entire context.In this paper, we show that it is possible to better manage the trade-off between concise explanations and high task accuracy by optimizing a bound on the Information Bottleneck (IB) objective.Our approach jointly learns an explainer that predicts sparse binary masks over input sentences without explicit supervision, and an end-task predictor that considers only the residual sentences.Using IB, we derive a learning objective that allows direct control of mask sparsity levels through a tunable sparse prior.Experiments on the ERASER benchmark demonstrate significant gains over previous work for both task performance and agreement with human rationales.Furthermore, we find that in the semi-supervised setting, a modest amount of gold rationales (25% of training examples with gold masks) can close the performance gap with a model that uses the full input.1 Bhargavi Paranjape, Mandar Joshi, John Thickstun, Hannaneh Hajishirzi, Luke Zettlemoyer |
EMNLP (1) | 3 |
| 2020 | Source Separation with Deep Generative PriorsabstractDespite substantial progress in signal source separation, results for richly structured data continue to contain perceptible artifacts. In contrast, recent deep generative models can produce authentic samples in a variety of domains that are indistinguishable from samples of the data distribution. This paper introduces a Bayesian approach to source separation that uses deep generative models as priors over the components of a mixture of sources, and noise-annealed Langevin dynamics to sample from the posterior distribution of sources given a mixture. This decouples the source separation problem from generative modeling, enabling us to directly use cutting-edge generative models as priors. The method achieves state-of-the-art performance for MNIST digit separation. We introduce new methodology for evaluating separation quality on richer datasets, providing quantitative evaluation and qualitative discussion of results for CIFAR-10 image separation. We also provide qualitative results on LSUN. Vivek Jayaram, John Thickstun |
ICML | 2 |
| 2018 | Invariances and Data Augmentation for Supervised Music TranscriptionabstractThis paper explores a variety of models for frame-based music transcription, with an emphasis on the methods needed to reach state-of-the-art on human recordings. The translation-invariant network discussed in this paper, which combines a traditional filterbank with a convolutional neural network, was the top-performing model in the 2017 MIREX Multiple Fundamental Frequency Estimation evaluation. This class of models shares parameters in the log-frequency domain, which exploits the frequency invariance of music to reduce the number of model parameters and avoid overfitting to the training data. All models in this paper were trained with supervision by labeled data from the MusicNet dataset, augmented by random label-preserving pitch-shift transformations. John Thickstun, Zaïd Harchaoui, Dean P. Foster, Sham M. Kakade |
ICASSP | 1 |
| 2017 | Learning Features of Music From Scratch
John Thickstun, Zaïd Harchaoui, Sham M. Kakade |
ICLR (Poster) | 1 |