Tensor Network Machine Learning for Wildfire Susceptibility Mapping: from Grokking Dynamics to Quantum Mixedness of Class Representations

• URL: http://arxiv.org/abs/2607.19503v1
• Date: Tue, 21 Jul 2026 18:30:50 GMT
• Title: Tensor Network Machine Learning for Wildfire Susceptibility Mapping: from Grokking Dynamics to Quantum Mixedness of Class Representations
• Abstract summary: A quantum-inspired tensor network framework for wildfire susceptibility classification in the Gargano region is introduced.<n>The approach combines scalable geospatial representations with an interpretable quantum mask, enabling both binary and multiclass classification.
• Score: 53.66343110413339
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A quantum-inspired tensor network framework for wildfire susceptibility classification in the Gargano region is introduced, leveraging AlphaEarth embeddings and Matrix Product State models. The approach combines scalable geospatial representations with an interpretable quantum mask, enabling both binary and multiclass classification of wildfire susceptibility. Beyond predictive performance, the study reveals a pronounced grokking transition in the binary case and provides a detailed analysis of inter-class confusion in the multiclass setting. By introducing level-resolved mixedness diagnostics based on reduced density matrices, we show that the MPS classifier naturally encodes a hierarchy of class distinguishability, with non-adjacent categories becoming more separable than neighboring ones. These results demonstrate that tensor network models not only achieve competitive classification accuracy but also offer a physically grounded framework to quantify and interpret class separability in complex environmental datasets.

Related papers

• Layerwise Dynamics for In-Context Classification in Transformers [27.052342498221748]
  We study multi-class linear classification in the hard no-margin regime.<n>We make computation identifiable by enforcing feature- and label-permutation equivariance at every layer.<n>This enables interpretability while maintaining functional equivalence.
  arXiv  Detail & Related papers  (2026-04-13T15:20:41Z)
• A class-driven hierarchical ResNet for classification of multispectral remote sensing images [12.282079123411947]
  We present a class-driven hierarchical Residual Neural Network (ResNet) for modelling the classification of Time Series (TS) of multispectral images at different semantical class levels.<n>We leverage on hierarchy-penalty maps to discourage incoherent hierarchical transitions within the classification.<n>The experimental results, obtained on two tiles of the Amazonian Forest on 12 monthly composites of Sentinel 2 images, demonstrate the effectiveness of the hierarchical approach.
  arXiv  Detail & Related papers  (2025-10-09T10:47:52Z)
• Multiclass threshold-based classification [2.66269503676104]
  We introduce a threshold-based framework for multiclass classification that generalizes the standard argmax rule.<n>We show that the multidimensional threshold-based setting yields consistent performance improvements across various networks and datasets.
  arXiv  Detail & Related papers  (2025-05-16T14:11:26Z)
• Bidirectional Logits Tree: Pursuing Granularity Reconcilement in Fine-Grained Classification [89.20477310885731]
  This paper addresses the challenge of Granularity Competition in fine-grained classification tasks.<n>Existing approaches typically develop independent hierarchy-aware models based on shared features extracted from a common base encoder.<n>We propose a novel framework called the Bidirectional Logits Tree (BiLT) for Granularity Reconcilement.
  arXiv  Detail & Related papers  (2024-12-17T10:42:19Z)
• Variational Classification [51.2541371924591]
  We derive a variational objective to train the model, analogous to the evidence lower bound (ELBO) used to train variational auto-encoders. Treating inputs to the softmax layer as samples of a latent variable, our abstracted perspective reveals a potential inconsistency. We induce a chosen latent distribution, instead of the implicit assumption found in a standard softmax layer.
  arXiv  Detail & Related papers  (2023-05-17T17:47:19Z)
• Attention-driven Graph Clustering Network [49.040136530379094]
  We propose a novel deep clustering method named Attention-driven Graph Clustering Network (AGCN) AGCN exploits a heterogeneous-wise fusion module to dynamically fuse the node attribute feature and the topological graph feature. AGCN can jointly perform feature learning and cluster assignment in an unsupervised fashion.
  arXiv  Detail & Related papers  (2021-08-12T02:30:38Z)
• An evidential classifier based on Dempster-Shafer theory and deep learning [6.230751621285322]
  We propose a new classification system based on Dempster-Shafer (DS) theory and a convolutional neural network (CNN) architecture for set-valued classification. Experiments on image recognition, signal processing, and semantic-relationship classification tasks demonstrate that the proposed combination of deep CNN, DS layer, and expected utility layer makes it possible to improve classification accuracy.
  arXiv  Detail & Related papers  (2021-03-25T01:29:05Z)
• Conditional Classification: A Solution for Computational Energy Reduction [2.182419181054266]
  We propose a novel solution to reduce the computational complexity of convolutional neural network models. Our proposed technique breaks the classification task into two steps: 1) coarse-grain classification, in which the input samples are classified among a set of hyper-classes, 2) fine-grain classification, in which the final labels are predicted among those hyper-classes detected at the first step.
  arXiv  Detail & Related papers  (2020-06-29T03:50:39Z)
• Open-Set Recognition with Gaussian Mixture Variational Autoencoders [91.3247063132127]
  In inference, open-set classification is to either classify a sample into a known class from training or reject it as an unknown class. We train our model to cooperatively learn reconstruction and perform class-based clustering in the latent space. Our model achieves more accurate and robust open-set classification results, with an average F1 improvement of 29.5%.
  arXiv  Detail & Related papers  (2020-06-03T01:15:19Z)
• Fine-Grained Visual Classification with Efficient End-to-end Localization [49.9887676289364]
  We present an efficient localization module that can be fused with a classification network in an end-to-end setup. We evaluate the new model on the three benchmark datasets CUB200-2011, Stanford Cars and FGVC-Aircraft.
  arXiv  Detail & Related papers  (2020-05-11T14:07:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.