Publications

2024

• Convex optimization with p-norm oracles

  Details PDF Video

• Acceleration Meets Inverse Maintenance:Faster Infinity-Regression

  Details PDF Video

• Decremental (1+epsilon)- Approximate Maximum Eigenvector: Dynamic Power Method

  Details PDF

2022

• Fast Algorithms for lp-norm Regression

  Details PDF Video

• Optimal Methods for Higher-Order Smooth Monotone Variational Inequalities

  Details PDF

2021

• Unifying Width-Reduced Methods for Quasi-Self-Concordant Optimization

  Details PDF

2020

• Almost-linear-time Weighted ℓp-norm Solvers in Slightly Dense Graphs via Sparsification

  Details PDF Video

2019

• Faster p-norm minimizing flows, via smoothed q-norm problems

  Details PDF

• Fast, Provably convergent IRLS Algorithm for p-norm Linear Regression

  Details PDF BibTeX Video Code

  @article{AdilPS19,author = {Deeksha Adil and Richard Peng and Sushant Sachdeva},
  title     = {Fast, Provably convergent {IRLS} Algorithm for p-norm Linear Regression},
  journal   = {CoRR},
  volume    = {abs/1907.07167},
  year= {2019},
  archivePrefix = {arXiv},
  eprint    = {1907.07167},
  timestamp = {Tue, 23 Jul 2019 10:54:22 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1907-07167},
  bibsource = {dblp computer science bibliography, https://dblp.org} }
  

• Iterative Refinement for lp-norm Regression

  Details PDF BibTeX

  @inproceedings{adil2019iterative,title={Iterative Refinement for lp-norm Regression},
  author={Adil, Deeksha and Kyng, Rasmus and Peng, Richard and Sachdeva, Sushant},
  booktitle={Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms},
  pages={1405–1424},
  year={2019},
  organization={SIAM}}
  

2018

• Parameterized algorithms for stable matching with ties and incomplete lists

  Details BibTeX

  @article{AdilGRSZ18, author    = {Deeksha Adil and Sushmita Gupta and Sanjukta Roy and Saket Saurabh and Meirav Zehavi},
  title     = {Parameterized algorithms for stable matching with ties and incomplete lists},
  journal   = {Theor. Comput. Sci.},
  volume= {723},
  pages     = {1–10},
  year      = {2018},
  url       = {https://doi.org/10.1016/j.tcs.2018.03.015},
  doi       = {10.1016/j.tcs.2018.03.015},
  timestamp = {Wed, 04 Apr 2018 15:21:59 +0200}}