Matthew Fahrbach

Vahab Mirrokni

CoRR, 2024

2023

Greedy PIG: Adaptive Integrated Gradients.

[BibT_eX]

[DOI]

CoRR, 2023

Pipeline Parallelism for DNN Inference with Practical Performance Guarantees.

[BibT_eX]

[DOI]

CoRR, 2023

Unified Embedding: Battle-Tested Feature Representations for Web-Scale ML Systems.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Approximately Optimal Core Shapes for Tensor Decompositions.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

Learning Rate Schedules in the Presence of Distribution Shift.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

Sequential Attention for Feature Selection.

[BibT_eX]

[DOI]

Taisuke Yasuda

Mohammad Hossein Bateni

Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022

Edge-Weighted Online Bipartite Matching.

[BibT_eX]

[DOI]

Zhiyi Huang

Runzhou Tao

J. ACM, 2022

Subquadratic Kronecker Regression with Applications to Tensor Decomposition.

[BibT_eX]

[DOI]

Thomas Fu

Mehrdad Ghadiri

CoRR, 2022

Subquadratic Kronecker Regression with Applications to Tensor Decomposition.

[BibT_eX]

[DOI]

Gang Fu

Mehrdad Ghadiri

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021

Fast Low-Rank Tensor Decomposition by Ridge Leverage Score Sampling.

[BibT_eX]

[DOI]

Mehrdad Ghadiri

Thomas Fu

CoRR, 2021

A Fast Minimum Degree Algorithm and Matching Lower Bound.

[BibT_eX]

[DOI]

Robert Cummings

Animesh Fatehpuria

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

Faster Graph Embeddings via Coarsening.

[BibT_eX]

[DOI]

Proceedings of the 37th International Conference on Machine Learning, 2020

2019

Slow Mixing of Glauber Dynamics for the Six-Vertex Model in the Ferroelectric and Antiferroelectric Phases.

[BibT_eX]

[DOI]

Dana Randall

CoRR, 2019

Submodular Maximization with Nearly Optimal Approximation, Adaptivity and Query Complexity.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Non-monotone Submodular Maximization with Nearly Optimal Adaptivity and Query Complexity.

[BibT_eX]

[DOI]

Proceedings of the 36th International Conference on Machine Learning, 2019

Slow Mixing of Glauber Dynamics for the Six-Vertex Model in the Ordered Phases.

[BibT_eX]

[DOI]

Dana Randall

Proceedings of the Approximation, 2019

2018

Non-monotone Submodular Maximization with Nearly Optimal Adaptivity Complexity.

[BibT_eX]

[DOI]

CoRR, 2018

Submodular Maximization with Optimal Approximation, Adaptivity and Query Complexity.

[BibT_eX]

[DOI]

CoRR, 2018

Nearly Tight Bounds for Sandpile Transience on the Grid.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Graph Sketching against Adaptive Adversaries Applied to the Minimum Degree Algorithm.

[BibT_eX]

[DOI]

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

Analyzing Boltzmann Samplers for Bose-Einstein Condensates with Dirichlet Generating Functions.

[BibT_eX]

[DOI]

Megan Bernstein

Dana Randall

Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, 2018

2017

On Computing Min-Degree Elimination Orderings.

[BibT_eX]

[DOI]

CoRR, 2017

Tight Bounds for Sandpile Transience on the Two-Dimensional Grid up to Polylogarithmic Factors.

[BibT_eX]

[DOI]

CoRR, 2017

Approximately Sampling Elements with Fixed Rank in Graded Posets.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

Coefficients and Roots of Peak Polynomials.

[BibT_eX]

[DOI]

Sara C. Billey