{
 "artifacts": null,
 "category": "architecture",
 "description": "Use the paper's families of local graph embeddings to identify repeated occurrences of the same causal substructure across time steps, environments, or entities. Feed every aligned occurrence through one shared transition mechanism and impose an explicit equivariance penalty under the symmetry group acting on occurrence indices, rather than learning an independent predictor for every context.",
 "formulas_latex": [
  "$$\\left(J_{0},\\{\\psi_{j}\\}_{j\\in J_{0}},\\mathcal{G},H,y_{0}\\right)$$",
  "$$\\psi_{*}(n):J_{0}\\rightarrow I,\\qquad j\\mapsto\\psi_{j}(n)$$",
  "$$\\forall j\\in J_{0}:\\ \\psi_{j}(y_{0})=j,\\qquad \\forall n\\in\\mathcal{N}:\\ \\psi_{*}(n)\\ \\text{is }H\\text{-equivariant},\\qquad \\forall n\\in\\mathcal{N}_{\\mathrm{inner}}:\\ \\psi_{*}(n)\\ \\text{is injective}$$",
  "$$\\mathcal{L}(\\theta)=\\frac{1}{|J_{0}|}\\sum_{j\\in J_{0}}\\ell\\!\\left(F_{\\theta}(z_{j}),y_{j}\\right)+\\lambda_{\\mathrm{eq}}\\,\\mathbb{E}_{h\\sim H}\\left\\|F_{\\theta}\\!\\left(\\rho_{\\mathrm{in}}(h)z_{j}\\right)-\\rho_{\\mathrm{out}}(h)F_{\\theta}(z_{j})\\right\\|_{2}^{2}$$"
 ],
 "id": 3145,
 "implementation": "Integrate this into a graph neural network or recurrent world model at the local transition block. First choose a template graph \\(\\mathcal{G}\\), such as an agent-centered neighborhood with anchor node equal to the central agent, and enumerate occurrences \\(j\\in J_{0}\\) across agents, time windows, or environments. For each occurrence, gather variables using \\(\\psi_{j}(n)\\), concatenate the parent states and action at those indices, and encode them as \\(z_{j}\\). Replace separate context-specific predictors with one shared module \\(F_{\\theta}\\) that predicts the next anchor state, reward, or local node outputs. Pseudocode: sample a minibatch of occurrences \\(j\\); compute \\(z_{j}=\\mathrm{Encode}(x_{\\psi_{j}(\\mathcal{N})},a_{j})\\); predict \\(\\hat y_{j}=F_{\\theta}(z_{j})\\); compute supervised loss \\(L_{\\mathrm{pred}}=|J_{B}|^{-1}\\sum_{j}\\ell(\\hat y_{j},y_{j})\\); sample a group element \\(h\\in H\\), transform inputs with \\(\\rho_{\\mathrm{in}}(h)\\), and add \\(L_{\\mathrm{eq}}=\\|F_{\\theta}(\\rho_{\\mathrm{in}}(h)z_{j})-\\rho_{\\mathrm{out}}(h)F_{\\theta}(z_{j})\\|^{2}\\); update \\(\\theta\\) using \\(L=L_{\\mathrm{pred}}+\\lambda_{\\mathrm{eq}}L_{\\mathrm{eq}}\\). The paper's exact structural checks are anchor consistency, injectivity of node occurrence mappings, and equivariance of \\(\\psi_{*}\\); estimate empirical violations by checking duplicate indices and transformed neighborhood correspondence in the dataset. Start with a two-dimensional grid-world or multi-agent particle environment, compare a standard per-agent MLP/GNN against the shared-equivariant model at equal parameter count and with one environment held out. Success is lower held-out transition error and faster adaptation to a permuted or rotated environment, without worsening in-distribution error; additionally measure whether the same accuracy is reached with fewer trajectories.",
 "math_summary": "Definition 4.2 introduces a family of embeddings \\((J_{0},\\{\\psi_{j}\\}_{j\\in J_{0}},\\mathcal{G},H,y_{0})\\), where \\(J_{0}\\) is the set of occurrences, \\(\\psi_{j}:\\mathcal{G}\\hookrightarrow I\\) maps a template local graph \\(\\mathcal{G}\\) into the global variable index set \\(I\\), \\(H\\subset G\\) is a symmetry group, and \\(y_{0}\\) is an anchor node. For each template node \\(n\\in\\mathcal{N}\\), the induced map is \\(\\psi_{*}(n):J_{0}\\to I\\), \\(j\\mapsto\\psi_{j}(n)\\). The required conditions are: trivial anchor \\(\\psi_{j}(y_{0})=j\\) for every \\(j\\in J_{0}\\); rigidity, meaning \\(\\psi_{*}(n)\\) is \\(H\\)-equivariant; and freeness, meaning \\(\\psi_{*}(n)\\) is injective for every inner node \\(n\\). The observable world uses structural mechanisms \\(\\mathcal{V}_{i}=f_{i}(\\mathcal{X}_{\\mathrm{Pa}_{I}(i)},\\eta_{i})\\), with independent noises \\(\\eta_{i}\\sim U([0,1])\\). We exploit the mathematical asset that all embedded copies of the same template can use one mechanism while the group action determines how their representations transform. Let \\(\\rho_{\\mathrm{in}}(h)\\) and \\(\\rho_{\\mathrm{out}}(h)\\) be representation matrices for \\(h\\in H\\); the neural analogue is the exact constraint \\(F_{\\theta}(\\rho_{\\mathrm{in}}(h)z)=\\rho_{\\mathrm{out}}(h)F_{\\theta}(z)\\), approximated by a sampled penalty.",
 "math_tags": [
  "graph-theory",
  "representation-theory",
  "probability"
 ],
 "ml_areas": [
  "world-model",
  "graph-nn",
  "rl",
  "regularization"
 ],
 "paper": {
  "arxiv_id": "2609.03697",
  "arxiv_url": "https://arxiv.org/abs/2609.03697",
  "summary_what_math_gives_to_ml": "The paper supplies a formal way to represent repeated, partially observed structures through families of graph embeddings whose mechanisms are shared and whose embeddings satisfy anchor, rigidity, and freeness constraints. This is directly transferable to neural networks as a principled alternative to treating non-IID temporal or multi-environment data as unrelated examples: aligned occurrences can share a causal transition module while equivariance controls how representations transform across environments. A second transferable asset is the warning that stochastic interventions cannot generally be handled by ordinary conditioning or do-calculus substitutions; the intervention distribution must remain part of the modeled joint law. The most promising experiments are an equivariant shared-mechanism world model and a joint intervention-conditioned predictor evaluated under distribution shift.",
  "title": "Symmetries and Causality: Causal Effect Identification Beyond IID Data",
  "year": "2026"
 },
 "ratings": {
  "difficulty": 5,
  "novelty": 5,
  "usefulness": 8
 },
 "solves": [
  "generalization",
  "sample-efficiency",
  "stability"
 ],
 "title": "Equivariant Shared-Mechanism World Model",
 "url": "https://synthcore.org/idea/3145/equivariant-shared-mechanism-world-model",
 "verification": {
  "peer_reviewed": false,
  "status": "unverified",
  "status_label": "Unverified",
  "verdict_source": "deterministic test code (paired-seed permutation statistics)",
  "verification_axes": {
   "benchmark_mechanism": {
    "confirmed": null,
    "tested": false
   },
   "practical_benchmark": {
    "beats_baseline": null,
    "tested": false
   },
   "toy_mechanism_gate": {
    "confirmed": null,
    "tested": false
   }
  }
 }
}