Recent advances in fully dynamic graph algorithms–a quick reference guide
In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …
dynamic algorithms. However, these theoretical results have received very little attention …
Minimum cost flows, MDPs, and ℓ1-regression in nearly linear time for dense instances
In this paper we provide new randomized algorithms with improved runtimes for solving
linear programs with two-sided constraints. In the special case of the minimum cost flow …
linear programs with two-sided constraints. In the special case of the minimum cost flow …
Bipartite matching in nearly-linear time on moderately dense graphs
We present an ̃O(m+n^1.5)-time randomized algorithm for maximum cardinality bipartite
matching and related problems (eg transshipment, negative-weight shortest paths, and …
matching and related problems (eg transshipment, negative-weight shortest paths, and …
A deterministic linear program solver in current matrix multiplication time
J van den Brand - Proceedings of the Fourteenth Annual ACM-SIAM …, 2020 - SIAM
Interior point algorithms for solving linear programs have been studied extensively for a long
time [eg Karmarkar 1984; Lee, Sidford FOCS'14; Cohen, Lee, Song STOC'19]. For linear …
time [eg Karmarkar 1984; Lee, Sidford FOCS'14; Cohen, Lee, Song STOC'19]. For linear …
Faster dynamic matrix inverse for faster lps
Motivated by recent Linear Programming solvers, we design dynamic data structures for
maintaining the inverse of an $ n\times n $ real matrix under $\textit {low-rank} $ updates …
maintaining the inverse of an $ n\times n $ real matrix under $\textit {low-rank} $ updates …
Algorithm and hardness for dynamic attention maintenance in large language models
Large language models (LLMs) have made fundamental changes in human life. The
attention scheme is one of the key components over all the LLMs, such as BERT, GPT-1 …
attention scheme is one of the key components over all the LLMs, such as BERT, GPT-1 …
An improved cutting plane method for convex optimization, convex-concave games, and its applications
Given a separation oracle for a convex set K⊂ ℝ n that is contained in a box of radius R, the
goal is to either compute a point in K or prove that K does not contain a ball of radius є. We …
goal is to either compute a point in K or prove that K does not contain a ball of radius є. We …
Solving tall dense linear programs in nearly linear time
In this paper we provide an O (nd+ d 3) time randomized algorithm for solving linear
programs with d variables and n constraints with high probability. To obtain this result we …
programs with d variables and n constraints with high probability. To obtain this result we …
Recent advances in fully dynamic graph algorithms
In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …
dynamic algorithms. However, these theoretical results have received very little attention …
Infoprompt: Information-theoretic soft prompt tuning for natural language understanding
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 …
However, the performances of prompt tuning can be highly sensitive to the initialization of …