22 citations · 58 across the 13 of their papers we have counts for
18 papers
On Approximate Computation of Critical Points
Amir Ali Ahmadi, Georgina Hall
We show that computing even very coarse approximations of critical points is intractable for simple classes of nonconvex functions. More concretely, we prove that if there exists a…
Sum of Squares Submodularity
Anna Deza, Georgina Hall
We introduce the notion of -sum of squares (sos) submodularity, which is a hierarchy, indexed by , of sufficient algebraic conditions for certifying submodularity of set func…
Learning to Warm-Start Fixed-Point Optimization Algorithms
Rajiv Sambharya, Georgina Hall, Brandon Amos +1
We introduce a machine-learning framework to warm-start fixed-point optimization algorithms. Our architecture consists of a neural network mapping problem parameters to warm starts…
Sums of Separable and Quadratic Polynomials
Amir Ali Ahmadi, Cemil Dibek, Georgina Hall
We study separable plus quadratic (SPQ) polynomials, i.e., polynomials that are the sum of univariate polynomials in different variables and a quadratic polynomial. Motivated by th…
Partial Recovery in the Graph Alignment Problem
Georgina Hall, Laurent Massoulié
In this paper, we consider the graph alignment problem, which is the problem of recovering, given two graphs, a one-to-one mapping between nodes that maximizes edge overlap. This p…
Shape-Constrained Regression using Sum of Squares Polynomials
Mihaela Curmei, Georgina Hall
We present a hierarchy of semidefinite programs (SDPs) for the problem of fitting a shape-constrained (multivariate) polynomial to noisy evaluations of an unknown shape-constrained…