Ilya Razenshteyn
Ilya Razenshteyn
Microsoft Research
Verified email at mit.edu - Homepage
Title
Cited by
Cited by
Year
Practical and optimal LSH for angular distance
A Andoni, P Indyk, T Laarhoven, I Razenshteyn, L Schmidt
arXiv preprint arXiv:1509.02897, 2015
3902015
Optimal data-dependent hashing for approximate near neighbors
A Andoni, I Razenshteyn
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
2652015
Provably robust deep learning via adversarially trained smoothed classifiers
H Salman, G Yang, J Li, P Zhang, H Zhang, I Razenshteyn, S Bubeck
arXiv preprint arXiv:1906.04584, 2019
2332019
Beyond locality-sensitive hashing
A Andoni, P Indyk, HL Nguyễn, I Razenshteyn
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
2042014
Adversarial examples from computational constraints
S Bubeck, YT Lee, E Price, I Razenshteyn
International Conference on Machine Learning, 831-840, 2019
1572019
Graph partitioning with natural cuts
D Delling, AV Goldberg, I Razenshteyn, RF Werneck
2011 IEEE International Parallel & Distributed Processing Symposium, 1135-1146, 2011
1532011
Optimal hashing-based time-space trade-offs for approximate near neighbors
A Andoni, T Laarhoven, I Razenshteyn, E Waingarten
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
1242017
Approximate nearest neighbor search in high dimensions
A Andoni, P Indyk, I Razenshteyn
Proceedings of the International Congress of Mathematicians: Rio de Janeiro …, 2018
812018
Performance of Johnson-Lindenstrauss transform for k-means and k-medians clustering
K Makarychev, Y Makarychev, I Razenshteyn
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
632019
Weighted low rank approximations with provable guarantees
I Razenshteyn, Z Song, DP Woodruff
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
602016
Randomized smoothing of all shapes and sizes
G Yang, T Duan, JE Hu, H Salman, I Razenshteyn, J Li
International Conference on Machine Learning, 10693-10705, 2020
562020
Tight lower bounds for data-dependent locality-sensitive hashing
A Andoni, I Razenshteyn
arXiv preprint arXiv:1507.04299, 2015
522015
Sketching and embedding are equivalent for norms
A Andoni, R Krauthgamer, I Razenshteyn
SIAM Journal on Computing 47 (3), 890-916, 2018
462018
Lsh forest: Practical algorithms made theoretical
A Andoni, I Razenshteyn, NS Nosatzki
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
442017
Learning space partitions for nearest neighbor search
Y Dong, P Indyk, I Razenshteyn, T Wagner
arXiv preprint arXiv:1901.08544, 2019
412019
Exact combinatorial branch-and-bound for graph bisection
D Delling, AV Goldberg, I Razenshteyn, RF Werneck
2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and …, 2012
412012
On the complexity of inner product similarity join
TD Ahle, R Pagh, I Razenshteyn, F Silvestri
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2016
402016
{SANNS}: Scaling up secure approximate k-nearest neighbors search
H Chen, I Chillotti, Y Dong, O Poburinnaya, I Razenshteyn, MS Riazi
29th {USENIX} Security Symposium ({USENIX} Security 20), 2111-2128, 2020
372020
Approximate near neighbors for general symmetric norms
A Andoni, HL Nguyen, A Nikolov, I Razenshteyn, E Waingarten
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
322017
Adversarial examples from cryptographic pseudo-random generators
S Bubeck, YT Lee, E Price, I Razenshteyn
arXiv preprint arXiv:1811.06418, 2018
312018
The system can't perform the operation now. Try again later.
Articles 1–20