arXiv (All)
open access
Detection Is Harder Than Estimation in Certain Regimes: Inference for Moment and Cumulant Tensors
We study estimation and detection of high-order cumulant tensors from $n$ i.i.d. observations of a $p$-dimensional random vector, with performance measured in the tensor spectral norm. Under sub-Gaussianity, we show that the minimax rate for estimating the order-$d$ cumulant tensor is $\sqrt{p/n}\we
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Spectral-Guided Diffusion: Accelerating Inference via Static Spectral Layer Scheduling#1077433
- Greedy Decoding Is Not Precision-Invariant: Cross-Precision Output Divergence in LLM Inference#1062509
- Greedy Decoding Is Not Precision-Invariant: Cross-Precision Output Divergence in LLM Inference#1043092
- Concentration of bounded sparse chaoses and sparse Khatri-Rao embeddings#1076531
- Hierarchical Besov-Laplace priors for spatially inhomogeneous binary classification#315194
Record · ID 1402182
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive