default search action
Teng Zhang 0002
Person information
- affiliation: University of Central Florida, Department of Mathematics, Orlando, FL, USA
Other persons with the same name
- Teng Zhang — disambiguation page
- Teng Zhang 0001
— Huazhong University of Science and Technology, School of Computer Science and Technology, Wuhan, China (and 1 more)
- Teng Zhang 0003
- Teng Zhang 0004 — University of Queensland, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j17]Hsin-Hsiung Huang, Feng Yu, Xing Fan, Teng Zhang:
A framework of regularized low-rank matrix models for regression and classification. Stat. Comput. 34(1): 10 (2024) - [c11]Feng Yu, Teng Zhang, Gilad Lerman:
A Subspace-Constrained Tyler's Estimator and its Applications to Structure from Motion. CVPR 2024: 14575-14584 - [i16]Feng Yu, Teng Zhang, Gilad Lerman:
A Subspace-Constrained Tyler's Estimator and its Applications to Structure from Motion. CoRR abs/2404.11590 (2024) - 2023
- [i15]Casey Garner, Gilad Lerman
Improved Convergence Rates of Anderson Acceleration for a Large Class of Fixed-Point Iterations. CoRR abs/2311.02490 (2023) - 2022
- [j16]Xing Fan, Marianna Pensky, Feng Yu, Teng Zhang:
ALMA: Alternating Minimization Algorithm for Clustering Mixture Multilayer Network. J. Mach. Learn. Res. 23: 330:1-330:46 (2022) - [j15]Joong-Ho Won
Orthogonal Trace-Sum Maximization: Tightness of the Semidefinite Relaxation and Guarantee of Locally Optimal Solutions. SIAM J. Optim. 32(3): 2180-2207 (2022) - [j14]Raj Gautam Dutta
Design and Analysis of Secure Distributed Estimator for Vehicular Platooning in Adversarial Environment. IEEE Trans. Intell. Transp. Syst. 23(4): 3418-3429 (2022) - [i14]Hsin-Hsiung Huang, Feng Yu, Xing Fan, Teng Zhang:
Robust Regularized Low-Rank Matrix Models for Regression and Classification. CoRR abs/2205.07106 (2022) - 2021
- [i13]Xing Fan, Marianna Pensky, Feng Yu, Teng Zhang:
ALMA: Alternating Minimization Algorithm for Clustering Mixture Multilayer Network. CoRR abs/2102.10226 (2021) - [i12]Honggang Yu, Shihfeng Zeng, Teng Zhang, Ing-Chao Lin, Yier Jin:
Exploring Adversarial Examples for Efficient Active Learning in Machine Learning Classifiers. CoRR abs/2109.10770 (2021) - 2020
- [j13]Zhibo Wang, Zhezhi He, Milan Shah, Teng Zhang, Deliang Fan, Wei Zhang
Network-based multi-task learning models for biomarker selection and cancer outcome prediction. Bioinform. 36(6): 1814-1822 (2020) - [j12]Jiao Sun, Jae-Woong Chang, Teng Zhang, Jeongsik Yong
Platform-integrated mRNA isoform quantification. Bioinform. 36(8): 2466-2473 (2020) - [j11]Hsin-Hsiung Huang
Robust discriminant analysis using multi-directional projection pursuit. Pattern Recognit. Lett. 138: 651-656 (2020) - [j10]Feng Yu
Fast Attack-Resilient Distributed State Estimator for Cyber-Physical Systems. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 39(11): 3555-3565 (2020) - [j9]Teng Zhang
Phase Retrieval by Alternating Minimization With Random Initialization. IEEE Trans. Inf. Theory 66(7): 4563-4573 (2020) - [c10]Feng Yu, Yaodan Hu, Teng Zhang, Yier Jin
Special Issue: Resilient Distributed Estimator with Information Consensus for CPS Security. ICCD 2020: 41-44 - [c9]Honggang Yu, Kaichen Yang, Teng Zhang, Yun-Yun Tsai, Tsung-Yi Ho
CloudLeak: Large-Scale Deep Learning Models Stealing Through Adversarial Examples. NDSS 2020 - [i11]Teng Zhang:
Phase retrieval of complex-valued objects via a randomized Kaczmarz method. CoRR abs/2005.03238 (2020)
2010 – 2019
- 2019
- [j8]Tyler Maunu, Teng Zhang, Gilad Lerman:
A Well-Tempered Landscape for Non-convex Robust Subspace Recovery. J. Mach. Learn. Res. 20: 37:1-37:59 (2019) - [c8]Raj Gautam Dutta, Teng Zhang, Yier Jin
Resilient Distributed Filter for State Estimation of Cyber-Physical Systems Under Attack. ACC 2019: 5141-5147 - 2018
- [j7]Gilad Lerman
Exact Camera Location Recovery by Least Unsquared Deviations. SIAM J. Imaging Sci. 11(4): 2692-2721 (2018) - [c7]Raj Gautam Dutta, Feng Yu
Security for safety: a path toward building trusted autonomous vehicles. ICCAD 2018: 92 - [c6]Teng Zhang:
Phase Retrieval Using Alternating Minimization in a Batch Setting. ITA 2018: 1-17 - 2017
- [j6]Ery Arias-Castro, Gilad Lerman, Teng Zhang:
Spectral Clustering Based on Local PCA. J. Mach. Learn. Res. 18: 9:1-9:57 (2017) - [j5]Teng Zhang:
A Majorization-Minimization Algorithm for Computing the Karcher Mean of Positive Definite Matrices. SIAM J. Matrix Anal. Appl. 38(2): 387-400 (2017) - [c5]Raj Gautam Dutta, Xiaolong Guo, Teng Zhang, Kevin A. Kwiat, Charles A. Kamhoua, Laurent Njilla, Yier Jin
Estimation of Safe Sensor Measurements of Autonomous System Under Attack. DAC 2017: 46:1-46:6 - [i10]Tejal Bhamre, Teng Zhang, Amit Singer:
Anisotropic twicing for single particle reconstruction using autocorrelation analysis. CoRR abs/1704.07969 (2017) - [i9]Tyler Maunu, Teng Zhang, Gilad Lerman:
A Well-Tempered Landscape for Non-convex Robust Subspace Recovery. CoRR abs/1706.03896 (2017) - [i8]Gilad Lerman, Yunpeng Shi, Teng Zhang:
Exact Camera Location Recovery by Least Unsquared Deviations. CoRR abs/1709.09683 (2017) - 2016
- [j4]Teng Zhang, Xiuyuan Cheng, Amit Singer
Marčenko-Pastur law for Tyler's M-estimator. J. Multivar. Anal. 149: 114-123 (2016) - [i7]Tejal Bhamre, Teng Zhang, Amit Singer:
Denoising and Covariance Estimation of Single Particle Cryo-EM Images. CoRR abs/1602.06632 (2016) - 2015
- [j3]Gilad Lerman
Robust Computation of Linear Models by Convex Relaxation. Found. Comput. Math. 15(2): 363-410 (2015) - [c4]Tejal Bhamre, Teng Zhang, Amit Singer
Orthogonal matrix retrieval in cryo-electron microscopy. ISBI 2015: 1048-1052 - 2014
- [j2]Teng Zhang, Gilad Lerman:
A novel M-estimator for robust PCA. J. Mach. Learn. Res. 15(1): 749-808 (2014) - [c3]John Goes, Teng Zhang, Raman Arora, Gilad Lerman:
Robust Stochastic Principal Component Analysis. AISTATS 2014: 266-274 - [i6]Tejal Bhamre, Teng Zhang, Amit Singer:
Orthogonal Matrix Retrieval in Cryo-Electron Microscopy. CoRR abs/1412.0494 (2014) - 2012
- [j1]Teng Zhang, Arthur Szlam, Yi Wang, Gilad Lerman
Hybrid Linear Modeling via Local Best-Fit Flats. Int. J. Comput. Vis. 100(3): 217-240 (2012) - [i5]Gilad Lerman, Michael B. McCoy, Joel A. Tropp, Teng Zhang:
Robust computation of linear models, or How to find a needle in a haystack. CoRR abs/1202.4044 (2012) - 2010
- [c2]Teng Zhang, Arthur Szlam, Yi Wang, Gilad Lerman
Randomized hybrid linear modeling by local best-fit flats. CVPR 2010: 1927-1934 - [i4]Teng Zhang, Arthur Szlam, Yi Wang, Gilad Lerman:
Randomized hybrid linear modeling by local best-fit flats. CoRR abs/1005.0858 (2010) - [i3]Teng Zhang, Arthur Szlam, Yi Wang, Gilad Lerman:
Hybrid Linear Modeling via Local Best-fit Flats. CoRR abs/1010.3460 (2010) - [i2]Gilad Lerman, Teng Zhang:
lp-Recovery of the Most Significant Subspace among Multiple Subspaces with Outliers. CoRR abs/1012.4116 (2010)
2000 – 2009
- 2009
- [c1]Teng Zhang, Arthur Szlam, Gilad Lerman
Median K-Flats for hybrid linear modeling with many outliers. ICCV Workshops 2009: 234-241 - [i1]Teng Zhang, Arthur Szlam, Gilad Lerman:
Median K-flats for hybrid linear modeling with many outliers. CoRR abs/0909.3123 (2009)
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-12-11 21:42 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: