pith. sign in

Matthew Fahrbach

Identifiers

  • name variant Matthew Fahrbach 0.60 · backfill

Papers (25)

  1. Accelerated Relax-and-Round for Concave Coverage Problems cs.DS · 2026 · author #1
  2. A Tight Lower Bound for the Approximation Guarantee of Higher-Order Singular Value Decomposition cs.DS · 2025 · author #1
  3. Fast Tensor Completion via Approximate Richardson Iteration cs.DS · 2025 · author #2
  4. PriorBoost: An Adaptive Algorithm for Learning from Aggregate Responses cs.LG · 2024 · author #2
  5. Greedy PIG: Adaptive Integrated Gradients cs.LG · 2023 · author #4
  6. Practical Performance Guarantees for Pipelined DNN Inference cs.LG · 2023 · author #2
  7. Unified Embedding: Battle-Tested Feature Representations for Web-Scale ML Systems cs.LG · 2023 · author #3
  8. Learning Rate Schedules in the Presence of Distribution Shift cs.LG · 2023 · author #1
  9. Approximately Optimal Core Shapes for Tensor Decompositions cs.DS · 2023 · author #2
  10. Sequential Attention for Feature Selection cs.LG · 2022 · author #4
  11. Subquadratic Kronecker Regression with Applications to Tensor Decomposition cs.DS · 2022 · author #1
  12. Fast Low-Rank Tensor Decomposition by Ridge Leverage Score Sampling cs.DS · 2021 · author #1
  13. Faster Graph Embeddings via Coarsening cs.LG · 2020 · author #1
  14. Edge-Weighted Online Bipartite Matching cs.DS · 2020 · author #1
  15. A Fast Minimum Degree Algorithm and Matching Lower Bound cs.DS · 2019 · author #2
  16. Slow Mixing of Glauber Dynamics for the Six-Vertex Model in the Ordered Phases cs.DS · 2019 · author #1
  17. Non-monotone Submodular Maximization with Nearly Optimal Adaptivity and Query Complexity cs.DS · 2018 · author #1
  18. Submodular Maximization with Nearly Optimal Approximation, Adaptivity and Query Complexity cs.DS · 2018 · author #1
  19. Graph Sketching Against Adaptive Adversaries Applied to the Minimum Degree Algorithm cs.DS · 2018 · author #1
  20. On Computing Min-Degree Elimination Orderings cs.DS · 2017 · author #1
  21. Analyzing Boltzmann Samplers for Bose-Einstein Condensates with Dirichlet Generating Functions cs.DS · 2017 · author #2
  22. Online Weighted Matching: Breaking the $\frac{1}{2}$ Barrier cs.DS · 2017 · author #1
  23. Nearly Tight Bounds for Sandpile Transience on the Grid cs.DS · 2017 · author #2
  24. Approximately Sampling Elements with Fixed Rank in Graded Posets cs.DS · 2016 · author #3
  25. Coefficients and roots of peak polynomials math.CO · 2014 · author #2

Mentions

  • 2502.09534 #2 · arxiv_oai · confidence 0.70 Matthew Fahrbach
  • 2508.06693 #1 · arxiv_oai · confidence 0.70 Matthew Fahrbach
  • 2305.12102 #3 · arxiv_oai · confidence 0.70 Matthew Fahrbach
  • 2303.15634 #1 · arxiv_oai · confidence 0.70 Matthew Fahrbach
  • 2302.03886 #2 · arxiv_oai · confidence 0.70 Matthew Fahrbach
  • 2209.14881 #4 · arxiv_oai · confidence 0.70 Matthew Fahrbach
  • 2007.02817 #1 · arxiv_oai · confidence 0.70 Matthew Fahrbach
  • 2311.03703 #2 · arxiv_oai · confidence 0.70 Matthew Fahrbach
  • 2005.01929 #1 · arxiv_oai · confidence 0.70 Matthew Fahrbach
  • 1410.8506 #2 · arxiv_oai · confidence 0.70 Matthew Fahrbach
  • 2402.04987 #2 · arxiv_oai · confidence 0.70 Matthew Fahrbach
  • 2311.06192 #4 · arxiv_oai · confidence 0.70 Matthew Fahrbach
  • 2209.04876 #1 · arxiv_oai · confidence 0.70 Matthew Fahrbach
  • 1907.12119 #2 · arxiv_oai · confidence 0.70 Matthew Fahrbach
  • 1808.06932 #1 · arxiv_oai · confidence 0.70 Matthew Fahrbach
  • 1807.07889 #1 · arxiv_oai · confidence 0.70 Matthew Fahrbach
  • 1804.04239 #1 · arxiv_oai · confidence 0.70 Matthew Fahrbach
  • 1708.02266 #2 · arxiv_oai · confidence 0.70 Matthew Fahrbach
  • 1704.04830 #2 · arxiv_oai · confidence 0.70 Matthew Fahrbach
  • 1611.03385 #3 · arxiv_oai · confidence 0.70 Matthew Fahrbach
  • 2107.10654 #1 · arxiv_oai · confidence 0.70 Matthew Fahrbach
  • 1904.01495 #1 · arxiv_oai · confidence 0.70 Matthew Fahrbach
  • 1704.05384 #1 · arxiv_oai · confidence 0.70 Matthew Fahrbach
  • 1711.08446 #1 · arxiv_oai · confidence 0.70 Matthew Fahrbach

Frequent Coauthors