Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
An online and unified algorithm for projection matrix vector multiplication with application to empirical risk minimization
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 …
learning algorithms. It is defined as follows: given a matrix at the pre-processing phase, at …
Dynamic tensor product regression
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} …
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
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 …
consumes massive computational resources and time. Therefore, designing an efficient …
Solving regularized exp, cosh and sinh regression problems
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 …
language models such as Transformer, GPT-4 and ChatGPT. In this work, we study …
Optimal sketching for kronecker product regression and low rank approximation
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 …
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
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 …
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
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 …
programmings, whose running time matches the state of the art results [Cohen, Lee, Song …