Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2002.10870

AMP Chain Graphs: Minimal Separators and Structure Learning Algorithms

Mohammad Ali Javidian·Marco Valtorta·Pooyan Jamshidi
View original source ↗Read source document ↗Export metadata ↓

Abstract

We address the problem of finding a minimal separator in an Andersson-Madigan-Perlman chain graph (AMP CG), namely, finding a set Z of nodes that separates a given nonadjacent pair of nodes such that no proper subset of Z separates that pair. We analyze several versions of this problem and offer polynomial-time algorithms for each. These include finding a minimal separator from a restricted set of nodes, finding a minimal separator for two given disjoint sets, and testing whether a given separator is minimal. To address the problem of learning the structure of AMP CGs from data, we show that the PC-like algorithm (Pena, 2012) is order-dependent, in the sense that the output can depend on the order in which the variables are given. We propose several modifications of the PC-like algorithm that remove part or all of this order-dependence. We also extend the decomposition-based approach for learning Bayesian networks (BNs) proposed by (Xie et al., 2006) to learn AMP CGs, which include BNs as a special case, under the faithfulness assumption. We prove the correctness of our extension using the minimal separator results. Using standard benchmarks and synthetically generated models and data in our experiments demonstrate the competitive performance of our decomposition-based method, called LCD-AMP, in comparison with the (modified versions of) PC-like algorithm. The LCD-AMP algorithm usually outperforms the PC-like algorithm, and our modifications of the PC-like algorithm learn structures that are more similar to the underlying ground truth graphs than the original PC-like algorithm, especially in high-dimensional settings. In particular, we empirically show that the results of both algorithms are more accurate and stabler when the sample size is reasonably large and the underlying graph is sparse.

Explore related subjects

cs.AIcs.DScs.LGstat.ML

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mohammad Ali Javidian, Marco Valtorta, Pooyan Jamshidi. 2020-08-04. AMP Chain Graphs: Minimal Separators and Structure Learning Algorithms. https://arxiv.org/abs/2002.10870

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

DeepFeature: LLM-Empowered Context-aware Feature Generation for Wearable Biosignals

Biosignals collected from wearable devices are widely utilized in healthcare applications. Machine learning models used in these applications often rely on features extracted from biosignals due to their effectiveness, lower data dimensionality, and wide compatibility across various model architectures. However, existing feature extraction methods often lack task-specific contextual knowledge, struggle to identify optimal features in high-dimensional combinatorial feature space, and are prone to automated code generation and execution errors. In this paper, we propose DeepFeature, the first LLM-empowered, context-aware feature generation framework for wearable biosignals. DeepFeature introduces a multi-source feature generation mechanism that integrates the inherent ability of LLMs, expert knowledge and inter-feature interactions. It also employs an iterative feature refinement process that uses feature assessment-based feedback for feature re-selection. Additionally, DeepFeature utilizes a robust multi-layer filtering and verification approach for feature description-to-code translation to ensure that the feature extraction functions run without crashing. Experimental evaluation results show that DeepFeature achieves the highest average AUROC across eight tasks under both sample-level and subject-level settings, outperforming the best baselines by 4.60% and 4.61%, respectively. DeepFeature achieves the most pronounced gains on the PPG-BP tasks, while remaining competitive with the best-performing baselines on Epilepsy, WESAD, and our self-collected SEN dataset.

cs.AI↗
arXiv2026

Modality-Guided Mixture of Structured Experts with Entropy-Triggered Routing for Multimodal Recommendation

Multimodal recommenders combine collaborative behavior with visual and textual item evidence, whose usefulness varies across user-item interactions. Independently trained source-specific diagnostic probes partition held-out interactions into behavior-, appearance-, semantics-, and mixed-evidence regimes across five benchmarks, within which capacity-matched fixed fusion rules exhibit systematic regime-dependent performance crossovers. This diagnostic observation motivates MAGNET, a multimodal graph recommender with two core mechanisms. First, a calibrated expert bank organizes trainable experts by anchor source (behavior, appearance, or semantics) and fusion family (dominant, balanced, or complementary), while an interaction-conditioned router selects a sparse composition using all three evidence sources. Second, an entropy-triggered, coverage-aware progressive schedule decouples population-level routing-mass coverage from per-instance decisiveness, transitioning from broad routing exploration to confident specialization once sufficient coverage is sustained, while preserving coverage thereafter. MAGNET separately encodes the observed interaction graph and a filtered content-induced structural view, applying cross-view alignment after independent propagation. We evaluate MAGNET on four Amazon domains and the non-Amazon MicroLens-100K benchmark, including tail-item and low-history warm-start user evaluation alongside matched expert-design controls. Under the shared-feature, fixed-split protocol, MAGNET-DV exceeds the strongest protocol-compatible non-MAGNET baseline in every reported main-table cell, supported by seed-wise difference tests. Both the fixed and KL-anchored structured variants achieve higher five-seed mean NDCG@20 than matched homogeneous and free-mixture alternatives across all five datasets. MAGNET supports route-level diagnostics through explicit expert semantics.

cs.AI↗
arXiv2026

From Refusal Tokens to Refusal Control: Discovering and Steering Category-Specific Refusal Directions

Language models are commonly fine-tuned for safety alignment to refuse harmful prompts. One approach fine-tunes them to generate categorical refusal tokens that distinguish different refusal types before responding. In this work, we leverage a version of Llama 3 8B fine-tuned with these categorical refusal tokens to enable inference-time control over fine-grained refusal behavior, improving both safety and reliability. We show that refusal token fine-tuning induces separable, category-aligned directions in the residual stream, which we extract and use to construct categorical steering vectors with a lightweight probe that determines whether to steer toward or away from refusal during inference. In addition, we introduce a learned low-rank combination that mixes these category directions in a whitened, orthonormal steering basis, resulting in a single controllable intervention under activation-space anisotropy, and show that this intervention is transferable across same-architecture model variants without additional training. Across benchmarks, both categorical steering vectors and the low-rank combination consistently reduce over-refusals on benign prompts while increasing refusal rates on harmful prompts, highlighting their utility for multi-category refusal control.

cs.AI↗