activity
20212026
most citedBlind Super-resolution of Point Sources via Projected Gradient Descent

10 citations · 12 across the 9 of their papers we have counts for

collaborators

9 papers

cs.IT2026

Non-Asymptotic Performance Guarantees for MLE under a Gumbel-Softmax Index Model with Phaseless Measurements

Jinchi Chen, Mingxi Hu, Peigang Jiang +3

This paper studies the recovery of a complex-valued signal from index-only observations generated by a phaseless Gumbel-Softmax model. The model is motivated by limited-feedback fr…

cs.LG2024

Global Convergence of Natural Policy Gradient with Hessian-aided Momentum Variance Reduction

Jie Feng, Ke Wei, Jinchi Chen

Natural policy gradient (NPG) and its variants are widely-used policy search methods in reinforcement learning. Inspired by prior work, a new NPG variant coined NPG-HM is developed…

math.OC2023

A Zeroth-Order Variance-Reduced Method for Decentralized Stochastic Non-convex Optimization

Hongxu Chen, Jinchi Chen, Ke Wei

In this paper, we consider a distributed stochastic non-convex optimization problem, which is about minimizing a sum of local cost functions over a network with only zeroth-ord…

math.OC2023

On the Linear Convergence of Policy Gradient under Hadamard Parameterization

Jiacai Liu, Jinchi Chen, Ke Wei

The convergence of deterministic policy gradient under the Hadamard parameterization is studied in the tabular setting and the linear convergence of the algorithm is established. T…

math.OC2022

Decentralized Natural Policy Gradient with Variance Reduction for Collaborative Multi-Agent Reinforcement Learning

Jinchi Chen, Jie Feng, Weiguo Gao +1

This paper studies a policy optimization problem arising from collaborative multi-agent reinforcement learning in a decentralized setting where agents communicate with their neighb…

cs.IT2021★ 10 cited

Blind Super-resolution of Point Sources via Projected Gradient Descent

Sihan Mao, Jinchi Chen

Blind super-resolution can be cast as a low rank matrix recovery problem by exploiting the inherent simplicity of the signal and the low dimensional structure of point spread funct…

cs.IT2021

Blind Super-resolution via Projected Gradient Descent

Sihan Mao, Jinchi Chen

Blind super-resolution can be cast as low rank matrix recovery problem by exploiting the inherent simplicity of the signal. In this paper, we develop a simple yet efficient nonconv…

cs.IT2021

Blind super-resolution of point sources via fast iterative hard thresholding

Zengying Zhu, Jinchi Chen, Weiguo Gao

In this work, we develop a provable fast algorithm for blind super-resolution based on the low rank structure of vectorized Hankel matrix associated with the target matrix. Theoret…

math.OC2021★ 2 cited

Implicit Regularization and Entrywise Convergence of Riemannian Optimization for Low Tucker-Rank Tensor Completion

Haifeng Wang, Jinchi Chen, Ke Wei

This paper is concerned with the low Tucker-rank tensor completion problem, which is about reconstructing a tensor of low multilinear rank f…