What we see depends on mainly what we look for.
– John Lubbock

Publications | CodePresentations

Coming up!

  • Mixed Integer Programming Workshop (MIP), July 15 – 18, 2019 MIT Sloan School of Management, Cambridge.
  • Simons Institute Real-Time Decision Making Reunion Workshop, June 2-5, 2019.
  • Global Privacy Summit, Washington DC, 2-3 May, 2019
  • AMS Sectional Meeting on Sparsity, Randomness and Optimization, University of Hawaii at Manoa, Honolulu, March 22-24, 2019.
  • Online Prediction and Fairness of Predictions, Middlevale Elementary School, Dekalb County, March 7, 2019.

Past talks:

  • Individual Fairness in Hindsight, ITA Workshop, UC San Diego, February 14/15, 2019.
  • Convex Minimization over Submodular Polytopes, CORE Research Seminar, February 4, 2019.
  • Panel on Policing, Microtargeting and the Right to Reasonable Algorithmic Inferences, at the CPDP February 1, 2019. (slides)
  • FOCUS Scholars 2019 (Georgia Tech) on Algorithmic Fairness, January 18, 2019.
  • Simons Institute Bridging Discrete and Continuous Optimization Reunion Workshop, on Limited Memory Kelley’s Method, December 12th, 2018.
  • NeurIPS 2018:
    • Limited Memory Kelley’s Method Converges Linearly for Composite Objectives (spotlight), 3:30-5:00 PM, November 6th (presenter: Madeleine Udell).
    • Temporal Aspects of Individual Fairness, Workshop on Ethics, Social and Governance Issues in AI, 2018, November 7th.
    • Fairness in the Face of Uncertainty, Workshop on Ethics, Social and Governance Issues in AI, 2018 (presenter: Michael Wang), November 7th.
  • INFORMS 2018:
    • Fairness Metrics in Facility Location Problems, in Fairness in Operations Research Session (organized by John Silberholz and I), @INFORMS Annual Meeting, WD09, November 7, 3:20 – 4:50 PM (presenter: Gireeja Ranade).
    • On Low-Rank Quasi-Convex Minimization for Combinatorial Problems, in INFORMS Annual Meeting, TB20, November 6, 11:30 AM – 11:50 AM (presenter: Orestis Papadigenopoulos).
    • Limited Memory Kelley’s Method Converges for Composite Convex and Submodular Objectives – INFORMS Annual Meeting, SD26, November 4, 4:30 – 6 PM, in INFORMS Undergraduate Research Competition (presenter: Sam Zhou).
  • Bregman Projections on Submodular Base Polytopes, in Optimization for Machine Learning Workshop at NIPS , December 10, 2016 (Barcelona, Spain). (poster)
  • INFORMS, November 13- 16, 2016 (Nashville, USA).
    • Learning Combinatorial Structures on Sunday 13 November, 8 – 9:30 AM, SA12, 104B-MCC.
    • An Efficient Algorithm for Dynamic Pricing using a Graphical Representation, on Tuesday 15 November, 8:00-9:30 AM, TA88, Broadway B-Omni. (Finalist for Service Science Section Student Paper Competition!)
  • Learning Combinatorial Structures, Cornell ORIE Workshop on Data-Driven Decision Making, Ithaca, NY, 14-15 October 2016.
  • Solving Combinatorial Games using Products, Projections and Lexicographically Optimal Bases, at Google Research, New York, April 14, 2016.
  • Solving Combinatorial Games using Products, Projections and Lexicographically Optimal Bases, at the DBLab (CSE), Boston University, March 3, 2016.
  • Learning Faster Combinatorial Structures, EECS Research Support Dinner at MIT,  on “Machine Learning Theory and Applications”, February 16, 2016.
  • Games People (Could not) Play, OPT-ML Reading group at MIT, November 2, 2015.
  • INFORMS, November 1 – 4, 2015 (Philadelphia, USA).
    • Winter is Coming: A Robust Optimization Approach to Inventory Routing, November 1, 8:00-9:30 AM.
    • (co-author in) Tutorial by Georgia Perakis: How Analytics can Impact Promotion Pricing,  November 1, 11:00-12:30 PM.
    • Games People (could not) Play, November 1, 1:30-3:00 PM.
    • Dynamic Pricing Through Combinatorial Methods, November 1, 4:30-6:00 PM.
  • Games people (could not) play, at the LIDS student conference at MIT, January 2015.
  • At INFORMS, November 2014 (San Francisco, USA).
    • Games people (could not) play (abstract)
    • When dynamic pricing meets graph theory (abstract),
    • (Co-author in)  Many heuristics are better that one: A data driven approach to MAX-CUT (presented by John and Iain, abstract),
    • (Co-author in) A tractable approach to robust inventory routing (presented by Joel, abstract).
  • Discrete Online TSP (abstract), at INFORMS 2013, November 2013 (Minnesota, USA).
  • An Analytics Approach to Heuristic Selection, at the Informal Student Research Seminar, Operations Research Center. January 2013 (Cambridge, USA) [Slides]
  • Towards a 4/3 approximation for the metric Traveling Salesman Problem, at the Operations Research Center Alumni Day, MIT. October 2011 (Cambridge, USA) [Poster]
  • Short Tours for Traveling Salesman Problem, at the Grace Hopper Celebration India. December 2010 (Bangalore, India) [Poster]
  • SPAN: A Unified Framework and Toolkit for Querying Heterogeneous Access Policies, at the 4th USENIX Workshop on Hot Topics in Security (HOTSEC). August 2009 (Montreal, Canada) [Slides]