default search action
Sheng Chen 0014
Person information
- affiliation: University of Minnesota, Department of Computer Science and Engineering, Twin Cities, USA
Other persons with the same name
- Sheng Chen — disambiguation page
- Sheng Chen 0001 — University of Southampton, Electronics and Computer Science, UK
- Sheng Chen 0002 — Xidian University, Software Engineering Institute, China
- Sheng Chen 0003 — Wuhan Iron and Steel Group Company, China (and 1 more)
- Sheng Chen 0005 — Stevens Institute of Technology
- Sheng Chen 0006 — Nanyang Technological University, Singapore
- Sheng Chen 0007 — Harbin Institute of Technology, Department of Mathematics, China
- Sheng Chen 0008 — University of Louisiana at Lafayette, USA (and 1 more)
- Sheng Chen 0009 — University of Shanghai for Science and Technology, Center of Optical Instrument and System, China (and 1 more)
- Sheng Chen 0010 — Nanjing University of Information Science and Technology, School of Information and Control, China (and 1 more)
- Sheng Chen 0011 — Hohai University, College of Energy and Electrical Engineering, Nanjing, China
- Sheng Chen 0012 — Hunan University, College of Electrical and Information Engineering, Changsha, China
- Sheng Chen 0013 — Tsinghua University, Beijing National Research Center for Information Science and Technology, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [c11]Sheng Chen, Arindam Banerjee:
Sparse Linear Isotonic Models. AISTATS 2018: 1270-1279 - [c10]Sheng Chen, Arindam Banerjee:
An Improved Analysis of Alternating Minimization for Structured Multi-Response Regression. NeurIPS 2018: 6617-6628 - [c9]Yingxue Zhou, Sheng Chen, Arindam Banerjee:
Stable Gradient Descent. UAI 2018: 766-775 - 2017
- [c8]Sheng Chen, Arindam Banerjee:
Robust Structured Estimation with Single-Index Models. ICML 2017: 712-721 - [c7]Sheng Chen, Arindam Banerjee:
Alternating Estimation for Structured High-Dimensional Multi-Response Models. NIPS 2017: 2838-2848 - 2016
- [c6]Sheng Chen, Arindam Banerjee:
Structured Matrix Recovery via the Generalized Dantzig Selector. NIPS 2016: 3252-3260 - 2015
- [c5]Sheng Chen, Arindam Banerjee:
One-bit Compressed Sensing with the k-Support Norm. AISTATS 2015 - [c4]Arindam Banerjee, Sheng Chen, Vidyashankar Sivakumar:
Open Problem: Restricted Eigenvalue Condition for Heavy Tailed Designs. COLT 2015: 1752-1755 - [c3]Sheng Chen, Arindam Banerjee:
Structured Estimation with Atomic Norms: General Bounds and Applications. NIPS 2015: 2908-2916 - [i2]Arindam Banerjee, Sheng Chen, Farideh Fazayeli, Vidyashankar Sivakumar:
Estimation with Norm Regularization. CoRR abs/1505.02294 (2015) - 2014
- [c2]Arindam Banerjee, Sheng Chen, Farideh Fazayeli, Vidyashankar Sivakumar:
Estimation with Norm Regularization. NIPS 2014: 1556-1564 - [c1]Soumyadeep Chatterjee, Sheng Chen, Arindam Banerjee:
Generalized Dantzig Selector: Application to the k-support norm. NIPS 2014: 1934-1942 - [i1]Soumyadeep Chatterjee, Sheng Chen, Arindam Banerjee:
Generalized Dantzig Selector: Application to the k-support norm. CoRR abs/1406.5291 (2014)
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-08 20:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint