Pith. sign in

REVIEW 2 cited by

Stochastic Neural Network Symmetrisation in Markov Categories

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2406.11814 v5 pith:4JYNZT3H submitted 2024-06-17 stat.ML cs.LGmath.CT

classification stat.MLcs.LGmath.CT
keywords neuralcategoriesmarkovnetworkstochasticsymmetrisingconsiderequivariant
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We consider the problem of symmetrising a neural network along a group homomorphism: given a homomorphism $\varphi : H \to G$, we would like a procedure that converts $H$-equivariant neural networks to $G$-equivariant ones. We formulate this in terms of Markov categories, which allows us to consider neural networks whose outputs may be stochastic, but with measure-theoretic details abstracted away. We obtain a flexible and compositional framework for symmetrisation that relies on minimal assumptions about the structure of the group and the underlying neural network architecture. Our approach recovers existing canonicalisation and averaging techniques for symmetrising deterministic models, and extends to provide a novel methodology for symmetrising stochastic models also. Beyond this, our findings also demonstrate the utility of Markov categories for addressing complex problems in machine learning in a conceptually clear yet mathematically precise way.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Approaching the Continuous from the Discrete: an Infinite Tensor Product Construction

    math.CT 2025-10 unverdicted novelty 7.0 of 10

    A universal construction adjoins infinite tensor products to FinStoch to produce a category of locally constant Markov kernels on finite sets union the Cantor space, enabling algebraic reasoning about continuous proba...

  2. A Diagrammatic Approach to Improve Computational Efficiency in Group Equivariant Neural Networks

    cs.LG 2024-12 conditional novelty 5.0 of 10

    A diagrammatic, category-theoretic algorithm reduces the time complexity of applying equivariant weight matrices in tensor-power networks from O(n^(l+k)) to O(n^k) or better for four classical groups.

Pith tools