Learning Constraints Directly from Network Data

• URL: http://arxiv.org/abs/2506.23964v1
• Date: Mon, 30 Jun 2025 15:36:22 GMT
• Title: Learning Constraints Directly from Network Data
• Abstract summary: Rule extraction can improve quality of synthetic data, reduce brittleness of machine learning models, and improve semantic understanding of network measurements.<n>This paper introduces NetNomos, which learns propositional logic constraints directly from raw network measurements.<n>Our evaluations show that NetNomos learns all benchmark rules, including those associated with as little as 0.01% of data points, in under three hours.
• Score: 0.34137115855910755
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Network data conforms to a wide range of rules that arise from protocols, design principles, and deployment decisions (e.g., a packet's queuing delay must be less than its end-to-end delay). Formalizing such rules as logic constraints can (i) improve the quality of synthetic data, (ii) reduce the brittleness of machine learning (ML) models, and (iii) improve semantic understanding of network measurements. However, these benefits remain out of reach if rule extraction is manual or solely reliant on ML, as both approaches yield incomplete, unreliable, and/or inaccurate rules. This paper formulates rule extraction as a constraint modeling problem and introduces NetNomos that learns propositional logic constraints directly from raw network measurements. Constraint modeling in this domain is uniquely challenging due to the scale of the data, the inherent learning complexity and passive environment, and the lack of ground truth supervision. NetNomos addresses these challenges via a lattice-based search structured by constraint specificity and succinctness. Our approach reduces learning complexity from superquadratic to logarithmic and enables efficient traversal in combinatorial search space. Our evaluations on diverse network datasets show that NetNomos learns all benchmark rules, including those associated with as little as 0.01% of data points, in under three hours. In contrast, baseline methods discover less than 25% of the rules and require several days to run. Through three case studies, we show that: NetNomos (i) finds rule violations in the outputs of all seven synthetic traffic generators, hence can be used to assess and guide their generation process; (ii) detects semantic differences in traffic, hence can be used for anomaly detection; and (iii) automatically finds rules used for telemetry imputation, hence can support monitoring through inference.

Related papers

• Understanding Network Behaviors through Natural Language Question-Answering [11.90560159315518]
  We propose NetMind, a novel framework for querying networks using natural language (NL)<n>Our approach introduces a tree-based configuration chunking strategy to preserve semantic coherence.<n>We then construct a unified fact graph as an intermediate representation to normalize vendor-specific configurations.
  arXiv  Detail & Related papers  (2025-10-24T08:54:29Z)
• A General Framework for Property-Driven Machine Learning [1.0485739694839669]
  We show that adversarial training can be used to improve robustness to small perturbations within $epsilon$-cubes.<n> domains other than computer vision may require more flexible input region specifications via generalised hyper-rectangles.<n>In this paper, we investigate how these two complementary approaches can be unified within a single framework for property-driven machine learning.
  arXiv  Detail & Related papers  (2025-05-01T11:33:38Z)
• Using Petri Nets as an Integrated Constraint Mechanism for Reinforcement Learning Tasks [3.105112058253643]
  Lack of trust in algorithms is usually an issue when using Reinforcement Learning (RL) agents for control in real-world domains. We propose an approach that uses Petri nets (PNs) with three main advantages over typical RL approaches.
  arXiv  Detail & Related papers  (2024-07-05T13:04:06Z)
• Generative AI-in-the-loop: Integrating LLMs and GPTs into the Next Generation Networks [11.509880721677156]
  Large language models (LLMs) have recently emerged, demonstrating near-human-level performance in cognitive tasks. We propose the concept of "generative AI-in-the-loop" We believe that combining LLMs and ML models allows both to leverage their respective capabilities and achieve better results than either model alone.
  arXiv  Detail & Related papers  (2024-06-06T17:25:07Z)
• Decentralized Learning Strategies for Estimation Error Minimization with Graph Neural Networks [94.2860766709971]
  We address the challenge of sampling and remote estimation for autoregressive Markovian processes in a wireless network with statistically-identical agents.<n>Our goal is to minimize time-average estimation error and/or age of information with decentralized scalable sampling and transmission policies.
  arXiv  Detail & Related papers  (2024-04-04T06:24:11Z)
• netFound: Foundation Model for Network Security [10.84029318509573]
  This paper introduces a novel transformer-based network foundation model, netFound.<n>We employ self-supervised learning techniques on abundant, unlabeled network telemetry data for pre-training.<n>Our results demonstrate that netFound effectively captures the hidden networking context in production settings.
  arXiv  Detail & Related papers  (2023-10-25T22:04:57Z)
• Optimization Guarantees of Unfolded ISTA and ADMM Networks With Smooth Soft-Thresholding [57.71603937699949]
  We study optimization guarantees, i.e., achieving near-zero training loss with the increase in the number of learning epochs. We show that the threshold on the number of training samples increases with the increase in the network width.
  arXiv  Detail & Related papers  (2023-09-12T13:03:47Z)
• Robust Online Learning over Networks [1.0249620437941]
  This work specifically targets some prevalent challenges inherent to distributed learning. We apply the Distributed Operator Theoretical (DOT) version of the Alternating Direction Method of Multipliers (ADMM) We prove that if the DOT-ADMM operator is metric subregular, then it converges with a linear rate for a class of convex learning problems.
  arXiv  Detail & Related papers  (2023-09-01T15:18:05Z)
• IF2Net: Innately Forgetting-Free Networks for Continual Learning [49.57495829364827]
  Continual learning can incrementally absorb new concepts without interfering with previously learned knowledge. Motivated by the characteristics of neural networks, we investigated how to design an Innately Forgetting-Free Network (IF2Net) IF2Net allows a single network to inherently learn unlimited mapping rules without telling task identities at test time.
  arXiv  Detail & Related papers  (2023-06-18T05:26:49Z)
• Networked Communication for Decentralised Agents in Mean-Field Games [59.01527054553122]
  We introduce networked communication to the mean-field game framework.<n>We prove that our architecture has sample guarantees bounded between those of the centralised- and independent-learning cases.<n>We show that our networked approach has significant advantages over both alternatives in terms of robustness to update failures and to changes in population size.
  arXiv  Detail & Related papers  (2023-06-05T10:45:39Z)
• Mitigating Catastrophic Forgetting in Long Short-Term Memory Networks [7.291687946822538]
  Continual learning on sequential data is critical for many machine learning (ML) deployments. LSTM networks suffer from catastrophic forgetting and are limited in their ability to learn multiple tasks continually. We discover that catastrophic forgetting in LSTM networks can be overcome in two novel and readily-implementable ways.
  arXiv  Detail & Related papers  (2023-05-26T20:17:18Z)
• Deep learning applied to computational mechanics: A comprehensive review, state of the art, and the classics [77.34726150561087]
  Recent developments in artificial neural networks, particularly deep learning (DL), are reviewed in detail. Both hybrid and pure machine learning (ML) methods are discussed. History and limitations of AI are recounted and discussed, with particular attention at pointing out misstatements or misconceptions of the classics.
  arXiv  Detail & Related papers  (2022-12-18T02:03:00Z)
• A new hope for network model generalization [66.5377859849467]
  Generalizing machine learning models for network traffic dynamics tends to be considered a lost cause. An ML architecture called_Transformer_ has enabled previously unimaginable generalization in other domains. We propose a Network Traffic Transformer (NTT) to learn network dynamics from packet traces.
  arXiv  Detail & Related papers  (2022-07-12T21:16:38Z)
• Synergy and Symmetry in Deep Learning: Interactions between the Data, Model, and Inference Algorithm [33.59320315666675]
  We study the triplet (D, M, I) as an integrated system and identify important synergies that help mitigate the curse of dimensionality. We find that learning is most efficient when these symmetries are compatible with those of the data distribution.
  arXiv  Detail & Related papers  (2022-07-11T04:08:21Z)
• Interpolation-based Contrastive Learning for Few-Label Semi-Supervised Learning [43.51182049644767]
  Semi-supervised learning (SSL) has long been proved to be an effective technique to construct powerful models with limited labels. Regularization-based methods which force the perturbed samples to have similar predictions with the original ones have attracted much attention. We propose a novel contrastive loss to guide the embedding of the learned network to change linearly between samples.
  arXiv  Detail & Related papers  (2022-02-24T06:00:05Z)
• Characterizing possible failure modes in physics-informed neural networks [55.83255669840384]
  Recent work in scientific machine learning has developed so-called physics-informed neural network (PINN) models. We demonstrate that, while existing PINN methodologies can learn good models for relatively trivial problems, they can easily fail to learn relevant physical phenomena even for simple PDEs. We show that these possible failure modes are not due to the lack of expressivity in the NN architecture, but that the PINN's setup makes the loss landscape very hard to optimize.
  arXiv  Detail & Related papers  (2021-09-02T16:06:45Z)
• SignalNet: A Low Resolution Sinusoid Decomposition and Estimation Network [79.04274563889548]
  We propose SignalNet, a neural network architecture that detects the number of sinusoids and estimates their parameters from quantized in-phase and quadrature samples. We introduce a worst-case learning threshold for comparing the results of our network relative to the underlying data distributions. In simulation, we find that our algorithm is always able to surpass the threshold for three-bit data but often cannot exceed the threshold for one-bit data.
  arXiv  Detail & Related papers  (2021-06-10T04:21:20Z)
• Reinforcement Learning with External Knowledge by using Logical Neural Networks [67.46162586940905]
  A recent neuro-symbolic framework called the Logical Neural Networks (LNNs) can simultaneously provide key-properties of both neural networks and symbolic logic. We propose an integrated method that enables model-free reinforcement learning from external knowledge sources.
  arXiv  Detail & Related papers  (2021-03-03T12:34:59Z)
• Towards Accurate Knowledge Transfer via Target-awareness Representation Disentanglement [56.40587594647692]
  We propose a novel transfer learning algorithm, introducing the idea of Target-awareness REpresentation Disentanglement (TRED) TRED disentangles the relevant knowledge with respect to the target task from the original source model and used as a regularizer during fine-tuning the target model. Experiments on various real world datasets show that our method stably improves the standard fine-tuning by more than 2% in average.
  arXiv  Detail & Related papers  (2020-10-16T17:45:08Z)
• Machine Learning for Intelligent Optical Networks: A Comprehensive Survey [9.947717243638289]
  It is imperative to improve intelligence in communication network, and several aspects have been incorporating with Artificial Intelligence (AI) and Machine Learning (ML) In this paper, a detailed survey of existing applications of ML for intelligent optical networks is presented. The applications of ML are classified in terms of their use cases, which are categorized into optical network control and resource management, and optical networks monitoring and survivability.
  arXiv  Detail & Related papers  (2020-03-11T13:51:38Z)
• Deep Learning for Ultra-Reliable and Low-Latency Communications in 6G Networks [84.2155885234293]
  We first summarize how to apply data-driven supervised deep learning and deep reinforcement learning in URLLC. To address these open problems, we develop a multi-level architecture that enables device intelligence, edge intelligence, and cloud intelligence for URLLC.
  arXiv  Detail & Related papers  (2020-02-22T14:38: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.