research
∙
07/12/2023
Ellipsoid Fitting Up to a Constant
In [Sau11,SPW13], Saunderson, Parrilo and Willsky asked the following el...
share
research
∙
02/02/2023
Explicit two-sided unique-neighbor expanders
We study the problem of constructing explicit sparse imbalanced bipartit...
research
∙
07/30/2022
Polynomial-Time Power-Sum Decomposition of Polynomials
We give efficient algorithms for finding power-sum decomposition of an i...
research
∙
07/22/2022
A simple and sharper proof of the hypergraph Moore bound
The hypergraph Moore bound is an elegant statement that characterizes th...
research
∙
06/18/2022
Approximating Max-Cut on Bounded Degree Graphs: Tighter Analysis of the FKL Algorithm
In this note, we describe a α_GW + Ω̃(1/d^2)-factor approximation algori...
research
∙
10/16/2021
Algorithmic Thresholds for Refuting Random Polynomial Systems
Consider a system of m polynomial equations {p_i(x) = b_i}_i ≤ m of degr...
research
∙
06/24/2021
Certifying solution geometry in random CSPs: counts, clusters and balance
An active topic in the study of random constraint satisfaction problems ...
research
∙
06/04/2019
Learning Neural PDE Solvers with Convergence Guarantees
Partial differential equations (PDEs) are widely used across the physica...
research
∙
12/01/2018
Vision-Based Gait Analysis for Senior Care
As the senior population rapidly increases, it is challenging yet crucia...
research
∙
06/11/2018
Learning to Decompose and Disentangle Representations for Video Prediction
Our goal is to predict future video frames given a sequence of input fra...
research
∙
11/30/2017
