Fetching the paper…
Reading the bibliography…
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 learning, group distributionally robust optimization, and fair federated learning.
A stochastic approximation method
H. Robbins and S. Monro · 1951
Earlier work this paper cites.
An iterative method of solving a game
J. Robinson · 1951
Earlier work this paper cites.
Problem Complexity and Method Efficiency in Optimization
A. S. Nemirovskij and D. B. Yudin · 1983
Earlier work this paper cites.
A theory of the learnable
L. G. Valiant · 1984
Earlier work this paper cites.
Epsilon-nets and simplex range queries
D. Haussler and E. Welzl · 1986
Earlier work this paper cites.
Learning quickly when irrelevant attributes abound: a new linear-threshold algorithm
N. Littlestone · 1987
Earlier work this paper cites.
A general lower bound on the number of examples needed for learning
A. Ehrenfeucht, D. Haussler, M. Kearns, and L. Valiant · 1989
Earlier work this paper cites.
A decision-theoretic generalization of on-line learning and an application to boosting
Y. Freund and R. E. Schapire · 1997
Earlier work this paper cites.
A simple adaptive procedure leading to correlated equilibrium
S. Hart and A. Mas-Colell · 2000
Earlier work this paper cites.
Neural Network Learning - Theoretical Foundations
M. Anthony and P. L. Bartlett · 2002
Earlier work this paper cites.
Mirror descent and nonlinear projected subgradient methods for convex optimization
A. Beck and M. Teboulle · 2003
Earlier work this paper cites.
Exploiting task relatedness for multiple task learning
S. Ben-David and R. Schuller · 2003
Earlier work this paper cites.
Quantized incremental algorithms for distributed optimization
M. G. Rabbat and R. D. Nowak · 2005
Earlier work this paper cites.
Noisy binary search and its applications
R. M. Karp and R. Kleinberg · 2007
Earlier work this paper cites.
Domain Adaptation with Multiple Sources
Y. Mansour, M. Mohri, and A. Rostamizadeh · 2008
Earlier work this paper cites.
Robust Optimization , volume 28 of Princeton Series in Applied Mathematics
A. Ben-Tal, L. El Ghaoui, and A. Nemirovski · 2009
Earlier work this paper cites.
Torchvision the machine-vision package of torch
S. Marcel and Y. Rodriguez · 2010
Earlier work this paper cites.
Distributed optimization and statistical learning via the alternating direction method of multipliers
S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein · 2011
Earlier work this paper cites.
Near-optimal no-regret algorithms for zero-sum games
C. Daskalakis, A. Deckelbaum, and A. Kim · 2011
Cited alongside, same era.
Solving variational inequalities with stochastic mirror-prox algorithm
A. Juditsky, A. Nemirovski, and C. Tauvel · 2011
Cited alongside, same era.
From bandits to experts: On the value of side-observations
S. Mannor and O. Shamir · 2011
Cited alongside, same era.
The Caltech-UCSD Birds-200-2011 dataset
C. Wah, S. Branson, P. Welinder, P. Perona, and S. Belongie · 2011
Cited alongside, same era.
Distributed learning, communication complexity and privacy
M.-F. Balcan, A. Blum, S. Fine, and Y. Mansour · 2012
Cited alongside, same era.
Efficient protocols for distributed classification and optimization
H. Daumé, J. M. Phillips, A. Saha, and S. Venkatasubramanian · 2012
Cited alongside, same era.
BERT: pre-training of deep bidirectional transformers for language understanding
J. Devlin, M.-W. Chang, K. Lee, and K. Toutanova · 2019
Later among the works it cites.
Meta-Sim: learning to generate synthetic datasets
A. Kar, A. Prakash, M.-Y. Liu, E. Cameracci, J. Yuan, M. Rusiniak, D. Acuna, A. Torralba, and S. Fidler · 2019
Later among the works it cites.
Agnostic federated learning
M. Mohri, G. Sivek, and A. T. Suresh · 2019
Later among the works it cites.
Huggingface’s transformers: state-of-the-art natural language processing, 2019
T. Wolf, L. Debut, V. Sanh, J. Chaumond, C. Delangue, A. Moi, P. Cistac, T. Rault, R. Louf, M. Funtowicz, and others · 2019
Later among the works it cites.
DeceptionNet: network-driven domain randomization
S. Zakharov, W. Kehl, and S. Ilic · 2019
Later among the works it cites.
Information-theoretic lower bounds of PAC sample complexity, 2019
C. Zhang · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
From bandits to experts: a tale of domination and independence
N. Alon, N. Cesa-Bianchi, C. Gentile, and Y. Mansour · 2013
Cited alongside, same era.
Optimization, learning, and games with predictable sequences
A. Rakhlin and K. Sridharan · 2013
Cited alongside, same era.
Communication-efficient distributed optimization using an approximate newton-type method
O. Shamir, N. Srebro, and T. Zhang · 2014
Cited alongside, same era.
Deep learning face attributes in the wild
Z. Liu, P. Luo, X. Wang, and X. Tang · 2015
Cited alongside, same era.
Explore no more: Improved high-probability regret bounds for non-stochastic bandits
G. Neu · 2015
Cited alongside, same era.
Deep residual learning for image recognition
K. He, X. Zhang, S. Ren, and J. Sun · 2016
Cited alongside, same era.
Later among the works it cites.
Adversarial laws of large numbers and optimal regret in online classification
N. Alon, O. Ben-Eliezer, Y. Dagan, S. Moran, M. Naor, and E. Yogev · 2021
Later among the works it cites.
Near-optimal no-regret learning in general games
C. Daskalakis, M. Fishelson, and N. Golowich · 2021
Later among the works it cites.
Learning models with uniform performance via distributionally robust optimization
J. C. Duchi and H. Namkoong · 2021
Later among the works it cites.
Outcome indistinguishability
C. Dwork, M. P. Kim, O. Reingold, G. N. Rothblum, and G. Yona · 2021
Later among the works it cites.
Fair attribute classification through latent space de-biasing
V. V. Ramaswamy, S. S. Kim, and O. Russakovsky · 2021
Later among the works it cites.
Multi-group agnostic PAC learnability
G. N. Rothblum and G. Yona · 2021
Later among the works it cites.
Algorithms for Convex Optimization
N. K. Vishnoi · 2021
Later among the works it cites.
A unifying perspective on multi-calibration: Game dynamics for multi-objective learning
N. Haghtalab, M. Jordan, and E. Zhao · 2022
Closest in time.
Metric entropy duality and the sample complexity of outcome indistinguishability
L. Hu, C. Peale, and O. Reingold · 2022
Closest in time.
Simple and near-optimal algorithms for hidden stratification and multi-group learning
C. J. Tosh and D. Hsu · 2022
Closest in time.
Open problem: The sample complexity of multi-distribution learning for vc classes
P. Awasthi, N. Haghtalab, and E. Zhao · 2023
Closest in time.
The sample complexity of multi-distribution learning, 2023
B. Peng · 2023
Closest in time.