Metraipolis › archive › dc_cce6469c39ff

High-Dimensional Nonparametric Change-Point Detection via Low-Rank Degree-Three Density Projection — arXiv:2608.15466

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.15466
License (as archived)
CC0-1.0
Archived
2026-10-18T19:40:30.479Z
SHA-256 of the archived text
00c00871e5c803f30d1e60fdd680ace30e5b683264c008c03e090b6b8b705327
Stable URL of this page
https://metraipolis.com/documento/dc_cce6469c39ff

How to cite

High-Dimensional Nonparametric Change-Point Detection via Low-Rank Degree-Three Density Projection — arXiv:2608.15466 — arXiv (en), https://arxiv.org/abs/2608.15466 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cce6469c39ff (Metraipolis archive dc_cce6469c39ff, sha256 00c00871e5c803f30d1e60fdd680ace30e5b683264c008c03e090b6b8b705327)
BibTeX
@misc{dccce6469c39ff,
  title = {High-Dimensional Nonparametric Change-Point Detection via Low-Rank Degree-Three Density Projection — arXiv:2608.15466},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.15466},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cce6469c39ff; sha256 00c00871e5c803f30d1e60fdd680ace30e5b683264c008c03e090b6b8b705327},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.15466. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Distributional changes can be invisible to means and covariances yet appear in skewness, asymmetric interactions, or other third-order structure. We develop a nonparametric change-point method that retains every degree-at-most-three coefficient of a density while avoiding direct density estimation. For observations in $[-1,1]^d$, we construct a symmetric order-three Legendre feature tensor $H_3(X)\in\Sym^3(\R^{d+1})$ such that $A(f)=\E_fH_3(X)$ is an exact isometric encoding of the degree-three density projection: $\|A(f)-A(g)\|_{\F}=\|P_3(f-g)\|_{L^2}$. Instead, fixed tensor contractions are degree-three polynomial chaoses with $\psi_{2/3}$ tails. The two terms have the characteristic order-three tensor scaling and match the powers in sharp concentration results for simple random tensors. For a coordinate-orthogonal specialization, the bound improves to $\sqrt{\log d}$ and enables a prefix-sum implementation in hundreds of dimensions. We derive the exact population tent shape and localization margin, introduce a seeded shortest-interval algorithm with a padded local recentering step, and prove exact recovery by induction: null recursive segments remain inactive, every undetected change retains a balanced isolating interval, and the shortest active seed contains exactly one change before recentering. A two-way cross-fitted scalar refinement attains $O_{\Pp}(\kappa^{-2})$ localization in the small-jump regime, matching a Le Cam lower bound on a pure cubic family whose degree-two projection jump is exactly zero. Reproducible experiments at $d\in\{20,50,100,200\}$ and a three-change $d=100$ sequence demonstrate the intended high-dimensional regime without materializing a $(d+1)^3$ tensor.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-18 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2608.15466 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T19:02:44.097Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-08-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).