Pith. sign in

REVIEW 1 cited by

Small Ball Probabilities for Simple Random Tensors

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2403.20192 v1 pith:AFK5C7KU submitted 2024-03-29 math.PR math.FA

classification math.PRmath.FA
keywords randomballsmallvarepsilonboundedfracindependentleft
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We study the small ball probability of an order-$\ell$ simple random tensor $X=X^{(1)}\otimes\cdots\otimes X^{(\ell)}$ where $X^{(i)}, 1\leq i\leq\ell$ are independent random vectors in $\mathbb{R}^n$ that are log-concave or have independent coordinates with bounded densities. We show that the probability that the projection of $X$ onto an $m$-dimensional subspace $F$ falls within an Euclidean ball of length $\varepsilon$ is upper bounded by $\frac{\varepsilon}{(\ell-1)!}\left(C\log\left(\frac{e}{\varepsilon}\right)\right)^{\ell}$ and also this upper bound is sharp when $m$ is small. We also established that a much better estimate holds true for a random subspace.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Faster Linear Algebra Algorithms with Structured Random Matrices

    cs.DS 2025-08 accept novelty 8.0 of 10

    Randomized sketching needs only the new OSI property, not the full subspace embedding, and multiple structured matrices satisfy it with near-optimal cost.

Pith tools