Követés
Samet Oymak
Samet Oymak
E-mail megerősítve itt: umich.edu - Kezdőlap
Cím
Hivatkozott rá
Hivatkozott rá
Év
Gradient descent with early stopping is provably robust to label noise for overparameterized neural networks
M Li, M Soltanolkotabi, S Oymak
The 23rd International Conference on Artificial Intelligence and Statistics, 2020
3652020
Towards moderate overparameterization: global convergence guarantees for training shallow neural networks
S Oymak, M Soltanolkotabi
IEEE Journal on Selected Areas in Information Theory, 2020
3452020
Simultaneously structured models with application to sparse and low-rank matrices
S Oymak, A Jalali, M Fazel, YC Eldar, B Hassibi
IEEE Transactions on Information Theory 61 (5), 2886-2908, 2015
3092015
Non-asymptotic identification of LTI systems from a single trajectory
S Oymak, N Ozay
The American Control Conference, 2019
2362019
Regularized linear regression: A precise analysis of the estimation error
C Thrampoulidis, S Oymak, B Hassibi
Conference on Learning Theory, 1683-1709, 2015
228*2015
Overparameterized Nonlinear Learning: Gradient Descent Takes the Shortest Path?
S Oymak, M Soltanolkotabi
36th International Conference on Machine Learning, 2019
1912019
Recovery of sparse 1-D signals from the magnitudes of their Fourier transform
K Jaganathan, S Oymak, B Hassibi
2012 IEEE International Symposium on Information Theory Proceedings, 1473-1477, 2012
1582012
Unsupervised Multi-source Domain Adaptation Without Access to Source Data
SM Ahmed, DS Raychaudhuri, S Paul, S Oymak, AK Roy-Chowdhury
IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2021
1562021
The squared-error of generalized lasso: A precise analysis
S Oymak, C Thrampoulidis, B Hassibi
51st Annual Allerton Conference on Communication, Control, and Computing …, 2013
1402013
Universality laws for randomized dimension reduction, with applications
S Oymak, JA Tropp
Information and Inference: A Journal of the IMA 7 (3), 337-446, 2018
1372018
Sparse phase retrieval: Convex algorithms and limitations
K Jaganathan, S Oymak, B Hassibi
IEEE International Symposium on Information Theory, 2013
1322013
Sharp Time--Data Tradeoffs for Linear Inverse Problems
S Oymak, B Recht, M Soltanolkotabi
IEEE Transactions on Information Theory, 2018
1122018
A simplified approach to recovery conditions for low rank matrices
S Oymak, K Mohan, M Fazel, B Hassibi
2011 IEEE International Symposium on Information Theory Proceedings, 2318-2322, 2011
1112011
Parallel correlation clustering on big graphs
X Pan, D Papailiopoulos, S Oymak, B Recht, K Ramchandran, MI Jordan
Neural Information Processing Systems (NIPS), 2015
1042015
New null space results and recovery thresholds for matrix rank minimization
S Oymak, B Hassibi
arXiv preprint arXiv:1011.6326, 2010
101*2010
Sharp MSE Bounds for Proximal Denoising
S Oymak, B Hassibi
Foundations of Computational Mathematics, 2013
99*2013
Transformers as Algorithms: Generalization and Stability in In-context Learning
Y Li, ME Ildiz, D Papailiopoulos, S Oymak
ICML, 2023
86*2023
Sparse phase retrieval: Uniqueness guarantees and recovery algorithms
K Jaganathan, S Oymak, B Hassibi
IEEE Transactions on Signal Processing 65 (9), 2402-2410, 2017
812017
Label-Imbalanced and Group-Sensitive Classification under Overparameterization
GR Kini, O Paraskevas, S Oymak, C Thrampoulidis
Thirty-Fifth Conference on Neural Information Processing Systems, 2021
792021
Generalization Guarantees for Neural Networks via Harnessing the Low-rank Structure of the Jacobian
S Oymak, Z Fabian, M Li, M Soltanolkotabi
ICML Workshop on Understanding and Improving Generalization in Deep Learning, 2019
742019
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20