Over the last decade, simultaneous wireless information and power transfer (SWIPT) has
become a practical and promising solution for connecting and recharging battery-limited …

Abstract Large Language Models (LLMs), despite their recent impressive accomplishments,
are notably cost-prohibitive to deploy, particularly for applications involving long-content …

The development of miniaturized nuclear power (NP) units and the improvement of the
carbon trading market provide a new way to realize the low-carbon operation of integrated …

This article shows how to solve linear programs of the form min Ax= b, x≥ 0 c⊤ x with n
variables in time O*((n ω+ n 2.5− α/2+ n 2+ 1/6) log (n/δ)), where ω is the exponent of matrix …

Large language models (LLMs) have made transformed changes for human society. One of
the key computation in LLMs is the softmax unit. This operation is important in LLMs …

Soft prompt tuning achieves superior performances across a wide range of few-shot tasks.
However, the performances of prompt tuning can be highly sensitive to the initialization of …

Semidefinite programming is a fundamental tool in optimization and theoretical computer
science. It has been extensively used as a black-box for solving many problems, such as …

We consider the problem of training a multi-layer over-parametrized neural network to
minimize the empirical risk induced by a loss function. In the typical setting of over …

In this work, we improved the analysis of the running time of SparseGPT [Frantar, Alistarh
ICML 2023] from $ O (d^{3}) $ to $ O (d^{\omega}+ d^{2+ a+ o (1)}+ d^{1+\omega (1, 1, a)-a}) …

The fastest known LP solver for general (dense) linear programs is due to [Cohen, Lee and
Song'19] and runs in O*(n ω+ n 2.5− α/2+ n 2+ 1/6) time. A number of follow-up works [Lee …