About
I am a Senior Research Scientist at Google in the Algorithms and Optimization group. I recieved my PhD in computer science from the Georgia Institute of Technology, where I was advised by Dana Randall. Before that, I studied computer science and mathematics at the University of Kentucky. I am the receipient of a FOCS 2020 Best Paper Award, NSF Graduate Research Fellowship, and Barry M. Goldwater Scholarship. My research interests broadly include algorithms, discrete mathematics, machine learning, and optimization.
Preprints
-
Pipeline Parallelism for DNN Inference with Practical Performance Guarantees
Aaron Archer, Matthew Fahrbach, Kuikui Liu, Prakash Prabhu
Manuscript
-
PriorBoost: An Adaptive Algorithm for Learning from Aggregate Responses
Adel Javanmard, Matthew Fahrbach, Vahab Mirrokni
Manuscript
Journal Articles
-
Edge-Weighted Online Bipartite Matching
Matthew Fahrbach, Zhiyi Huang, Runzhou Tao, Morteza Zadimoghaddam
Journal of the ACM, 69(6), 45:1-45:35, 2022
-
Coefficients and Roots of Peak Polynomials
Sara Billey, Matthew Fahrbach, Alan Talmage
Experimental Mathematics, 25(2), 165-175, 2016
Conference Papers
-
Unified Embedding: Battle-Tested Feature Representations for Web-Scale ML Systems
Benjamin Coleman, Wang-Cheng Kang, Matthew Fahrbach, Ruoxi Wang, Lichan Hong, Ed H. Chi, Derek Zhiyuan Cheng
NeurIPS 2023, Spotlight Presentation
-
Approximately Optimal Core Shapes for Tensor Decompositions
Mehrdad Ghadiri, Matthew Fahrbach, Gang Fu, Vahab Mirrokni
ICML 2023
-
Learning Rate Schedules in the Presence of Distribution Shift
Matthew Fahrbach, Adel Javanmard, Vahab Mirrokni, Pratik Worah
ICML 2023
-
Sequential Attention for Feature Selection
Taisuke Yasuda, MohammadHossein Bateni, Lin Chen, Matthew Fahrbach, Gang Fu, Vahab Mirrokni
ICLR 2023
-
Subquadratic Kronecker Regression with Applications to Tensor Decomposition
Matthew Fahrbach, Gang Fu, Mehrdad Ghadiri
NeurIPS 2022
-
A Fast Minimum Degree Algorithm and Matching Lower Bound
Robert Cummings, Matthew Fahrbach, Animesh Fatehpuria
SODA 2021
-
Edge-Weighted Online Bipartite Matching
Matthew Fahrbach, Zhiyi Huang, Runzhou Tao, Morteza Zadimoghaddam
FOCS 2020, Best Paper Award
-
Faster Graph Embeddings via Coarsening
Matthew Fahrbach, Gramoz Goranci, Richard Peng, Sushant Sachdeva, Chi Wang
ICML 2020
-
Slow Mixing of Glauber Dynamics for the Six-Vertex Model in the
Ordered Phases
Matthe Fahrbach, Dana Randall
RANDOM 2019
-
Non-monotone Submodular Maximization with Nearly
Optimal Adaptivity and Query Complexity
Matthew Fahrbach, Vahab Mirrokni, Morteza Zadimoghaddam
ICML 2019
-
Submodular Maximization with Nearly Optimal Approximation,
Adaptivity and Query Complexity
Matthew Fahrbach, Vahab Mirrokni, Morteza Zadimoghaddam
SODA 2019
-
Graph Sketching Against Adaptive Adversaries Applied to the
Minimum Degree Algorithm
Matthew Fahrbach, Gary Miller, Richard Peng, Saurabh Sawlani, Junxing Wang, Shen Chen Xu
FOCS 2018
-
Nearly Tight Bounds for Sandpile Transience on the Grid
David Durfee, Matthew Fahrbach, Yu Gao, Tao Xiao
SODA 2018
-
Analyzing Boltzmann Samplers for Bose–Einstein Condensates with Dirichlet Generating Functions
Megan Bernstein, Matthew Fahrbach, Dana Randall
ANALCO 2018
-
Approximately Sampling Elements with Fixed Rank in Graded Posets
Prateek Bhakta, Ben Cousins, Matthew Fahrbach, Dana Randall
SODA 2017