An online and unified algorithm for projection matrix vector multiplication with application to empirical risk minimization

L Qin, Z Song, L Zhang, D Zhuo - … Conference on Artificial …, 2023 - proceedings.mlr.press
Online matrix vector multiplication is a fundamental step and bottleneck in many machine
learning algorithms. It is defined as follows: given a matrix at the pre-processing phase, at …

Dynamic tensor product regression

A Reddy, Z Song, L Zhang - Advances in Neural …, 2022 - proceedings.neurips.cc
In this work, we initiate the study of\emph {Dynamic Tensor Product Regression}. One has
matrices $ A_1\in\mathbb {R}^{n_1\times d_1},\ldots, A_q\in\mathbb {R}^{n_q\times d_q} …

Efficient sgd neural network training via sublinear activated neuron identification

L Qin, Z Song, Y Yang - 2024 IEEE International Conference on …, 2024 - ieeexplore.ieee.org
Deep learning has been widely used in many fields, but the model training process usually
consumes massive computational resources and time. Therefore, designing an efficient …

Solving regularized exp, cosh and sinh regression problems

Z Li, Z Song, T Zhou - arxiv preprint arxiv:2303.15725, 2023 - arxiv.org
In modern machine learning, attention computation is a fundamental task for training large
language models such as Transformer, GPT-4 and ChatGPT. In this work, we study …

Optimal sketching for kronecker product regression and low rank approximation

H Diao, R Jayaram, Z Song, W Sun… - Advances in neural …, 2019 - proceedings.neurips.cc
We study the Kronecker product regression problem, in which the design matrix is a
Kronecker product of two or more matrices. Formally, given $ A_i\in\R^{n_i\times d_i} $ for …

Low rank matrix completion via robust alternating minimization in nearly linear time

Y Gu, Z Song, J Yin, L Zhang - arxiv preprint arxiv:2302.11068, 2023 - arxiv.org
Given a matrix $ M\in\mathbb {R}^{m\times n} $, the low rank matrix completion problem
asks us to find a rank-$ k $ approximation of $ M $ as $ UV^\top $ for $ U\in\mathbb …

Oblivious sketching-based central path method for linear programming

Z Song, Z Yu - International Conference on Machine …, 2021 - proceedings.mlr.press
In this work, we propose a sketching-based central path method for solving linear
programmings, whose running time matches the state of the art results [Cohen, Lee, Song …