4 papers
Universal Online Convex Optimization Meets Second-order Bounds
Lijun Zhang, Yibo Wang, Guanghui Wang +2
Recently, several universal methods have been proposed for online convex optimization, and attain minimax rates for multiple types of convex functions simultaneously. However, they…
Projection-free Online Learning over Strongly Convex Sets
Yuanyu Wan, Lijun Zhang
To efficiently solve online problems with complicated constraints, projection-free algorithms including online frank-wolfe (OFW) and its variants have received significant interest…
Approximate Multiplication of Sparse Matrices with Limited Space
Yuanyu Wan, Lijun Zhang
Approximate matrix multiplication with limited space has received ever-increasing attention due to the emergence of large-scale applications. Recently, based on a popular matrix sk…
Relative Error Bound Analysis for Nuclear Norm Regularized Matrix Completion
Lijun Zhang, Tianbao Yang, Rong Jin +1
In this paper, we develop a relative error bound for nuclear norm regularized matrix completion, with the focus on the completion of full-rank matrices. Under the assumption that t…