The complexity of explaining neural networks through (group) invariants

MaRDI QIDQ4645652zbMATH OpenFDO

Authors Danielle Ensign, Scott Neville, Arnab Paul, Suresh Venkatasubramanian

Publication date 10 January 2019

Full work available at URL http://proceedings.mlr.press/v76/ensign17a.html

zbMATH Keywords

neural networksNP-completenessgroup theory

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• The complexity of explaining neural networks through (group) invariants
• Probabilistic symmetries and invariant neural networks
• Representation theory and invariant neural networks
• A unifying framework for invariant pattern recognition
• Analysis of deep convolutional networks from group theory viewpoint

Cited in

(3)

• Challenges in Markov chain Monte Carlo for Bayesian neural networks
• The complexity of explaining neural networks through (group) invariants
• Probabilistic symmetries and invariant neural networks

This page was built for publication: The complexity of explaining neural networks through (group) invariants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645652)