CaltechAUTHORS
  A Caltech Library Service

Items where Person is "Oymak-S"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Date | Item Type | First Author | No Grouping
Number of items: 34.

Article

Jaganathan, Kishore and Oymak, Samet and Hassibi, Babak (2017) Sparse Phase Retrieval: Uniqueness Guarantees and Recovery Algorithms. IEEE Transactions on Signal Processing, 65 (9). pp. 2402-2410. ISSN 1053-587X. https://resolver.caltech.edu/CaltechAUTHORS:20150121-073440098

Oymak, Samet and Hassibi, Babak (2016) Sharp MSE Bounds for Proximal Denoising. Foundations of Computational Mathematics, 16 (4). pp. 965-1029. ISSN 1615-3375. https://resolver.caltech.edu/CaltechAUTHORS:20160825-102038882

Thrampoulidis, Christos and Oymak, Samet and Hassibi, Babak (2015) Regularized Linear Regression: A Precise Analysis of the Estimation Error. Proceedings of Machine Learning Research, 40 . pp. 1683-1709. ISSN 1938-7228. https://resolver.caltech.edu/CaltechAUTHORS:20200221-130234534

Oymak, Samet and Jalali, Amin and Fazel, Maryam et al. (2015) Simultaneously Structured Models with Application to Sparse and Low-rank Matrices. IEEE Transactions on Information Theory, 61 (5). pp. 2886-2908. ISSN 0018-9448. https://resolver.caltech.edu/CaltechAUTHORS:20150126-073012139

Book Section

Oymak, Samet and Thrampoulidis, Christos and Hassibi, Babak (2017) Near-optimal sample complexity bounds for circulant binary embedding. In: 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE , Piscataway, NJ, pp. 6359-6363. ISBN 978-1-5090-4117-6. https://resolver.caltech.edu/CaltechAUTHORS:20170621-165223982

Oymak, Samet and Hassibi, Babak (2015) The proportional mean decomposition: A bridge between the Gaussian and Bernoulli ensembles. In: 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE , Piscataway, NJ, pp. 3322-3326. ISBN 978-1-4673-6997-8. https://resolver.caltech.edu/CaltechAUTHORS:20160722-153039699

Thrampoulidis, Christos and Oymak, Samet and Hassibi, Babak (2015) Recovering Structured Signals in Noise: Least-Squares Meets Compressed Sensing. In: Compressed Sensing and its Applications. Applied and Numerical Harmonic Analysis. Springer , Cham, pp. 97-141. ISBN 978-3-319-16041-2. https://resolver.caltech.edu/CaltechAUTHORS:20160901-121710649

Korlakai Vinayak, Ramya and Oymak, Samet and Hassibi, Babak (2014) Sharp performance bounds for graph clustering via convex optimization. In: 2014 IEEE International Conference on Acoustics, Speech and Signal Processing. IEEE , Piscataway, NJ, pp. 8297-8301. ISBN 978-1-4799-2892-7. https://resolver.caltech.edu/CaltechAUTHORS:20150106-133535671

Korlakai Vinayak, Ramya and Oymak, Samet and Hassibi, Babak (2014) Graph Clustering With Missing Data: Convex Algorithms and Analysis. In: Advances in Neural Information Processing Systems 27 (NIPS 2014). Advances in Neural Information Processing Systems. No.27. Neural Information Processing Systems , La Jolla, CA. https://resolver.caltech.edu/CaltechAUTHORS:20160401-170949281

Thrampoulidis, Christos and Oymak, Samet and Hassibi, Babak (2014) Simple Error Bounds for Regularized Noisy Linear Inverse Problems. In: 2014 IEEE International Symposium on Information Theory (ISIT),. IEEE , Piscataway, NJ, pp. 3007-3011. ISBN 978-1-4799-5186-4. https://resolver.caltech.edu/CaltechAUTHORS:20150121-071420813

Oymak, Samet and Hassibi, Babak (2014) A case for orthogonal measurements in linear inverse problems. In: 2014 IEEE International Symposium on Information Theory (ISIT). IEEE , Piscataway, NJ, pp. 3175-3179. https://resolver.caltech.edu/CaltechAUTHORS:20150224-071049082

Oymak, Samet and Thrampoulidis, Christos and Hassibi, Babak (2013) The squared-error of generalized LASSO: A precise analysis. In: 51st Annual Allerton Conference on Communication, Control, and Computing. IEEE , Piscataway, NJ, pp. 1002-1009. ISBN 978-1-4799-3410-2. https://resolver.caltech.edu/CaltechAUTHORS:20170201-142815906

Oymak, Samet and Jalali, Amin and Fazel, Maryam et al. (2013) Noisy estimation of simultaneously structured models: Limitations of convex relaxation. In: 2013 IEEE 52nd Annual Conference on Decision and Control (CDC). IEEE , Piscataway, NJ, pp. 6019-6024. ISBN 978-1-4673-5714-2. https://resolver.caltech.edu/CaltechAUTHORS:20150224-071400977

Jaganathan, Kishore and Oymak, Samet and Hassibi, Babak (2013) Sparse Phase Retrieval: Convex Algorithms and Limitations. In: 2013 IEEE International Symposium on Information Theory Proceedings (ISIT),. IEEE , Piscataway, NJ, pp. 1022-1026. https://resolver.caltech.edu/CaltechAUTHORS:20150126-071647266

Jaganathan, Kishore and Oymak, Samet and Hassibi, Babak (2012) On Robust Phase Retrieval for Sparse Signals. In: 2012 50th Annual Allerton Conference on Communication, Control, and Computing. IEEE , Piscataway, NJ, pp. 794-799. ISBN 978-1-4673-4537-8. https://resolver.caltech.edu/CaltechAUTHORS:20130730-135255859

Oymak, Samet and Hassibi, Babak (2012) On a Relation between the Minimax Risk and the Phase Transitions of Compressed Recovery. In: 2012 50th Annual Allerton Conference on Communication, Control, and Computing. IEEE , Piscataway, NJ, pp. 1018-1025. ISBN 978-1-4673-4537-8. https://resolver.caltech.edu/CaltechAUTHORS:20130731-085137179

Oymak, Samet and Khajehnejad, M. Amin and Hassibi, Babak (2012) Recovery Threshold for Optimal Weight ℓ_1 Minimization. In: 2012 IEEE International Symposium on Information Theory Proceedings (ISIT). IEEE International Symposium on Information Theory Proceedings . IEEE , Piscataway, NJ, pp. 2032-2036. ISBN 978-1-4673-2580-6. https://resolver.caltech.edu/CaltechAUTHORS:20120828-151151611

Jaganathan, Kishore and Oymak, Samet and Hassibi, Babak (2012) Recovery of sparse 1-D signals from the magnitudes of their Fourier transform. In: 2012 IEEE International Symposium on Information Theory Proceedings. IEEE International Symposium on Information Theory. IEEE , Piscataway, NJ, pp. 1473-1477. ISBN 978-1-4673-2580-6. https://resolver.caltech.edu/CaltechAUTHORS:20130204-114142719

Jaganathan, Kishore and Oymak, Samet and Hassibi, Babak (2012) Phase retrieval for sparse signals using rank minimization. In: 2012 IEEE International Conference on Acoustics, Speech and Signal Processing. IEEE , Piscataway, NJ, pp. 3449-3452. ISBN 978-1-4673-0045-2. https://resolver.caltech.edu/CaltechAUTHORS:20130208-133900478

Li, Cheuk Ting and Oymak, Samet and Hassibi, Babak (2012) Deterministic phase guarantees for robust recovery in incoherent dictionaries. In: 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE , Piscataway, NJ, pp. 3817-3820. ISBN 978-1-4673-0045-2. https://resolver.caltech.edu/CaltechAUTHORS:20150224-072653860

Krishnaswamy, Anilesh K. and Oymak, Samet and Hassibi, Babak (2012) A simpler approach to weighted ℓ_1 minimization. In: 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE , Piscataway, NJ, pp. 3621-3624. ISBN 978-1-4673-0045-2. https://resolver.caltech.edu/CaltechAUTHORS:20150224-072919592

Oymak, Samet and Mohan, Karthik and Fazel, Maryam et al. (2011) A Simplified Approach to Recovery Conditions for Low Rank Matrices. In: 2011 IEEE International Symposium on Information Theory Proceedings. IEEE , Piscataway, NJ, pp. 2318-2322. ISBN 978-1-4577-0596-0. https://resolver.caltech.edu/CaltechAUTHORS:20120406-112117384

Oymak, Samet and Khajehnejad, Amin and Hassibi, Babak (2011) Subspace Expanders and Matrix Rank Minimization. In: 2011 IEEE International Symposium on Information Theory Proceedings. IEEE , Piscataway, NJ, pp. 2308-2312. ISBN 978-1-4577-0596-0. https://resolver.caltech.edu/CaltechAUTHORS:20120406-111241824

Oymak, Samet and Hassibi, Babak (2011) Tight Recovery Thresholds and Robustness Analysis for Nuclear Norm Minimization. In: 2011 IEEE International Symposium on Information Theory Proceedings. IEEE , Piscataway, NJ, pp. 2323-2327. ISBN 978-1-4577-0596-0. https://resolver.caltech.edu/CaltechAUTHORS:20120406-113136818

Oymak, Samet and Khajehnejad, M. Amin and Hassibi, Babak (2011) Weighted compressed sensing and rank minimization. In: 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE , Piscataway, NJ, pp. 3736-3739. ISBN 978-1-4577-0538-0. https://resolver.caltech.edu/CaltechAUTHORS:20150204-071344814

Oymak, Samet and Khajehnejad, M. Amin and Hassibi, Babak (2011) Improved thresholds for rank minimization. In: 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE , Piscataway, NJ, pp. 5988-5991. ISBN 978-1-4577-0538-0. https://resolver.caltech.edu/CaltechAUTHORS:20150204-070559629

Report or Paper

Oymak, Samet and Tropp, Joel A. (2015) Universality laws for randomized dimension reduction, with applications. . (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20180831-112137332

Thrampoulidis, Christos and Oymak, Samet and Hassibi, Babak (2014) A Tight Version of the Gaussian min-max theorem in the Presence of Convexity. . (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20150120-073025721

Oymak, Samet and Thrampoulidis, Christos and Hassibi, Babak (2013) Simple Bounds for Noisy Linear Inverse Problems with Exact Side Information. . (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20150121-072935827

Oymak, Samet and Thrampoulidis, Christos and Hassibi, Babak (2013) The Squared-Error of Generalized LASSO: A Precise Analysis. . (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20150121-073901094

Oymak, Samet and Hassibi, Babak (2012) Recovering Jointly Sparse Signals via Joint Basis Pursuit. . (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20150126-075526346

Oymak, Samet and Hassibi, Babak (2011) Finding Dense Clusters via "Low Rank + Sparse" Decomposition. . (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20150127-073728199

Chowdhury, Mainak and Oymak, Samet and Khajehnejad, M. Amin et al. (2011) Robustness Analysis of a List Decoding Algorithm for Compressed Sensing. . (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20150223-073119058

Oymak, Samet and Hassibi, Babak (2010) New Null Space Results and Recovery Thresholds for Matrix Rank Minimization. . (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20150129-072018732

This list was generated on Fri Jul 10 09:14:18 2020 PDT.