Metraipolis › archive › dc_d25ea83cc75e

Revisiting WEASEL 2.0: Reproduction, Sensitivity, and an Adaptive Ensemble-Size Rule — arXiv:2608.18021

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.18021
License (as archived)
CC0-1.0
Archived
2026-10-18T14:48:47.799Z
SHA-256 of the archived text
4297567c36af384513ca207bec3c37dcb11871fcc6a8cfb5a8baa2546878a01d
Stable URL of this page
https://metraipolis.com/documento/dc_d25ea83cc75e

How to cite

Revisiting WEASEL 2.0: Reproduction, Sensitivity, and an Adaptive Ensemble-Size Rule — arXiv:2608.18021 — arXiv (en), https://arxiv.org/abs/2608.18021 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d25ea83cc75e (Metraipolis archive dc_d25ea83cc75e, sha256 4297567c36af384513ca207bec3c37dcb11871fcc6a8cfb5a8baa2546878a01d)
BibTeX
@misc{dcd25ea83cc75e,
  title = {Revisiting WEASEL 2.0: Reproduction, Sensitivity, and an Adaptive Ensemble-Size Rule — arXiv:2608.18021},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.18021},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d25ea83cc75e; sha256 4297567c36af384513ca207bec3c37dcb11871fcc6a8cfb5a8baa2546878a01d},
  year = {2026}
}

Archived text

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

WEASEL 2.0 is a dictionary-based time series classifier that combines dilated sliding windows with a randomised hyperparameter ensemble and a fixed-size dense feature representation. Two of its hyperparameter choices, the maximum ensemble size and the maximum window size, are specified by simple thresholding rules whose chosen thresholds are not empirically justified in the original paper. In this work we reproduce WEASEL 2.0 on 114 UCR datasets, achieving a mean accuracy of 0.865 and median of 0.928, closely matching the published values (Wilcoxon signed-rank, p = 0.655). We then test the sensitivity of four design choices: the downstream classifier, the absence of feature weighting, the maximum window-size rule, and the maximum ensemble-size rule. The first three are robust to perturbation. The fourth is over-provisioned for long-series datasets, motivating an adaptive rule that sets the maximum ensemble size from series length and number of classes. Evaluated on fixed-length datasets, the adaptive rule reduces peak fit memory by a median of 37 MB (mean 395 MB) and fit time by a median of 0.4 s (mean 4 s), with a median accuracy change of 0% (mean -0.11%). Memory and time savings concentrate on long-series datasets where the original rule allocates the largest ensemble size.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-19 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2608.18021 — 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-18T14:47:59.424Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-08-19?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).