The aBc Problem and Equator Sampling Renyi Divergences
share
We investigate the problem of approximating the product a^TBc, where a,c∈ S^n-1 and B∈ O_n, in models of communication complexity and streaming algorithms. The worst meaningful approximation is to simply decide whether the product is 1 or -1, given the promise that it is either. We call that problem the aBc problem. This is a modification of computing approximate inner products, by allowing a basis change. While very efficient streaming algorithms and one-way communication protocols are known for simple inner products (approximating a^Tc) we show that no efficient one-way protocols/streaming algorithms exist for the aBc problem. In communication complexity we consider the 3-player number-in-hand model. 1) In communication complexity a^TBc can be approximated within additive error ϵ with communication O(√(n)/ϵ^2) by a one-way protocol Charlie to Bob to Alice. 2) The aBc problem has a streaming algorithm that uses space O(√(n)log n). 3) Any one-way communication protocol for aBc needs communication at least Ω(n^1/3), and we prove a tight results regarding a communication tradeoff: if Charlie and Bob communicate over many rounds such that Charlie communicates o(n^2/3) and Bob o(n^1/3), and then the transcript is sent to Alice, the error will be large. 4) To establish our lower bound we show concentration results for Renyi divergences under the event of restricting a density function on the sphere to a random equator and subsequently normalizing the restricted density function. This extends previous results by Klartag and Regev for set sizes to Renyi divergences of arbitrary density functions. 5) We show a strong concentration result for conditional Renyi divergences on bipartite systems for all α>1.
READ FULL TEXT