research
∙
07/14/2023
Performance of â„“_1 Regularization for Sparse Convex Optimization
Despite widespread adoption in practice, guarantees for the LASSO and Gr...
share
research
∙
06/26/2023
Gradient Descent Converges Linearly for Logistic Regression on Separable Data
We show that running gradient descent with variable learning rate guaran...
research
∙
04/11/2022
Iterative Hard Thresholding with Adaptive Regularization: Sparser Solutions Without Sacrificing Runtime
We propose a simple modification to the iterative hard thresholding (IHT...
research
∙
11/19/2021
Faster Sparse Minimum Cost Flow by Electrical Flow Localization
We give an O(m^3/2 - 1/762log (U+W)) time algorithm for minimum cost flo...
research
∙
03/05/2021
Decomposable Submodular Function Minimization via Maximum Flow
This paper bridges discrete and continuous optimization approaches for d...
research
∙
01/15/2021
Local Search Algorithms for Rank-Constrained Convex Optimization
We propose greedy and local search algorithms for rank-constrained conve...
research
∙
08/24/2020
Fast and Simple Modular Subset Sum
We revisit the Subset Sum problem over the finite cyclic group ℤ_m for s...
research
∙
06/25/2020
Sparse Convex Optimization via Adaptively Regularized Hard Thresholding
The goal of Sparse Convex Optimization is to optimize a convex function ...
research
∙
03/10/2020
Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs
We present an m^11/8+o(1)log W-time algorithm for solving the minimum co...
research
∙
07/12/2018
Fast Modular Subset Sum using Linear Sketching
Given n positive integers, the Modular Subset Sum problem asks if a subs...
research
∙
02/18/2018
