AI & ML






Sharp spectral norm concentration and regularization of sparse random tensors
arXiv stat.TH0 views
arXiv:2609.20520v2 Announce Type: replace-cross Abstract: We prove sharp spectral-norm bounds and construct a mean-fitting regularization procedure for sparse random tensors of fixed order $k$. For an $n\times\cdots\times n$ tensor with independentBernoulli$(p)$ entries, the centered norm is $O(\sqrt{np})$ with polynomially high probability whenever $np\ge c\log n$. This removes the logarithmic loss in Zhou and Zhu (2021). We also determine the expected centered norm at every sparsity level: for every $0
PreviousOracle high-dimensional $M$-estimation using smooth reparameterization for sparsityNextGeneralized Fiducial Inference for Hybrid Discrete-Continuous Count Data: Theory and Application
Related posts
Introducing the Grid Protectors Program
0OpenAI Blog
The world has a new plan to save nature, but it still needs the money
0Ars Technica

Could data center backlash flip Florida?
0The Verge

Vivo’s first Pro Max phone proves its Ultra is still in a league of its own
0The Verge

Why Peacock is making a huge bet on YouTube
0The Verge
Ninja’s first-ever microwave just replaced two of my kitchen appliances at once
0TechCrunch
show = false, 2600)"
x-show="show" x-cloak x-transition.opacity.duration.200ms
class="fixed bottom-8 left-1/2 z-[80] -translate-x-1/2 rounded-lg border border-line bg-card px-4 py-2.5 text-sm text-heading shadow-card-hover"
role="status" aria-live="polite">