activity
20202023
most citedOn Asymptotic Linear Convergence of Projected Gradient Descent for Constrained Least Squares

17 citations · 28 across the 7 of their papers we have counts for

collaborators

7 papers

cs.IR2023★ 3 cited

Better Generalization with Semantic IDs: A Case Study in Ranking for Recommendations

Anima Singh, Trung Vu, Nikhil Mehta +9

Randomly-hashed item ids are used ubiquitously in recommendation models. However, the learned representations from random hashing prevents generalization across similar items, caus…

math.OC2022

On Local Linear Convergence of Projected Gradient Descent for Unit-Modulus Least Squares

Trung Vu, Raviv Raich, Xiao Fu

The unit-modulus least squares (UMLS) problem has a wide spectrum of applications in signal processing, e.g., phase-only beamforming, phase retrieval, radar code design, and sensor…

math.OC2021★ 8 cited

On Asymptotic Linear Convergence Rate of Iterative Hard Thresholding for Matrix Completion

Trung Vu, Evgenia Chunikhina, Raviv Raich

Iterative hard thresholding (IHT) has gained in popularity over the past decades in large-scale optimization. However, convergence properties of this method have only been explored…

math.OC2021★ 17 cited

On Asymptotic Linear Convergence of Projected Gradient Descent for Constrained Least Squares

Trung Vu, Raviv Raich

Many recent problems in signal processing and machine learning such as compressed sensing, image restoration, matrix/tensor recovery, and non-negative matrix factorization can be c…

eess.SY2021

A Closed-Form Bound on the Asymptotic Linear Convergence of Iterative Methods via Fixed Point Analysis

Trung Vu, Raviv Raich

In many iterative optimization methods, fixed-point theory enables the analysis of the convergence rate via the contraction factor associated with the linear approximation of the f…

math.OC2021

Exact Linear Convergence Rate Analysis for Low-Rank Symmetric Matrix Completion via Gradient Descent

Trung Vu, Raviv Raich

Factorization-based gradient descent is a scalable and efficient algorithm for solving low-rank matrix completion. Recent progress in structured non-convex optimization has offered…