Metraipolis › archive › dc_4982d03e3435

A Mixture-of-Experts Framework for Multi-Stream Quickest Change Detection — arXiv:2610.20876

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.20876
License (as archived)
CC0-1.0
Archived
2026-10-16T10:25:33.466Z
SHA-256 of the archived text
4c0387c8676de37308c06243d4405f7c28d3d1bd8e10dd8d7a3ff526ca47e53f
Stable URL of this page
https://metraipolis.com/documento/dc_4982d03e3435

How to cite

A Mixture-of-Experts Framework for Multi-Stream Quickest Change Detection — arXiv:2610.20876 — arXiv (en), https://arxiv.org/abs/2610.20876 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4982d03e3435 (Metraipolis archive dc_4982d03e3435, sha256 4c0387c8676de37308c06243d4405f7c28d3d1bd8e10dd8d7a3ff526ca47e53f)
BibTeX
@misc{dc4982d03e3435,
  title = {A Mixture-of-Experts Framework for Multi-Stream Quickest Change Detection — arXiv:2610.20876},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.20876},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4982d03e3435; sha256 4c0387c8676de37308c06243d4405f7c28d3d1bd8e10dd8d7a3ff526ca47e53f},
  year = {2026}
}

Archived text

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

A Mixture-of-Experts (MoE) framework is proposed for quickest change detection (QCD) where there are multiple experts, and each expert produces a sequence of statistics for change detection. A change is declared when a weighted sum of these statistics crosses a threshold. This framework is then applied to the problem of multi-stream QCD to obtain a family of powerful algorithms that outperform the best known algorithms in the literature. In the multi-stream QCD problem, a decision-maker observes multiple streams of observations. At the change point, the distribution of an unknown subset of the streams changes. The optimal algorithm based on a generalized likelihood ratio is computationally expensive. One of the most computationally and performance-efficient algorithms in the literature is the rank-weighted sum (RWS) scheme based on Shiryaev-Roberts statistics. It is shown in the paper that the MoE-based QCD algorithm for multi-stream data outperforms the RWS scheme. This is demonstrated through simulation results on real-valued Gaussian mean shift data and high-dimensional data from Gaussian--Bernoulli Restricted Boltzmann Machines (GB-RBMs).

Tema degli esploratori: statistica e scienza dei dati (elenco arXiv stat.ML, nuovi lavori del giorno).
Categorie arXiv: Signal Processing (eess.SP) ; Methodology (stat.ME); Machine Learning (stat.ML).
Pagina del lavoro: https://arxiv.org/abs/2610.20876 — 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-16T08:48:47.659Z dalla pagina https://arxiv.org/list/stat.ML/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).