WEASEL 2.0 is a dictionary‑based time‑series classifier that uses dilated sliding windows, a randomised hyperparameter ensemble, and a fixed‑size dense feature representation. The authors reproduced the method on 114 UCR datasets, matching the original accuracy results, and examined the sensitivity of four design choices. They found that the rule for maximum ensemble size is over‑provisioned for long series and proposed an adaptive rule that reduces memory and time usage without significantly affecting accuracy.
By Cian Higgins, Gerard Carrigan, Pinar Sungu Isiacik, Georgiana Ifrim
The paper introduces EDiS, an Edge‑Disjoint Subgraph sparsification framework that separates a one‑time structural extraction of a graph into cacheable edge‑disjoint subgraphs from the per‑epoch graph composition. By recombining these cached subgraphs under edge‑budget constraints, EDiS avoids repeated sampling or recomputation while allowing varying training graphs across epochs. Experiments on 19 node‑classification benchmarks show that EDiS outperforms 17 baselines in accuracy/ROC‑AUC, achieving the lowest average rank and gap‑to‑best, especially at tight edge budgets.
By Sai Karthik Navuluru, Siddhartha Shankar Das, Franck Dernoncourt, S M Ferdous, Ryan A. Rossi, Nesreen K. Ahmed, Baris Coskunuzer, Alex Pothen, Lakshman Tamil, Mahantesh M Halappanavar
The paper reports the ABAI submission to COLIEE 2026 Task 1, a case law retrieval challenge that suppresses cited passages, and details a four‑stage retrieval pipeline: multi‑view BM25 with reciprocal rank fusion, neural reranking, graph‑based features via a graph attention network, and a LightGBM meta‑learner over 34 features. The best run achieved an F1 score of 0.177 on the official test set, compared to a cross‑validated 0.311, and the authors attribute the gap to a recall ceiling, temporal distribution shift, and threshold miscalibration. A controlled post‑hoc study examined the impact of threshold transfer, decision quality across time, and query similarity, and identified specific remedies—such as BM25 length‑normalisation tuning, event‑triple views, and dense fusion—that improved recall, while other interventions had no effect.
By Minhan Cho, Soyoung Park, Daejin Choi, Jinyoung Han
arXiv:2609.01441v1 Announce Type: new
Abstract: Graph neural networks (GNN) based on message passing are provably no more powerful than the one-dimensional Weisfeiler--Leman colour-refinement test (1...
By Lilian Marey, Charlotte Laclau
arXiv:2609. 20193v1 Announce Type: new Abstract: Retrieval plug-ins supply a deep forecaster with information its lookback window cannot carry.
By Mert Onur Cakiroglu, Elham Buxton, Mehmet Dalkilic, Hasan Kurban
arXiv:2604. 17324v2 Announce Type: replace-cross Abstract: Global self-attention drives modern graph transformers, yet the softmax at its core imposes a structural constraint rarely examined directly: every attention row is non-negative and sums to one, so each per-head output is a mass-conserving convex combination of value vectors.
By Yang Liu, Dongxin Guo, Tom Zheng, Siu Ming Yiu, Liam Ning, Jikun Wu
arXiv:2607. 07500v1 Announce Type: cross Abstract: Time series classification (TSC) is dominated by a two-stage paradigm: train a feature encoder -- either from scratch on the target dataset or via pretraining on large corpora -- and then fit a task-specific classifier on top.
By Jaris K\"uken, Shi Bin Hoo, Martin Mr\'az, Frank Hutter, Lennart Purucker
arXiv:2606. 11562v1 Announce Type: new Abstract: Graph analysis underlies many applications whose answers cannot be looked up in a single record or retrieved along a path: laundering rings, drug repurposing, user preference, and scientific theme are all inferred from a node together with its neighbourhood.
By Zhuoyi Peng, Jingzhou Jiang, Hanlin Gu, Lixin Fan, Yi Yang
The paper investigates an output‑selection bottleneck in frozen DETR‑family segmentation models, showing that many useful mask proposals are computed but never exposed. A lightweight selector called HYDRA, trained only on cached outputs, can recover up to +7.41 mIoU on ADE20k and COCO and +9.4 class‑macro prompt‑IoU on SAM 3 across eight domains by selectively choosing better candidates. The study demonstrates that evaluating segmenters should consider both exposed masks and the hidden candidates they suppress.
By Ignacio M. De la Jara, Cristian Rodriguez-Opazo, Damith Ranasinghe
arXiv:2609.36281v1 Announce Type: new
Abstract: Deep forecasters predict from a fixed-length lookback window, and lengthening it gives diminishing returns at a growing cost. Retrieval augmentation in...
By Vincent Uhse
arXiv:2608. 02947v1 Announce Type: new Abstract: The attention score with rotary position embeddings (RoPE) decomposes exactly into a sum over its 2D-rotation frequency pairs, and each pair's wavelength limits how far it can discriminate position.
By Shun-ichiro Hayashi, Daichi Mukunoki, Tetsuya Hoshino, Takahiro Katagiri
SiST‑GNN introduces a simultaneous spatial‑temporal message‑passing framework for dynamic graph neural networks, fusing per‑node temporal embeddings with spatial aggregation in a single operation. By maintaining a recurrent hidden state per node and treating it as a cross‑time edge, the model jointly reasons over topology and evolution. Experiments on link‑prediction and node‑classification benchmarks show significant improvements over prior methods, achieving up to 158% gains in live‑update link prediction and outperforming discrete‑time baselines by 7–23% in dynamic node classification.
By Shubhajit Roy, Anirban Dasgupta