Chrome Extension
WeChat Mini Program
Use on ChatGLM

Fast Online Learning of Vulnerabilities for Networks with Propagating Failures

IEEE-ACM TRANSACTIONS ON NETWORKING(2024)

Ohio State Univ | Rhein Westfal TH Aachen

Cited 0|Views10
Abstract
In real-world networks, we regularly face the effect of propagating failures over networks, for example, rumors spread over social networks, outages spread over power networks, viruses spread over communication and biological networks. Often, these failures spread over a network of agents with unknown and potentially diverse degrees of vulnerabilities to the propagating phenomenon. In this work, we consider a general network model subject to propagating failures and develop provably fast mechanisms for learning the unknown vulnerabilities of the network with minimal cost incurred in the process. We propose an extension to the classic Independent Cascade (IC) model where we incorporate both node and edge failures with non-uniform costs. From an online learning perspective, the goal is to find an optimal policy to control where to start failures and generate samples. Therefore, we formulate a cost minimization problem with Probably-Approximately-Correct (PAC) type guarantees. As a theoretical benchmark, we design a linear programming problem using a proposed joint Bernstein inequality. Then we characterize the performance of randomized policies that use a fixed budget distribution independent of sampling history. Finally, we propose a fast Lyapunov-based online learning policy, for which we give a formal theoretical analysis. The performance of the policy are validated under extensive numerical studies for both synthetic and real-world networks.
More
Translated text
Key words
Online learning,Lyapunov method,independent cascade model
求助PDF
上传PDF
Bibtex
AI Read Science
AI Summary
AI Summary is the key point extracted automatically understanding the full text of the paper, including the background, methods, results, conclusions, icons and other key content, so that you can get the outline of the paper at a glance.
Example
Background
Key content
Introduction
Methods
Results
Related work
Fund
Key content
  • Pretraining has recently greatly promoted the development of natural language processing (NLP)
  • We show that M6 outperforms the baselines in multimodal downstream tasks, and the large M6 with 10 parameters can reach a better performance
  • We propose a method called M6 that is able to process information of multiple modalities and perform both single-modal and cross-modal understanding and generation
  • The model is scaled to large model with 10 billion parameters with sophisticated deployment, and the 10 -parameter M6-large is the largest pretrained model in Chinese
  • Experimental results show that our proposed M6 outperforms the baseline in a number of downstream tasks concerning both single modality and multiple modalities We will continue the pretraining of extremely large models by increasing data to explore the limit of its performance
Upload PDF to Generate Summary
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Related Papers
Data Disclaimer
The page data are from open Internet sources, cooperative publishers and automatic analysis results through AI technology. We do not make any commitments and guarantees for the validity, accuracy, correctness, reliability, completeness and timeliness of the page data. If you have any questions, please contact us by email: report@aminer.cn
Chat Paper

要点】:本文针对网络中的传播性故障,提出了一种快速在线学习网络节点脆弱性的机制,以最小化成本实现故障控制。

方法】:研究扩展了经典的独立级联(IC)模型,引入了节点和边故障的非均匀成本,并利用线性规划和Lyapunov理论设计了在线学习策略。

实验】:通过广泛的数值研究,包括合成网络和真实世界网络,验证了所提出的快速Lyapunov-based在线学习策略的性能。