Obserwuj
Ilya Razenshteyn
Ilya Razenshteyn
CipherMode Labs
Zweryfikowany adres z mit.edu - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Provably robust deep learning via adversarially trained smoothed classifiers
H Salman, J Li, I Razenshteyn, P Zhang, H Zhang, S Bubeck, G Yang
Advances in neural information processing systems 32, 2019
6232019
Practical and optimal LSH for angular distance
A Andoni, P Indyk, T Laarhoven, I Razenshteyn, L Schmidt
Advances in neural information processing systems 28, 2015
6202015
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
3732015
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
2712014
Adversarial examples from computational constraints
S Bubeck, YT Lee, E Price, I Razenshteyn
International Conference on Machine Learning, 831-840, 2019
2582019
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
2312020
Graph partitioning with natural cuts
D Delling, AV Goldberg, I Razenshteyn, RF Werneck
2011 IEEE International Parallel & Distributed Processing Symposium, 1135-1146, 2011
1792011
Approximate nearest neighbor search in high dimensions
A Andoni, P Indyk, I Razenshteyn
Proceedings of the International Congress of Mathematicians: Rio de Janeiro …, 2018
1772018
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
1662017
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
1582019
Learning space partitions for nearest neighbor search
Y Dong, P Indyk, I Razenshteyn, T Wagner
arXiv preprint arXiv:1901.08544, 2019
1082019
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
1042016
Maliciously secure matrix multiplication with applications to private deep learning
H Chen, M Kim, I Razenshteyn, D Rotaru, Y Song, S Wagh
Advances in Cryptology–ASIACRYPT 2020: 26th International Conference on the …, 2020
832020
{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
782020
Scalable nearest neighbor search for optimal transport
A Backurs, Y Dong, P Indyk, I Razenshteyn, T Wagner
International Conference on machine learning, 497-506, 2020
752020
Tight lower bounds for data-dependent locality-sensitive hashing
A Andoni, I Razenshteyn
arXiv preprint arXiv:1507.04299, 2015
612015
Sketching and embedding are equivalent for norms
A Andoni, R Krauthgamer, I Razenshteyn
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
562015
Lsh forest: Practical algorithms made theoretical
A Andoni, I Razenshteyn, NS Nosatzki
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
532017
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
492016
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
482012
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20