Skip to main content
QUICK REVIEW

[论文解读] Feedback Control for Multi-Objective Graph Self-Supervision

Karish Grover, Theodore Vasiloudis|arXiv (Cornell University)|Feb 4, 2026
Advanced Graph Neural Networks被引用 0
一句话总结

ControlG 将多目标图 SSL 重构为闭环时间分配,利用感知、Pareto 感知规划和 deficit 基于 PID 控制来调度单目标块并提高迁移性能。

ABSTRACT

Can multi-task self-supervised learning on graphs be coordinated without the usual tug-of-war between objectives? Graph self-supervised learning (SSL) offers a growing toolbox of pretext objectives: mutual information, reconstruction, contrastive learning; yet combining them reliably remains a challenge due to objective interference and training instability. Most multi-pretext pipelines use per-update mixing, forcing every parameter update to be a compromise, leading to three failure modes: Disagreement (conflict-induced negative transfer), Drift (nonstationary objective utility), and Drought (hidden starvation of underserved objectives). We argue that coordination is fundamentally a temporal allocation problem: deciding when each objective receives optimization budget, not merely how to weigh them. We introduce ControlG, a control-theoretic framework that recasts multi-objective graph SSL as feedback-controlled temporal allocation by estimating per-objective difficulty and pairwise antagonism, planning target budgets via a Pareto-aware log-hypervolume planner, and scheduling with a Proportional-Integral-Derivative (PID) controller. Across 9 datasets, ControlG consistently outperforms state-of-the-art baselines, while producing an auditable schedule that reveals which objectives drove learning.

研究动机与目标

  • 由于每次更新混合导致的不稳定性和干扰在多目标图 SSL 中的存在及其原因
  • 提出一种时间分配方法,对单一目标进行调度而非逐更新混合
  • 开发一个感知-规划-控制环,包括状态估计、Pareto 感知规划和 PID 执行
  • 提供可审计的调度,揭示哪些目标在何时驱动学习

提出的方法

  • 将多任务图 SSL 解释为一个包含感知、规划、控制三环的闭环调度问题
  • Sense:通过表示梯度变化来估计每个目标的谱需求,并通过基于 MGDA 的梯度几何来估计干扰
  • Plan:使用对数超体积敏感性并结合综合难度状态的 tempered 值,计算 Pareto 感知分配
  • Control:实现一个 deficit 跟踪的 PID 控制器,以实现离散的单任务块和可审计的调度
  • 调度决策映射到基于 softmax 的随机选择器,以进行块级任务更新
Figure 3 : Time per step on Cora. Bar plot comparing wall-clock time (ms) per optimizer step across all methods. ControlG (highlighted in teal) incurs modest overhead compared to simple scheduling baselines (p_par, Random, Round-Robin) but is significantly faster than heavyweight methods like AutoSS
Figure 3 : Time per step on Cora. Bar plot comparing wall-clock time (ms) per optimizer step across all methods. ControlG (highlighted in teal) incurs modest overhead compared to simple scheduling baselines (p_par, Random, Round-Robin) but is significantly faster than heavyweight methods like AutoSS

实验结果

研究问题

  • RQ1是否可以通过时序分配在不牺牲性能的前提下避免在图 SSL 中按更新混合目标?
  • RQ2如何量化谱需求和梯度干扰以驱动自适应调度?
  • RQ3将 Pareto 感知的对数超体积规划器与 PID 控制结合,是否在多样化图基准上带来鲁棒改进?
  • RQ4生成的训练调度是否可审计且可解释,哪些目标驱动学习?

主要发现

MethodCoraCiteSeerChameleonSquirrelActorPubMedWiki-CSCo-CSArxivAvg Rank
BGRL77.14 ± 2.235.28 ± 2.164.87 ± 1.346.11 ± 1.231.22 ± 0.579.94 ± 1.280.36 ± 0.393.05 ± 0.471.24 ± 0.89.2
DGI75.64 ± 1.663.84 ± 1.666.27 ± 0.948.17 ± 1.030.46 ± 0.781.28 ± 1.177.95 ± 0.993.17 ± 0.470.86 ± 0.69.6
GRACE68.88 ± 2.158.96 ± 2.366.23 ± 0.454.06 ± 1.228.80 ± 0.580.54 ± 0.879.78 ± 0.393.62 ± 0.29.1
MVGRL79.32 ± 0.959.68 ± 3.955.00 ± 1.131.17 ± 0.778.60 ± 0.990.51 ± 4.512.4
p_link76.72 ± 1.052.76 ± 1.957.41 ± 3.636.56 ± 1.329.00 ± 0.681.28 ± 0.579.22 ± 0.391.92 ± 0.270.42 ± 0.513.1
p_recon78.76 ± 0.564.86 ± 1.569.39 ± 1.352.33 ± 0.827.75 ± 0.476.28 ± 0.979.88 ± 0.494.85 ± 0.371.08 ± 0.46.8
p_minsg76.44 ± 1.161.74 ± 0.864.78 ± 1.647.61 ± 0.929.16 ± 0.780.76 ± 1.079.95 ± 0.293.44 ± 0.370.94 ± 0.610.2
p_decor43.86 ± 9.034.22 ± 5.752.59 ± 0.840.88 ± 1.125.92 ± 0.975.66 ± 1.372.60 ± 4.793.39 ± 0.368.52 ± 1.215.6
p_par67.22 ± 1.352.74 ± 1.757.06 ± 3.440.96 ± 0.628.26 ± 1.374.20 ± 0.873.56 ± 0.292.31 ± 0.269.86 ± 0.714.7
AutoSSL80.30 ± 1.564.72 ± 1.070.09 ± 2.049.99 ± 3.029.76 ± 0.780.80 ± 0.779.82 ± 0.393.61 ± 0.26.4
WAS74.12 ± 3.357.66 ± 3.557.59 ± 6.343.52 ± 2.229.68 ± 0.578.62 ± 2.177.40 ± 1.692.62 ± 1.370.68 ± 0.912.9
Uniform77.14 ± 0.958.68 ± 1.266.23 ± 1.449.93 ± 1.029.26 ± 0.582.38 ± 0.580.48 ± 0.293.97 ± 0.271.32 ± 0.47.3
ParetoGNN78.26 ± 0.958.32 ± 1.165.35 ± 2.245.00 ± 1.928.95 ± 1.067.72 ± 3.379.94 ± 0.193.96 ± 0.270.56 ± 0.810.8
PCGrad79.44 ± 0.859.66 ± 1.466.84 ± 1.449.11 ± 1.329.63 ± 0.583.12 ± 0.580.40 ± 0.294.07 ± 0.271.48 ± 0.35.8
CAGrad80.40 ± 0.462.66 ± 0.366.75 ± 0.650.34 ± 1.429.67 ± 0.582.84 ± 0.979.94 ± 0.394.31 ± 0.171.62 ± 0.45.2
Random79.06 ± 0.358.10 ± 1.363.07 ± 1.846.22 ± 0.729.57 ± 1.080.56 ± 0.880.10 ± 0.293.39 ± 0.271.18 ± 0.59.4
Round-Robin78.52 ± 2.059.90 ± 1.164.61 ± 1.148.17 ± 1.130.07 ± 0.580.78 ± 0.580.22 ± 0.194.11 ± 0.271.28 ± 0.47.4
ControlG81.92 ± 0.966.48 ± 1.169.54 ± 1.053.18 ± 0.931.20 ± 0.684.24 ± 0.780.45 ± 0.396.14 ± 0.272.86 ± 0.31.4
  • ControlG 在九个数据集上的节点分类、链接预测和节点聚类任务上具有最佳平均排名。
  • ControlG 在同向同质图(如 Cora、PubMed)上显示出强劲增益,在异质图上仍具有竞争力,优于基于加权的基线。
  • ControlG 在各数据集的节点分类平均排名为 1.4,链接预测为 1.9,节点聚类为 1.8。
  • 在 ogbn-arxiv 上,ControlG 达到 72.86% 的准确率,比 CAGrad 提升 1.2%。
  • 消融实验显示谱需求和规划器组件发挥了贡献作用;移除它们会降低性能。
  • ControlG 产生可审计的调度,揭示了哪些目标被优先考虑以及何时被考虑。
Figure 4 : Task scheduling timeline. Top: Scatter plot showing which pretext task was selected at each training block (raster view). Bottom: Stacked area chart showing the running proportion of recent blocks allocated to each task. The visualization reveals how ControlG dynamically shifts focus betw
Figure 4 : Task scheduling timeline. Top: Scatter plot showing which pretext task was selected at each training block (raster view). Bottom: Stacked area chart showing the running proportion of recent blocks allocated to each task. The visualization reveals how ControlG dynamically shifts focus betw

更好的研究,从现在开始

从论文设计到论文写作,大幅缩短您的研究时间。

无需绑定信用卡

本解读由 AI 生成,并经人工编辑审核。