3 citations · 6 across the 27 of their papers we have counts for
3 papers · 1 filter
A Subsampling Theorem for Constraint Satisfaction Problems with Large Arity
Martino Bernasconi, Matteo Castiglioni, Andrea Celli +2
Subsampling theorems for constraint satisfaction problems (CSPs) guarantee that the value of the CSP is approximately preserved after restricting it to small random subsets of vari…
A Unifying Framework for Quasi-Polynomial Optimization of Fixed-degree Polynomials
Martino Bernasconi, Matteo Castiglioni, Andrea Celli +1
We study the simultaneous approximation of constant-degree polynomials over convex sets. For any family of degree- polynomials and any convex set ${H} \subseteq \mathbb{R}_{…
Min-Max Optimization Requires Exponentially Many Queries
Martino Bernasconi, Matteo Castiglioni, Andrea Celli +1
We study the query complexity of min-max optimization of a nonconvex-nonconcave function over . We show that, given oracle access to and to its grad…