activity
20072026
most citedSCAFFOLD: Stochastic Controlled Averaging for Federated Learning

732 citations · 3.8k across the 103 of their papers we have counts for

collaborators
Showing cs.LGShow all

99 papers · 1 filter

cs.LG2026

Beyond Binary: Continuous State Optimization with Graph-Structured Objectives

Corinna Cortes, Yishay Mansour, Mehryar Mohri

Large-scale learning systems often face the challenge of balancing multiple, potentially competing objectives, such as fairness, accuracy, and latency. While recent work has formal…

cs.LG2026

Principled Algorithms for Optimizing Generalized Metrics in Multi-Label Learning

Mehryar Mohri, Yutao Zhong

Many real-world classification tasks require predicting multiple labels per instance, necessitating the optimization of complex evaluation metrics such as the -measure and Jacca…

cs.LG2026

Generalized Distributional Alignment Games for Unbiased Answer-Level Fine-Tuning

Mehryar Mohri, Jon Schneider, Yutao Zhong

The Distributional Alignment Game framework provides a powerful variational perspective on Answer-Level Fine-Tuning (ALFT). However, standard algorithms for these games rely on est…

cs.LG2026

Theoretical Foundations and Effective Algorithms for Policy-Aware Simulator Learning

Christoph Dann, Yishay Mansour, Mehryar Mohri

Model-based reinforcement learning (MBRL) agents typically learn world models by minimizing predictive loss. However, powerful RL optimizers inevitably exploit minor model inaccura…

cs.LG2026

Distributional Alignment Games for Answer-Level Fine-Tuning

Mehryar Mohri, Jon Schneider, Yifan Wu

We focus on the problem of \emph{Answer-Level Fine-Tuning} (ALFT), where the goal is to optimize a language model based on the correctness or properties of its final answers, rathe…

cs.LG2026

Linear-Core Surrogates: Smooth Loss Functions with Linear Rates for Classification and Structured Prediction

Mehryar Mohri, Yutao Zhong

A fundamental dichotomy in the theory of classification sets smoothness against statistical efficiency: smooth surrogate losses such as the logistic loss enable fast optim…

cs.LG2026

Optimized Deferral for Imbalanced Settings

Corinna Cortes, Anqi Mao, Mehryar Mohri +1

Learning algorithms can be significantly improved by routing complex or uncertain inputs to specialized experts, balancing accuracy with computational cost. This approach, known as…

cs.LG2026

Next-Token Prediction and Regret Minimization

Mehryar Mohri, Clayton Sanford, Jon Schneider +2

We consider the question of how to employ next-token prediction algorithms in adversarial online decision-making environments. Specifically, if we train a next-token prediction mod…

cs.LG2026

Efficient Opportunistic Approachability

Teodor Vanislavov Marinov, Mehryar Mohri, Princewill Okoroafor +2

We study the problem of opportunistic approachability: a generalization of Blackwell approachability where the learner would like to obtain stronger guarantees (i.e., approach a sm…

cs.LG2026

Rational Transductors

Mehryar Mohri

Standard Transformers excel at semantic modeling but struggle with rigid sequential logic and state tracking. Theoretical work establishes that self-attention is limited to $\AC^0$…

cs.LG2026

A Theoretical Framework for Modular Learning of Robust Generative Models

Corinna Cortes, Mehryar Mohri, Yutao Zhong

Training large-scale generative models is resource-intensive and relies heavily on heuristic dataset weighting. We address two fundamental questions: Can we train Large Language Mo…

cs.LG2026

Temper-Then-Tilt: Principled Unlearning for Generative Models through Tempering and Classifier Guidance

Jacob L. Block, Mehryar Mohri, Aryan Mokhtari +1

We study machine unlearning in large generative models by framing the task as density ratio estimation to a target distribution rather than supervised fine-tuning. While classifier…

cs.LG2025

Improved Balanced Classification with Theoretically Grounded Loss Functions

Corinna Cortes, Mehryar Mohri, Yutao Zhong

The balanced loss is a widely adopted objective for multi-class classification under class imbalance. By assigning equal importance to all classes, regardless of their frequency, i…

cs.LG2025

Principled Algorithms for Optimizing Generalized Metrics in Binary Classification

Anqi Mao, Mehryar Mohri, Yutao Zhong

In applications with significant class imbalance or asymmetric costs, metrics such as the -measure, AM measure, Jaccard similarity coefficient, and weighted accuracy offer mor…

cs.LG2025

Beyond Tsybakov: Model Margin Noise and -Consistency Bounds

Mehryar Mohri, Yutao Zhong

We introduce a new low-noise condition for classification, the Model Margin Noise (MM noise) assumption, and derive enhanced -consistency bounds under this condition.…

cs.LG2025

Coherence Mechanisms for Provable Self-Improvement

Mehryar Mohri, Jon Schneider, Yifan Wu

Self-improvement is a critical capability for large language models and other intelligent systems, enabling them to refine their behavior and internal consistency without external…

cs.LG2025

Budgeted Multiple-Expert Deferral

Giulia DeSalvo, Clara Mohri, Mehryar Mohri +1

Learning to defer uncertain predictions to costly experts offers a powerful strategy for improving the accuracy and efficiency of machine learning systems. However, standard traini…

cs.LG2025

Mastering Multiple-Expert Routing: Realizable -Consistency and Strong Guarantees for Learning to Defer

Anqi Mao, Mehryar Mohri, Yutao Zhong

The problem of learning to defer with multiple experts consists of optimally assigning input instances to experts, balancing the trade-off between their accuracy and computational…

cs.LG2025

High-Dimensional Calibration from Swap Regret

Maxwell Fishelson, Noah Golowich, Mehryar Mohri +1

We study online calibration of multi-dimensional forecasts over an arbitrary convex set relative to an arbitrary norm . We connect this to externa…

cs.LG2025

Balancing the Scales: A Theoretical and Algorithmic Framework for Learning from Imbalanced Data

Corinna Cortes, Anqi Mao, Mehryar Mohri +1

Class imbalance remains a major challenge in machine learning, especially in multi-class problems with long-tailed distributions. Existing methods, such as data resampling, cost-se…

cs.LG2024

Multi-Label Learning with Stronger Consistency Guarantees

Anqi Mao, Mehryar Mohri, Yutao Zhong

We present a detailed study of surrogate losses and algorithms for multi-label learning, supported by -consistency bounds. We first show that, for the simplest form of multi-lab…

cs.LG2024

Realizable -Consistent and Bayes-Consistent Loss Functions for Learning to Defer

Anqi Mao, Mehryar Mohri, Yutao Zhong

We present a comprehensive study of surrogate loss functions for learning to defer. We introduce a broad family of surrogate losses, parameterized by a non-increasing function ,…

cs.LG2024

Cardinality-Aware Set Prediction and Top- Classification

Corinna Cortes, Anqi Mao, Christopher Mohri +2

We present a detailed study of cardinality-aware top- classification, a novel approach that aims to learn an accurate top- set predictor while maintaining a low cardinality.…

cs.LG2024

Enhanced -Consistency Bounds

Anqi Mao, Mehryar Mohri, Yutao Zhong

Recent research has introduced a key notion of -consistency bounds for surrogate losses. These bounds offer finite-sample guarantees, quantifying the relationship between the ze…