368 citations · 1.4k across the 51 of their papers we have counts for
5 papers · 1 filter
Fast algorithms for Higher-order Singular Value Decomposition from incomplete data
Yangyang Xu
Higher-order singular value decomposition (HOSVD) is an efficient way for data reduction and also eliciting intrinsic structure of multi-dimensional array data. It has been used in…
A globally convergent algorithm for nonconvex optimization based on block coordinate update
Yangyang Xu, Wotao Yin
Nonconvex optimization problems arise in many areas of computational science and engineering and are (approximately) solved by a variety of algorithms. Existing algorithms usually…
A fast patch-dictionary method for whole image recovery
Yangyang Xu, Wotao Yin
Various algorithms have been proposed for dictionary learning. Among those for image processing, many use image patches to form dictionaries. This paper focuses on whole-image reco…
Block stochastic gradient iteration for convex and nonconvex optimization
Yangyang Xu, Wotao Yin
The stochastic gradient (SG) method can minimize an objective function composed of a large number of differentiable functions, or solve a stochastic optimization problem, to a mode…
Sparse Bilinear Logistic Regression
Jianing V. Shi, Yangyang Xu, Richard G. Baraniuk
In this paper, we introduce the concept of sparse bilinear logistic regression for decision problems involving explanatory variables that are two-dimensional matrices. Such problem…