Ilya Razenshteyn
Ilya Razenshteyn
Microsoft Research
Email verificata su mit.edu - Home page
Titolo
Citata da
Citata da
Anno
Practical and optimal LSH for angular distance
A Andoni, P Indyk, T Laarhoven, I Razenshteyn, L Schmidt
Advances in neural information processing systems, 1225-1233, 2015
2652015
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
2112015
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
1562014
Graph partitioning with natural cuts
D Delling, AV Goldberg, I Razenshteyn, RF Werneck
2011 IEEE International Parallel & Distributed Processing Symposium, 1135-1146, 2011
1272011
Adversarial examples from computational constraints
S Bubeck, YT Lee, E Price, I Razenshteyn
International Conference on Machine Learning, 831-840, 2019
892019
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
892017
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, 11292-11303, 2019
792019
Tight lower bounds for data-dependent locality-sensitive hashing
A Andoni, I Razenshteyn
arXiv preprint arXiv:1507.04299, 2015
462015
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
442016
Sketching and embedding are equivalent for norms
A Andoni, R Krauthgamer, I Razenshteyn
SIAM Journal on Computing 47 (3), 890-916, 2018
432018
Approximate nearest neighbor search in high dimensions
A Andoni, P Indyk, I Razenshteyn
arXiv preprint arXiv:1806.09823 7, 2018
412018
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
392012
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
352016
Lsh forest: Practical algorithms made theoretical
A Andoni, I Razenshteyn, NS Nosatzki
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
342017
On model-based RIP-1 matrices
P Indyk, I Razenshteyn
International Colloquium on Automata, Languages, and Programming, 564-575, 2013
242013
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
222017
An exact combinatorial algorithm for minimum graph bisection
D Delling, D Fleischman, AV Goldberg, I Razenshteyn, RF Werneck
Mathematical Programming 153 (2), 417-458, 2015
222015
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
202019
Restricted isometry property for general p-norms
Z Allen-Zhu, R Gelashvili, I Razenshteyn
IEEE Transactions on Information Theory 62 (10), 5839-5854, 2016
202016
High-dimensional similarity search and sketching: algorithms and hardness
I Razenshteyn
Massachusetts Institute of Technology, 2017
162017
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20