Fetching the paper…
Reading the bibliography…
Sagawa, S., Koh, P. W., Hashimoto, T. B., and Liang, P. (2019) · 1911
Earlier work this paper cites.
Zur theorie der gesellschaftsspiele
v. Neumann, J. (1928) · 1928
Earlier work this paper cites.
Fairness without demographics in repeated loss minimization
Hashimoto, T., Srivastava, M., Namkoong, H., and Liang, P. (2018) · 1938
Earlier work this paper cites.
Multicalibration: Calibration for the (computationally-identifiable) masses
Hébert-Johnson, U., Kim, M., Reingold, O., and Rothblum, G. (2018) · 1948
Earlier work this paper cites.
On tail probabilities for martingales
Freedman, D. A. (1975) · 1975
Earlier work this paper cites.
A theory of the learnable
Valiant, L. G. (1984) · 1984
Earlier work this paper cites.
Learnability and the Vapnik-Chervonenkis dimension
Blumer, A., Ehrenfeucht, A., Haussler, D., and Warmuth, M. K. (1989) · 1989
Earlier work this paper cites.
Measuring the VC-dimension of a learning machine
Vapnik, V., Levin, E., and Le Cun, Y. (1994) · 1994
Earlier work this paper cites.
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y. and Schapire, R. E. (1997) · 1997
Earlier work this paper cites.
Multi-source domain adaptation in the deep learning era: A systematic survey
Zhao, S., Li, B., Xu, P., and Keutzer, K. (2020) · 2002
Earlier work this paper cites.
Domain adaptation with multiple sources
Mansour, Y., Mohri, M., and Rostamizadeh, A. (2008) · 2008
Earlier work this paper cites.
The multiplicative weights update method: a meta-algorithm and applications
Arora, S., Hazan, E., and Kale, S. (2012) · 2012
Earlier work this paper cites.
Online learning and online convex optimization
Shalev-Shwartz, S. (2012) · 2012
Earlier work this paper cites.
Understanding machine learning: From theory to algorithms
Shalev-Shwartz, S. and Ben-David, S. (2014) · 2014
Earlier work this paper cites.
Magging: maximin aggregation for inhomogeneous large-scale data
Bühlmann, P. and Meinshausen, N. (2015) · 2015
Earlier work this paper cites.
Twenty lectures on algorithmic game theory
Roughgarden, T. (2016) · 2016
Cited alongside, same era.
Collaborative PAC learning
Blum, A., Haghtalab, N., Procaccia, A. D., and Qiao, M. (2017) · 2017
Cited alongside, same era.
Tight bounds for collaborative PAC learning via multiplicative weights
Chen, J., Zhang, Q., and Zhou, Y. (2018) · 2018
Cited alongside, same era.
Foundations of machine learning
Mohri, M., Rostamizadeh, A., and Talwalkar, A. (2018) · 2018
Cited alongside, same era.
Improved algorithms for collaborative PAC learning
Nguyen, H. and Zakynthinou, L. (2018) · 2018
Cited alongside, same era.
Meta-sim: Learning to generate synthetic datasets
Kar, A., Prakash, A., Liu, M.-Y., Cameracci, E., Yuan, J., Rusiniak, M., Acuna, D., Torralba, A., and Fidler, S. (2019) · 2019
Cited alongside, same era.
Outcome indistinguishability
Dwork, C., Kim, M. P., Reingold, O., Rothblum, G. N., and Yona, G. (2021) · 2021
Later among the works it cites.
Multi-group agnostic PAC learnability
Rothblum, G. N. and Yona, G. (2021) · 2021
Later among the works it cites.
Active sampling for min-max fairness
Abernethy, J., Awasthi, P., Kleindessner, M., Morgenstern, J., Russell, C., and Zhang, J. (2022) · 2022
Later among the works it cites.
Distributionally robust optimization via ball oracle acceleration
Carmon, Y. and Hausler, D. (2022) · 2022
Later among the works it cites.
On-demand sampling: Learning optimally from multiple distributions
Haghtalab, N., Jordan, M., and Zhao, E. (2022) · 2022
Later among the works it cites.
Introduction to online convex optimization
Hazan, E. (2022) · 2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Agnostic federated learning
Mohri, M., Sivek, G., and Suresh, A. T. (2019) · 2019
Cited alongside, same era.
High-dimensional statistics: A non-asymptotic viewpoint
Wainwright, M. J. (2019) · 2019
Cited alongside, same era.
Distributionally robust federated averaging
Deng, Y., Kamani, M. M., and Mahdavi, M. (2020) · 2020
Cited alongside, same era.
Oracle-efficient online learning and auction design
Dudík, M., Haghtalab, N., Luo, H., Schapire, R. E., Syrgkanis, V., and Vaughan, J. W. (2020) · 2020
Cited alongside, same era.
Bandit algorithms
Lattimore, T. and Szepesvári, C. (2020) · 2020
Cited alongside, same era.
An investigation of why overparameterization exacerbates spurious correlations
Sagawa, S., Raghunathan, A., Koh, P. W., and Liang, P. (2020) · 2020
Cited alongside, same era.
Horizon-free reinforcement learning in polynomial time: the power of stationary policies
Zhang, Z., Ji, X., and Du, S. (2022) · 2022
Later among the works it cites.
Open problem: The sample complexity of multi-distribution learning for VC classes
Awasthi, P., Haghtalab, N., and Zhao, E. (2023) · 2023
Closest in time.
Statistical inference for maximin effects: Identifying stable associations across multiple studies
Guo, Z. (2023) · 2023
Closest in time.
A unifying perspective on multi-calibration: Game dynamics for multi-objective learning
Haghtalab, N., Jordan, M., and Zhao, E. (2023) · 2023
Closest in time.
The sample complexity of multi-distribution learning
Peng, B. (2023) · 2023
Closest in time.
Distributionally robust machine learning with multi-source data
Wang, Z., Bühlmann, P., and Guo, Z. (2023) · 2023
Closest in time.
Distributionally robust transfer learning
Xiong, X., Guo, Z., and Cai, T. (2023) · 2023
Closest in time.
Does distributionally robust supervised learning give robust classifiers?
Hu, W., Niu, G., Sato, I., and Sugiyama, M. (2018) · 2037
Closest in time.