On-Demand Sampling: Learning Optimally from Multiple DistributionsAuthors are ordered alphabetically. Correspondence to eric.zh@berkeley.edu.
This is experimental HTML to improve accessibility. We invite you to report rendering errors. Use Alt+Y to toggle on accessible reporting links and Alt+Shift+Y to toggle off. Learn more about this project and help improve conversions.
On-Demand Sampling: Learning Optimally from Multiple DistributionsAuthors are ordered alphabetically. Correspondence to eric.zh@berkeley.edu. On-Demand Sampling: Learning Optimally from Multiple Distributions † † thanks: Authors are ordered alphabetically. Correspondence to eric.zh@berkeley.edu . Nika Haghtalab Michael I. Jordan Eric Zhao Abstract Social and real-world considerations such as robustness, fairness, social welfare and multi-agent tradeoffs have given rise to multi-distribution learning paradigms, such as collaborative [ 9 ] , group distributionally robust [ 50 ] , and fair federa
related reading
- [2407.19777] Revisiting Agnostic PAC Learningarxiv.org
- course_stat_rl.pdfmit.edu
- Competing with sampling — Alignment Research Centeralignment.org
- Majority-of-Three: The Simplest Optimal Learner?proceedings.mlr.press
- arxiv.org/pdf/2511.08544arxiv.org
- IsoCompute Playbook: Optimally Scaling Sampling Compute for RL Training of LLMscompute-optimal-rl-llm-scaling.github.io
- [arxiv] an algorithmic framework for fairness elicitationarxiv.org
- ARC progress update: Competing with sampling — LessWronglesswrong.com
- [1710.10044] Distributional Reinforcement Learning with Quantile Regressionarxiv.org
- An optimization perspective on log-concave sampling and beyond | Sinho Chewichewisinho.github.io
- [1911.08731] Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationarxiv.org
- A Course in Machine Learningciml.info