Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming

arXiv:2506.01826 · cs.LG, eess.SP · Submitted 2025-06-02 · Read on arXiv

cs.LG, eess.SP

Submitted: 2025-06-02

Updated: 2026-09-01

Terminology

• Sparsity — 7× in this paper · explained in 4 episodes
• Adjacency Matrix — 4× in this paper · explained in 1 episode
• Anti-correlation — 4× in this paper · explained in 3 episodes
• Consistency — 4× in this paper · explained in 3 episodes
• Alignment — 3× in this paper · explained in 1 episode
• Accuracy — 2× in this paper · explained in 1 episode
• Adaptation — 2× in this paper · explained in 1 episode
• Cartwright-Harary Theorem — 2× in this paper
• Clustering — 2× in this paper · explained in 2 episodes
• Core — 2× in this paper · explained in 2 episodes
• Diffusion Model — 2× in this paper · explained in 8 episodes
• GNNs — 2× in this paper · explained in 2 episodes
• Regularization — 2× in this paper · explained in 3 episodes
• Diffusion Models — 1× in this paper · explained in 6 episodes
• Multi-Agent System — 1× in this paper · explained in 6 episodes
• SIAM International Conference on Data Mining — 1× in this paper
• Structural Constraints — 1× in this paper · explained in 2 episodes
• Transformer — 1× in this paper · explained in 2 episodes

Related papers

• Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
• AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
• Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
• Convergence issues in Relational Concept Analysis based on AOC-posets
• Beliefs Beyond Posteriors: Local-Consistency Optimisation for Bayesian Neural Networks
• Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks