Papers under review
Y. Laguel, N. S. Aybat, M. Gürbüzbalaban, “High probability and risk-averse guarantees for stochastic saddle point problems,” under review.
A. Jalilzadeh, E. Yazdandoost Hamedani, and N. S. Aybat, “A Doubly-Randomized Block-Coordinate Primal-Dual Method for Large-scale Saddle Point Problems," under review.
Accepted/Published Papers
X. Zhang, N. S. Aybat, M. Gürbüzbalaban, “Robust Accelerated Primal-Dual Methods for Computing Saddle Points,” is accepted to SIAM Journal on Optimization (SIOPT).
D. Ghaderyan, N. S. Aybat, A. P. Aguiar, F. L. Pereira, “A Fast Row-Stochastic Decentralized Optimization Method Over Directed Graphs,” is accepted to IEEE Transactions on Automatic Control.
B. Can, S. Soori, N. S. Aybat, M. Dehvani, and M. Gurbuzbalaban, “Randomized Gossiping with Effective Resistance Weights: Performance Guarantees and Applications," IEEE Transactions on Control of Network Systems, 9(2), pp. 524-536, June 2022.
N. S. Aybat, H. Ahmadi, and Uday V. Shanbhag, “On the Analysis of Inexact Augmented Lagrangian Schemes for Misspecified Conic Convex Programs,” IEEE Transactions on Automatic Control, 67(8), pp. 3981-3996, Aug. 2022.
E. Yazdandoost Hamedani and N. S. Aybat, “A decentralized primal-dual method for constrained minimization of a strongly convex function, IEEE Transactions on Automatic Control, 67(11), pp. 5682-5697, Nov. 2022.
E. Yazdandoost Hamedani and N. S. Aybat, “A Primal-Dual Algorithm with Line Search for General Convex-Concave Saddle Point Problems,” SIAM Journal on Optimization (SIOPT), 31(2), pp. 1299-1329, 2021.
S. Davanloo Tajbakhsh, N. S. Aybat, and Enrique del Castillo, “On the Theoretical Guarantees for Parameter Estimation of Gaussian Random Field Models: A Sparse Precision Matrix Approach” Journal of Machine Learning Research (JMLR), 21, pp. 1-41, 2020.
N. S. Aybat, A. Fallah, M. Gürbüzbalaban, A. Ozdaglar, “Robust Accelerated Gradient Methods for Smooth Strongly Convex Functions,” SIAM Journal on Optimization, 30(1), pp. 717-751 (2019).
N. S. Aybat, E. Yazdandoost Hamedani, “A Distributed ADMM-like Method for Resource Sharing over Time-varying Directed Networks," SIAM Journal on Optimization, 29(4), pp. 3036–3068 (2019).
J. Wang, M. Ashour, C. M. Lagoa, N. S. Aybat, H. Che, “A fully distributed traffic allocation algorithm for nonconcave utility maximization in connectionless communication networks," Automatica, 109, 108506 (2019).
S. Ma and N. S. Aybat, “Efficient Optimization Algorithms for Robust Principal Component Analysis and Its Variants,” accepted to be published in the Proceedings of the IEEE, 2018.
M. Ashour, J. Wang, N. S. Aybat, C. Lagoa, and H. Che, “End-to-End Distributed Flow Control for Networks with Nonconcave Utilities,” accepted to be published in Transactions on Network Science and Engineering, 2017.
Sam Davanloo Tajbakhsh, Necdet Serhat Aybat, and Enrique del Castillo, “Generalized Sparse Precision Matrix Selection for Fitting Multivariate Gaussian Random Fields to Large Data Sets,” Statistica Sinica, 28 (2018), pp. 941-962.
Necdet Serhat Aybat, Zi Wang, Tianyi Lin, and Shiqian Ma, “Distributed Linearized Alternating Direction Method of Multipliers for Composite Convex Consensus Optimization,” IEEE Transactions on Automatic Control, 63 (2018), pp.5-20.
Ashkan Jasour, Necdet Serhat Aybat, and Constantino Lagoa, “Semidefinite Programming for Chance Constrained Optimization over Semialgebraic Sets,” SIAM Journal on Optimization, 25 (2015), pp. 1411-1440.
Necdet Serhat Aybat and Garud Iyengar, “An Alternating Direction Method with Increasing Penalty for Stable Principal Component Pursuit,” Computational Optimization and Applications, 61 (2015), pp. 635-668.
Necdet Serhat Aybat and Garud Iyengar, “A Unified Approach for Minimizing Composite Norms,” Mathematical Programming, Series A, 144 (2014), pp. 181-226.
Necdet Serhat Aybat, Shiqian Ma and Donald Goldfarb, “Efficient Algorithms for Robust and Stable Principal Component Pursuit Problems,” Computational Optimization and Applications, 58 (2014), pp. 1-29.
Necdet Serhat Aybat and Garud Iyengar, “A First-Order Augmented Lagrangian Method for Compressed Sensing,” SIAM Journal on Optimization, 22 (2012), pp. 429-459.
Necdet Serhat Aybat and Garud Iyengar, “A First-Order Smoothed Penalty Method for Compressed Sensing,” SIAM Journal on Optimization, 21 (2011), pp. 287-313.
Technical Reports
Necdet Serhat Aybat and Zi Wang, “A Parallelizable Dual Smoothing Method for Large Scale Convex Regression Problems,” 2016.
Necdet Serhat Aybat and Garud Iyengar, “An Augmented Lagrangian Method for Conic Convex Programming,” 2013.
Necdet Serhat Aybat and Amit Chakraborty, “Fast Reconstruction of CT Images from Parsimonious Angular Measurements,” 2011.
Peer Reviewed Conference Papers
X. Zhang, G. Mancino-Ball, N. S. Aybat, and Y. Xu, “Jointly Improving the Sample and Communication Complexities in Decentralized Stochastic Minimax Optimization,” is accepted to the 38th Annual AAAI Conference on Artificial Intelligence (acceptance rate 23.75%).
E. Yazdandoost Hamedani, A. Jalilzadeh, and N. S. Aybat, “Randomized Primal-Dual Methods with Line-Search for Saddle Point Problems,” Proceeding of the 25th International Conference on Artificial Intelligence and Statistics (AISTATS), Valencia, Spain, April 25-27, 2023 (acceptance rate 29%).
X. Zhang, N. S. Aybat, M. Gürbüzbalaban, “SAPD+: An Accelerated Stochastic Method for Nonconvex-Concave Minimax Problems,” Advances in Neural Information Processing Systems (NeurIPS), New Orleans, USA, November 28 - December 9, 2022 (acceptance rate 25.6%, 2665 / 10411).
N. S. Aybat, A. Fallah, M. Gürbüzbalaban, A. Ozdaglar, “A Universally Optimal Multistage Accelerated Stochastic Gradient Method,” Advances in Neural Information Processing Systems (NeurIPS), 32, pp. 8523-8534 (2019).
M. Ashour, C. M. Lagoa, and N. S. Aybat. “Lp Quasi-norm Minimization,” 2019 53rd Asilomar Conference on Signals, Systems, and Computers, IEEE, pp. 726-730 (2019).
N. S. Aybat, and M. Gurbuzbalaban, “Decentralized Computation of Effective Resistances and Acceleration of Consensus Algorithms,” the Proceedings of 2017 5th IEEE Global Conference on Signal and Information Processing (GlobalSIP), Montreal, Canada, November 14-16, 2017, pp. 538-542.
E. Yazdandoost Hamedani, and N. S. Aybat, “Multi-agent Constrained Optimization of a Strongly Convex Function,” the Proceedings of 2017 5th IEEE Global Conference on Signal and Information Processing (GlobalSIP), Montreal, Canada, November 14-16, 2017, pp. 558-562.
E. Yazdandoost Hamedani, and N. S. Aybat, “Multi-agent constrained optimization of a strongly convex function over time-varying directed networks/,” the Proceedings of 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton), Monticello, IL, 2017, pp. 518-525.
J. Wang, M. Ashour, C. Lagoa, N. S. Aybat, and H. Che, “Non-concave network utility maximization in connectionless networks: A fully distributed traffic allocation algorithm,” the Proceedings of the 2017 American Control Conference (ACC), Seattle, WA, USA, May 24-26, 2017, pp. 3980-3985.
M. Ashour, J. Wang, C. Lagoa, N. S. Aybat, and H. Che, “Non-Concave Network Utility Maximization: A Distributed Optimization Approach,” the Proceedings of IEEE INFOCOM 2017 - The 36th Annual IEEE International Conference on Computer Communications, Atlanta, GA, USA, May 1-4, 2017, pp. 1-9 (acceptance rate 20.93%, 292 / 1395).
N. S. Aybat, and E. Yazdandoost Hamedani, “A primal-dual method for conic constrained distributed optimization problems,” Advances in Neural Information Processing Systems 29 (2016), pp.5049-5057. (Acceptance rate 22.72%, 568 / 2500).
E. Yazdandoost Hamedani, and N. S. Aybat, “Distributed primal-dual method for multi-agent sharing problem with conic constraints,” 2016 50th Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, 2016, pp. 777-782.
Hesam Ahmadi, Necdet Serhat Aybat, and Uday V. Shanbhag, “On the rate analysis of inexact augmented Lagrangian schemes for convex optimization problems with misspecified constraints,” the Proceedings of 2016 American Control Conference (ACC), Boston, MA, USA (2016), pp. 4841-4846.
Necdet Serhat Aybat, Zi Wang, and Garud Iyengar, “An Asynchronous Distributed Proximal Gradient Method for Composite Convex Optimization,” Journal of Machine Learning Research (JMLR): W&CP 37 (2015), pp. 2454-2462 – Proceedings of the 32nd International Conference on Machine Learning, Lille, France, 2015 (acceptance rate 26.03%, 270 / 1037).
Necdet Serhat Aybat, Sahar Zarmehri and Soundar Kumara, “An ADMM Algorithm for Clustering Partially Observed Networks,” the Proceedings of the 2015 SIAM International Conference on Data Mining (2015), pp. 460-468. (Acceptence Rate: 14.66%) Download SDM15 Presentation
Necdet Serhat Aybat and Zi Wang, “A Parallel Method for Large Scale Convex Regression Problems,” the Proceedings of the IEEE Conference on Decision and Control (2014), pp. 5710-5717.
Necdet Serhat Aybat, Sinem Daysal, Burcu Tan and Fulden Topaloglu, “Decision Making Tests with Different Variations of the Stock Management Game,” the Proceedings of the 22nd International System Dynamics Conference (2004), Oxford, UK.
Chapters in Collections & Books
N. S. Aybat, “Algorithms for Stable PCA” in Handbook of Robust Low Rank and Sparse Matrix Decomposition: Applications in Image and Video Processing, edited by T. Bouwmans, N. S. Aybat, and E. Zahzah, CRC Press, Taylor and Francis Group, 2016.
IMPORTANT: The first print of the book has typos in chapter “Algorithms for Stable PCA.” Download the corrected version
Handbook of Robust Low Rank and Sparse Matrix Decomposition: Applications in Image and Video Processing, edited by T. Bouwmans, N. S. Aybat, and E. Zahzah, CRC Press, Taylor and Francis Group, 2016
Theses
Necdet Serhat Aybat, “First Order Methods for Large-Scale Sparse Optimization,” PhD Thesis, 2011.
Necdet Serhat Aybat, “Analysis and Solution of Cardinality Constrained Quadratic Portfolio Optimization Problem Using Eigen Portfolios,” MS Thesis, 2005.
|