4 problems

For a third-order tensor completion problem with sampling complexity measured by the number of observed entries $pn_1n_2n_3$, the relevant regime is $\mu=O(1)$ and…

Low-rank tensor bandit lower-bound conjecture. The minimax regret lower bound for the low-rank tensor bandits considered in this work is

Let ${\cal T}$ be a low-rank third-order tensor with tensor dimension $p$, and let $n$ denote the sample size. Computational sample-size conjecture. It was widely conjectured that…

Let $\bm{T}^{\star} \in \mathbb{R}^{d\times d\times d}$ be a rank-$r$ symmetric tensor of the form … where each $\bm{u}_i^{\star}\in\mathbb{R}^d$, and suppose that entries are obse…