Nisheeth K. Vishnoi
Affiliations: Yale University
 Microsoft Research
According to our database^{1},
Nisheeth K. Vishnoi
authored at least 123 papers
between 2002 and 2022.
Collaborative distances:
Collaborative distances:
Awards
ACM Fellow
ACM Fellow 2019, "For contributions to theoretical computer science and its connections with mathematics, sciences, and social sciences".
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on orcid.org
On csauthors.net:
Bibliography
2022
Iteratively reweighted least squares and slime mold dynamics: connection and convergence.
Math. Program., 2022
Faster Sampling from LogConcave Distributions over Polytopes via a SoftThreshold Dikin Walk.
CoRR, 2022
Proceedings of the International Conference on Machine Learning, 2022
Selection in the Presence of Implicit Bias: The Advantage of Intersectional Constraints.
Proceedings of the FAccT '22: 2022 ACM Conference on Fairness, Accountability, and Transparency, Seoul, Republic of Korea, June 21, 2022
Proceedings of the FAccT '22: 2022 ACM Conference on Fairness, Accountability, and Transparency, Seoul, Republic of Korea, June 21, 2022
Proceedings of the Conference on Learning Theory, 25 July 2022, London, UK., 2022
2021
On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes).
SIAM J. Discret. Math., 2021
SIAM J. Comput., 2021
Sampling from LogConcave Distributions with InfinityDistance Guarantees and Applications to Differentially Private Optimization.
CoRR, 2021
CoRR, 2021
CoRR, 2021
Greedy adversarial equilibrium: an efficient alternative to nonconvexnonconcave minmax optimization.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021
Sampling matrices from HarishChandraItzyksonZuber densities with applications to Quantum inference and differential privacy.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021
Fair Classification with Noisy Protected Attributes: A Framework with Provable Guarantees.
Proceedings of the 38th International Conference on Machine Learning, 2021
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021
Proceedings of the FAccT '21: 2021 ACM Conference on Fairness, 2021
2020
SIAM J. Comput., 2020
A PolynomialTime Algorithm and Applications for Matrix Sampling from HarishChandraItzyksonZuber Densities.
CoRR, 2020
On the Computability of Continuous Maximum Entropy Distributions: Adjoint Orbits of Lie Groups.
CoRR, 2020
A Provably Convergent and Practical Algorithm for Minmax Optimization with Applications to GANs.
CoRR, 2020
A Secondorder Equilibrium in NonconvexNonconcave Minmax Optimization: Existence and Algorithm.
CoRR, 2020
CoRR, 2020
On the computability of continuous maximum entropy distributions with applications.
Proceedings of the Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020
Coresets for clustering in Euclidean spaces: importance sampling is nearly optimal.
Proceedings of the Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020
Proceedings of the 37th International Conference on Machine Learning, 2020
Proceedings of the FAT* '20: Conference on Fairness, 2020
2019
IEEE Trans. Inf. Theory, 2019
CoRR, 2019
Faster algorithms for polytope rounding, sampling, and volume computation via a sublinear "Ball Walk".
CoRR, 2019
CoRR, 2019
Commun. ACM, 2019
AI Commun., 2019
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019
Proceedings of the 36th International Conference on Machine Learning, 2019
Proceedings of the 36th International Conference on Machine Learning, 2019
Faster Polytope Rounding, Sampling, and Volume Computation via a SubLinear Ball Walk.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019
Proceedings of the Conference on Fairness, Accountability, and Transparency, 2019
Classification with Fairness Constraints: A MetaAlgorithm with Provable Guarantees.
Proceedings of the Conference on Fairness, Accountability, and Transparency, 2019
Proceedings of the Conference on Learning Theory, 2019
Proceedings of the Conference on Learning Theory, 2019
2018
Geodesic Convex Optimization: Differentiation on Manifolds, Geodesics, and Convexity.
CoRR, 2018
CoRR, 2018
CoRR, 2018
CoRR, 2018
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018
Proceedings of the TwentySeventh International Joint Conference on Artificial Intelligence, 2018
Proceedings of the TwentySeventh International Joint Conference on Artificial Intelligence, 2018
Proceedings of the 35th International Conference on Machine Learning, 2018
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
Proceedings of the Conference On Learning Theory, 2018
Proceedings of the Approximation, 2018
2017
Electron. Colloquium Comput. Complex., 2017
CoRR, 2017
CoRR, 2017
CoRR, 2017
CoRR, 2017
CoRR, 2017
Proceedings of the Web and Internet Economics  13th International Conference, 2017
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017
Proceedings of the Approximation, 2017
2016
Oper. Res. Lett., 2016
Dagstuhl Reports, 2016
CoRR, 2016
CoRR, 2016
CoRR, 2016
Proceedings of the TwentySeventh Annual ACMSIAM Symposium on Discrete Algorithms, 2016
Proceedings of the TwentySeventh Annual ACMSIAM Symposium on Discrete Algorithms, 2016
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
Proceedings of the 31st Conference on Computational Complexity, 2016
2015
The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of NegativeType Metrics into ℓ<sub>1</sub>.
J. ACM, 2015
CoRR, 2015
Proceedings of the TwentySixth Annual ACMSIAM Symposium on Discrete Algorithms, 2015
2014
SIAM J. Comput., 2014
Found. Trends Theor. Comput. Sci., 2014
A quadratically tight partition bound for classical communication complexity and query complexity.
CoRR, 2014
Proceedings of the Symposium on Theory of Computing, 2014
2013
Found. Trends Theor. Comput. Sci., 2013
CoRR, 2013
CoRR, 2013
Proceedings of the TwentyFourth Annual ACMSIAM Symposium on Discrete Algorithms, 2013
Proceedings of the Innovations in Theoretical Computer Science, 2013
2012
PLoS Comput. Biol., 2012
A local spectral method for graphs: with applications to improving graph partitions and exploring data graphs locally.
J. Mach. Learn. Res., 2012
J. Comput. Biol., 2012
Approximating the exponential, the lanczos method and an Õ(<i>m</i>)time spectral algorithm for balanced separator.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012
2<sup>log1ε <i>n</i></sup> hardness for the closest vector problem with preprocessing.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012
2011
2<sup>log<sup>1έ</sup>n</sup> Hardness for Closest Vector Problem with Preprocessing.
Electron. Colloquium Comput. Complex., 2011
Approximating the Exponential, the Lanczos Method and an \tilde{O}(m)Time Spectral Algorithm for Balanced Separator
CoRR, 2011
CoRR, 2011
Comput. Complex., 2011
Towards an SDPbased Approach to Spectral Methods: A NearlyLinearTime Algorithm for Graph Partitioning and Decomposition.
Proceedings of the TwentySecond Annual ACMSIAM Symposium on Discrete Algorithms, 2011
Proceedings of the TwentySecond Annual ACMSIAM Symposium on Discrete Algorithms, 2011
Proceedings of the TwentySecond Annual ACMSIAM Symposium on Discrete Algorithms, 2011
Proceedings of the 24th IEEE Conference on Computer Vision and Pattern Recognition, 2011
2010
Proceedings of the Algorithm Theory, 2010
2009
Inf. Process. Lett., 2009
Electron. Colloquium Comput. Complex., 2009
Electron. Colloquium Comput. Complex., 2009
CoRR, 2009
CoRR, 2009
Comb., 2009
2008
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008
2007
The Impact of Noise on the Scaling of Collectives: The Nearest Neighbor Model [Extended Abstract].
Proceedings of the High Performance Computing, 2007
2006
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006
2005
Internet Math., 2005
Proceedings of the High Performance Computing, 2005
On the Fourier Spectrum of Symmetric Boolean Functions with Applications to Learning Symmetric Juntas.
Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 2005
2004
PhD thesis, 2004
Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004
2003
Proceedings of the Fourteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2003
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2003
Proceedings of the Discrete Random Walks, 2003
2002
Proceedings of the Thirteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2002