Sign-Rank Can Increase Under Intersection

03/01/2019
by   Mark Bun, et al.
0

The communication class UPP^cc is a communication analog of the Turing Machine complexity class PP. It is characterized by a matrix-analytic complexity measure called sign-rank (also called dimension complexity), and is essentially the most powerful communication class against which we know how to prove lower bounds. For a communication problem f, let f ∧ f denote the function that evaluates f on two disjoint inputs and outputs the AND of the results. We exhibit a communication problem f with UPP(f)= O( n), and UPP(f ∧ f) = Θ(^2 n). This is the first result showing that UPP communication complexity can increase by more than a constant factor under intersection. We view this as a first step toward showing that UPP^cc, the class of problems with polylogarithmic-cost UPP communication protocols, is not closed under intersection. Our result shows that the function class consisting of intersections of two majorities on n bits has dimension complexity n^Ω( n). This matches an upper bound of (Klivans, O'Donnell, and Servedio, FOCS 2002), who used it to give a quasipolynomial time algorithm for PAC learning intersections of polylogarithmically many majorities. Hence, fundamentally new techniques will be needed to learn this class of functions in polynomial time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/17/2018

Classical lower bounds from quantum upper bounds

We prove lower bounds on complexity measures, such as the approximate de...
research
07/10/2023

Randomized Communication and Implicit Representations for Matrices and Graphs of Small Sign-Rank

We prove a characterization of the structural conditions on matrices of ...
research
06/24/2020

Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond

The disjointness problem - where Alice and Bob are given two subsets of ...
research
02/19/2019

Lower bounds on separation automata for Parity Games

Several recently developed quasi-polynomial time algorithms for Parity G...
research
01/04/2019

Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC^0

The threshold degree of a Boolean function f{0,1}^n→{0,1} is the minimum...
research
04/17/2022

Comparison communication protocols

We introduce a restriction of the classical 2-party deterministic commun...
research
10/06/2021

A Theory of Tournament Representations

Real world tournaments are almost always intransitive. Recent works have...

Please sign up or login with your details

Forgot password? Click here to reset