relative perturbations

[[concept]]
Relative Perturbations modulo permutations

E(S,S~)={D:PTSP=S+DS+SD,PP}

given S~, the error is E with the smallest norm ie

E~=argminDE(S,S~)||D||

ie ||E~||=d(S,S~)

where d() is the operator distance modulo permutations.

Note

  • dilation takes into account edge weights, but cannot model edge additions and deletions
  • additive perturbations can model edge additions and deletions, but do not take into account edge weights
  • relative perturbations take into account both edge weights and additions/deletions

Mentions

File
GNNs inherit stability from their layers
integral Lipschitz filters are stable to relative perturbations
perturbations on a graph shift operator
relative perturbation edge changes are tied to node degree
2025-03-05 graphs lecture 12
2025-03-10 graphs lecture 13