default search action
Ke Wei 0001
Person information
- affiliation: Fudan University, Shanghai, China
Other persons with the same name
- Wei Ke (aka: Ke Wei) — disambiguation page
- Ke Wei 0002
— Central South University, School of Automation, Changsha, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j14]Jinchi Chen, Jie Feng, Weiguo Gao, Ke Wei:
Decentralized Natural Policy Gradient with Variance Reduction for Collaborative Multi-Agent Reinforcement Learning. J. Mach. Learn. Res. 25: 172:1-172:49 (2024) - [j13]Jie Feng, Ke Wei, Jinchi Chen
Global Convergence of Natural Policy Gradient with Hessian-Aided Momentum Variance Reduction. J. Sci. Comput. 101(2): 44 (2024) - [i14]Jie Feng, Ke Wei, Jinchi Chen:
Global Convergence of Natural Policy Gradient with Hessian-aided Momentum Variance Reduction. CoRR abs/2401.01084 (2024) - [i13]Tianming Wang, Ke Wei:
Leave-One-Out Analysis for Nonconvex Robust Matrix Completion with General Thresholding Functions. CoRR abs/2407.19446 (2024) - 2023
- [j12]Haifeng Wang, Jinchi Chen, Ke Wei:
Implicit Regularization and Entrywise Convergence of Riemannian Optimization for Low Tucker-Rank Tensor Completion. J. Mach. Learn. Res. 24: 347:1-347:84 (2023) - [i12]Jiacai Liu, Jinchi Chen, Ke Wei:
On the Linear Convergence of Policy Gradient under Hadamard Parameterization. CoRR abs/2305.19575 (2023) - 2022
- [j11]Jinchi Chen
Vectorized Hankel Lift: A Convex Approach for Blind Super-Resolution of Point Sources. IEEE Trans. Inf. Theory 68(12): 8280-8309 (2022) - [i11]Jian-Feng Cai, Jae Kyu Choi, Ke Wei:
Approximation Theory of Total Variation Minimization for Data Completion. CoRR abs/2207.07473 (2022) - 2021
- [j10]Haifeng Wang, Jian-Feng Cai, Tianming Wang, Ke Wei
Fast Cadzow's Algorithm and a Gradient Variant. J. Sci. Comput. 88(2): 41 (2021) - 2020
- [j9]Jian-Feng Cai, Jae Kyu Choi
Data Driven Tight Frame for Compressed Sensing MRI Reconstruction via Off-the-Grid Regularization. SIAM J. Imaging Sci. 13(3): 1272-1301 (2020) - [j8]Zhenzhen Li
Toward the Optimal Construction of a Loss Function Without Spurious Local Minima for Solving Quadratic Equations. IEEE Trans. Inf. Theory 66(5): 3242-3260 (2020) - [i10]Jinchi Chen, Weiguo Gao, Sihan Mao, Ke Wei:
Vectorized Hankel Lift: A Convex Approach for Blind Super-Resolution of Point Sources. CoRR abs/2008.05092 (2020) - [i9]Jian-Feng Cai, Jae Kyu Choi, Jingyang Li, Ke Wei:
Image Restoration: Structured Low Rank Matrix Framework for Piecewise Smooth Functions and Beyond. CoRR abs/2012.06827 (2020)
2010 – 2019
- 2019
- [j7]HanQin Cai, Jian-Feng Cai, Ke Wei:
Accelerated Alternating Projections for Robust Principal Component Analysis. J. Mach. Learn. Res. 20: 20:1-20:33 (2019) - [i8]Haifeng Wang, Jian-Feng Cai, Tianming Wang, Ke Wei:
Fast Cadzow's Algorithm and a Gradient Variant. CoRR abs/1906.03572 (2019) - [i7]Jinchi Chen, Weiguo Gao, Ke Wei:
Exact matrix completion based on low rank Hankel structure in the Fourier domain. CoRR abs/1910.02576 (2019) - [i6]Jian-Feng Cai, Jae Kyu Choi, Ke Wei:
Off-the-Grid Compressed Sensing MRI Reconstruction via Data Driven Tight Frame Regularization. CoRR abs/1911.03150 (2019) - 2018
- [j6]Jian-Feng Cai, Tianming Wang, Ke Wei:
Spectral Compressed Sensing via Projected Gradient Descent. SIAM J. Optim. 28(3): 2625-2653 (2018) - [i5]Jian-Feng Cai, Ke Wei:
Exploiting the structure effectively and efficiently in low rank matrix recovery. CoRR abs/1809.03652 (2018) - [i4]Zhenzhen Li
Towards the optimal construction of a loss function without spurious local minima for solving quadratic equations. CoRR abs/1809.10520 (2018) - 2017
- [j5]Kuan Xu, Anthony P. Austin, Ke Wei
A Fast Algorithm for the Convolution of Functions with Compact Support Using Fourier Extensions. SIAM J. Sci. Comput. 39(6) (2017) - [i3]Ke Wei, Ke Yin, Xue-Cheng Tai, Tony F. Chan:
New region force for variational models in image segmentation and high dimensional data clustering. CoRR abs/1704.08218 (2017) - [i2]HanQin Cai, Jian-Feng Cai, Ke Wei:
Accelerated Alternating Projections for Robust Principal Component Analysis. CoRR abs/1711.05519 (2017) - 2016
- [j4]Ke Wei
Guarantees of Riemannian Optimization for Low Rank Matrix Recovery. SIAM J. Matrix Anal. Appl. 37(3): 1198-1222 (2016) - [i1]Jian-Feng Cai, Tianming Wang, Ke Wei:
Fast and Provable Algorithms for Spectrally Sparse Signal Reconstruction via Low-Rank Hankel Matrix Completion. CoRR abs/1606.01567 (2016) - 2015
- [j3]Ke Wei
Fast Iterative Hard Thresholding for Compressed Sensing. IEEE Signal Process. Lett. 22(5): 593-597 (2015) - [j2]Jeffrey D. Blanchard, Jared Tanner, Ke Wei
Conjugate Gradient Iterative Hard Thresholding: Observed Noise Stability for Compressed Sensing. IEEE Trans. Signal Process. 63(2): 528-537 (2015) - 2013
- [j1]Jared Tanner, Ke Wei
Normalized Iterative Hard Thresholding for Matrix Completion. SIAM J. Sci. Comput. 35(5) (2013) - [c1]Jared Tanner, Ke Wei:
Matrix completion algorithms with optimal phase transition. EUSIPCO 2013: 1-2
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-17 21:00 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: