Skip to content

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

Aug 2026 · 0 citations · 17 references
Computer Science

TL;DR

This work reproduces WEASEL 2.0 on 114 UCR datasets and tests the sensitivity of four design choices: the downstream classifier, the absence of feature weighting, the maximum window-size rule, the maximum ensemble-size rule, and the maximum ensemble-size rule.

Abstract

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.

View source

Similar papers

Preprint Aug 2026

The Sparsity Whisperer

A family of difference-informed pruning methods built upon this principle are introduced, suggesting that preserving output differences is a broadly useful and composable signal for post-training LLM sparsification.

Linghao Kong, Inimai Subramanian, Micah Adler et al. · 0 citations
Jul 2026

Between Gradient and Natural Gradient: A Continuum of LoRA Initializations

It is shown that a principled design space for LoRA initialization and curvature preconditioning should be treated as a tunable dimension rather than a fixed design decision, and a deployable, search-free variant, ULoRA-Auto, selects per-layer exponents from measured spectral statistics, approaches this upper bound at...

Dian Liu, Farshid Ghezelbash · 0 citations
Jul 2026

Feature Bagging Provides Stability

This work introduces feature instability (FI), the feature-axis analogue of instance instability (II), which measures sensitivity to removing a single feature, and shows that FI captures generalization-relevant information complementary to II.

Yuheng Ma, Qiang Sun · 0 citations
Preprint Aug 2026

TESLA: Taylor Expansion of Sinusoidal Learnable Activations

TESLA, an activation defined as a learnable combination of sine and cosine terms, enabling explicit control over polynomial degree and selective amplification of high-order components is proposed, indicating that activation-level degree control transfers to more general vision workloads.

Daehwa Ko, Jae-Hwan Kim, Seunghyun Ham et al. · 0 citations
Preprint Jul 2026

Super Weights in LLMs and the Failure of Selective Training

It is established that parameter importance does not imply parameter trainability in isolation, and that effective fine-tuning relies on structured decompositions over entire layers rather than targeting individually important weights.

S. Subramanian, Adewale Akinfaderin, Akarsha Sehwag · 0 citations
Preprint Jul 2026

Grokking Is Conditional and Fragile: A Fully-Tractable, Multi-Seed Study at 12K Parameters

A publicly released ~11,856-parameter Llama-style Llama-style transformer on modular arithmetic is studied, small enough to enumerate its weights, attention, and full input-output map, and grokking is measured as a multi-seed rate rather than a single outcome.

Yoshiyuki Ootani · 0 citations

Related blog posts

Microsoft Research Blog Oct 12, 2026

Simulating student learning for better AI tutoring

StudentSim is a research system for evaluating and improving AI tutoring tools before they are tested with learners. It models how individuals may engage with tutors, giving feedback to improve tutor performance across subjects like chess, writing, and mathematics. The post Simulating student learning for better AI tutoring appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.