4 problems

Let $\mathcal{Q}$ and $\mathcal{P}$ be sufficiently nice distributions, and let $\operatorname{Adv}_{\leq D}(\mathcal{Q},\mathcal{P})$ denote the degree-$D$ low-degree advantage fo…

Let $N(\epsilon,\delta,T)$ be the smallest number of elements needed so that all but a set of measure $\delta$ of trajectories generated over time $T$ lie within distance…

Let $d$ be the tensor dimension, $k>2$ the tensor order, and $n$ the number of samples in the Tensor PCA problem. A testing or estimation procedure is computationally efficient if…

One-step predictive distortion conjecture. Success will be achieved by instead focusing on a one-step predictive distortion equivalent to a self-information loss function.