Discovering Dual-Origin Slow Wind from Solar Orbiter with Self-Supervised Contrastive Learning
Not on the map. Why?
Abstract (arXiv)
Whether the slow solar wind originates from one coronal source or two distinct channels remains a central open question in heliophysics. Resolving this requires unsupervised separation of two populations that arrive at nearly the same bulk speed and differ mainly in heavy-ion composition. We present Solar-CDC, a self-supervised contrastive deep clustering (CDC) framework that maps plasma observables to a latent space via a Transformer encoder, optimizes a triplet margin loss, and updates pseudo-labels via k-means. Theoretically, we prove that neighborhood-preserving embeddings such as t-SNE and UMAP are fundamentally constrained. Preserving the neighbor graph leaves the cross-cluster cut fraction unchanged, and preserving all but a fraction varepsilon of its links moves that fraction by at most varepsilon. Neither bound depends on the target dimension. A margin objective rewrites the graph and drives the cut fraction to zero. Empirically, on 30,602 Solar Orbiter observations, thirty combinations of dimensionality reduction and clustering peak at a silhouette of 0.454, whereas Solar-CDC reaches 0.869. Escaping the geometric bound alone does not guarantee physical validity: TriMap also optimizes triplets and reaches 0.824, yet its clusters score below chance against the published composition taxonomy. Solar-CDC instead recovers clusters with mean charge-state ratios of 0.080, 0.160, and 0.400, placing the intermediate population inside the window associated with coronal-hole boundaries. Even when the defining charge-state ratio is withheld from the inputs entirely, the model still recovers the taxonomy defined on it. Solar-CDC thus connects self-supervised representation learning to coronal source diagnostics. Importantly, a learning loss recovers physical populations only when driven by dynamically updated physically-aware clusters rather than distances.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 6 of its 26 references that are in the map. First posted on arXiv 22 Aug 2026.
Builds on
6 of 26 references.
References · 6
- 2017Attention Is All You Needcited by 60,361
- 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,898
- 2018Deep Clustering for Unsupervised Learning of Visual Featurescited by 1,028
- 2019Learning Representations by Maximizing Mutual Information Across Viewscited by 734
- 2020Self-supervised Learning: Generative or Contrastivecited by 694
- 2019TriMap: Large-scale Dimensionality Reduction Using Tripletscited by 60
Built on by
Not cited yet.