Ilya P. Razenshteyn

Publication Activity (10 Years)

Years Active: 2010-2023
Publications (10 Years): 48

Top Venues

CoRR

STOC

SODA

ICML

Massachusetts Institute of Technology, Cambridge, USA (PHD)

Education History

Massachusetts Institute of Technology, Cambridge, USA

PHD

Publications

Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner
Learning Space Partitions for Nearest Neighbor Search. IEEE Data Eng. Bull. 46 (3) (2023)
Meena Jagadeesan, Ilya P. Razenshteyn, Suriya Gunasekar
Inductive Bias of Multi-Channel Linear Convolutional Networks with Bounded Weight Norm. COLT (2022)
Meena Jagadeesan, Ilya P. Razenshteyn, Suriya Gunasekar
Inductive Bias of Multi-Channel Linear Convolutional Networks with Bounded Weight Norm. CoRR (2021)
Alexandr Andoni, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten
Approximate Nearest Neighbors Beyond Space Partitions. SODA (2021)
Hao Chen, Miran Kim, Ilya P. Razenshteyn, Dragos Rotaru, Yongsoo Song, Sameer Wagh
Maliciously Secure Matrix Multiplication with Applications to Private Deep Learning. ASIACRYPT (3) (2020)
Yihe Dong, Yu Gao, Richard Peng, Ilya P. Razenshteyn, Saurabh Sawlani
A Study of Performance of Optimal Transport. CoRR (2020)
Amir Zandieh, Navid Nouri, Ameya Velingker, Michael Kapralov, Ilya P. Razenshteyn
Scaling up Kernel Ridge Regression via Locality Sensitive Hashing. AISTATS (2020)
Greg Yang, Tony Duan, J. Edward Hu, Hadi Salman, Ilya P. Razenshteyn, Jerry Li
Randomized Smoothing of All Shapes and Sizes. CoRR (2020)
Hao Chen, Ilaria Chillotti, Yihe Dong, Oxana Poburinnaya, Ilya P. Razenshteyn, M. Sadegh Riazi
SANNS: Scaling Up Secure Approximate k-Nearest Neighbors Search. USENIX Security Symposium (2020)
Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner
Learning Space Partitions for Nearest Neighbor Search. ICLR (2020)
Michael Kapralov, Navid Nouri, Ilya P. Razenshteyn, Ameya Velingker, Amir Zandieh
Scaling up Kernel Ridge Regression via Locality Sensitive Hashing. CoRR (2020)
Hao Chen, Miran Kim, Ilya P. Razenshteyn, Dragos Rotaru, Yongsoo Song, Sameer Wagh
Maliciously Secure Matrix Multiplication with Applications to Private Deep Learning. IACR Cryptol. ePrint Arch. 2020 (2020)
Greg Yang, Tony Duan, J. Edward Hu, Hadi Salman, Ilya P. Razenshteyn, Jerry Li
Randomized Smoothing of All Shapes and Sizes. ICML (2020)
Sepideh Mahabadi, Ilya P. Razenshteyn, David P. Woodruff, Samson Zhou
Non-adaptive adaptive sampling on turnstile streams. STOC (2020)
Sepideh Mahabadi, Ilya P. Razenshteyn, David P. Woodruff, Samson Zhou
Non-Adaptive Adaptive Sampling on Turnstile Streams. CoRR (2020)
Arturs Backurs, Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner
Scalable Nearest Neighbor Search for Optimal Transport. ICML (2020)
Sébastien Bubeck, Yin Tat Lee, Eric Price, Ilya P. Razenshteyn
Adversarial examples from computational constraints. ICML (2019)
Hadi Salman, Jerry Li, Ilya P. Razenshteyn, Pengchuan Zhang, Huan Zhang, Sébastien Bubeck, Greg Yang
Provably Robust Deep Learning via Adversarially Trained Smoothed Classifiers. NeurIPS (2019)
Hao Chen, Ilaria Chillotti, Yihe Dong, Oxana Poburinnaya, Ilya P. Razenshteyn, M. Sadegh Riazi
SANNS: Scaling Up Secure Approximate k-Nearest Neighbors Search. IACR Cryptol. ePrint Arch. 2019 (2019)
Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner
Learning Sublinear-Time Indexing for Nearest Neighbor Search. CoRR (2019)
Hadi Salman, Greg Yang, Jerry Li, Pengchuan Zhang, Huan Zhang, Ilya P. Razenshteyn, Sébastien Bubeck
Provably Robust Deep Learning via Adversarially Trained Smoothed Classifiers. CoRR (2019)
Jerry Li, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten
On Mean Estimation for General Norms with Statistical Queries. COLT (2019)
Jerry Li, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten
On Mean Estimation for General Norms with Statistical Queries. CoRR (2019)
Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner
Scalable Nearest Neighbor Search for Optimal Transport. CoRR (2019)
Hao Chen, Ilaria Chillotti, Yihe Dong, Oxana Poburinnaya, Ilya P. Razenshteyn, M. Sadegh Riazi
SANNS: Scaling Up Secure Approximate k-Nearest Neighbors Search. CoRR (2019)
Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn
-medians clustering. STOC (2019)
Sepideh Mahabadi, Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn
Nonlinear Dimension Reduction via Outer Bi-Lipschitz Extensions. CoRR (2018)
Sepideh Mahabadi, Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn
Nonlinear dimension reduction via outer Bi-Lipschitz extensions. STOC (2018)
Sébastien Bubeck, Yin Tat Lee, Eric Price, Ilya P. Razenshteyn
Adversarial Examples from Cryptographic Pseudo-Random Generators. CoRR (2018)
Alexandr Andoni, Robert Krauthgamer, Ilya P. Razenshteyn
Sketching and Embedding are Equivalent for Norms. SIAM J. Comput. 47 (3) (2018)
Alexandr Andoni, Assaf Naor, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten
Data-dependent hashing via nonlinear spectral gaps. STOC (2018)
Alexandr Andoni, Assaf Naor, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten
Hölder Homeomorphisms and Approximate Nearest Neighbors. FOCS (2018)
Alexandr Andoni, Piotr Indyk, Ilya P. Razenshteyn
Approximate Nearest Neighbor Search in High Dimensions. CoRR (2018)
Sébastien Bubeck, Eric Price, Ilya P. Razenshteyn
Adversarial examples from computational constraints. CoRR (2018)
Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn
Performance of Johnson-Lindenstrauss Transform for k-Means and k-Medians Clustering. CoRR (2018)
Alexandr Andoni, Thijs Laarhoven, Ilya P. Razenshteyn, Erik Waingarten
Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors. SODA (2017)
Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner
Practical Data-Dependent Metric Compression with Provable Guarantees. NIPS (2017)
Alexandr Andoni, Ilya P. Razenshteyn, Negev Shekel Nosatzki
LSH Forest: Practical Algorithms Made Theoretical. SODA (2017)
Alexandr Andoni, Huy L. Nguyen, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten
Approximate near neighbors for general symmetric norms. STOC (2017)
Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner
Practical Data-Dependent Metric Compression with Provable Guarantees. CoRR (2017)
Ilya P. Razenshteyn, Zhao Song, David P. Woodruff
Weighted low rank approximations with provable guarantees. STOC (2016)
Thomas Dybdahl Ahle, Rasmus Pagh, Ilya P. Razenshteyn, Francesco Silvestri
On the Complexity of Inner Product Similarity Join. PODS (2016)
Alexandr Andoni, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten
Approximate Near Neighbors for General Symmetric Norms. CoRR (2016)
Zeyuan Allen Zhu, Rati Gelashvili, Ilya P. Razenshteyn
Restricted Isometry Property for General p-Norms. IEEE Trans. Inf. Theory 62 (10) (2016)
Alexandr Andoni, Ilya P. Razenshteyn
Tight Lower Bounds for Data-Dependent Locality-Sensitive Hashing. SoCG (2016)
Arturs Backurs, Piotr Indyk, Ilya P. Razenshteyn, David P. Woodruff
-median sketching. SODA (2016)
Alexandr Andoni, Thijs Laarhoven, Ilya P. Razenshteyn, Erik Waingarten
Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors. CoRR (2016)
Alexandr Andoni, Thijs Laarhoven, Ilya P. Razenshteyn, Erik Waingarten
Lower Bounds on Time-Space Trade-Offs for Approximate Near Neighbors. CoRR (2016)
Alexandr Andoni, Ilya P. Razenshteyn
Optimal Data-Dependent Hashing for Approximate Near Neighbors. STOC (2015)
Alexandr Andoni, Piotr Indyk, Thijs Laarhoven, Ilya P. Razenshteyn, Ludwig Schmidt
Practical and Optimal LSH for Angular Distance. NIPS (2015)
Silvio Lattanzi, Stefano Leonardi, Vahab S. Mirrokni, Ilya P. Razenshteyn
Robust Hierarchical k-Center Clustering. ITCS (2015)
Alexandr Andoni, Ilya P. Razenshteyn
Tight Lower Bounds for Data-Dependent Locality-Sensitive Hashing. CoRR (2015)
Daniel Delling, Daniel Fleischman, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato F. Werneck
An exact combinatorial algorithm for minimum graph bisection. Math. Program. 153 (2) (2015)
Arturs Backurs, Piotr Indyk, Eric Price, Ilya P. Razenshteyn, David P. Woodruff
Nearly-optimal bounds for sparse recovery in generic norms, with applications to $k$-median sketching. CoRR (2015)
Thomas D. Ahle, Rasmus Pagh, Ilya P. Razenshteyn, Francesco Silvestri
On the Complexity of Inner Product Similarity Join. CoRR (2015)
Alexandr Andoni, Piotr Indyk, Thijs Laarhoven, Ilya P. Razenshteyn, Ludwig Schmidt
Practical and Optimal LSH for Angular Distance. CoRR (2015)
Alexandr Andoni, Robert Krauthgamer, Ilya P. Razenshteyn
Sketching and Embedding are Equivalent for Norms. STOC (2015)
Alexandr Andoni, Ilya P. Razenshteyn
Optimal Data-Dependent Hashing for Approximate Near Neighbors. CoRR (2015)
Zeyuan Allen Zhu, Rati Gelashvili, Ilya P. Razenshteyn
Restricted Isometry Property for General p-Norms. SoCG (2015)
Alexandr Andoni, Piotr Indyk, Huy L. Nguyen, Ilya P. Razenshteyn
Beyond Locality-Sensitive Hashing. SODA (2014)
Zeyuan Allen Zhu, Rati Gelashvili, Ilya P. Razenshteyn
The Restricted Isometry Property for the General p-Norms. CoRR (2014)
Alexandr Andoni, Robert Krauthgamer, Ilya P. Razenshteyn
Sketching and Embedding are Equivalent for Norms. CoRR (2014)
Alexandr Andoni, Piotr Indyk, Huy L. Nguyen, Ilya P. Razenshteyn
Beyond Locality-Sensitive Hashing. CoRR (2013)
Andrew V. Goldberg, Ilya P. Razenshteyn, Ruslan Savchenko
Separating Hierarchical and General Hub Labelings. MFCS (2013)
Piotr Indyk, Ilya P. Razenshteyn
On Model-Based RIP-1 Matrices. ICALP (1) (2013)
Piotr Indyk, Ilya P. Razenshteyn
On Model-Based RIP-1 Matrices CoRR (2013)
Andrew V. Goldberg, Ilya P. Razenshteyn, Ruslan Savchenko
Separating Hierarchical and General Hub Labelings CoRR (2013)
Daniel Delling, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato Fonseca F. Werneck
Exact Combinatorial Branch-and-Bound for Graph Bisection. ALENEX (2012)
Ilya P. Razenshteyn
On Epsilon-Nets, Distance Oracles, and Metric Embeddings CoRR (2012)
Mikhail Andreev, Ilya P. Razenshteyn, Alexander Shen
Not every domain of a plain decompressor contains the domain of a prefix-free one. Theor. Comput. Sci. 412 (4-5) (2011)
Daniel Delling, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato Fonseca F. Werneck
Graph Partitioning with Natural Cuts. IPDPS (2011)
Ilya P. Razenshteyn
Common information revisited CoRR (2011)
Maxim A. Babenko, Ignat I. Kolesnichenko, Ilya P. Razenshteyn
A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks. SOFSEM (2010)
Mikhail Andreev, Ilya P. Razenshteyn, Alexander Shen
Not Every Domain of a Plain Decompressor Contains the Domain of a Prefix-Free One CoRR (2010)
Maxim A. Babenko, Alexey Gusakov, Ilya P. Razenshteyn
Triangle-Free 2-Matchings Revisited. Discret. Math. Algorithms Appl. 2 (4) (2010)
Maxim A. Babenko, Ignat I. Kolesnichenko, Ilya P. Razenshteyn
A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks CoRR (2010)
Maxim A. Babenko, Alexey Gusakov, Ilya P. Razenshteyn
Triangle-Free 2-Matchings Revisited. COCOON (2010)

Ilya P. Razenshteyn.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ilya P. Razenshteyn