I’m extremely fortunate to work with many fantastic collaborators and students, without whom this work would not have been possible.
Publications
You can browse my publications below, or filter them by topic using the chips. (The topic filter is currently approximate.)
All
Societal Impact
Optimization
Discrete Optimization
Continuous Optimization
ML / AI
Learning
Quantum
Hardware & GPUs
Districting
Energy
Admissions & Hiring
Law
Healthcare
Misc
*Note that some journal papers that also have a preliminary conference version are noted with the number mentioned in parenthesis, e.g., (35J).
| Working Papers: | ||||
| Index. | Title | Venue | Area | Notes |
| • | Alignment and Misalignment of Fairness Constraints in Real-World Candidate-Job Matchings – with Trapp, Vasconcellos | working paper | fairness, matching markets | |
| • | Learning Customer Value from Heterogeneous Signals: A Bandit Approach for Mixed Fidelity Learning with Costs – with Duval, Pollack | working paper | bandits, mixed-fidelity learning | |
| • | Adaptive Cost-Aware Stochastic Optimization with Heterogeneous Gradient Oracles – with Li | working paper | stochastic optimization | |
| • | Fair Hierarchical Facility Location Problem – with Moondra, Singh | working paper | fair facility location | |
| • | Uncertainty-Aware Methods for Organ Allocation – with Pollack, Daillak, Toner, Uygun, Yeh | working paper | healthcare, decisions under uncertainty | |
| Papers under review: | ||||
| Title | Venue | Area | Notes | |
| 52 | Why Global LLM Leaderboards Are Misleading: Small Portfolios for Heterogeneous Supervised ML – with Moondra, Chughtai, Lanka | under review | heterogeneous ML, LLMs, rankings, portfolios | arXiv |
| 51 | Faster Parametric Submodular Function Minimization using Duality – with Zhu | under review | optimization | arXiv |
| 50 | Improved Regret Guarantees for Online Mirror Descent using a Portfolio of Mirror Maps – with Moondra, Singh | under review | optimization, learning | arXiv |
| 49 | Provably Small Portfolios for Multiobjective Optimization with Application to Subsidized Facility Location – with Moondra, Singh | under review | approximation algorithms | arXiv |
| (35J) | Discovering Opportunities in New York City’s Discovery Program: an Analysis of Affirmative Action Mechanisms with Faenza, Zhang | Major revision, Operations Research | reliable and incentive compatible mechanism design | arXiv |
| (19J) | Walking in the Shadow: A New Perspective on Descent Directions for Constrained Minimization with Mortagy, Pokutta | Major revision at Mathematics of Operations Research | continuous optimization | arXiv |
| Published (or Forthcoming) papers: | ||||
| Title | Venue | Area | Notes | |
| 48 | Many Preferences, Few Policies: Towards Scalable Language Model Personalization – with Kim, Moondra, Nahavandi, Perrault, Tambe | Workshop on the Scientific Understanding of Foundation Models 2026 (at Conference on Language Modeling 2026) | personalization, LLMs | arXiv |
| (37J) | Reducing the Filtering Effect in Public School Admissions: A Bias-aware Analysis for Targeted Interventions with Faenza, Vuorinen, Zhang | Manufacturing and Service Operations Management (M&SOM) 2026 (forthcoming) | social impact, admissions | arXiv |
| 47 | Promise of Graph Sparsification and Decomposition for Noise Reduction in QAOA: Analysis for Trapped-Ion Compilations – with Moondra, Mohler, Lotshaw | Quantum 2026 | quantum and classical computing | arXiv |
| (41J) | Balancing Notions of Equity: Trade-offs Between Fair Portfolio Sizes and Achievable Guarantees – with Moondra, Singh | Mathematical Programming 2026 | approximation algorithms | arXiv |
| 46 | Comparison of Hyperplane Rounding for Max-Cut and Quantum Approximate Optimization Algorithm over Certain Regular Graph Families – with Tate | Operations Research Letters 2026 | quantum and classical computing | link |
| 45 | Navigating the Social Welfare Frontier: Portfolios for Multi-objective Reinforcement Learning – with Woo Kim, Moondra, Verma, Pollack, Kong, Tambe | ICML 2025 (acceptance rate: 26.9%) | reinforcement learning, multicriteria objectives | arXiv |
| (25J) | Algorithmic Challenges in Ensuring Fairness at the Time of Decision with Salem and Kamble | Operations Research 2025 | trustworthy learning, pricing | arXiv |
44 | Improving Clinical Decision Support through Interpretable Machine Learning and Error Correction in Electronic Health Records – with Arora, Mortagy, Dwarshius, Wang, Yang, Holder, Kamaleswaran | Journal of the American Medical Informatics Association (JAMIA) 2025 (impact factor: 7.942 in 2021) | healthcare | arXiv |
| 43 | Allocating wildfire resilience investments for power grids: The curse of aggregation and vulnerability indices – with Pollack, Piansky and Molzahn | Applied Energy 2025 (impact factor: 13.1 in 2023) | power systems, wildfire, sustainability | arXiv |
| 42 | Fair and Reliable Reconnections for Temporary Disruptions in Electric Distribution Networks using Submodularity – with Hettle and Molzahn | INFORMS Journal on Computing 2025 (impact factor 2023: 2.3) | power systems, optimization, approximation | arXiv | github |
| 41 | Balancing Notions of Equity: Trade-offs Between Fair Portfolio Sizes and Achievable Guarantees – with Moondra, Singh | SODA 2025 (acceptance rate: 29.3%) | multi-criteria approximation algorithms | arXiv |
| 40 | Quantum Optimization: Potential, Challenges, and the Path Forward – with 40+ authors | Nature Reviews Physics 2024 (impact factor: 44.8) | quantum optimization | arXiv, nature |
| 39 | TACOS: Topology-Aware Collective Algorithm Synthesizer for Distributed Machine Learning with Won, Elavazhagan, Srinivasan, Krishna | MICRO 2024 (acceptance rate: 22%) | machine learning, optimization, accelerators | arXiv |
| 38 | Sequential Sampling for Functional Estimation via SIEVE, with Benevento, Pacella and Paynabar | Quality and Reliability Engineering International 2024 (impact factor: 2.2 in 2023) | function estimation | link |
| (21J) | Secretary Problems with Biased Evaluations using Partial Ordinal Information with Salem | Management Science 2023 (impact factor: 4.6 in 2023) | reliable and robust secretary problems | paper |
| 37 | Reducing the Filtering Effect in Public School Admissions: A Bias-aware Analysis for Targeted Interventions with Faenza and Zhang | SIAM Applied Computational and Discrete Algorithms (ACDA) 2023 | trustworthy admissions | arxiv |
| 36 | Which L_p norm is the fairest? Approximations for fair facility location across all “p” – with Moondra, Singh | ACM Economics and Computation (EC) 2023 (acceptance rate: 28%) | multi-criteria optimization, approximation | arxiv |
| 35 | Discovering Opportunities in New York City’s Discovery Program: an Analysis of Affirmative Action Mechanisms with Faenza, Zhang | ACM Economics and Computation (EC) 2023 (acceptance rate: 28%) | reliable and incentive compatible mechanism design | arxiv |
| 34 | Using Algorithms to Tame Discrimination – with Desai, Salem | UC Davis Law Review, 2023 | law, trustworthy and robust algorithms | ssrn |
| 33 | Classically-inspired Mixers for QAOA Beat Goemans-Williamson’s Max-Cut at Low Circuit Depths, with Tate, Moondra, Gard, Mohler | Quantum 2023 (impact factor: 6.77) | quantum, optimization | arxiv |
| 32 | Hardness and Approximation of Submodular Minimum Linear Ordering Problems, with Farhadi, Sun, Tetali, Wigal | Mathematical Programming 2023 (impact factor: 2.2) | submodularity, approximations | arxiv |
| 31 | Temporal Fairness in Online Decision-Making with Salem, Kamble | Ethics in Artificial Intelligence: Bias, Fairness and Beyond 2023 | trustworthy online learning | chapter |
| 30 | Electrical Flows over Spanning Trees with Khodabhaksh, Mortagy, Nikolova | Mathematical Programming B, 2022 (impact factor: 2.2) | power systems, optimization, approximation | link |
| 29 | Don’t let Ricci v. DeStefano Hold You Back: A Bias-Aware Legal Solution to the Hiring Paradox, with Salem and Desai | ACM FAccT 2022 | law, robustness, trustworthy | arxiv |
| 28 | Mathematically Quantifying Gerrymandering and Non-Responsiveness of the 2021 Georgia Congressional Districting Plan with Zhao, Hettle, Mattingly, Randall, and Herschlag | ACM EAAMO 2022 | trustworthiness, gerrymandering, sampling | arxiv |
| 27 | Generating Target Graph Couplings for QAOA from Native Quantum Hardware Couplings with Rajakumar, Moondra and Herold | Physical Review A, 2022 (impact factor: 2.6) | quantum, approximation, optimization | arxiv |
| 26 | Bridging Classical and Quantum using SDP initialized warm-starts for QAOA with Tate, Farhadi, Herold and Mohler | ACM Transactions of Quantum Computing, 2022 (impact factor: 3.7) | quantum, optimization, approximation | arxiv |
| 25 | Algorithmic Challenges in Ensuring Fairness at the Time of Decision with Salem and Kamble | Web and Internet Economics (WINE) 2022 | trustworthy learning, pricing | arxiv |
| (16J) | Individual Fairness in Hindsight with Kamble | Journal of Machine Learning Research, JMLR 2021 (impact factor: 4.3) | trustworthy online learning | arxiv |
| 24 | Reusing Combinatorial Structure: Faster Iterative Projections over Submodular Base Polytopes with Moondra, Mortagy | Neural Information Processing Systems (NeurIPS) 2021 | submodularity, machine learning, optimization | arxiv |
| 23 | Balanced Districting with Provable Compactness and Contiguity with Hettle, Zhu and Xie | Foundations of Responsible Computing, FORC 2021 | robust and reliable districting | arxiv, talk |
| 22 | Generating clusters for urban logistics in hyperconnected networks with Hettle, Faugere, Kwon, Montreuil | International Physical Internet Conference (IPIC) 2021 | districting, logistics | link |
| 21 | Closing the GAP: Mitigating Bias in Online Résumé-Filtering with Salem | Web and Internet Economics (WINE) 2020 | trustworthy and robust secretary problems | link |
| 20 | Group-Fair Online Allocation in Continuous Time with Cayci, Eryilmaz | Neural Information Processing Systems, NeurIPS 2020 | balancing online learning | arxiv |
| 19 | Walking in the Shadow: A New Perspective on Descent Directions for Constrained Minimization with Mortagy, Pokutta | Neural Information Processing Systems, NeurIPS 2020 | optimization, continuous, discrete | arxiv |
| 18 | An Efficient Algorithm for Dynamic Pricing using a Graphical Representation with Cohen, Kalas and Perakis | Production and Operations Management (POMS) 2020 | pricing, approximation | link |
| 17 | Too many fairness metrics: Is there a solution? with Jalan, Ranade, Yang, Zhuang | Fields Institute Communication Series (conditionally accepted) and EDSC 2020 | balancing objectives, facility location, data analytics | ssrn |
| 16 | Individual Fairness in Hindsight with Kamble | ACM Economics and Computation (EC) 2019 (best paper candidate) | trustworthy learning | arxiv |
| 15 | Computational Comparison of Metaheuristics with Silberholz, Golden, Wang | Handbook of Metaheuristics, Springer, 2019 | heuristics, ML | chapter |
| 14 | Robust Look-ahead Three-phase Balancing of Uncertain Distribution Loads with Xie, Geng | Hawaii International Conference on System Sciences (HICSS) 2019 | power systems, robust optimization | link |
| 13 | Limited Memory Kelley’s Method Converges for Composite Convex and Submodular Objectives with Udell, Zhou | Neural Information Processing Systems, NeurIPS 2018 | optimization | paper |
| 12 | Fairness in Inventory Routing with Wang | NeurIPS Workshop on Ethical, Social and Governance Issues in AI 2018 | inventory routing, reliable service | link |
| 11 | A 4/3 approximation for TSP on cubic 3-edge-connected graph with Agarwal, Garg | Operations Research Letters, 2018 | approximation algorithms | paper |
| 10 | What works best when? A Framework for Systematic Heuristic Evaluation with Silberholz, Dunning | INFORMS Journal on Computing, 2018 | heuristics, ML | github |
| 9 | Newton’s Method for Parametric Submodular Function Minimization with Goemans, Jaillet | Integer Programming and Combinatorial Optimization (IPCO) 2017 | submodularity | link |
| 8 | Combinatorial Structure in Online and Convex Optimization | PhD Thesis, MIT 2017 | optimization, submodularity | thesis |
| 7 | Solving Combinatorial Games using Products, Projections and Lexicographically Optimal Bases with Goemans, Jaillet | NeurIPS Workshop on Optimization for ML, 2016 | submodularity, optimization | arxiv, video |
| 6 | The two-color Rado number for ax + by = (a+b)z with Rangan, Tripathi | Annals of Combinatorics, 2015 | combinatorics | link |
| 5 | Towards a 4/3-approximation for the Metric Traveling Salesman Problem | Master’s Thesis, IIT Delhi 2011 | approximation algorithms | |
| 4 | SPAN: A Unified Framework and Toolkit for Querying Heterogeneous Access Policies – with LeFevre, Prakash | Hot Topics in Security 2009 | security, networks | |
| Other Working Manuscripts: | ||||
| Title | Notes | Area | ||
| 3 | Strategies for running the QAOA at hundreds of qubits – with Augustino, Cain, Farhi, Gutmann, Ranard, Tang and Van Kirk | arxiv | quantum computing | |
| 2 | Robust Classifiers using Robust Feature Augmentation with Eykholt, Prakash, Rahmati, Vaishnavi, Zheng | arxiv | adversarial ML | |
| 1 | A Scalable Robust and Adaptive Optimization Approach to Inventory Routing with Tay, Bertsimas | optonline | inventory routing |
