This first week at the Simons Institute was a lot of fun! I attended the first workshop in the Real Analysis program which was about Testing, Learning and Inapproximability. There was plenty of good talks and I learned a lot of new things.

– First I learned about parallel repetition. Let be a finite alphabet. Consider a bipartite graph with vertex sets and and a labeling of the edges with mappings from to , that is edge is labelled with some mapping . Now consider the following two players game (Alice and Bob are the players). First an edge is drawn at random from some known probability distribution over the set of edges in (the graph and the ‘labels’ are also known to the players). The vertex is revealed to Alice and the vertex is revealed to Bob. Without communication each one of them has to output an alphabet symbol, say for Alice and for Bob, and they win if . In other words they win if the pair of symbols is consistent with the labeling of the drawn edge. The value of the game is the probability that Alice and Bob wins, which can be rewritten as:

Now we define the value of the repeated game as follows: the players simply play the above game times (with no communication at all except before the game starts when they agree on their strategy, and with the sequence of edges being i.i.d.) and the value of the repeated game, denoted is the probability that they win all the games. This can be rewritten as:

One is now interested in understanding the relation between and .

At this point it’s probably a good idea to pause. If this is the first time that you read about parallel repetition you are probably like ‘wtf, it’s obvious that !!!’ (at least this was my initial reaction). It turns out that this is very far from being true. Clearly it’s true that since you can simply play the games independently. But in some cases might be much larger than , which is kind of amazing! Here is a beautiful example (which is due to Lance Fortnow I think) where and . The graph is the complete graph on the set of vertices and the distribution is uniform on the set of edges (in other words Alice receives a random bit and Bob receives a random bit ). The alphabet is where the symbol is introduced for sake of simplicity and we assume that the players cannot respond with . Now the mappings are given by:

In words the players must choose either Alice or Bob and then they both have to output the bit of the chosen player. For instance if they choose Alice then Bob has to guess the bit of Alice (and Alice can just report her bit). Clearly there is not much one can do for the one-shot game: one has . Now the situation becomes more interesting for the two rounds game: the players can agree that in the first round Bob will try to guess Alice’s first bit, and in the second round Alice will try to guess Bob’s second bit. The trick is that when Bob tries to guess Alice’s first bit he can use his second bit as a guess, and respectively Alice’s guess for Bob’s second bit can be her own first bit. That way they effectively reduced the two rounds game to a one-round game, since both predictions are correct if Bob’s second bit is equal to Alice’s first bit which happens with probability . In other words we proved while naively one would have guessed that .

Now that we have a better understanding of why the original question on the relation between and is a non-trivial one, it is clear that the interesting thing to study is to upper bound the value as a function of (recall the obvious lower bound ). In essence we are asking to show a limit to the power of tricks such as the one described above. Such a result was first proved by Ran Raz in 1995. He showed that, essentially, if then (the original proof gave instead of ). At the Simons workshop David Steurer talked about a new proof of this result based on viewing the value of the game as the norm of some matrix, see this paper. This new proof method also lead to new upper bounds, including (which matches some known lower bounds from Ran Raz). As far as I understand there are still plenty of open questions on this fundamental problem of parallel repetition.

– Joe Neeman talked about a new proof of Borell’s theorem which states that if and are two standard Gaussian vectors in with , then half-spaces are maximizers of the function . The proof is really slick, it’s basically one page of fairly simple calculations, see Section 2 here. Elchanan Mossel then talked about the ‘natural’ extension of this result to the case of uniform variables on the hypercube , see this paper.

– James Lee talked about a very interesting problem: we know how to prove lower bounds for the size of extended formulations (see this blog post for instance), but such bounds are interesting only for exact optimization. A natural question is whether we can prove lower bounds on the size of LPs even for approximate optimization. Apparently there is a rich literature on this for specific type of LP relaxations such the Sherali-Adams hierarchy. Now in their new paper (which is not yet online) James Lee and his co-authors are able to prove general bounds instead of the one that were previously proved specifically for the Sherali-Adams hierarchy. Of course LPs are nice but SDPs are even nicer (see here) and a natural question is how to generalize these results to SDPs instead of LPs. This was touched upon in Raghu Meka‘s talk where he discussed lower bounds for the number of rounds to solve the hidden clique problem with the Lasserre hierarchy. The paper, joint work with Avi Wigderson, is available here.

– Nati Linial gave an absolutely wonderful talk, probably one of the best that I have seen in months. My advice is to look at the video as soon as it is released on the Simons website (this should be a link to it hopefully). Just as a teaser here is one object that Linial is looking at. First a definition: for a graph let be the fraction of the set of vertices that contains exactly edges. The vector is called the -profile of . Now the object that we look at is the set of possible ‘asymptotic profile’, more precisely:

There is not much that we know about . It is not convex: and are clearly in but is of course not in . We also know since the 60’s that for one has and Linial recently proved that . A better understanding of the properties of could lead to breakthroughs in the emerging theory of statistics for networks (see Nati’s talk for more details!).

Tomorrow the Big Data program will start with its Boot Camp. Apparently there has been a lot of hype around this boot camp and the seats have been ‘sold out’. If you can’t enter the auditorium, or if you are not in Berkeley, the event will be streamed live here.

## By Sasho Nikolov September 5, 2013 - 5:25 am

There has in fact been some recent work on the size of extended formulations that capture e.g. max clique approximately. For example a stoc 2013 paper by Moitra and Braverman matches the hardness of approximation of max clique.

## By Sebastien Bubeck September 11, 2013 - 2:16 pm

Yes that's right, thanks for pointing this out!

## By Andrej Risteski September 2, 2013 - 7:46 pm

Great exposition Sebastien! Keep them coming.

Just a small thing: the Meka-Wigderson result is actually on the ArXiv already:

http://arxiv.org/abs/1307.7615

## By Sebastien Bubeck September 3, 2013 - 11:09 am

Thanks Andrej, and thanks for the pointer (I fixed it in the text).