O-RAN xApps Conflict Management using Graph Convolutional Networks

• URL: http://arxiv.org/abs/2503.03523v2
• Date: Tue, 15 Apr 2025 07:49:44 GMT
• Title: O-RAN xApps Conflict Management using Graph Convolutional Networks
• Abstract summary: We introduce a novel data-driven method called GRAPH-based Intelligent xApp Conflict Prediction and Analysis (GRAPHICA) based on Graph Convolutional Network (GCN)<n>GRAPHICA predicts three types of conflicts (direct, indirect, and implicit) and pinpoints the root causes (xApps)
• Score: 2.087814874079289
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: The lack of a unified mechanism to coordinate and prioritize the actions of different applications can create three types of conflicts (direct, indirect, and implicit). Conflict management in O-RAN refers to the process of identifying and resolving conflicts between network applications. In our paper, we introduce a novel data-driven GCN-based method called GRAPH-based Intelligent xApp Conflict Prediction and Analysis (GRAPHICA) based on Graph Convolutional Network (GCN). It predicts three types of conflicts (direct, indirect, and implicit) and pinpoints the root causes (xApps). GRAPHICA captures the complex and hidden dependencies among the xApps, controlled parameters, and KPIs in O-RAN to predict possible conflicts. Then, it identifies the root causes (xApps) contributing to the predicted conflicts. The proposed method was tested on highly imbalanced synthesized datasets where conflict instances range from 40% to 10%. The model is tested in a setting that simulates real-world scenarios where conflicts are rare to assess its performance. Experimental results demonstrate a high F1-score over 98% for the synthesized datasets with different levels of class imbalance.

Related papers

• Cognitive Graph Intelligence for Adaptive and Robust DDoS Attack Detection in Next Generation Networks [2.434167379974669]
  This paper proposes a Graph-based Generative Adrial Network (GraphGAN) that serves as the cognitive detection engine for this task.<n>GraphGAN captures the relational structure among traffic flows while addressing imbalance through adversarial generation of synthetic samples.<n>The generator learns the distribution of DDoS attacks to synthesize realistic minority samples, while a Graph Convolutional Network (GCN)-based discriminator distinguishes real from synthetic graph data.
  arXiv  Detail & Related papers  (2026-08-18T04:18:31Z)
• CORE: Conflict-Oriented Reasoning for General Multimodal Manipulation Detection [56.64398465636452]
  generative AI has made multimodal fake news increasingly realistic and pervasive, posing severe threats to public trust and social stability.<n>We propose textbfConflict-textbfOriented textbfREasoning (textbfCORE) framework, an effective paradigm that learns to endows multimodal large language models (MLLMs) with explicit conflict-capturing capability.<n> CORE achieves robust and generalizable conflict detection, effectively and rapidly adapting to unseen manipulation types with a few samples or in even zero-shot settings.
  arXiv  Detail & Related papers  (2026-06-02T02:53:48Z)
• Conflicts Make Large Reasoning Models Vulnerable to Attacks [17.460309581795595]
  This work investigates how LRMs respond to harmful queries when confronted with two categories of conflicts.<n>Internal conflicts pit alignment values against each other and dilemmas impose mutually contradictory choices.<n>Using over 1,300 prompts across five benchmarks, we evaluate three representative LRMs.
  arXiv  Detail & Related papers  (2026-04-10T11:44:57Z)
• Diagnosing Knowledge Conflict in Multimodal Long-Chain Reasoning [78.86309644343295]
  Multimodal large language models (MLLMs) in long chain-of-thought reasoning often fail when different knowledge sources provide conflicting signals.<n>We formalize these failures under a unified notion of knowledge conflict, distinguishing input-level objective conflict from process-level effective conflict.<n>Our findings provide a mechanism-level view of multimodal reasoning under knowledge conflict and enable principled diagnosis and control of long-CoT failures.
  arXiv  Detail & Related papers  (2026-02-16T07:10:44Z)
• Group Interventions on Deep Networks for Causal Discovery in Subsystems [9.239779358333182]
  Causal discovery uncovers complex relationships between variables, enhancing predictions, decision-making, and insights into real-world systems.<n>We introduce gCDMI, a novel multi-group causal discovery method that leverages group-level interventions on trained deep neural networks.<n>We evaluate our method on simulated datasets, demonstrating its superior performance compared to existing methods.
  arXiv  Detail & Related papers  (2025-10-27T22:26:20Z)
• That's Deprecated! Understanding, Detecting, and Steering Knowledge Conflicts in Language Models for Code Generation [55.78914774437411]
  Large language models (LLMs) behave when faced with discrepancies between their parametric knowledge and conflicting information contained in a prompt.<n>We propose a domain-agnostic framework for constructing and interpreting such conflicts.<n>We show that activation-level steering can achieve up to a textbf12.6% improvement in steering success over a random baseline.
  arXiv  Detail & Related papers  (2025-10-21T22:27:56Z)
• Test-time Verification via Optimal Transport: Coverage, ROC, & Sub-optimality [53.03186946689658]
  Test-time scaling with verification has shown promise in improving the performance of large language models.<n>The effect of verification manifests through interactions of three quantities: (i) the generator's coverage, (ii) the verifier's region of convergence (ROC), and (iii) the sampling algorithm's sub-optimality.<n>We frame verifiable test-time scaling as a transport problem. This characterizes the interaction of coverage, ROC, and sub-optimality.
  arXiv  Detail & Related papers  (2025-10-21T18:05:42Z)
• Conflicts in Texts: Data, Implications and Challenges [58.03478157713084]
  Conflicts could reflect the complexity of situations, changes that need to be explained and dealt with, difficulties in data annotation, and mistakes in generated outputs. This survey categorizes these conflicts into three key areas: (1) natural texts on the web, where factual inconsistencies, subjective biases, and multiple perspectives introduce contradictions; (2) human-annotated data, where annotator disagreements, mistakes, and societal biases impact model training; and (3) model interactions, where hallucinations and knowledge conflicts emerge during deployment. We highlight key challenges and future directions for developing conflict-aware NLP systems that can reason over and reconcile conflicting information more effectively
  arXiv  Detail & Related papers  (2025-04-28T04:24:01Z)
• Out-of-Distribution Detection on Graphs: A Survey [58.47395497985277]
  Graph out-of-distribution (GOOD) detection focuses on identifying graph data that deviates from the distribution seen during training. We categorize existing methods into four types: enhancement-based, reconstruction-based, information propagation-based, and classification-based approaches. We discuss practical applications and theoretical foundations, highlighting the unique challenges posed by graph data.
  arXiv  Detail & Related papers  (2025-02-12T04:07:12Z)
• Discovery of Maximally Consistent Causal Orders with Large Language Models [0.8192907805418583]
  Causal discovery is essential for understanding complex systems.<n>Traditional methods often rely on strong, untestable assumptions.<n>We propose a novel method to derive a class of acyclic tournaments.
  arXiv  Detail & Related papers  (2024-12-18T16:37:51Z)
• Graph Disentangle Causal Model: Enhancing Causal Inference in Networked Observational Data [24.583216292149366]
  Estimating individual treatment effects (ITE) from observational data is a critical task across various domains. We propose a novel framework called the textitGraph Disentangle Causal model (GDC) to conduct ITE estimation in the network setting.
  arXiv  Detail & Related papers  (2024-12-05T06:30:20Z)
• Indiscriminate Disruption of Conditional Inference on Multivariate Gaussians [60.22542847840578]
  Despite advances in adversarial machine learning, inference for Gaussian models in the presence of an adversary is notably understudied. We consider a self-interested attacker who wishes to disrupt a decisionmaker's conditional inference and subsequent actions by corrupting a set of evidentiary variables. To avoid detection, the attacker also desires the attack to appear plausible wherein plausibility is determined by the density of the corrupted evidence.
  arXiv  Detail & Related papers  (2024-11-21T17:46:55Z)
• CONGRA: Benchmarking Automatic Conflict Resolution [3.9910625211670485]
  ConGra is a benchmarking scheme designed to evaluate the performance of software merging tools. We build a large-scale evaluation dataset based on 44,948 conflicts from 34 real-world projects.
  arXiv  Detail & Related papers  (2024-09-21T12:21:41Z)
• AdaCAD: Adaptively Decoding to Balance Conflicts between Contextual and Parametric Knowledge [57.66282463340297]
  Knowledge conflict arises from discrepancies between information in the context of a large language model and the knowledge stored in its parameters. We propose a fine-grained, instance-level approach called AdaCAD, which dynamically infers the weight of adjustment based on the degree of conflict. We show that ADACAD consistently outperforms other decoding baselines with average QA accuracy gains of 14.21% (absolute) over a static contrastive baseline, and improves the factuality of summaries by 6.19 (AlignScore)
  arXiv  Detail & Related papers  (2024-09-11T16:35:18Z)
• Targeted Cause Discovery with Data-Driven Learning [66.86881771339145]
  We propose a novel machine learning approach for inferring causal variables of a target variable from observations. We employ a neural network trained to identify causality through supervised learning on simulated data. Empirical results demonstrate the effectiveness of our method in identifying causal relationships within large-scale gene regulatory networks.
  arXiv  Detail & Related papers  (2024-08-29T02:21:11Z)
• Deriving Causal Order from Single-Variable Interventions: Guarantees & Algorithm [14.980926991441345]
  We show that datasets containing interventional data can be effectively extracted under realistic assumptions about the data distribution.<n>We introduce a novel variant of interventional faithfulness, which relies on comparisons between the marginal distributions of each variable across observational and interventional settings.<n>We also introduce Intersort, an algorithm designed to infer the causal order from datasets containing large numbers of single-variable interventions.
  arXiv  Detail & Related papers  (2024-05-28T16:07:17Z)
• DIGIC: Domain Generalizable Imitation Learning by Causal Discovery [69.13526582209165]
  Causality has been combined with machine learning to produce robust representations for domain generalization. We make a different attempt by leveraging the demonstration data distribution to discover causal features for a domain generalizable policy. We design a novel framework, called DIGIC, to identify the causal features by finding the direct cause of the expert action from the demonstration data distribution.
  arXiv  Detail & Related papers  (2024-02-29T07:09:01Z)
• Multi-modal Causal Structure Learning and Root Cause Analysis [67.67578590390907]
  We propose Mulan, a unified multi-modal causal structure learning method for root cause localization. We leverage a log-tailored language model to facilitate log representation learning, converting log sequences into time-series data. We also introduce a novel key performance indicator-aware attention mechanism for assessing modality reliability and co-learning a final causal graph.
  arXiv  Detail & Related papers  (2024-02-04T05:50:38Z)
• Hidden Conflicts in Neural Networks and Their Implications for Explainability [10.6042677656006]
  We develop a theory of conflicts in ANNs and demonstrate their impact on ANN explainability through two case studies.<n>In the first case study, we use our theory of conflicts to inspire the design of a novel feature attribution method.<n>In the second case study, we take preliminary steps towards understanding the role of conflicts in out-of-distribution scenarios.
  arXiv  Detail & Related papers  (2023-10-31T11:14:26Z)
• Modeling Instance Interactions for Joint Information Extraction with Neural High-Order Conditional Random Field [39.055053720433435]
  We introduce a joint IE framework (CRFIE) that formulates joint IE as a high-order Conditional Random Field. Specifically, we design binary factors and ternary factors to directly model interactions between not only a pair of instances but also triplets. We incorporate a high-order neural decoder that is unfolded from a mean-field variational inference method.
  arXiv  Detail & Related papers  (2022-12-17T18:45:23Z)
• NetRCA: An Effective Network Fault Cause Localization Algorithm [22.88986905436378]
  Localizing root cause of network faults is crucial to network operation and maintenance. We propose a novel algorithm named NetRCA to deal with this problem. Experiments and analysis are conducted on the real-world dataset from ICASSP 2022 AIOps Challenge.
  arXiv  Detail & Related papers  (2022-02-23T02:03:35Z)
• Relational Graph Neural Networks for Fraud Detection in a Super-App environment [53.561797148529664]
  We propose a framework of relational graph convolutional networks methods for fraudulent behaviour prevention in the financial services of a Super-App. We use an interpretability algorithm for graph neural networks to determine the most important relations to the classification task of the users. Our results show that there is an added value when considering models that take advantage of the alternative data of the Super-App and the interactions found in their high connectivity.
  arXiv  Detail & Related papers  (2021-07-29T00:02:06Z)
• Examining and Combating Spurious Features under Distribution Shift [94.31956965507085]
  We define and analyze robust and spurious representations using the information-theoretic concept of minimal sufficient statistics. We prove that even when there is only bias of the input distribution, models can still pick up spurious features from their training data. Inspired by our analysis, we demonstrate that group DRO can fail when groups do not directly account for various spurious correlations.
  arXiv  Detail & Related papers  (2021-06-14T05:39:09Z)
• An Influence-based Approach for Root Cause Alarm Discovery in Telecom Networks [7.438302177990416]
  In practice, accurate and self-adjustable alarm root cause analysis is a great challenge due to network complexity and vast amounts of alarms. We propose a data-driven framework for root cause alarm localization, combining both causal inference and network embedding techniques. We evaluate our method on artificial data and real-world telecom data, showing a significant improvement over the best baselines.
  arXiv  Detail & Related papers  (2021-05-07T07:41:46Z)
• Unsupervised and self-adaptative techniques for cross-domain person re-identification [82.54691433502335]
  Person Re-Identification (ReID) across non-overlapping cameras is a challenging task. Unsupervised Domain Adaptation (UDA) is a promising alternative, as it performs feature-learning adaptation from a model trained on a source to a target domain without identity-label annotation. In this paper, we propose a novel UDA-based ReID method that takes advantage of triplets of samples created by a new offline strategy.
  arXiv  Detail & Related papers  (2021-03-21T23:58:39Z)
• When Relation Networks meet GANs: Relation GANs with Triplet Loss [110.7572918636599]
  Training stability is still a lingering concern of generative adversarial networks (GANs) In this paper, we explore a relation network architecture for the discriminator and design a triplet loss which performs better generalization and stability. Experiments on benchmark datasets show that the proposed relation discriminator and new loss can provide significant improvement on variable vision tasks.
  arXiv  Detail & Related papers  (2020-02-24T11:35:28Z)

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.