Ali Vakilian

Research Interests

Algorithmic Foundations of Machine Learning and Data Science. In particular:

• Algorithms for Massive Data: streaming, sketching, and sublinear-time algorithms
• Algorithms & ML: learning-augmented algorithms, randomized numerical linear algebra
• Trustworthy ML: algorithmic fairness, learning with strategic agents

As well as combinatorial optimization and approximation algorithms.

• Jun 2026
  Invited talk at the Leveraging Data for Performance with Theoretical Guarantees tutorial at COLT 2026.
• Jun 2026
  Co-organizing the Machine Learning for Algorithms workshop at STOC 2026.
• Jun 2026
  Invited talk at the Learning-augmented Algorithms: Theory and Applications (LATA) workshop at SIGMETRICS 2026.
• Apr 2026
  Honored to receive an NSF CAREER Award. Grateful to the National Science Foundation for this support.
• Sep 2025
  Released a preliminary survey, Fair Clustering: Concepts, Methods, and Algorithms. I also maintain the Algorithmic Fair Clustering Repository. Feedback is welcome.
• Aug 2025
  Co-organized the Workshop on Local Algorithms (WOLA). (videos)
• Aug 2025
  Joined Virginia Tech as an Assistant Professor.
• May 2024
  Long-term participant in the Sublinear Algorithms program at the Simons Institute at Berkeley.
• May 2024
  “Learning-Based Graph Searching Problems” received the Outstanding Student Paper Highlight Award at AISTATS 2024.

Teaching & Mentorship

• Courses
  • CS 6104: Algorithms for Big Data (Virginia Tech, Fall 2025)
  • TTIC 31150 / CMSC 31150: Mathematical Toolkit (TTIC / UChicago, Spring 2023)
• Virginia Tech: Rojin Rezvan (Postdoc; Oct 2025 – )
• Interns at TTIC: Amir Azarmehr (PhD at Northeastern; 2025), Madhusudhan Pittu (PhD at CMU; 2023), Erasmo Tani (PhD at UChicago; 2023)
• Fatima Fellows (see the Fatima Fellow program): Sèdjro Hotegni (MS at African Institute for Mathematical Sciences—Rwanda; 2022)

1. 2026
2. Learning with Conflicts of Interest
   Nischal Aryal, Arash Termehchy, Ali Vakilian, Marianne Winslett.
   May 2026
3. Graph-Based Nearest-Neighbor Search without the Spread
   Jeff Giliberti, Sariel Har-Peled, Jonas Sauer, Ali Vakilian.
   February 2026
4. A Configuration-LP Framework for Connected k-Median Clustering
   Kushagra Chatterjee, Rojin Rezvan, Ali Vakilian.
   APPROX 2026
5. An Optimal Algorithm for Stochastic Vertex Cover
   Jan van den Brand, Inge Li Gørtz, Chirag Pabbaraju, Debmalya Panigrahi, Cliff Stein, Miltiadis Stouras, Ola Svensson, Ali Vakilian.
   STOC 2026
6. A Polynomial-Time Approximation for Pairwise Fair k-Median Clustering
   Sayan Bandyapadhyay, Eden Chlamtáč, Zachary Friggstad, Mahya Jamshidian, Yury Makarychev, Ali Vakilian.
   AISTATS 2026
7. Sublinear Metric Steiner Forest via Maximal Independent Set
   Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski, Ali Vakilian.
   SODA 2026
8. 2025
9. Fair Clustering: Concepts, Methods, and Algorithms [fair-clustering repository]
   Ali Vakilian.
   September 2025 · preliminary version; feedback welcome.
10. Max-Cut with Multiple Cardinality Constraints
    Yury Makarychev, Madhusudhan Pittu, Ali Vakilian.
    APPROX 2025
11. Streaming Algorithms for Network Design
    Chandra Chekuri, Rhea Jain, Sepideh Mahabadi, Ali Vakilian.
    APPROX 2025
12. New and Improved Bounds for Markov Paging
    Chirag Pabbaraju, Ali Vakilian.
    ICALP 2025
13. Guessing Efficiently for Constrained Subspace Approximation
    Aditya Bhaskara, Sepideh Mahabadi, Madhusudhan Pittu, Ali Vakilian, David Woodruff.
    ICALP 2025
14. Minimax Group Fairness in Strategic Classification
    Emily Diana, Saeed Sharifi-Malvajerdi, Ali Vakilian.
    SaTML 2025
15. Learning-Augmented Streaming Algorithms for Approximating Max-Cut
    Yinhao Dong, Pan Peng, Ali Vakilian.
    ITCS 2025
16. Sublinear Metric Steiner Tree via Improved Bounds for Set Cover
    Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski, Ali Vakilian.
    ITCS 2025
17. 2024
18. Bayesian Strategic Classification
    Lee Cohen, Saeed Sharifi-Malvajerdi, Kevin Stangl, Ali Vakilian, Juba Ziani.
    NeurIPS 2024
19. On Socially Fair Low-Rank Approximation and Column Subset Selection
    Zhao Song, Ali Vakilian, David Woodruff, Samson Zhou.
    NeurIPS 2024
20. Streaming Algorithms for Connectivity Augmentation
    Ce Jin, Michael Kapralov, Sepideh Mahabadi, Ali Vakilian.
    ICALP 2024
21. Learning-Based Algorithms for Graph Searching Problems [code]
    Adela DePavia, Erasmo Tani, Ali Vakilian.
    AISTATS 2024; selected for Oral presentation Outstanding Student Paper Highlight Award (7 of 547 accepted papers)
22. Scalable Algorithms for Individual Preference Stable Clustering
    Ron Mosenzon, Ali Vakilian.
    AISTATS 2024
23. 2023
24. Constant Approximation for Individual Preference Stable Clustering
    Anders Aamand, Justin Chen, Allen Liu, Sandeep Silwal, Pattara Sukprasert, Ali Vakilian, Fred Zhang.
    NeurIPS 2023; selected for Spotlight presentation
25. Improved Frequency Estimation Algorithms with and without Predictions
    Anders Aamand, Justin Chen, Huy Nguyen, Sandeep Silwal, Ali Vakilian.
    NeurIPS 2023; selected for Spotlight presentation
26. Tight Bounds for Volumetric Spanners and Applications
    Aditya Bhaskara, Sepideh Mahabadi, Ali Vakilian.
    NeurIPS 2023
27. Approximating Red-Blue Set Cover
    Eden Chlamtáč, Yury Makarychev, Ali Vakilian.
    APPROX 2023
28. Sequential Strategic Screening
    Lee Cohen, Saeed Sharifi-Malvajerdi, Kevin Stangl, Ali Vakilian, Juba Ziani.
    ICML 2023
29. Approximation Algorithms for Fair Range Clustering
    Sèdjro Hotegni, Sepideh Mahabadi, Ali Vakilian.
    ICML 2023
30. Learning the Positions in CountSketch [code]
    Yi Li, Honghao Lin, Simin Liu, Ali Vakilian, David Woodruff.
    ICLR 2023; selected as Notable top-25% paper
31. 2022
32. Individual Preference Stability for Clustering [code]
    Saba Ahmadi, Pranjal Awasthi, Samir Khuller, Matthäus Kleindessner, Jamie Morgenstern, Pattara Sukprasert, Ali Vakilian.
    ICML 2022; selected for Long presentation
33. Faster Fundamental Graph Algorithms via Learned Predictions
    Justin Chen, Sandeep Silwal, Ali Vakilian, Fred Zhang.
    ICML 2022
34. Multi Stage Screening: Enforcing Fairness and Maximizing Efficiency in a Pre-Existing Pipeline
    Avrim Blum, Kevin Stangl, Ali Vakilian.
    FAccT 2022
35. Fair Representation Clustering with Several Protected Classes
    Zhen Dai, Yury Makarychev, Ali Vakilian.
    FAccT 2022
36. Improved Approximation Algorithms for Individually Fair Clustering
    Ali Vakilian, Mustafa Yalçıner.
    AISTATS 2022
37. Approximating Fair Clustering with Cascaded Norm Objectives
    Eden Chlamtáč, Yury Makarychev, Ali Vakilian.
    SODA 2022
38. 2021
39. Approximation Algorithms for Socially Fair Clustering
    Yury Makarychev, Ali Vakilian.
    COLT 2021
40. Learning Online Algorithms with Distributional Advice
    Ilias Diakonikolas, Vasilis Kontonis, Christos Tzamos, Ali Vakilian, Nikos Zarifis.
    ICML 2021
41. Node-weighted Network Design in Planar and Minor-closed Families of Graphs
    Chandra Chekuri, Alina Ene, Ali Vakilian.
    Transactions on Algorithms (TALG) 2021 · builds upon our ICALP 2012 paper; extends to element-connectivity requirements.
42. 2020
43. Individual Fairness for k-Clustering
    Sepideh Mahabadi, Ali Vakilian.
    ICML 2020
44. Improved Local Computation Algorithm for Set Cover via Sparsification
    Christoph Grunau, Slobodan Mitrović, Ronitt Rubinfeld, Ali Vakilian.
    SODA 2020
45. (Learned) Frequency Estimation Algorithms under Zipfian Distribution
    Anders Aamand, Piotr Indyk, Ali Vakilian.
    February 2020
46. 2019
47. Learning-Based Low-Rank Approximations
    Piotr Indyk, Ali Vakilian, Yang Yuan.
    NeurIPS 2019
48. Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class
    Erik Demaine, Timothy Goodrich, Kyle Kloster, Brian Lavallee, Quanquan Liu, Blair Sullivan, Ali Vakilian, Andrew van der Poel.
    ESA 2019
49. Sample-Optimal Low-Rank Approximation of Distance Matrices
    Piotr Indyk, Ali Vakilian, Tal Wagner, David Woodruff.
    COLT 2019
50. Scalable Fair Clustering
    Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, Tal Wagner.
    ICML 2019
51. Tight Trade-offs for Maximum k-Coverage Problem in the General Streaming Model
    Piotr Indyk, Ali Vakilian.
    PODS 2019
52. Learning-Based Frequency Estimation Algorithms [website] [code] [MIT News] [Forbes]
    Chen-Yu Hsu, Piotr Indyk, Dina Katabi, Ali Vakilian.
    ICLR 2019
53. Local Computation Algorithms for Spanners
    Merav Parter, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee.
    ITCS 2019
54. New Directions in Streaming Algorithms [DSpace@MIT]
    Ali Vakilian.
    Ph.D. Thesis, MIT EECS
55. 2018
56. Set Cover in Sub-linear Time
    Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee.
    SODA 2018
57. Approximation Algorithms for Nearly H-Minor-Free Graphs
    Erik Demaine, Quanquan Liu, Ali Vakilian.
    November 2018
58. Cost-Effective Conceptual Design Using Taxonomies
    Ali Vakilian, Yodsawalai Chodpathumwan, Arash Termehchy, Amir Nayyeri.
    VLDB Journal 2018
59. 2017
60. Fractional Set Cover in the Streaming Model
    Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Jonathan Ullman, Ali Vakilian, Anak Yodpinyanee.
    APPROX 2017
61. Cost-Effective Conceptual Design Over Taxonomies
    Ali Vakilian, Yodsawalai Chodpathumwan, Arash Termehchy, Amir Nayyeri.
    WebDB 2017
62. 2016
63. Towards Tight Bounds for the Streaming Set Cover Problem
    Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian.
    PODS 2016
64. 2015
65. Cost-Effective Database Design For Information Extraction Applications
    Arash Termehchy, Ali Vakilian, Yodsawalai Chodpathumwan, Marianne Winslett.
    Transactions on Database Systems (TODS) 2015
66. 2014
67. On Streaming and Communication Complexity of The Set Cover Problem
    Erik Demaine, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian.
    DISC 2014
68. Which Concepts are Worth Extracting?
    Arash Termehchy, Ali Vakilian, Yodsawalai Chodpathumwan, Marianne Winslett.
    SIGMOD 2014
69. Improved Approximation Algorithms for Degree-bounded Network Design Problems with Node Connectivity Requirements
    Alina Ene, Ali Vakilian.
    STOC 2014
70. 2013
71. Connected Domatic Packing in Node-capacitated Graphs
    Alina Ene, Nitish Korula, Ali Vakilian.
    July 2013
72. Node-Weighted Prize-Collecting Survivable Network Design Problems [IDEALS@UIUC]
    Ali Vakilian.
    M.S. Thesis, UIUC CS
73. 2012
74. Prize-collecting Survivable Network Design in Node-weighted Graphs
    Chandra Chekuri, Alina Ene, Ali Vakilian.
    APPROX 2012
75. Node-weighted Network Design in Planar and Minor-closed Families of Graphs
    Chandra Chekuri, Alina Ene, Ali Vakilian.
    ICALP 2012

• Streaming Algorithms for Connectivity Augmentation Problems
  • Simons Institute at Berkeley, Extroverted Sublinear Algorithms Workshop (6/20/24)
• Algorithms for Socially Fair Clustering: Min-Max Fairness to Cascaded Norms
  • MIT, A&C Seminar (12/6/23)
  • UW Seattle, Theory Seminar (11/13/23)
  • INFORMS Annual Meeting (10/15/23)
  • UT Austin, Theory Seminar (10/6/23)
  • Stanford, Algorithmic Fairness Seminar (10/2/23)
• Learning-Augmented Algorithms for Massive Data
  • INFORMS Annual Meeting (10/18/23)
• Tight Bounds for Volumetric Spanners in All Norms
  • Simons Institute at Berkeley, Sketching and Algorithm Design Workshop (10/11/23)
• Individual Preference Stability for Clustering
  • TRIPODS Postdoc Workshop (8/22/23)
  • Research at TTIC (2/24/23)
• Graph Algorithms with Learned Duals
  • “Scheduling” Seminar at Schloss Dagstuhl (2/9/23)

Copyright Notice

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.