Organizations: UM, IROKO · University of Montpellier, Inria, CNRS, LIRMM, Montpellier, France · LMD, LSCE, ESTIMR · Laboratoire des Sciences du Climat et de l’Environnement, UMR 8212 CEA-CNRS-UVSQ, Université Paris-Saclay & IPSL, CEA Saclay l’Orme des Merisiers, 91191 Gif-sur-Yvette, France · London Mathematical Laboratory, 8 Margravine Gardens, London W6 8RH, UK · LMD/IPSL, ENS, Université PSL, École Polytechnique, Institut Polytechnique de Paris, Sorbonne Université, CNRS, Paris France
Extreme weather events, such as windstorms and heatwaves, are driven by persistent atmospheric circulation patterns that evolve over several consecutive days. While traditional circulation-based studies often focus on instantaneous atmospheric states, capturing the temporal evolution, or trajectory, of these spatial fields is essential for characterizing rare and potentially impactful atmospheric behavior. However, performing an exhaustive similarity search on multi-decadal, continental-scale gridded datasets presents significant computational and memory challenges. In this paper, we propose TRAKNN (TRajectory Aware KNN), a fully unsupervised and data-agnostic framework for detecting geometrically rare short trajectories in spatio-temporal data with an exact kNN approach. TRAKNN leverages a recurrence-based algorithm that decouples computational complexity from trajectory length and efficient batch operations, maximizing computational intensity. These optimizations enable exhaustive analysis on standard workstations, either on CPU or on GPU. We evaluate our approach on 75 years of daily European sea-level pressure data. Our results illustrate that rare trajectories identified by TRAKNN correspond to physically coherent atmospheric anomalies and align with independent extreme-event databases.
Figures & tables
Figure 1: Execution time (in seconds) of TRAKNN compared to FAISS on both CPU and GPU as a function of (a) spatial dimension length, (b) number of time steps, (c) trajectory length, and (d) number of neighbors. The default parameters are n=27,000 , h=180,w=280 , d=1 , and k=1 .
Figure 2: RAM peak memory usage per algorithm
d
Ambient
ID
1
50,000
8±7
3
150,000
16±6
5
250,000
18±5
7
350,000
19±4
15
750,000
21±3
Table 1: Comparison of the ambient space dimension ( d×h×w ) and the mean local intrinsic dimension (ID) as a function of the trajectory duration on the mean sea level pressure
Figure 3: Composite analysis on the three main clusters of mean sea level (msl) pressure anomalies
Dataset
Storm type
d
Random
1
3
5
7
CLIMK-WINDS
–
6
9
11
12
0.7
XWS
Insurance storms
6
5
2
4
0.2
Large storms
3
4
5
7
0.2
EM-DAT
Storm (general)
8
5
7
4
0.9
Storm (tropical)
0
0
1
1
0.1
Table 2: Number of identified dates associated with a storm, as a function of the trajectory duration d (in days) with TRAKNN, by dataset and storm subtype, compared to an averaged random estimator.
Deep learning weather models now match numerical weather prediction accuracy while running orders of magnitude faster, but produce deterministic forecasts without uncertainty estimates, a critical gap for high-stakes decisions during extreme weather events. This paper proposes Neural Tangent Kernel-based uncertainty quantification (NTK-UQ) using last-layer empirical features. Theoretical analysis predicts that UQ quality is architecture-dependent through two mechanisms. First, a variance collapse mechanism explains when UQ fails: when the eigenvalue truncation rank approaches the effective rank of the feature space, the GP correction term consumes nearly all prior variance, destroying discrimination between tropical cyclones and routine conditions; architectures with concentrated spectra (spectral operators) require aggressive truncation (k≤10), while attention-based models tolerate full-rank computation. Second, decomposition performance depends on the non-Gaussian, heavy-tailed structure of extreme weather: Independent Component Analysis exploits higher-order statistics (kurtosis, negentropy) to isolate heavy-tailed extreme-event features, achieving higher discrimination than singular value decomposition, which captures only second-order variance. A data-driven selection rule chooses ICA or SVD from the feature eigenspectrum concentration ratio, correctly prescribing the superior decomposition for all four evaluated architectures. Compared to split conformal prediction (the natural post-hoc baseline), NTK-UQ achieves 31--37% sharper prediction intervals at 90% coverage, and uniquely produces adaptive intervals that scale with extreme event severity, which conformal prediction cannot achieve by construction. The framework requires no retraining; inference-time uncertainty requires only a single matrix-vector product per sample.
Jose Marie Antonio Miñoza, Rex Gregor Laylo, Sebastian C. Ibañez
Center for AI Research · Department of Education · Makati, Philippines
Trajectory anomaly detection underpins applications from fraud detection to urban mobility analysis. Dense GPS preserves fine-grained evidence such as abnormal speeds and short-duration events, but its quadratic cost makes multi-month analysis intractable; sparse stay-point methods scale by discarding that evidence and require a separate modeling regime. We argue that this bottleneck is unnecessary: dense and sparse trajectories share a natural two-dimensional cyclic structure along within-day and across-day axes. TITAnD (Trajectory Image Transformer for Anomaly Detection) is the first framework to cast both in a single representation, a Hyperspectral Trajectory Image (HTI), a day × time-of-day grid whose channels encode spatial, semantic, temporal, and kinematic information. Under this formulation, agent-level detection reduces to image classification and temporal localization to semantic segmentation. The Cyclic Factorized Transformer (CFT) models the two temporal axes directly, reducing attention cost by up to two orders of magnitude. With the HTI, multi-month dense anomaly detection becomes feasible for the first time, and CFT keeps it accurate and fast. Empirically, TITAnD matches or beats every evaluated baseline in AUC-PR on all four benchmarks. It surpasses vision models such as U-Net while using as few as 6.5M parameters, and it runs 11--75× faster than a capacity-matched flat Transformer on the same trajectory images.
We present a scalable framework for unsupervised clustering of maritime trajectories derived from terabyte-scale Automatic Identification System (AIS) archives. Variable-length trajectories are encoded with a custom BERT-based model trained via masked token modeling and clustered using CURE hierarchical clustering, producing physically interpretable trajectory groups without requiring a predefined number of clusters. An intrinsic unsupervised anomaly detection method based on reconstruction loss and clustering noise assignment identifies irregular navigation patterns. The framework is demonstrated on a national-scale AIS dataset comprising billions of messages spanning one year, yielding stable trajectory clusters and a clear separation between nominal and anomalous vessel behavior.
Bertram Hage, Alexander Schiøtz, Felix Thomsen +2
Technical University of Denmark Anker Engelunds Vej 101 2800 Kongens Lyngby, Denmark