Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization

• URL: http://arxiv.org/abs/2604.15746v1
• Date: Fri, 17 Apr 2026 06:42:59 GMT
• Title: Enhancing Discrete Particle Swarm Optimization for Hypergraph-Modeled Influence Maximization
• Abstract summary: Influence (IM) is a fundamental problem in complex network analysis, with a wide range of real-world applications.<n>We propose a new hypergraph-modeled IM method, based on the Discrete Particle Swarm Optimization algorithm and the threshold model.<n>In proposed method, a particle represents the selection information of seed nodes, and the fitness function is designed to accurately and efficiently evaluate the influence of seed nodes via a two-layer local influence approximation.
• Score: 9.949881986716553
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Influence maximization (IM) is a fundamental problem in complex network analysis, with a wide range of real-world applications. To date, existing approaches to influential node identification in IM have predominantly relied on standard graphs, failing to capture higher-order intrinsic interactions embedded in many real-world systems. Hypergraphs can be employed to better capture higher-order interactions. However, using hypergraphs may lead to an excessively large search space and increased complexity in modeling cascading dynamics, making it challenging to accurately identify influential nodes. Therefore, in this study, we propose a new hypergraph-modeled IM method, based on the Discrete Particle Swarm Optimization algorithm and the threshold model. In the proposed method, a particle (i.e., a candidate solution) represents the selection information of seed nodes, and the fitness function is designed to accurately and efficiently evaluate the influence of seed nodes via a two-layer local influence approximation. We also propose a degree-based initialization strategy to improve the quality of initial solutions and develop rules for updating particles' velocity and position, incorporated with a local search to drive particles toward better solutions. Experimental results demonstrate that the proposed method outperforms baseline methods on both synthetic and real-world hypergraphs. In addition, ablation studies validate the effectiveness of both the local search and the initialization strategies.

Related papers

• Characterizing and Optimizing the Spatial Kernel of Multi Resolution Hash Encodings [2.497913938263034]
  Multi-Resolution Hash Function (MHE) provides a powerful parameterization for neural fields.<n>This work introduces a novel analytical approach that characterizes MHE by examining its Point Spread (PSF)<n>We demonstrate how collisions introduce speckle noise and degrade the Signal-to-Noise Ratio (SNR)
  arXiv  Detail & Related papers  (2026-02-11T03:55:42Z)
• PACMANN: Point Adaptive Collocation Method for Artificial Neural Networks [41.99844472131922]
  PINNs minimize a loss function which includes the PDE residual determined for a set of collocation points.<n>PACMANN incrementally moves collocation points toward regions of higher residuals using gradient-based optimization algorithms.<n>Key features of the method include its low computational cost and simplicity of integration into existing physics-informed neural network pipelines.
  arXiv  Detail & Related papers  (2024-11-29T11:31:11Z)
• Scalable and Effective Negative Sample Generation for Hyperedge Prediction [55.9298019975967]
  Hyperedge prediction is crucial for understanding complex multi-entity interactions in web-based applications. Traditional methods often face difficulties in generating high-quality negative samples due to imbalance between positive and negative instances. We present the scalable and effective negative sample generation for Hyperedge Prediction (SEHP) framework, which utilizes diffusion models to tackle these challenges.
  arXiv  Detail & Related papers  (2024-11-19T09:16:25Z)
• Spatiotemporal Graph Learning with Direct Volumetric Information Passing and Feature Enhancement [62.91536661584656]
  We propose a dual-module framework, Cell-embedded and Feature-enhanced Graph Neural Network (aka, CeFeGNN) for learning.<n>We embed learnable cell attributions to the common node-edge message passing process, which better captures the spatial dependency of regional features.<n>Experiments on various PDE systems and one real-world dataset demonstrate that CeFeGNN achieves superior performance compared with other baselines.
  arXiv  Detail & Related papers  (2024-09-26T16:22:08Z)
• Influence Maximization in Hypergraphs Using A Genetic Algorithm with New Initialization and Evaluation Methods [6.315027378756443]
  Influence (IM) is a crucial optimization task related to analyzing complex networks in the real world. We propose a novel model that integrates the influences of both node and hyperedge failures. We then introduce genetic algorithms (GA) to identify the most influential nodes that leverage hypergraph collective influences.
  arXiv  Detail & Related papers  (2024-05-15T08:46:33Z)
• Efficient Heterogeneous Graph Learning via Random Projection [58.4138636866903]
  Heterogeneous Graph Neural Networks (HGNNs) are powerful tools for deep learning on heterogeneous graphs. Recent pre-computation-based HGNNs use one-time message passing to transform a heterogeneous graph into regular-shaped tensors. We propose a hybrid pre-computation-based HGNN, named Random Projection Heterogeneous Graph Neural Network (RpHGNN)
  arXiv  Detail & Related papers  (2023-10-23T01:25:44Z)
• Implicit Stochastic Gradient Descent for Training Physics-informed Neural Networks [51.92362217307946]
  Physics-informed neural networks (PINNs) have effectively been demonstrated in solving forward and inverse differential equation problems. PINNs are trapped in training failures when the target functions to be approximated exhibit high-frequency or multi-scale features. In this paper, we propose to employ implicit gradient descent (ISGD) method to train PINNs for improving the stability of training process.
  arXiv  Detail & Related papers  (2023-03-03T08:17:47Z)
• Optimal Propagation for Graph Neural Networks [51.08426265813481]
  We propose a bi-level optimization approach for learning the optimal graph structure. We also explore a low-rank approximation model for further reducing the time complexity.
  arXiv  Detail & Related papers  (2022-05-06T03:37:00Z)
• Data-heterogeneity-aware Mixing for Decentralized Learning [63.83913592085953]
  We characterize the dependence of convergence on the relationship between the mixing weights of the graph and the data heterogeneity across nodes. We propose a metric that quantifies the ability of a graph to mix the current gradients. Motivated by our analysis, we propose an approach that periodically and efficiently optimize the metric.
  arXiv  Detail & Related papers  (2022-04-13T15:54:35Z)
• RL-PGO: Reinforcement Learning-based Planar Pose-Graph Optimization [1.4884785898657995]
  This paper presents a state-of-the-art Deep Reinforcement Learning (DRL) based environment and proposed agent for 2D pose-graph optimization. We demonstrate that the pose-graph optimization problem can be modeled as a partially observable Decision Process and evaluate performance on real-world and synthetic datasets.
  arXiv  Detail & Related papers  (2022-02-26T20:10:14Z)
• Learnable Hypergraph Laplacian for Hypergraph Learning [34.28748027233654]
  HyperGraph Convolutional Neural Networks (HGCNNs) have demonstrated their potential in modeling high-order relations preserved in graph structured data. We propose the first learning-based method tailored for constructing adaptive hypergraph structure, termed HypERgrAph Laplacian aDaptor (HERALD) HERALD adaptively optimize the adjacency relationship between hypernodes and hyperedges in an end-to-end manner and thus the task-aware hypergraph is learned.
  arXiv  Detail & Related papers  (2021-06-12T02:07:07Z)
• Hypergraph Optimization for Multi-structural Geometric Model Fitting [42.217640009137554]
  We propose a novel hypergraph optimization based model fitting (HOMF) method to construct a simple but effective hypergraph. The proposed method is highly efficient, and it can obtain accurate model fitting results within a few iterations.
  arXiv  Detail & Related papers  (2020-02-13T05:07:11Z)

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.