Obserwuj
Yair Carmon
Yair Carmon
Zweryfikowany adres z tauex.tau.ac.il - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Unlabeled data improves adversarial robustness
Y Carmon, A Raghunathan, L Schmidt, JC Duchi, PS Liang
Advances in neural information processing systems 32, 2019
6472019
Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference time
M Wortsman, G Ilharco, SY Gadre, R Roelofs, R Gontijo-Lopes, ...
International Conference on Machine Learning, 23965-23998, 2022
3572022
Accelerated methods for nonconvex optimization
Y Carmon, JC Duchi, O Hinder, A Sidford
SIAM Journal on Optimization 28 (2), 1751-1772, 2018
3122018
No bad local minima: Data independent training error guarantees for multilayer neural networks
D Soudry, Y Carmon
arXiv preprint arXiv:1605.08361, 2016
2492016
Lower bounds for non-convex stochastic optimization
Y Arjevani, Y Carmon, JC Duchi, DJ Foster, N Srebro, B Woodworth
Mathematical Programming 199 (1-2), 165-214, 2023
2462023
Accuracy on the line: on the strong correlation between out-of-distribution and in-distribution generalization
JP Miller, R Taori, A Raghunathan, S Sagawa, PW Koh, V Shankar, ...
International Conference on Machine Learning, 7721-7735, 2021
1772021
Lower bounds for finding stationary points I
Y Carmon, JC Duchi, O Hinder, A Sidford
Mathematical Programming, 1-50, 2019
1732019
Gradient descent finds the cubic-regularized non-convex newton step
Y Carmon, JC Duchi
arXiv preprint arXiv:1612.00547, 2016
1622016
"Convex Until Proven Guilty": Dimension-Free Acceleration of Gradient Descent on Non-Convex Functions
Y Carmon, O Hinder, JC Duchi, A Sidford
arXiv preprint arXiv:1705.02766, 2017
1402017
Lower bounds for finding stationary points II: first-order methods
Y Carmon, JC Duchi, O Hinder, A Sidford
Mathematical Programming, 2019
139*2019
Large-scale methods for distributionally robust optimization
D Levy, Y Carmon, JC Duchi, A Sidford
Advances in Neural Information Processing Systems 33, 8847-8860, 2020
1372020
Variance reduction for matrix games
Y Carmon, Y Jin, A Sidford, K Tian
Advances in Neural Information Processing Systems 32, 2019
652019
Analysis of Krylov Subspace Solutions of Regularized Nonconvex Quadratic Problems
Y Carmon, JC Duchi
arXiv preprint arXiv:1806.09222, 2018, 2018
502018
Second-order information in non-convex stochastic optimization: Power and limitations
Y Arjevani, Y Carmon, JC Duchi, DJ Foster, A Sekhari, K Sridharan
Conference on Learning Theory, 242-299, 2020
482020
DataComp: In search of the next generation of multimodal datasets
SY Gadre, G Ilharco, A Fang, J Hayase, G Smyrnis, T Nguyen, R Marten, ...
arXiv preprint arXiv:2304.14108, 2023
462023
Contour based defect detection
A Gupta, M Mahadevan, S Venkataraman, H Yang, L Karsenti, Y Carmon, ...
US Patent 10,395,362, 2019
422019
Single image detection
L Karsenti, K Bhaskar, JR Jordan III, S Venkataraman, Y Carmon
US Patent 10,186,026, 2019
412019
Acceleration with a ball optimization oracle
Y Carmon, A Jambulapati, Q Jiang, Y Jin, YT Lee, A Sidford, K Tian
Advances in Neural Information Processing Systems 33, 19052-19063, 2020
362020
Coordinate methods for matrix games
Y Carmon, Y Jin, A Sidford, K Tian
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
292020
Harder or different? a closer look at distribution shift in dataset reproduction
S Lu, B Nott, A Olson, A Todeschini, H Vahabi, Y Carmon, L Schmidt
ICML Workshop on Uncertainty and Robustness in Deep Learning 5, 15, 2020
292020
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20