activity
20202026
most citedBayesian Model Selection, the Marginal Likelihood, and Generalization

19 citations · 39 across the 14 of their papers we have counts for

collaborators

16 papers

cs.CL2026

Muse Glimmer 30B: An On-Device Agentic Model

Arash Ebrahim Abtahizadeh, Muna Aghamelu, Adil Ahmed +327

We introduce Muse Glimmer, an open-source 30B parameter causal language model with perception encoder, purpose-built for autonomous agentic tasks on consumer hardware. Muse Glimmer…

cs.LG2026

Small-Scale Experiments: Are We There Yet?

Nicholas Lourie, Kyunghyun Cho, Karen Ullrich +1

Scaling laws promised cost-effective experiments; six years later, they have yet to fully deliver. Instead, researchers have found them unreliable at small scales (starting at 4M p…

cs.CL2026

End-to-End Context Compression at Scale

Ang Li, Sean McLeish, Haozhe Chen +12

Long-context language model inference is bottlenecked by memory, as the KV cache grows with context length. Recent techniques to compress the KV cache fall short: they either degra…

cs.LG2026

Quantized Reasoning Models Think They Need to Think Longer, but They Do Not

Sanae Lotfi, Polina Kirichenko, Steven Li +1

Post-training quantization (PTQ) is widely used to deploy large language models efficiently, but its effect on reasoning models is not well understood. Across math, coding, and sci…

cs.LG2026

Trade-offs in Ensembling, Merging and Routing Among Parameter-Efficient Experts

Sanae Lotfi, Lucas Caccia, Alessandro Sordoni +2

While large language models (LLMs) fine-tuned with lightweight adapters achieve strong performance across diverse tasks, their performance on individual tasks depends on the fine-t…

cs.CL2026

Investigating Social Bias Changes in Quantized Language Models

Stanley Z. Hua, Sanae Lotfi, Irene Y. Chen

Post-training quantization reduces the memory needed to run large language models but alters their social biases in ways that aggregate metrics fail to capture. We present the firs…

cs.LG2025

Customizing the Inductive Biases of Softmax Attention using Structured Matrices

Yilun Kuang, Noah Amsel, Sanae Lotfi +3

The core component of attention is the scoring function, which transforms the inputs into low-dimensional queries and keys and takes the dot product of each pair. While the low-dim…

cs.LG2025

Small Batch Size Training for Language Models: When Vanilla SGD Works, and Why Gradient Accumulation Is Wasteful

Martin Marek, Sanae Lotfi, Aditya Somasundaram +2

Conventional wisdom dictates that small batch sizes make language model pretraining and fine-tuning unstable, motivating gradient accumulation, which trades off the number of optim…

stat.ML2024

Unlocking Tokens as Data Points for Generalization Bounds on Larger Language Models

Sanae Lotfi, Yilun Kuang, Brandon Amos +3

Large language models (LLMs) with billions of parameters excel at predicting the next token in a sequence. Recent work computes non-vacuous compression-based generalization bounds…

stat.ML2023

Non-Vacuous Generalization Bounds for Large Language Models

Sanae Lotfi, Marc Finzi, Yilun Kuang +3

Modern language models can contain billions of parameters, raising the question of whether they can generalize beyond the training data or simply parrot their training corpora. We…

cs.LG2022★ 7 cited

PAC-Bayes Compression Bounds So Tight That They Can Explain Generalization

Sanae Lotfi, Marc Finzi, Sanyam Kapoor +3

While there has been progress in developing non-vacuous generalization bounds for deep neural networks, these bounds tend to be uninformative about why deep learning works. In this…

cs.LG2022★ 19 cited

Bayesian Model Selection, the Marginal Likelihood, and Generalization

Sanae Lotfi, Pavel Izmailov, Gregory Benton +2

How do we compare between hypotheses that are entirely consistent with observations? The marginal likelihood (aka Bayesian evidence), which represents the probability of generating…

cs.LG2021

Adaptive First- and Second-Order Algorithms for Large-Scale Machine Learning

Sanae Lotfi, Tiphaine Bonniot de Ruisselet, Dominique Orban +1

In this paper, we consider both first- and second-order techniques to address continuous optimization problems arising in machine learning. In the first-order case, we propose a fr…

cs.LG2021★ 7 cited

Dangers of Bayesian Model Averaging under Covariate Shift

Pavel Izmailov, Patrick Nicholson, Sanae Lotfi +1

Approximate Bayesian inference for neural networks is considered a robust alternative to standard training, often providing good performance on out-of-distribution data. However, B…

cs.LG2021★ 4 cited

Loss Surface Simplexes for Mode Connecting Volumes and Fast Ensembling

Gregory W. Benton, Wesley J. Maddox, Sanae Lotfi +1

With a better understanding of the loss surfaces for multilayer networks, we can build more robust and accurate training procedures. Recently it was discovered that independently t…

cs.LG2020★ 2 cited

Stochastic Damped L-BFGS with Controlled Norm of the Hessian Approximation

Sanae Lotfi, Tiphaine Bonniot de Ruisselet, Dominique Orban +1

We propose a new stochastic variance-reduced damped L-BFGS algorithm, where we leverage estimates of bounds on the largest and smallest eigenvalues of the Hessian approximation to…