research
∙
09/10/2023
Streaming Semidefinite Programs: O(√(n)) Passes, Small Space and Fast Runtime
We study the problem of solving semidefinite programs (SDP) in the strea...
share
research
∙
08/23/2023
How to Protect Copyright Data in Optimization of Large Language Models?
Large language models (LLMs) and generative AI have played a transformat...
research
∙
07/13/2023
Efficient SGD Neural Network Training via Sublinear Activated Neuron Identification
Deep learning has been widely used in many fields, but the model trainin...
research
∙
07/05/2023
In-Context Learning for Attention Scheme: from Single Softmax Regression to Multiple Softmax Regression via a Tensor Trick
Large language models (LLMs) have brought significant and transformative...
research
∙
05/15/2023
Fast and Efficient Matching Algorithm with Deadline Instances
Online weighted matching problem is a fundamental problem in machine lea...
research
∙
02/21/2023
Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time
Given a matrix M∈ℝ^m× n, the low rank matrix completion problem asks us ...
research
∙
01/17/2023
Faster Sinkhorn's Algorithm with Small Treewidth
Computing optimal transport (OT) distances such as the earth mover's dis...
research
∙
11/27/2022
Dynamic Kernel Sparsifiers
A geometric graph associated with a set of points P= {x_1, x_2, ⋯, x_n }...
research
∙
11/26/2022
Faster Algorithm for Structured John Ellipsoid Computation
Computing John Ellipsoid is a fundamental problem in machine learning an...
research
∙
10/22/2022
Discrepancy Minimization in Input-Sparsity Time
A recent work of Larsen [Lar23] gave a faster combinatorial alternative ...
research
∙
01/20/2021
Solving Tall Dense SDPs in the Current Matrix Multiplication Time
This paper introduces a new interior point method algorithm that solves ...
research
∙
09/21/2020
A Faster Interior Point Method for Semidefinite Programming
Semidefinite programs (SDPs) are a fundamental class of optimization pro...
research
∙
06/10/2020
When is Particle Filtering Efficient for POMDP Sequential Planning?
Particle filtering is a popular method for inferring latent states in st...
research
∙
04/08/2020
An Improved Cutting Plane Method for Convex Optimization, Convex-Concave Games and its Applications
Given a separation oracle for a convex set K ⊂R^n that is contained in a...
research
∙
02/06/2020
Solving Tall Dense Linear Programs in Nearly Linear Time
In this paper we provide an Õ(nd+d^3) time randomized algorithm for solv...
research
∙
12/02/2018
Revisiting the Softmax Bellman Operator: Theoretical Properties and Practical Benefits
The softmax function has been primarily employed in reinforcement learni...
research
∙
12/27/2017
Sketching for Kronecker Product Regression and P-splines
TensorSketch is an oblivious linear sketch introduced in Pagh'13 and lat...
research
∙
12/25/2017
