paper-with-me

Papers

Stochastic Natural Thresholding Algorithms

2023-06-07 · Rachel Grotheer, Shuang Li, Anna Ma, Deanna Needell, Jing Qin

Sparse signal recovery is one of the most fundamental problems in various applications, including medical imaging and remote sensing. Many greedy algorithms based on the family of hard thresholding operators have been developed to solve the sparse signal recovery problem. More recently, Natural Thresholding (NT) has been proposed with improved computational efficiency. This paper proposes and discusses convergence guarantees for stochastic natural thresholding algorithms by extending the NT from the deterministic version with linear measurements to the stochastic version with a general objective function. We also conduct various numerical experiments on linear and nonlinear measurements to demonstrate the performance of StoNT.

📄 PDF Abstract BibTeX arXiv:2306.04730

Code (0)

등록된 구현이 없습니다.

Tasks

Computational Efficiency

Similar Papers 제목 키워드 기반

Stochastic Hard Thresholding Algorithms for AUC Maximization

2020-11-04 · Zhenhuan Yang, Baojian Zhou, Yunwen Lei, Yiming Ying

In this paper, we aim to develop stochastic hard thresholding algorithms for the important problem of AUC maximization in imbalanced classification. The main challenge is the pairwise loss involved in AUC maximization. W…

imbalanced classification

Efficient High-Dimensional Data Representation Learning via Semi-Stochastic Block Coordinate Descent Methods

2019-09-25 · Bingkun Wei, Yangyang Li, Fanhua Shang, Yuanyuan Liu 외

With the increase of data volume and data dimension, sparse representation learning attracts more and more attention. For high-dimensional data, randomized block coordinate descent methods perform well because they do no…

Face RecognitionRepresentation Learning

Efficient Stochastic Gradient Hard Thresholding

2018-12-01 · NeurIPS 2018 12 · Pan Zhou, Xiao-Tong Yuan, Jiashi Feng

Stochastic gradient hard thresholding methods have recently been shown to work favorably in solving large-scale empirical risk minimization problems under sparsity or rank constraint. Despite the improved iteration compl…

Computational Efficiency

Efficient Relaxed Gradient Support Pursuit for Sparsity Constrained Non-convex Optimization

2019-12-02 · Fanhua Shang, Bingkun Wei, Hongying Liu, Yuanyuan Liu 외

Large-scale non-convex sparsity-constrained problems have recently gained extensive attention. Most existing deterministic optimization methods (e.g., GraSP) are not suitable for large-scale and high-dimensional problems…

Stochastic Optimization

Reflected Diffusion Models

2023-04-10 · Aaron Lou, Stefano Ermon

Score-based diffusion models learn to reverse a stochastic differential equation that maps data to noise. However, for complex tasks, numerical error can compound and result in highly unnatural samples. Previous work mit…

Image Generation