default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSalar Fattahi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c22]Jianhao Ma, Salar Fattahi:
Convergence of Gradient Descent with Small Initialization for Unregularized Matrix Completion. COLT 2024: 3683-3742- [i19]Jianhao Ma, Salar Fattahi:
Convergence of Gradient Descent with Small Initialization for Unregularized Matrix Completion. CoRR abs/2402.06756 (2024) - [i18]Naichen Shi, Salar Fattahi, Raed Al Kontar
:
Triple Component Matrix Factorization: Untangling Global, Local, and Noisy Components. CoRR abs/2404.07955 (2024) - 2023
- [j13]Jianhao Ma, Salar Fattahi:
Global Convergence of Sub-gradient Method for Robust Matrix Recovery: Small Initialization, Noisy Measurements, and Over-parameterization. J. Mach. Learn. Res. 24: 96:1-96:84 (2023) - [j12]Gavin Zhang, Salar Fattahi, Richard Y. Zhang:
Preconditioned Gradient Descent for Overparameterized Nonconvex Burer-Monteiro Factorization with Global Optimality Certification. J. Mach. Learn. Res. 24: 163:1-163:55 (2023) - [j11]Peijing Liu, Salar Fattahi, Andrés Gómez, Simge Küçükyavuz:
A graph-based decomposition method for convex quadratic optimization with indicators. Math. Program. 200(2): 669-701 (2023) - [j10]Salar Fattahi, Cédric Josz, Yuhao Ding, Reza Mohammadi-Ghazi, Javad Lavaei, Somayeh Sojoudi:
On the Absence of Spurious Local Trajectories in Time-Varying Nonconvex Optimization. IEEE Trans. Autom. Control. 68(1): 80-95 (2023) - [j9]Visweswaran Ravikumar, Tong Xu, Wajd N. Al-Holou, Salar Fattahi, Arvind Rao:
Efficient Inference of Spatially-Varying Gaussian Markov Random Fields With Applications in Gene Regulatory Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 20(5): 2920-2932 (2023) - [c21]Jianhao Ma, Lingjun Guo, Salar Fattahi:
Behind the Scenes of Gradient Descent: A Trajectory Analysis via Basis Function Decomposition. ICLR 2023 - [c20]Geyu Liang, Naichen Shi, Raed Al Kontar, Salar Fattahi:
Personalized Dictionary Learning for Heterogeneous Datasets. NeurIPS 2023 - [i17]Jianhao Ma, Salar Fattahi:
On the Optimization Landscape of Burer-Monteiro Factorization: When do Global Solutions Correspond to Ground Truth? CoRR abs/2302.10963 (2023) - [i16]Jianhao Ma, Rui Ray Chen, Yinghui He, Salar Fattahi, Wei Hu:
Robust Sparse Mean Estimation via Incremental Learning. CoRR abs/2305.15276 (2023) - [i15]Geyu Liang, Naichen Shi, Raed Al Kontar, Salar Fattahi:
Personalized Dictionary Learning for Heterogeneous Datasets. CoRR abs/2305.15311 (2023) - [i14]Salar Fattahi, Andrés Gómez:
Solution Path of Time-varying Markov Random Fields with Discrete Regularization. CoRR abs/2307.13750 (2023) - 2022
- [c19]Jianhao Ma, Salar Fattahi:
Blessing of Depth in Linear Regression: Deeper Models Have Flatter Landscape Around the True Solution. NeurIPS 2022 - [i13]Jianhao Ma, Salar Fattahi:
Global Convergence of Sub-gradient Method for Robust Matrix Recovery: Small Initialization, Noisy Measurements, and Over-parameterization. CoRR abs/2202.08788 (2022) - [i12]Gavin Zhang, Salar Fattahi, Richard Y. Zhang:
Preconditioned Gradient Descent for Overparameterized Nonconvex Burer-Monteiro Factorization with Global Optimality Certification. CoRR abs/2206.03345 (2022) - [i11]Jianhao Ma, Salar Fattahi:
Blessing of Nonconvexity in Deep Linear Models: Depth Flattens the Optimization Landscape Around the True Solution. CoRR abs/2207.07612 (2022) - [i10]Jianhao Ma, Lingjun Guo, Salar Fattahi:
Behind the Scenes of Gradient Descent: A Trajectory Analysis via Basis Function Decomposition. CoRR abs/2210.00346 (2022) - [i9]Geyu Liang, Gavin Zhang, Salar Fattahi, Richard Y. Zhang:
Simple Alternating Minimization Provably Solves Complete Dictionary Learning. CoRR abs/2210.12816 (2022) - 2021
- [j8]Julie Mulvaney-Kemp, Salar Fattahi, Javad Lavaei:
Smoothing Property of Load Variation Promotes Finding Global Solutions of Time-Varying Optimal Power Flow. IEEE Trans. Control. Netw. Syst. 8(3): 1552-1564 (2021) - [j7]Salar Fattahi, Somayeh Sojoudi:
Sample Complexity of Block-Sparse System Identification Problem. IEEE Trans. Control. Netw. Syst. 8(4): 1905-1917 (2021) - [c18]Salar Fattahi:
Learning Partially Observed Linear Dynamical Systems from Logarithmic Number of Samples. L4DC 2021: 60-72 - [c17]Jialun Zhang, Salar Fattahi, Richard Y. Zhang:
Preconditioned Gradient Descent for Over-Parameterized Nonconvex Matrix Factorization. NeurIPS 2021: 5985-5996 - [c16]Salar Fattahi, Andrés Gómez:
Scalable Inference of Sparsely-changing Gaussian Markov Random Fields. NeurIPS 2021: 6529-6541 - [i8]Jianhao Ma, Salar Fattahi:
Implicit Regularization of Sub-Gradient Method in Robust Matrix Recovery: Don't be Afraid of Outliers. CoRR abs/2102.02969 (2021) - [i7]Salar Fattahi, Andrés Gómez:
Scalable Inference of Sparsely-changing Markov Random Fields with Strong Statistical Guarantees. CoRR abs/2102.03585 (2021) - 2020
- [j6]Salar Fattahi, Somayeh Sojoudi:
Exact Guarantees on the Absence of Spurious Local Minima for Non-negative Rank-1 Robust Principal Component Analysis. J. Mach. Learn. Res. 21: 59:1-59:51 (2020) - [j5]Salar Fattahi, Nikolai Matni, Somayeh Sojoudi:
Efficient Learning of Distributed Linear-Quadratic Control Policies. SIAM J. Control. Optim. 58(5): 2927-2951 (2020) - [c15]Salar Fattahi, Cédric Josz, Reza Mohammadi-Ghazi, Javad Lavaei, Somayeh Sojoudi:
Absence of Spurious Local Trajectories in Time-Varying Optimization: A Control-Theoretic Perspective. CCTA 2020: 140-147 - [i6]Salar Fattahi:
Learning Partially Observed Linear Dynamical Systems from Logarithmic Number of Samples. CoRR abs/2010.04015 (2020)
2010 – 2019
- 2019
- [j4]Salar Fattahi, Richard Y. Zhang, Somayeh Sojoudi:
Linear-Time Algorithm for Learning Large-Scale Sparse Graphical Models. IEEE Access 7: 12658-12672 (2019) - [j3]Salar Fattahi, Somayeh Sojoudi:
Graphical Lasso and Thresholding: Equivalence and Closed-form Solutions. J. Mach. Learn. Res. 20: 10:1-10:44 (2019) - [j2]Somayeh Sojoudi, Salar Fattahi, Javad Lavaei:
Convexification of generalized network flow problem. Math. Program. 173(1-2): 353-391 (2019) - [j1]Salar Fattahi, Ghazal Fazelnia, Javad Lavaei, Murat Arcak:
Transformation of Optimal Centralized Controllers Into Near-Globally Optimal Static Distributed Controllers. IEEE Trans. Autom. Control. 64(1): 66-80 (2019) - [c14]Salar Fattahi, Nikolai Matni, Somayeh Sojoudi:
Learning Sparse Dynamical Systems from a Single Sample Trajectory. CDC 2019: 2682-2689 - [i5]Salar Fattahi, Nikolai Matni, Somayeh Sojoudi:
Learning Sparse Dynamical Systems from a Single Sample Trajectory. CoRR abs/1904.09396 (2019) - [i4]Salar Fattahi, Nikolai Matni, Somayeh Sojoudi:
Efficient Learning of Distributed Linear-Quadratic Controllers. CoRR abs/1909.09895 (2019) - 2018
- [c13]Salar Fattahi, Somayeh Sojoudi:
Data-Driven Sparse System Identification. Allerton 2018: 462-469 - [c12]Salar Fattahi, Somayeh Sojoudi:
Closed-Form Solution and Sparsity Path for Inverse Covariance Estimation Problem. ACC 2018: 410-417 - [c11]Georgios Darivianakis, Salar Fattahi, John Lygeros, Javad Lavaei:
High-Performance Cooperative Distributed Model Predictive Control for Linear Systems. ACC 2018: 2318-2325 - [c10]Salar Fattahi, Somayeh Sojoudi:
Non-Asymptotic Analysis of Block-Regularized Regression Problem. CDC 2018: 27-34 - [c9]Salar Fattahi, Richard Y. Zhang, Somayeh Sojoudi:
Sparse Inverse Covariance Estimation for Chordal Structures. ECC 2018: 837-844 - [c8]Richard Y. Zhang, Salar Fattahi, Somayeh Sojoudi:
Large-Scale Sparse Inverse Covariance Estimation via Thresholding and Max-Det Matrix Completion. ICML 2018: 5761-5770 - [i3]Richard Y. Zhang, Salar Fattahi, Somayeh Sojoudi:
Linear-Time Algorithm for Learning Large-Scale Sparse Graphical Models. CoRR abs/1802.04911 (2018) - [i2]Salar Fattahi, Somayeh Sojoudi:
Data-Driven Sparse System Identification. CoRR abs/1803.07753 (2018) - [i1]Salar Fattahi, Somayeh Sojoudi:
Exact Guarantees on the Absence of Spurious Local Minima for Non-negative Robust Principal Component Analysis. CoRR abs/1812.11466 (2018) - 2017
- [c7]Salar Fattahi, Javad Lavaei:
On the convexity of optimal decentralized control problem and sparsity path. ACC 2017: 3359-3366 - [c6]Salar Fattahi, Javad Lavaei, Alper Atamtürk:
Promises of conic relaxations in optimal transmission switching of power systems. CDC 2017: 3238-3245 - [c5]Salar Fattahi, Javad Lavaei, Murat Arcak:
A scalable method for designing distributed controllers for systems with unknown initial states. CDC 2017: 4739-4749 - 2016
- [c4]Salar Fattahi, Javad Lavaei:
Theoretical guarantees for the design of near globally optimal static distributed controllers. Allerton 2016: 582-589 - [c3]Morteza Ashraphijuo, Salar Fattahi, Javad Lavaei, Alper Atamtürk:
A strong semidefinite programming relaxation of the unit commitment problem. CDC 2016: 694-701 - 2015
- [c2]Salar Fattahi, Javad Lavaei:
Convex analysis of generalized flow networks. CDC 2015: 1569-1576 - [c1]Salar Fattahi, Ghazal Fazelnia, Javad Lavaei:
Transformation of optimal centralized controllers into near-global static distributed controllers. CDC 2015: 4915-4922
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
