~/talk

Extended Formulations 4

links:none on file
links:none on file
links:none on file
slides:none on file

Shows how any bounded density F on {0,1}^n that tests indistinguishably against a family of functions D1 … Dm is approximated by a normalized exponential of a small weighted sum of those tests with multiplicative weights updates giving at most O((log ||F||_∞) · max_i ||Di||_∞^2 / η^2) terms so inner products match up to η. Extends to PSD matrix valued Q and yields a square of a low degree matrix polynomial approximation. Used to turn Sherali Adams and SOS gap instances into LP and SDP lower bounds for the correlation polytope via random restriction and factorization rescaling.

AI-written summary · about

  1. 0:00Intro
  2. 1:18Question
  3. 8:06Theorem
  4. 11:57Approximator
  5. 24:20Matrixvalued functions
  6. 38:10Good approximation
  7. 49:21Random restriction
  8. 51:46SDP relaxations
  9. 53:16SDP lower bound
  10. 53:41Questions
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.