Optimal multi-distribution learning

DOI10.1145/3760256MaRDI QIDQ6892968zbMATH OpenFDO

Authors Zihan Zhang, Yuxin Chen, Simon S. Du, Jason D. Lee

Publication date 27 November 2025

Published in Journal of the ACM (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1145/3760256

zbMATH Keywords

game dynamicsmulti-distribution learningon-demand samplingoracle efficiencyRademacher classesVC classes

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• A decision-theoretic generalization of on-line learning and an application to boosting
• A theory of the learnable
• Bandit algorithms
• Foundations of machine learning
• High-dimensional statistics. A non-asymptotic viewpoint
• Introduction to Online Convex Optimization
• Learnability and the Vapnik-Chervonenkis dimension
• On tail probabilities for martingales
• Online learning and online convex optimization
• Oracle-efficient Online Learning and Auction Design
• Outcome indistinguishability
• The multiplicative weights update method: a meta-algorithm and applications
• Twenty lectures on algorithmic game theory
• Understanding machine learning. From theory to algorithms
• Zur Theorie der Gesellschaftsspiele.

This page was built for publication: Optimal multi-distribution learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6892968)