Skip to main content
Search

# Causal Learning

3 related articles

Subscribe to updates
  1. arXiv

    Clique constraints enter exact causal structure learning: no uniform speedup, and gains hinge on graph density and cut management

    Exact causal structure learning solves for a globally optimal directed acyclic graph with mixed-integer programming, but its branch-and-cut search is costly. This work adds an upper bound on the maximum clique size of the learned undirected skeleton, using lazy cycle and clique constraints to reject locally over-dense subgraphs at integer candidates. On static linear-Gaussian synthetic graphs, clique constraints do not uniformly accelerate optimization; their benefit depends on graph density, sample size, and cut-management policy, while tighter valid Big-M bounds reduced the fixed-budget optimality gap in most tested settings.

  2. Intrusion detection stops leaning on correlation alone: causal graph plus entropy compression cuts 78 flow features to 18 and reaches 97.4% accuracy

    A hybrid intrusion-detection framework that chains causal graph learning, entropy-guided compression, attention fusion, adversarial calibration and trust-weighted federated aggregation into one pipeline reaches 97.4% detection accuracy on CICIDS2017 while cutting the input from 78 features to 18.

  3. arXiv

    SCOPE aligns interventions across multiple decision points using causal learners plus backward induction, consistently beating existing sequential prescriptive process monitoring methods on SimBank and the new SimBPIC17 benchmark

    The work introduces SCOPE, a prescriptive process monitoring approach that combines causal learners (S-, T-, and RA-learners) with regret-based backward induction to learn sequential intervention policies aligned across multiple decision points directly from observational event logs, without building an MDP or augmenting data; on SimBank and on a new semi-synthetic benchmark SimBPIC17 built from the BPIC17_W event log, SCOPE outperforms baselines such as KMeans-Q and SEP-S in most experimental settings, with its advantage growing as training size and the number of decision points increase.

You’re all caught up