default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmin Jalali 0002
Person information
- affiliation (former): Technicolor AI Lab
- affiliation (former): University of Wisconsin, Madison, WI, USA
- affiliation (former): University of Washington, Department of Electrical Engineering, USA
Other persons with the same name
- Amin Jalali — disambiguation page
- Amin Jalali 0001
![[0000-0002-6633-8587]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-6633-8587")
— Stockholm University, Department of Computer and Systems Sciences, Sweden - Amin Jalali 0003 — Kyungpook National University, Daegu, South Korea
- Amin Jalali 0005 — University of California, Davis, Department of Electrical and Computer Engineering, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[i5]Amirhossein Taghvaei, Amin Jalali:
2-Wasserstein Approximation via Restricted Convex Potentials with Application to Improved Training for GANs. CoRR abs/1902.07197 (2019)- [i4]Amin Jalali, Adel Javanmard, Maryam Fazel:
New Computational and Statistical Aspects of Regularized Regression with Application to Rare Feature Selection and Aggregation. CoRR abs/1904.05338 (2019) - 2018
- [c7]Amin Jalali, Rebecca Willett:
Sparse Transition Matrix Estimation for Sub-Gaussian Autoregressive Processes with Missing Data. ACC 2018: 1881-1886 - [c6]Zachary Charles, Amin Jalali, Rebecca Willett:
Sparse Subspace Clustering with Missing and Corrupted Data. DSW 2018: 180-184 - [i3]Amin Jalali, Rebecca Willett:
Missing Data in Sparse Transition Matrix Estimation for Sub-Gaussian Vector Autoregressive Processes. CoRR abs/1802.09511 (2018) - 2017
- [j2]Amin Jalali, Maryam Fazel, Lin Xiao:
Variational Gram Functions: Convex Analysis and Optimization. SIAM J. Optim. 27(4): 2634-2661 (2017) - [c5]Amin Jalali, James Saunderson, Maryam Fazel, Babak Hassibi:
Error bounds for Bregman denoising and structured natural parameter estimation. ISIT 2017: 2273-2277 - [c4]Amin Jalali, Rebecca Willett:
Subspace Clustering via Tangent Cones. NIPS 2017: 6744-6753 - 2016
- [c3]Amin Jalali, Qiyang Han, Ioana Dumitriu, Maryam Fazel:
Exploiting Tradeoffs for Exact Recovery in Heterogeneous Stochastic Block Models. NIPS 2016: 4871-4879 - 2015
- [j1]Samet Oymak, Amin Jalali, Maryam Fazel, Yonina C. Eldar, Babak Hassibi:
Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices. IEEE Trans. Inf. Theory 61(5): 2886-2908 (2015) - [i2]Amin Jalali, Lin Xiao, Maryam Fazel:
Variational Gram Functions: Convex Analysis and Optimization. CoRR abs/1507.04734 (2015) - 2013
- [c2]Samet Oymak, Amin Jalali, Maryam Fazel, Babak Hassibi:
Noisy estimation of simultaneously structured models: Limitations of convex relaxation. CDC 2013: 6019-6024 - [c1]Amin Jalali, Maryam Fazel:
A convex method for learning d-valued models. GlobalSIP 2013: 1123-1126 - 2012
- [i1]Samet Oymak, Amin Jalali, Maryam Fazel, Yonina C. Eldar, Babak Hassibi:
Simultaneously Structured Models with Application to Sparse and Low-rank Matrices. CoRR abs/1212.3753 (2012)
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 2024-11-04 21:40 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:
