Jose Correa, Andres Cristi, Paul Duetting, and Ashkan Norouzi-Fard. Fairness and Bias in Online Selection. In Proceedings of the 38th International Conference on Machine Learning, volume 139 of Proceedings of Machine Learning Research, pages 2112-2121. PMLR, 18-24 Jul 2021.
Chandler Davis and W. M. Kahan. Some new bounds on perturbation of subspaces. Bulletin of the American Mathematical Society, 75(4):863 - 868, 1969.
Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, and Richard Zemel. Fairness through Awareness. In Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, ITCS '12, page 214-226, New York, NY, USA, 2012. Association for Computing Machinery.
Carl Eckart and Gale Young. The approximation of one matrix by another of lower rank. Psychometrika, 1:211-218, 1936.
Marwa El Halabi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Jakab Tardos, and Jakub M Tarnawski. Fairness in Streaming Submodular Maximization: Algorithms and Hardness. In Advances in Neural Information Processing Systems, volume 33, pages 13609-13622. Curran Associates, Inc., 2020.
Michael Feldman, Sorelle A. Friedler, John Moeller, Carlos Scheidegger, and Suresh Venkatasubramanian. Certifying and Removing Disparate Impact. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '15, page 259-268, New York, NY, USA, 2015. Association for Computing Machinery.
Mina Ghashami, Daniel J. Perry, and Jeff Phillips. Streaming Kernel Principal Component Analysis. In Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, volume 51 of Proceedings of Machine Learning Research, pages 1365-1374, Cadiz, Spain, 09-11 May 2016. PMLR.
Stephen Gillen, Christopher Jung, Michael Kearns, and Aaron Roth. Online Learning with an Unknown Fairness Metric. In Advances in Neural Information Processing Systems, volume 31, pages 2605-2614. Curran Associates, Inc., 2018.
Gene H. Golub and Charles F. Van Loan. Matrix Computations. Johns Hopkins Studies in the Mathematical Sciences. The Johns Hopkins University Press, 4 edition, 2013.
Moritz Hardt and Eric Price. The Noisy Power Method: A Meta Algorithm with Applications. In Advances in Neural Information Processing Systems, volume 27, pages 2861-2869. Curran Associates, Inc., 2014.
Moritz Hardt, Eric Price, and Nati Srebro. Equality of Opportunity in Supervised Learning. In Advances in Neural Information Processing Systems, volume 29, pages 3323-3331. Curran Associates, Inc., 2016.
Charles R. Harris, K. Jarrod Millman, Stéfan J. van der Walt, Ralf Gommers, Pauli Virtanen, David Cournapeau, Eric Wieser, Julian Taylor, Sebastian Berg, Nathaniel J. Smith, Robert Kern, Matti Picus, Stephan Hoyer, Marten H. van Kerkwijk, Matthew Brett, Allan Haldane, Jaime Fernández del Río, Mark Wiebe, Pearu Peterson, Pierre Gérard-Marchant, Kevin Sheppard, Tyler Reddy, Warren Weckesser, Hameer Abbasi, Christoph Gohlke, and Travis E. Oliphant. Array programming with NumPy. Nature, 585(7825):357-362, September 2020.
Max Hopkins, Daniel M. Kane, Shachar Lovett, and Gaurav Mahajan. Do PAC-Learners Learn the Marginal Distribution? arXiv preprint arXiv:2302.06285, 2023.
Harold Hotelling. Analysis of a complex of statistical variables into principal components. Journal of Educational Psychology, 24(6):417-441, 1933.
De Huang, Jonathan Niles-Weed, and Rachel Ward. Streaming k-PCA: Efficient guarantees for Oja's algorithm, beyond rank-one updates. In Proceedings of Thirty Fourth Conference on Learning Theory, volume 134 of Proceedings of Machine Learning Research, pages 2463-2498. PMLR, 15-19 Aug 2021.