TL;DR
In the nine-method MCC5 comparison, DualRes leads at six of seven reported label budgets in total; MiniRocket leads at 2.048 labelled seconds per class. At the primary budget of 6.144 seconds per class, DualRes exceeds the stronger of MambaSL and MiniRocket by 16.1 macro-F1 percentage points. The selected evidence does not independently establish identical supervised training protocols for all nine methods.
At 1.024 labelled seconds per class, DualRes has higher mean macro-F1 than MambaSL on Paderborn, KAIST and UORED, ties on Ottawa, and trails on CWRU and HUST. UORED exhibits substantial variability across seeds. MiniRocket performs best on HUST under its geometry shift.
Source: [2]
On MCC5, DualRes has 40,048 parameters including the classification head versus MambaSL’s 15,592, but its checkpoint uses 0.164 MiB versus 4.065 MiB, a 24.8-fold storage reduction. Native-record latency is 196.65 ms versus 283.85 ms, a 1.44-fold speedup. Separately, the matched batch-one window-latency comparison includes preprocessing and transfers on an RTX A4000 in FP32 with TF32 disabled; those conditions are not silently assigned to the native-record measurements. Some attention models are faster but have lower macro-F1; MiniRocket’s CPU costs are reported separately.
The paper identifies limits on interpretation across tasks: CWRU and KAIST test operating-condition changes rather than independent bearing populations; HUST changes bearing identity and geometry together; and Ottawa’s near-perfect scores do not establish transfer to independent machines.
Why This Matters
Source-paper contributions
What the paper contributes
Evaluation datasets
The study evaluates six bearing datasets—Paderborn, CWRU, KAIST, UORED, HUST, and Ottawa—along with the eight-class MCC5-THU gearbox benchmark. It also reports a separate two-model, 14-way configuration-recognition pilot on PHM2009.
Source: [23]
Key Findings
Paper reports
Limitations
Repeated development on the evaluated datasets limits claims of independent confirmation. The component ablations are descriptive one-seed effects and do not establish uncertainty across initializations.
How the method works
The frontend centers each vibration window and divides it by its root-mean-square amplitude, removing absolute amplitude while retaining within-window variation. It uses a one-sided, unnormalized STFT with a periodic Hann window, no padding and a 128-sample hop. The 256-sample and 1024-sample resolutions provide 4 ms and 16 ms supports, with 250 Hz and 62.5 Hz bin spacing. Cropping aligns their frame centers; oscillatory state rotation and input-dependent damping control the subsequent memory updates. The admitted excerpts do not establish a magnitude-STFT or an additional projection step.
The encoder has 39,528 parameters; the classification head adds 65C parameters for C classes.
Source: [18]
Evaluation metrics
Measurement conditions
The bearing macro-F1 summary reports the mean and sample standard deviation over three seeds, with each seed averaged over both frozen folds; its labelled exposure is 1.024 unique seconds per class and neural models receive 100 supervised updates.
Source: [14]
Research question and scope
The paper asks which compact representation captures diagnostic vibration structure and how data efficiency should be evaluated when labelled recordings are limited.
Source: [5]
Tested scope and boundaries
Across the bearing tasks, the evaluation distinguishes component identity, operating conditions, geometry and speed profiles: Paderborn and UORED hold out bearing identities; CWRU and KAIST hold out conditions; HUST holds out geometries; Ottawa holds out speed profiles. MCC5 evaluates opposite motion modes, with severity composition also changing. The selected split-label fragment does not securely bind a recording-repeat split and its condition change to the separate PHM2009 pilot.
Training setup
For MCC5, label budgets range from 1 to 6 recordings per class with four non-overlapping 0.512-second windows per recording, or 2.048–12.288 labelled seconds per class. The primary budget is 3 × 4 windows, or 6.144 seconds per class. A matched-duration pilot compares 1 × 12, 3 × 4 and 6 × 2 windows to study recording diversity at fixed labelled duration. An extension keeps six recordings and increases windows per recording to eight or twelve, corresponding to 24.576 or 36.864 seconds per class. The bearing protocol uses three overlapping windows covering 1.024 unique seconds per class.
Source: [19]
Evaluation recordings are separated before windows are extracted. Compared methods receive identical supports and vibration channels and are fitted directly on labelled source support without pretraining. Neural MCC5 and bearing runs use 300 and 100 Adam updates, respectively; terminal checkpoints are used rather than target-based early stopping.
Paper Details
Machine Learning · Empirical
Original research: When Labels Are Scarce: An Oscillatory State Space Model for Vibration Diagnosis · 2609.27411v1
Paper authors: Mainak Mallick, Seung-Kyum Choi
Source license: CC BY 4.0. This article summarizes and interprets the source using AI. Attribution does not imply endorsement by the source authors.
This adapted analysis is shared under the same CC BY 4.0 license. This brief uses the sampled human-reviewed reader and evidence-bound editorial corrections. Historical model verdicts are retained separately; they do not evaluate changed wording.
- Canonical source identity
- arXiv 2609.27411
- Analyzed source version
- v1
- Source retrieved
- BaitaPhish analysis published
- BaitaPhish analysis reviewed
Evidence & Provenance
Show evidence locators
Evidence labels locate support in the original paper; they do not establish independent replication.
- [1] · page 17 — Source passage: Admitted source passage
- [2] · page 5 — Source passage: Admitted source passage
- [3] · page 4 — Source passage: Admitted source passage
- [4] · page 2 — Source passage: Admitted source passage
- [5] · page 1 — Source passage: Admitted source passage
- [6] · page 3 — Source passage: Admitted source passage
- [7] · page 16 — Source passage: Admitted source passage
- [8] · page 16 — Source passage: Admitted source passage
- [9] · page 3 — Source passage: Admitted source passage
- [10] · page 23 — Source passage: Admitted source passage
- [11] · page 5 — Source passage: Admitted source passage
- [12] · page 7 — Source passage: Admitted source passage
- [13] · page 5 — Source passage: Admitted source passage
- [14] · page 6 — Source passage: Admitted source passage
- [15] · page 6 — Source passage: Admitted source passage
- [16] · page 2 — Source passage: Admitted source passage
- [17] · page 8 — Source passage: Admitted source passage
- [18] · page 4 — Source passage: Admitted source passage
- [19] · page 5 — Source passage: Admitted source passage
- [20] · page 3 — Source passage: Admitted source passage
- [21] · page 15 — Source passage: Admitted source passage
- [22] · page 7 — Source passage: Admitted source passage
- [23] · page 5 — Source passage: Admitted source passage