Jian-Feng Cai

Orcid: 0000-0003-2571-570X

Affiliations:
  • Hong Kong University of Science and Technology, Department of Mathematics, Hong Kong
  • University of Iowa, Department of Mathematics, IA, USA (2011 - 2015)
  • University of California, Los Angeles, CA, USA (2009 - 2011)
  • National University of Singapore, Singapore (2007 - 2009)
  • Chinese University of Hong Kong, Department of Mathematics, Hong Kong (PhD 2007)


According to our database1, Jian-Feng Cai authored at least 90 papers between 2004 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
Restoration Guarantee of Image Inpainting via Low Rank Patch Matrix Completion.
SIAM J. Imaging Sci., 2024

A Preconditioned Fast Iterative Hard Thresholding Algorithm for Spectrally Sparse Signal Reconstruction.
Proceedings of the 13th IEEE Sensor Array and Multichannel Signal Processing Workshop, 2024

On the Convergence of Projected Bures-Wasserstein Gradient Descent under Euclidean Strong Convexity.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

A Fast and Provable Algorithm for Sparse Phase Retrieval.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

RL in Markov Games with Independent Function Approximation: Improved Sample Complexity Bound under the Local Access Model.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023
Structured Gradient Descent for Fast Robust Low-Rank Hankel Matrix Completion.
SIAM J. Sci. Comput., June, 2023

Restoration Guarantee of Image Inpainting via Low Rank Patch Matrix Completion.
CoRR, 2023

Online Tensor Learning: Computational and Statistical Trade-offs, Adaptivity and Optimal Regret.
CoRR, 2023

Computationally Efficient and Statistically Optimal Robust High-Dimensional Linear Regression.
CoRR, 2023

Asymptotically Sharp Upper Bound for the Column Subset Selection Problem.
CoRR, 2023

Fast Projected Newton-like Method for Precision Matrix Estimation under Total Positivity.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Spectral Super-Resolution on the Unit Circle Via Gradient Descent.
Proceedings of the IEEE International Conference on Acoustics, 2023

2022
Sample-Efficient Sparse Phase Retrieval via Stochastic Alternating Minimization.
IEEE Trans. Signal Process., 2022

Provable Tensor-Train Format Tensor Completion by Riemannian Optimization.
J. Mach. Learn. Res., 2022

Provable Sample-Efficient Sparse Phase Retrieval Initialized by Truncated Power Method.
CoRR, 2022

Two Stage Continuous Domain Regularization for Piecewise Constant Image Restoration.
CoRR, 2022

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

Nearly optimal bounds for the global geometric landscape of phase retrieval.
CoRR, 2022

Computationally Efficient and Statistically Optimal Robust Low-rank Matrix Estimation.
CoRR, 2022

2021
Accelerated Structured Alternating Projections for Robust Spectrally Sparse Signal Recovery.
IEEE Trans. Signal Process., 2021

An Automatic Denoising Method for NMR Spectroscopy Based on Low-Rank Hankel Model.
IEEE Trans. Instrum. Meas., 2021

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

Scalable Incremental Nonconvex Optimization Approach for Phase Retrieval.
J. Sci. Comput., 2021

The global landscape of phase retrieval II: quotient intensity models.
CoRR, 2021

The global landscape of phase retrieval I: perturbed amplitude models.
CoRR, 2021

Fast Projected Newton-like Method for Precision Matrix Estimation with Nonnegative Partial Correlations.
CoRR, 2021

Solving phase retrieval with random initial guess is nearly as good as by spectral initialization.
CoRR, 2021

2020
Multi-Direction Dictionary Learning Based Depth Map Super-Resolution With Autoregressive Modeling.
IEEE Trans. Multim., 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

Provable Near-Optimal Low-Multilinear-Rank Tensor Recovery.
CoRR, 2020

Sparse Signal Recovery From Phaseless Measurements via Hard Thresholding Pursuit.
CoRR, 2020

Image Inpainting Based on Multi-frequency Probabilistic Inference Model.
Proceedings of the MM '20: The 28th ACM International Conference on Multimedia, 2020

2019
Fast Rank-One Alternating Minimization Algorithm for Phase Retrieval.
J. Sci. Comput., 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

Fast and Robust Spectrally Sparse Signal Recovery: A Provable Non-Convex Approach via Robust Low-Rank Hankel Matrix Reconstruction.
CoRR, 2019

A stochastic alternating minimizing method for sparse phase retrieval.
CoRR, 2019

Data-driven Method for 3D Axis-symmetric Object Reconstruction from Single Cone-beam Projection Data.
Proceedings of the Third International Symposium on Image Computing and Digital Medicine, 2019

Fast Single Image Reflection Suppression via Convex Optimization.
Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2019

2018
Vandermonde Factorization of Hankel Matrix for Complex Exponential Signal Recovery - Application in Fast NMR Spectroscopy.
IEEE Trans. Signal Process., 2018

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

Enhanced Expressive Power and Fast Training of Neural Networks by Random Projections.
CoRR, 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

Sep]ration-Free Super-Resolution from Compressed Measurements is Possible: an Orthonormal Atomic Norm Minimization Approach.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Data-Driven Tight Frame for CRYO-EM Image Denoising and Conformational Classification.
Proceedings of the 2018 IEEE Global Conference on Signal and Information Processing, 2018

2017
Hankel Matrix Nuclear Norm Regularized Tensor Completion for N-dimensional Exponential Signals.
IEEE Trans. Signal Process., 2017

Separation-Free Super-Resolution from Compressed Measurements is Possible: an Orthonormal Atomic Norm Minimization Approach.
CoRR, 2017

Large scale 2D spectral compressed sensing in continuous domain.
Proceedings of the 2017 IEEE International Conference on Acoustics, 2017

Accelerated magnetic resonance spectroscopy with Vandermonde factorization.
Proceedings of the 2017 39th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC), 2017

2016
Projected Iterative Soft-Thresholding Algorithm for Tight Frames in Compressed Sensing Magnetic Resonance Imaging.
IEEE Trans. Medical Imaging, 2016

Fast Multiclass Dictionaries Learning With Geometrical Directions in MRI Reconstruction.
IEEE Trans. Biomed. Eng., 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

Precise phase transition of total variation minimization.
Proceedings of the 2016 IEEE International Conference on Acoustics, 2016

Fast alternating projected gradient descent algorithms for recovering spectrally sparse signals.
Proceedings of the 2016 IEEE International Conference on Acoustics, 2016

2015
Block Iterative Reweighted Algorithms for Super-Resolution of Spectrally Sparse Signals.
IEEE Signal Process. Lett., 2015

Fast Multi-class Dictionaries Learning with Geometrical Directions in MRI Reconstruction.
CoRR, 2015

A Simple and Fast Iterative Soft-thresholding Algorithm for Tight Frames in Compressed Sensing Magnetic Resonance Imaging.
CoRR, 2015

Robust recovery of complex exponential signals from random Gaussian projections via low rank Hankel matrix reconstruction.
CoRR, 2015

Projected Wirtinger Gradient Descent for Low-Rank Hankel Matrix Completion in Spectral Compressed Sensing.
CoRR, 2015

2014
Cine Cone Beam CT Reconstruction Using Low-Rank Matrix Factorization: Algorithm and a Proof-of-Principle Study.
IEEE Trans. Medical Imaging, 2014

Precise semidefinite programming formulation of atomic norm minimization for recovering d-dimensional (D ≥ 2) off-the-grid frequencies.
Proceedings of the 2014 Information Theory and Applications Workshop, 2014

Incoherent dictionary learning for sparse representation based image denoising.
Proceedings of the 2014 IEEE International Conference on Image Processing, 2014

2013
Sparse Error Correction From Nonlinear Measurements With Applications in Bad Data Detection for Power Networks.
IEEE Trans. Signal Process., 2013

Precise Semidefinite Programming Formulation of Atomic Norm Minimization for Recovering d-Dimensional ($d\geq 2$) Off-the-Grid Frequencies.
CoRR, 2013

Fast Sparsity-Based Orthogonal Dictionary Learning for Image Restoration.
Proceedings of the IEEE International Conference on Computer Vision, 2013

Guarantees of total variation minimization for signal recovery.
Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012
Framelet-Based Blind Motion Deblurring From a Single Image.
IEEE Trans. Image Process., 2012

2011
Strongly Convex Programming for Exact Matrix Completion and Robust Principal Component Analysis
CoRR, 2011

Multigrid algorithm from cyclic reduction for Markovian queueing networks.
Appl. Math. Comput., 2011

2010
A Singular Value Thresholding Algorithm for Matrix Completion.
SIAM J. Optim., 2010

Fast Two-Phase Image Deblurring Under Impulse Noise.
J. Math. Imaging Vis., 2010

Split Bregman Method for Sparse Inverse Covariance Estimation with Matrix Iteration Acceleration
CoRR, 2010

2009
Linearized Bregman Iterations for Frame-Based Image Deblurring.
SIAM J. Imaging Sci., 2009

Simultaneously inpainting in image and transformed domains.
Numerische Mathematik, 2009

Convergence of the linearized Bregman iteration for ℓ<sub>1</sub>-norm minimization.
Math. Comput., 2009

Linearized Bregman iterations for compressed sensing.
Math. Comput., 2009

Split Bregman Methods and Frame Based Image Restoration.
Multiscale Model. Simul., 2009

Blind motion deblurring using multiple images.
J. Comput. Phys., 2009

Convergence analysis of tight framelet approach for missing data recovery.
Adv. Comput. Math., 2009

High-quality curvelet-based motion deblurring from an image pair.
Proceedings of the 2009 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2009), 2009

Blind motion deblurring from a single image using sparse approximation.
Proceedings of the 2009 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2009), 2009

2008
Restoration of Chopped and Nodded Images by Framelets.
SIAM J. Sci. Comput., 2008

2007
Minimization of a Detail-Preserving Regularization Functional for Impulse Noise Removal.
J. Math. Imaging Vis., 2007

2006
Interval iterative methods for computing Moore-Penrose inverse.
Appl. Math. Comput., 2006

2004
Computing Moore-Penrose inverses of Toeplitz matrices by Newton's iteration.
Math. Comput. Model., 2004

Displacement structure of weighted pseudoinverses.
Appl. Math. Comput., 2004


  Loading...