← Search

Junqi Tang

7 accepted papers

2026

Blessing of Dimensionality for Approximating Sobolev Classes on Manifolds

AAAI 2026technical

The manifold hypothesis says that natural high-dimensional data lie on or around a low-dimensional manifold. The recent success of statistical and learning-based methods in very high dimensions empirically supports this hypothesis, suggesting that typical worst-case analysis does not provide practic

Cited by 0SourcePDFScholar
2025

Iterative Operator Sketching Framework for Large-Scale Imaging Inverse Problems

ICASSP 2025accepted

Despite impressive empirical performance in various imaging applications, iterative data-driven reconstruction (IDR) schemes such as plug-and-play algorithms and deep unrolling networks can have significant computational limitations, especially for large-scale imaging inverse problems. This is mostl…

Cited by 0SourceScholar
2023

Robust Data-Driven Accelerated Mirror Descent

ICASSP 2023accepted

Learning-to-optimize is an emerging framework that leverages training data to speed up the solution of certain optimization problems. One such approach is based on the classical mirror descent algorithm, where the mirror map is modelled using input-convex neural networks. In this work, we extend thi…

Cited by 0SourceScholar
2019

The Limitation and Practical Acceleration of Stochastic Gradient Algorithms in Inverse Problems

ICASSP 2019accepted

In this work we investigate the practicability of stochastic gradient descent and recently introduced variants with variance-reduction techniques in imaging inverse problems, such as space-varying image deblurring. Such algorithms have been shown in machine learning literature to have optimal comple…

Cited by 0SourceScholar
2018

Rest-Katyusha: Exploiting the Solution's Structure via Scheduled Restart Schemes

NeurIPS 2018poster

We propose a structure-adaptive variant of the state-of-the-art stochastic variance-reduced gradient algorithm Katyusha for regularized empirical risk minimization. The proposed method is able to exploit the intrinsic low-dimensional structure of the solution, such as sparsity or low rank which is…

Cited by 20SourcePDFScholar
2017

Gradient Projection Iterative Sketch for Large-Scale Constrained Least-Squares

ICML 2017poster

We propose a randomized first order optimization algorithm Gradient Projection Iterative Sketch (GPIS) and an accelerated variant for efficiently solving large scale constrained Least Squares (LS). We provide the first theoretical convergence analysis for both algorithms. An efficient implementation…