There is mounting evidence of emergent phenomena in the capabilities of deep learning
methods as we scale up datasets, model sizes, and training times. While there are some …

Indistinguishability obfuscation, introduced by [Barak et. al. Crypto 2001], aims to compile
programs into unintelligible ones while preserving functionality. It is a fascinating and …

We give new algorithms for a variety of randomly-generated instances of computational
problems using a linearization technique that reduces to solving a system of linear …

In the Densest k-Subgraph problem, given a graph G and a parameter k, one needs to find a
subgraph of G induced on k vertices that contains the largest number of edges. There is a …

We introduce a framework for proving lower bounds on computational problems over
distributions against algorithms that can be implemented using access to a statistical query …

We prove that with high probability over the choice of a random graph G from the Erdös--
Rényi distribution G(n,1/2), the n^O(d)-time degree d sum-of-squares (SOS) semidefinite …

4 Design Rationale and Considerations (2. B. 6) 11 4.1 What is BIKE and how should it be
used?............... 11 4.1. 1 What is BIKE in one sentence?................. 11 4.1. 2 How many …

We initiate the study of structured encryption schemes with computationally-secure leakage.
Specifically, we focus on the design of volume-hiding encrypted multi-maps; that is, of …

This paper considers the matrix completion problem. We show that it is not necessary to
assume joint incoherence, which is a standard but unintuitive and restrictive condition that is …

Recently, research in unsupervised learning has gravitated towards exploring statistical-
computational gaps induced by sparsity. A line of work initiated in Berthet and Rigollet …