Swati Gupta

Orcid: 0000-0002-9566-3856

Affiliations:
  • MIT, Sloan School of Management, USA


According to our database1, Swati Gupta authored at least 27 papers between 2016 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Warm-Started QAOA with Custom Mixers Provably Converges and Computationally Beats Goemans-Williamson's Max-Cut at Low Circuit Depths.
Quantum, September, 2023

Balancing Notions of Equity: Approximation Algorithms for Fair Portfolio of Solutions in Combinatorial Optimization.
CoRR, 2023

Mixed-Integer Projections for Automated Data Correction of EMRs Improve Predictions of Sepsis among Hospitalized Patients.
CoRR, 2023

Which Lp norm is the fairest? Approximations for fair facility location across all "p".
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Discovering Opportunities in New York City's Discovery Program: Disadvantaged Students in Highly Competitive Markets.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

2022
Electrical flows over spanning trees.
Math. Program., 2022

Socially Fair and Hierarchical Facility Location Problems.
CoRR, 2022

Mathematically Quantifying Gerrymandering and the Non-responsiveness of the 2021 Georgia Congressional Districting Plan.
CoRR, 2022

Discovering Opportunities in New York City's Discovery Program: an Analysis of Affirmative Action Mechanisms.
CoRR, 2022

Algorithmic Challenges in Ensuring Fairness at the Time of Decision.
Proceedings of the Web and Internet Economics - 18th International Conference, 2022

Don't let Ricci v. DeStefano Hold You Back: A Bias-Aware Legal Solution to the Hiring Paradox.
Proceedings of the FAccT '22: 2022 ACM Conference on Fairness, Accountability, and Transparency, Seoul, Republic of Korea, June 21, 2022

Mathematically Quantifying Non-responsiveness of the 2021 Georgia Congressional Districting Plan.
Proceedings of the Equity and Access in Algorithms, Mechanisms, and Optimization, 2022

2021
Individual Fairness in Hindsight.
J. Mach. Learn. Res., 2021

Fair and Reliable Reconnections for Temporary Disruptions in Electric Distribution Networks using Submodularity.
CoRR, 2021

Taming Wild Price Fluctuations: Monotone Stochastic Convex Optimization with Bandit Feedback.
CoRR, 2021

Balanced Districting on Grid Graphs with Provable Compactness and Contiguity.
CoRR, 2021

Reusing Combinatorial Structure: Faster Iterative Projections over Submodular Base Polytopes.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
Generating Target Graph Couplings for QAOA from Native Quantum Hardware Couplings.
CoRR, 2020

Impact of Bias on School Admissions and Targeted Interventions.
CoRR, 2020

Closing the Gap: Mitigating Bias in Online Résumé-Filtering.
Proceedings of the Web and Internet Economics - 16th International Conference, 2020

Walking in the Shadow: A New Perspective on Descent Directions for Constrained Minimization.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Group-Fair Online Allocation in Continuous Time.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019
Robust Classification using Robust Feature Augmentation.
CoRR, 2019

2018
What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO.
INFORMS J. Comput., 2018

Temporal Aspects of Individual Fairness.
CoRR, 2018

2017
Discrete Newton's Algorithm for Parametric Submodular Function Minimization.
Proceedings of the Integer Programming and Combinatorial Optimization, 2017

2016
Solving Combinatorial Games using Products, Projections and Lexicographically Optimal Bases.
CoRR, 2016


  Loading...