activity
20182026
most citedA Modern Take on the Bias-Variance Tradeoff in Neural Networks

67 citations · 131 across the 29 of their papers we have counts for

collaborators
Showing cs.LGShow all

23 papers · 1 filter

cs.LG2026

Beyond Distribution Sharpening: The Importance of Task Rewards

Sarthak Mittal, Leo Gagnon, Guillaume Lajoie

Frontier models have demonstrated exceptional capabilities following the integration of task-reward-based reinforcement learning (RL) into their training pipelines, enabling system…

cs.LG2025

A Comedy of Estimators: On KL Regularization in RL Training of LLMs

Vedant Shah, Johan Obando-Ceron, Vineet Jain +10

The reasoning performance of large language models (LLMs) can be substantially improved by training them with reinforcement learning (RL). The RL objective for LLM training involve…

cs.LG2025

Iterative Amortized Inference: Unifying In-Context Learning and Learned Optimizers

Sarthak Mittal, Divyat Mahajan, Guillaume Lajoie +1

Modern learning systems increasingly rely on amortized learning - the idea of reusing computation or inductive biases shared across tasks to enable rapid generalization to novel pr…

cs.LG2025

Reinforced sequential Monte Carlo for amortised sampling

Sanghyeok Choi, Sarthak Mittal, Víctor Elvira +2

This paper proposes a synergy of amortised and particle-based methods for sampling from distributions defined by unnormalised density functions. We state a connection between seque…

cs.LG2025

Recursive Self-Aggregation Unlocks Deep Thinking in Large Language Models

Siddarth Venkatraman, Vineet Jain, Sarthak Mittal +9

Test-time scaling methods improve the capabilities of large language models (LLMs) by increasing the amount of compute used during inference to make a prediction. Inference-time co…

cs.LG2025

Next-Token Prediction Should be Ambiguity-Sensitive: A Meta-Learning Perspective

Leo Gagnon, Eric Elmoznino, Sarthak Mittal +4

The rapid adaptation ability of auto-regressive foundation models is often attributed to the diversity of their pre-training data. This is because, from a Bayesian standpoint, mini…

cs.LG2025

Solving Bayesian inverse problems with diffusion priors and off-policy RL

Luca Scimeca, Siddarth Venkatraman, Moksh Jain +14

This paper presents a practical application of Relative Trajectory Balance (RTB), a recently introduced off-policy reinforcement learning (RL) objective that can asymptotically sol…

cs.LG2025

In-Context Parametric Inference: Point or Distribution Estimators?

Sarthak Mittal, Yoshua Bengio, Nikolay Malkin +1

Bayesian and frequentist inference are two fundamental paradigms in statistical estimation. Bayesian methods treat hypotheses as random variables, incorporating priors and updating…

cs.LG2025★ 2 cited

Amortized In-Context Bayesian Posterior Estimation

Sarthak Mittal, Niels Leif Bracher, Guillaume Lajoie +2

Bayesian inference provides a natural way of incorporating prior beliefs and assigning a probability measure to the space of hypotheses. Current solutions rely on iterative routine…

cs.LG2024★ 2 cited

Steering Masked Discrete Diffusion Models via Discrete Denoising Posterior Prediction

Jarrid Rector-Brooks, Mohsin Hasan, Zhangzhi Peng +9

Generative modeling of discrete data underlies important applications spanning text-based agents like ChatGPT to the design of the very building blocks of life in protein sequences…

cs.LG2024

Recurrent Interpolants for Probabilistic Time Series Prediction

Yu Chen, Marin Biloš, Sarthak Mittal +3

Sequential models like recurrent neural networks and transformers have become standard for probabilistic multivariate time series forecasting across various domains. Despite their…

cs.LG2024

In-context learning and Occam's razor

Eric Elmoznino, Tom Marty, Tejas Kasetty +5

A central goal of machine learning is generalization. While the No Free Lunch Theorem states that we cannot obtain theoretical guarantees for generalization without further assumpt…

cs.LG2024★ 1 cited

Amortizing intractable inference in diffusion models for vision, language, and control

Siddarth Venkatraman, Moksh Jain, Luca Scimeca +12

Diffusion models have emerged as effective distribution estimators in vision, language, and reinforcement learning, but their use as priors in downstream tasks poses an intractable…

cs.LG2024

Does learning the right latent variables necessarily improve in-context learning?

Sarthak Mittal, Eric Elmoznino, Leo Gagnon +4

Large autoregressive models like Transformers can solve tasks through in-context learning (ICL) without learning new weights, suggesting avenues for efficiently solving new tasks.…

cs.LG2024★ 1 cited

Iterated Denoising Energy Matching for Sampling from Boltzmann Densities

Tara Akhound-Sadegh, Jarrid Rector-Brooks, Avishek Joey Bose +9

Efficiently generating statistically independent samples from an unnormalized probability distribution, such as equilibrium samples of many-body systems, is a foundational problem…

cs.LG2024

Improved off-policy training of diffusion samplers

Marcin Sendera, Minsu Kim, Sarthak Mittal +6

We study the problem of training diffusion models to sample from a distribution with a given unnormalized density or energy function. We benchmark several diffusion-structured infe…

cs.LG2022★ 2 cited

MixupE: Understanding and Improving Mixup from Directional Derivative Perspective

Yingtian Zou, Vikas Verma, Sarthak Mittal +6

Mixup is a popular data augmentation technique for training deep neural networks where additional samples are generated by linearly interpolating pairs of inputs and their labels.…

cs.LG2022★ 3 cited

From Points to Functions: Infinite-dimensional Representations in Diffusion Models

Sarthak Mittal, Guillaume Lajoie, Stefan Bauer +1

Diffusion-based generative models learn to iteratively transfer unstructured noise to a complex target distribution as opposed to Generative Adversarial Networks (GANs) or the deco…

cs.LG2022★ 15 cited

Is a Modular Architecture Enough?

Sarthak Mittal, Yoshua Bengio, Guillaume Lajoie

Inspired from human cognition, machine learning systems are gradually revealing advantages of sparser and more modular architectures. Recent work demonstrates that not only do some…

cs.LG2021★ 1 cited

Compositional Attention: Disentangling Search and Retrieval

Sarthak Mittal, Sharath Chandra Raparthy, Irina Rish +2

Multi-head, key-value attention is the backbone of the widely successful Transformer model and its variants. This attention mechanism uses multiple parallel key-value attention blo…

cs.LG2021★ 6 cited

Diffusion-Based Representation Learning

Sarthak Mittal, Korbinian Abstreiter, Stefan Bauer +2

Diffusion-based methods represented as stochastic differential equations on a continuous-time domain have recently proven successful as a non-adversarial generative model. Training…

cs.LG2020★ 16 cited

Learning to Combine Top-Down and Bottom-Up Signals in Recurrent Neural Networks with Attention over Modules

Sarthak Mittal, Alex Lamb, Anirudh Goyal +5

Robust perception relies on both bottom-up and top-down signals. Bottom-up signals consist of what's directly observed through sensation. Top-down signals consist of beliefs and ex…

cs.LG2018★ 67 cited

A Modern Take on the Bias-Variance Tradeoff in Neural Networks

Brady Neal, Sarthak Mittal, Aristide Baratin +4

The bias-variance tradeoff tells us that as model complexity increases, bias falls and variances increases, leading to a U-shaped test error curve. However, recent empirical result…