Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Provably Robust Deep Learning via Adversarially Trained Smoothed Classifiers.

H. Salman, J. Li, I. Razenshteyn, P. Zhang, H. Zhang, S. Bubeck, and G. Yang. NeurIPS, page 11289-11300. (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Katja Ilyashava

Maxim Ilyasov

Rimma Ilyasova

Ilya Christoffel

Ilya Pavlyukevich

Other publications of authors with the same name

Performance of Johnson-Lindenstrauss Transform for k-Means and k-Medians Clustering.K. Makarychev, Y. Makarychev, and I. Razenshteyn. CoRR, (2018)On Mean Estimation for General Norms with Statistical Queries.J. Li, A. Nikolov, I. Razenshteyn, and E. Waingarten. COLT, volume 99 of Proceedings of Machine Learning Research, page 2158-2172. PMLR, (2019)On Model-Based RIP-1 Matrices.P. Indyk, and I. Razenshteyn. ICALP (1), volume 7965 of Lecture Notes in Computer Science, page 564-575. Springer, (2013)Adversarial Examples from Cryptographic Pseudo-Random Generators.S. Bubeck, Y. Lee, E. Price, and I. Razenshteyn. CoRR, (2018)Scalable Nearest Neighbor Search for Optimal Transport.A. Backurs, Y. Dong, P. Indyk, I. Razenshteyn, and T. Wagner. ICML, volume 119 of Proceedings of Machine Learning Research, page 497-506. PMLR, (2020)Adversarial examples from computational constraints.S. Bubeck, Y. Lee, E. Price, and I. Razenshteyn. ICML, volume 97 of Proceedings of Machine Learning Research, page 831-840. PMLR, (2019)Scaling up Kernel Ridge Regression via Locality Sensitive Hashing.M. Kapralov, N. Nouri, I. Razenshteyn, A. Velingker, and A. Zandieh. CoRR, (2020)Maliciously Secure Matrix Multiplication with Applications to Private Deep Learning.H. Chen, M. Kim, I. Razenshteyn, D. Rotaru, Y. Song, and S. Wagh. ASIACRYPT (3), volume 12493 of Lecture Notes in Computer Science, page 31-59. Springer, (2020)On the Complexity of Inner Product Similarity Join.T. Ahle, R. Pagh, I. Razenshteyn, and F. Silvestri. PODS, page 151-164. ACM, (2016)Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching.A. Backurs, P. Indyk, I. Razenshteyn, and D. Woodruff. SODA, page 318-337. SIAM, (2016)

BibSonomy

Disambiguation of "Razenshteyn, Ilya P."

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Provably Robust Deep Learning via Adversarially Trained Smoothed Classifiers.

Please choose a person to relate this publication to

Katja Ilyashava

Maxim Ilyasov

Rimma Ilyasova

Ilya Christoffel

Ilya Pavlyukevich

Other publications of authors with the same name

Disambiguation

BibSonomy

Disambiguation of "Razenshteyn, Ilya P."

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML Provably Robust Deep Learning via Adversarially Trained Smoothed Classifiers.

Please choose a person to relate this publication to

Katja Ilyashava

Maxim Ilyasov

Rimma Ilyasova

Ilya Christoffel

Ilya Pavlyukevich

Other publications of authors with the same name

Disambiguation

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Provably Robust Deep Learning via Adversarially Trained Smoothed Classifiers.