Learning hidden cascades via classification

• URL: http://arxiv.org/abs/2505.11228v3
• Date: Wed, 24 Sep 2025 14:22:54 GMT
• Title: Learning hidden cascades via classification
• Authors: Derrick Gilchrist Edward Manoharan, Anubha Goel, Alexandros Iosifidis, Henri Hansen, Juho Kanniainen,
• Abstract summary: intermediate indicators such as symptoms of infection are observable.<n>We propose a partial observability-aware Machine Learning framework to learn the characteristics of the spreading model.<n>We validate the method on synthetic networks and extend the study to a real-world insider trading network.
• Score: 49.40566691717171
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The spreading dynamics in social networks are often studied under the assumption that individuals' statuses, whether informed or infected, are fully observable. However, in many real-world situations, such statuses remain unobservable, which is crucial for determining an individual's potential to further spread the infection. While final statuses are hidden, intermediate indicators such as symptoms of infection are observable and provide useful representations of the underlying diffusion process. We propose a partial observability-aware Machine Learning framework to learn the characteristics of the spreading model. We term the method Distribution Classification, which utilizes the power of classifiers to infer the underlying transmission dynamics. Through extensive benchmarking against Approximate Bayesian Computation and GNN-based baselines, our framework consistently outperforms these state-of-the-art methods, delivering accurate parameter estimates across diverse diffusion settings while scaling efficiently to large networks. We validate the method on synthetic networks and extend the study to a real-world insider trading network, demonstrating its effectiveness in analyzing spreading phenomena where direct observation of individual statuses is not possible.

Related papers

• Conformal Prediction for Multi-Source Detection on a Network [59.17729745907474]
  We study the multi-source detection problem.<n>Given snapshot observations of node infection status on a graph, estimate the set of source nodes that initiated the propagation.<n>We propose a novel conformal prediction framework that provides statistically valid recall guarantees for source set detection.
  arXiv  Detail & Related papers  (2025-11-12T01:09:56Z)
• Robust Domain Generalisation with Causal Invariant Bayesian Neural Networks [9.999199798941424]
  We propose a Bayesian neural architecture that disentangles the learning of the the data distribution from the inference process mechanisms. We show theoretically and experimentally that our model approximates reasoning under causal interventions.
  arXiv  Detail & Related papers  (2024-10-08T20:38:05Z)
• Distinguishing mechanisms of social contagion from local network view [0.02499907423888048]
  Multiple adoption rules may coexist even within the same social contagion process. Our goal is to understand whether coexisting adoption mechanisms can be distinguished from a microscopic view. This study offers a novel perspective on the observations of propagation processes at the egocentric level.
  arXiv  Detail & Related papers  (2024-06-26T17:49:24Z)
• Understanding Activation Patterns in Artificial Neural Networks by Exploring Stochastic Processes [0.0]
  We propose utilizing the framework of processes, which has been underutilized thus far. We focus solely on activation frequency, leveraging neuroscience techniques used for real neuron spike trains. We derive parameters describing activation patterns in each network, revealing consistent differences across architectures and training sets.
  arXiv  Detail & Related papers  (2023-08-01T22:12:30Z)
• Universal Scaling Laws of Absorbing Phase Transitions in Artificial Deep Neural Networks [0.8932296777085644]
  Conventional artificial deep neural networks operating near the phase boundary of the signal propagation dynamics, also known as the edge of chaos, exhibit universal scaling laws of absorbing phase transitions.<n>We exploit the fully deterministic nature of the propagation dynamics to elucidate an analogy between a signal collapse in the neural networks and an absorbing state.
  arXiv  Detail & Related papers  (2023-07-05T13:39:02Z)
• ShapeWordNet: An Interpretable Shapelet Neural Network for Physiological Signal Classification [16.82411861562806]
  We propose a more effective and interpretable scheme tailored for the physiological signal classification task. We exploit the time series shapelets to extract prominent local patterns and perform interpretable sequence discretization. We name our method as ShapeWordNet and conduct extensive experiments on three real-world datasets to investigate its effectiveness.
  arXiv  Detail & Related papers  (2023-02-10T02:30:31Z)
• Modeling Uncertain Feature Representation for Domain Generalization [49.129544670700525]
  We show that our method consistently improves the network generalization ability on multiple vision tasks. Our methods are simple yet effective and can be readily integrated into networks without additional trainable parameters or loss constraints.
  arXiv  Detail & Related papers  (2023-01-16T14:25:02Z)
• Interventional Causal Representation Learning [75.18055152115586]
  Causal representation learning seeks to extract high-level latent factors from low-level sensory data. Can interventional data facilitate causal representation learning? We show that interventional data often carries geometric signatures of the latent factors' support.
  arXiv  Detail & Related papers  (2022-09-24T04:59:03Z)
• Uncertainty Modeling for Out-of-Distribution Generalization [56.957731893992495]
  We argue that the feature statistics can be properly manipulated to improve the generalization ability of deep learning models. Common methods often consider the feature statistics as deterministic values measured from the learned features. We improve the network generalization ability by modeling the uncertainty of domain shifts with synthesized feature statistics during training.
  arXiv  Detail & Related papers  (2022-02-08T16:09:12Z)
• Data-driven emergence of convolutional structure in neural networks [83.4920717252233]
  We show how fully-connected neural networks solving a discrimination task can learn a convolutional structure directly from their inputs. By carefully designing data models, we show that the emergence of this pattern is triggered by the non-Gaussian, higher-order local structure of the inputs.
  arXiv  Detail & Related papers  (2022-02-01T17:11:13Z)
• Diffusion Mechanism in Residual Neural Network: Theory and Applications [12.573746641284849]
  In many learning tasks with limited training samples, the diffusion connects the labeled and unlabeled data points. We propose a novel diffusion residual network (Diff-ResNet) internally introduces diffusion into the architectures of neural networks. Under the structured data assumption, it is proved that the proposed diffusion block can increase the distance-diameter ratio that improves the separability of inter-class points.
  arXiv  Detail & Related papers  (2021-05-07T10:42:59Z)
• Health Status Prediction with Local-Global Heterogeneous Behavior Graph [69.99431339130105]
  Estimation of health status can be achieved with various kinds of data streams continuously collected from wearable sensors. We propose to model the behavior-related multi-source data streams with a local-global graph. We take experiments on StudentLife dataset, and extensive results demonstrate the effectiveness of our proposed model.
  arXiv  Detail & Related papers  (2021-03-23T11:10:04Z)
• Explainable Adversarial Attacks in Deep Neural Networks Using Activation Profiles [69.9674326582747]
  This paper presents a visual framework to investigate neural network models subjected to adversarial examples. We show how observing these elements can quickly pinpoint exploited areas in a model.
  arXiv  Detail & Related papers  (2021-03-18T13:04:21Z)
• Intraclass clustering: an implicit learning ability that regularizes DNNs [22.732204569029648]
  We show that deep neural networks are regularized through their ability to extract meaningful clusters among a class. Measures of intraclass clustering are designed based on the neuron- and layer-level representations of the training data.
  arXiv  Detail & Related papers  (2021-03-11T15:26:27Z)
• The Hidden Uncertainty in a Neural Networks Activations [105.4223982696279]
  The distribution of a neural network's latent representations has been successfully used to detect out-of-distribution (OOD) data. This work investigates whether this distribution correlates with a model's epistemic uncertainty, thus indicating its ability to generalise to novel inputs.
  arXiv  Detail & Related papers  (2020-12-05T17:30:35Z)
• Joint Inference of Diffusion and Structure in Partially Observed Social Networks Using Coupled Matrix Factorization [3.399624105745357]
  In this paper, a model is learned from partially observed data to infer unobserved diffusion and structure networks. The interrelations among links of nodes and cascade processes are utilized in the proposed method via learning and low-dimensional latent factors. Experiments on these synthetic and real-world datasets show that the proposed method successfully detects invisible social behaviors, predicts links, and identifies latent features.
  arXiv  Detail & Related papers  (2020-10-03T17:48:57Z)
• Vulnerability Under Adversarial Machine Learning: Bias or Variance? [77.30759061082085]
  We investigate the effect of adversarial machine learning on the bias and variance of a trained deep neural network. Our analysis sheds light on why the deep neural networks have poor performance under adversarial perturbation. We introduce a new adversarial machine learning algorithm with lower computational complexity than well-known adversarial machine learning strategies.
  arXiv  Detail & Related papers  (2020-08-01T00:58:54Z)
• Relationship between manifold smoothness and adversarial vulnerability in deep learning with local errors [2.7834038784275403]
  We study the origin of the adversarial vulnerability in artificial neural networks. Our study reveals that a high generalization accuracy requires a relatively fast power-law decay of the eigen-spectrum of hidden representations.
  arXiv  Detail & Related papers  (2020-07-04T08:47:51Z)
• Network Diffusions via Neural Mean-Field Dynamics [52.091487866968286]
  We propose a novel learning framework for inference and estimation problems of diffusion on networks. Our framework is derived from the Mori-Zwanzig formalism to obtain an exact evolution of the node infection probabilities. Our approach is versatile and robust to variations of the underlying diffusion network models.
  arXiv  Detail & Related papers  (2020-06-16T18:45:20Z)

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.