Ke Wei

Orcid: 0000-0003-1222-3044

Affiliations:
  • Fudan University, Shanghai, China


According to our database1, Ke Wei authored at least 25 papers between 2013 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Global Convergence of Natural Policy Gradient with Hessian-Aided Momentum Variance Reduction.
J. Sci. Comput., November, 2024

Decentralized Natural Policy Gradient with Variance Reduction for Collaborative Multi-Agent Reinforcement Learning.
J. Mach. Learn. Res., 2024

Leave-One-Out Analysis for Nonconvex Robust Matrix Completion with General Thresholding Functions.
CoRR, 2024

2023
Implicit Regularization and Entrywise Convergence of Riemannian Optimization for Low Tucker-Rank Tensor Completion.
J. Mach. Learn. Res., 2023

On the Linear Convergence of Policy Gradient under Hadamard Parameterization.
CoRR, 2023

2022
Vectorized Hankel Lift: A Convex Approach for Blind Super-Resolution of Point Sources.
IEEE Trans. Inf. Theory, 2022

Approximation Theory of Total Variation Minimization for Data Completion.
CoRR, 2022

2021
Fast Cadzow's Algorithm and a Gradient Variant.
J. Sci. Comput., 2021

2020
Toward the Optimal Construction of a Loss Function Without Spurious Local Minima for Solving Quadratic Equations.
IEEE Trans. Inf. Theory, 2020

Data Driven Tight Frame for Compressed Sensing MRI Reconstruction via Off-the-Grid Regularization.
SIAM J. Imaging Sci., 2020

Image Restoration: Structured Low Rank Matrix Framework for Piecewise Smooth Functions and Beyond.
CoRR, 2020

2019
Accelerated Alternating Projections for Robust Principal Component Analysis.
J. Mach. Learn. Res., 2019

Off-the-Grid Compressed Sensing MRI Reconstruction via Data Driven Tight Frame Regularization.
CoRR, 2019

Exact matrix completion based on low rank Hankel structure in the Fourier domain.
CoRR, 2019

2018
Spectral Compressed Sensing via Projected Gradient Descent.
SIAM J. Optim., 2018

Towards the optimal construction of a loss function without spurious local minima for solving quadratic equations.
CoRR, 2018

Exploiting the structure effectively and efficiently in low rank matrix recovery.
CoRR, 2018

2017
A Fast Algorithm for the Convolution of Functions with Compact Support Using Fourier Extensions.
SIAM J. Sci. Comput., 2017

New region force for variational models in image segmentation and high dimensional data clustering.
CoRR, 2017

2016
Guarantees of Riemannian Optimization for Low Rank Matrix Recovery.
SIAM J. Matrix Anal. Appl., 2016

Fast and Provable Algorithms for Spectrally Sparse Signal Reconstruction via Low-Rank Hankel Matrix Completion.
CoRR, 2016

2015
Conjugate Gradient Iterative Hard Thresholding: Observed Noise Stability for Compressed Sensing.
IEEE Trans. Signal Process., 2015

Fast Iterative Hard Thresholding for Compressed Sensing.
IEEE Signal Process. Lett., 2015

2013
Normalized Iterative Hard Thresholding for Matrix Completion.
SIAM J. Sci. Comput., 2013

Matrix completion algorithms with optimal phase transition.
Proceedings of the 21st European Signal Processing Conference, 2013


  Loading...