Ming Yan

Orcid: 0000-0002-8686-3530

Affiliations:
  • Chinese University of Hong Kong-Shenzhen (CUHK-SZ), Shenzhen, China
  • Michigan State University, Department of Mathematical Sciences / Department of Computational Mathematics, Science and Engineering, East Lansing, MI, USA (former)
  • University of California Los Angeles, Department of Mathematics, CA, USA (PhD 2012)


According to our database1, Ming Yan authored at least 56 papers between 2011 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
Optimal gradient tracking for decentralized optimization.
Math. Program., September, 2024

On the Improved Conditions for Some Primal-Dual Algorithms.
J. Sci. Comput., June, 2024

Provably Accelerated Decentralized Gradient Methods Over Unbalanced Directed Graphs.
SIAM J. Optim., March, 2024

Time-Varying Graph Signal Recovery Using High-Order Smoothness and Adaptive Low-rankness.
CoRR, 2024

2023
Accelerated Sparse Recovery via Gradient Descent with Nonlinear Conjugate Gradient Momentum.
J. Sci. Comput., April, 2023

2022
Compressed Gradient Tracking for Decentralized Optimization Over General Directed Networks.
IEEE Trans. Signal Process., 2022

Phase retrieval from incomplete data via weighted nuclear norm minimization.
Pattern Recognit., 2022

Communication-Efficient Topologies for Decentralized Learning with $O(1)$ Consensus Rate.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021
Decentralized Frequency Alignment for Collaborative Beamforming in Distributed Phased Arrays.
IEEE Trans. Wirel. Commun., 2021

Dual Consensus Proximal Algorithm for Multi-Agent Sharing Problems.
IEEE Trans. Signal Process., 2021

Surface-Aware Blind Image Deblurring.
IEEE Trans. Pattern Anal. Mach. Intell., 2021

A Novel Regularization Based on the Error Function for Sparse Recovery.
J. Sci. Comput., 2021

On the Linear Convergence of Two Decentralized Algorithms.
J. Optim. Theory Appl., 2021

Decentralized Composite Optimization with Compression.
CoRR, 2021

Provably Accelerated Decentralized Gradient Method Over Unbalanced Directed Graphs.
CoRR, 2021

New convergence analysis of a primal-dual algorithm with large stepsizes.
Adv. Comput. Math., 2021

ErrorCompensatedX: error compensation for variance reduced algorithms.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Elastic Graph Neural Networks.
Proceedings of the 38th International Conference on Machine Learning, 2021

Linear Convergent Decentralized Optimization with Compression.
Proceedings of the 9th International Conference on Learning Representations, 2021

2020
Accelerated Schemes for the $L_1/L_2$ Minimization.
IEEE Trans. Signal Process., 2020

Fast algorithms for robust principal component analysis with an upper bound on the rank.
CoRR, 2020

A Multi-Agent Primal-Dual Strategy for Composite Optimization over Distributed Features.
Proceedings of the 28th European Signal Processing Conference, 2020

A Double Residual Compression Algorithm for Efficient Distributed Learning.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
A Decentralized Proximal-Gradient Method With Network Independent Step-Sizes and Separated Convergence Rates.
IEEE Trans. Signal Process., 2019

Robust mixed one-bit compressive sensing.
Signal Process., 2019

Fast and robust deconvolution of tumor infiltrating lymphocyte from expression profiles using least trimmed squares.
PLoS Comput. Biol., 2019

Manifold denoising by Nonlinear Robust Principal Component Analysis.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Image Smoothing Via Gradient Sparsity and Surface Area Minimization.
Proceedings of the 2019 IEEE International Conference on Image Processing, 2019

2018
Fast Signal Recovery From Saturated Measurements by Linear Loss and Nonconvex Penalties.
IEEE Signal Process. Lett., 2018

Nonconvex penalties with analytical solutions for one-bit compressive sensing.
Signal Process., 2018

A New Primal-Dual Algorithm for Minimizing the Sum of Three Functions with a Linear Operator.
J. Sci. Comput., 2018

Fast L1-L2 Minimization via a Proximal Operator.
J. Sci. Comput., 2018

Pinball loss minimization for one-bit compressive sensing: Convex models and algorithms.
Neurocomputing, 2018

D<sup>2</sup>: Decentralized Training over Decentralized Data.
Proceedings of the 35th International Conference on Machine Learning, 2018

2017
Non-convex Penalties with Analytical Solutions for One-bit Compressive Sensing.
CoRR, 2017

Mixed one-bit compressive sensing with applications to overexposure correction for CT reconstruction.
CoRR, 2017

Exploring Outliers in Crowdsourced Ranking for QoE.
Proceedings of the 2017 ACM on Multimedia Conference, 2017

2016
ARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates.
SIAM J. Sci. Comput., 2016

A Multiphase Image Segmentation Based on Fuzzy Membership Functions and L1-Norm Fidelity.
J. Sci. Comput., 2016

On the Convergence of Asynchronous Parallel Iteration with Arbitrary Delays.
CoRR, 2016

Coordinate Friendly Structures, Algorithms and Applications.
CoRR, 2016

Fast L<sub>1</sub>-L<sub>2</sub> Minimization via a Proximal Operator.
CoRR, 2016

One condition for solution uniqueness and robustness of both l1-synthesis and l1-analysis minimizations.
Adv. Comput. Math., 2016

2015
Pinball Loss Minimization for One-bit Compressive Sensing.
CoRR, 2015

2014
Fast Adaptive Least Trimmed Squares for Robust Evaluation of Quality of Experience.
CoRR, 2014

2013
Restoration of Images Corrupted by Impulse Noise and Mixed Gaussian Impulse Noise Using Blind Inpainting.
SIAM J. Imaging Sci., 2013

Exact Low-Rank Matrix Completion from Sparsely Corrupted Entries Via Adaptive Outlier Pursuit.
J. Sci. Comput., 2013

Convergence analysis of SART: optimization and statistics.
Int. J. Comput. Math., 2013

One condition for all: solution uniqueness and robustness of ℓ<sub>1</sub>-synthesis and ℓ<sub>1</sub>-analysis minimizations
CoRR, 2013

Parallel and distributed sparse optimization.
Proceedings of the 2013 Asilomar Conference on Signals, 2013

2012
Image and Signal Processing with Non-Gaussian Noise: EM-Type Algorithms and Adaptive Outlier Pursuit.
PhD thesis, 2012

Robust 1-bit Compressive Sensing Using Adaptive Outlier Pursuit.
IEEE Trans. Signal Process., 2012

A Hybrid Architecture for Compressive Sensing 3-D CT Reconstruction.
IEEE J. Emerg. Sel. Topics Circuits Syst., 2012

FPGA-accelerated 3D reconstruction using compressive sensing.
Proceedings of the ACM/SIGDA 20th International Symposium on Field Programmable Gate Arrays, 2012

2011
EM+TV Based Reconstruction for Cone-Beam CT with Reduced Radiation.
Proceedings of the Advances in Visual Computing - 7th International Symposium, 2011

EM-Type Algorithms for Image Reconstruction with Background Emission and Poisson Noise.
Proceedings of the Advances in Visual Computing - 7th International Symposium, 2011


  Loading...