research
∙
03/27/2023
Learning Rate Schedules in the Presence of Distribution Shift
We design learning rate schedules that minimize regret for SGD-based onl...
share
research
∙
02/08/2023
Approximately Optimal Core Shapes for Tensor Decompositions
This work studies the combinatorial optimization problem of finding an o...
research
∙
09/29/2022
Sequential Attention for Feature Selection
Feature selection is the problem of selecting a subset of features for a...
research
∙
09/11/2022
Subquadratic Kronecker Regression with Applications to Tensor Decomposition
Kronecker regression is a highly-structured least squares problem min_𝐱‖...
research
∙
07/22/2021
Fast Low-Rank Tensor Decomposition by Ridge Leverage Score Sampling
Low-rank tensor decomposition generalizes low-rank matrix approximation ...
research
∙
07/06/2020
Faster Graph Embeddings via Coarsening
Graph embeddings are a ubiquitous tool for machine learning tasks, such ...
research
∙
05/05/2020
Edge-Weighted Online Bipartite Matching
Online bipartite matching and its variants are among the most fundamenta...
research
∙
07/28/2019
A Fast Minimum Degree Algorithm and Matching Lower Bound
The minimum degree algorithm is one of the most widely-used heuristics f...
research
∙
04/02/2019
Slow Mixing of Glauber Dynamics for the Six-Vertex Model in the Ferroelectric and Antiferroelectric Phases
We analyze the mixing time of Glauber dynamics for the six-vertex model ...
research
∙
08/19/2018
Non-monotone Submodular Maximization with Nearly Optimal Adaptivity Complexity
As a generalization of many classic problems in combinatorial optimizati...
research
∙
07/20/2018
Submodular Maximization with Optimal Approximation, Adaptivity and Query Complexity
As a generalization of many classic problems in combinatorial optimizati...
research
∙
04/11/2018
Graph Sketching Against Adaptive Adversaries Applied to the Minimum Degree Algorithm
Motivated by the study of matrix elimination orderings in combinatorial ...
research
∙
11/22/2017