Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

The complexity of explaining neural networks through (group) invariants

From MaRDI portal
Publication:4645652
Jump to:navigation, search

zbMATH Open1403.68186MaRDI QIDQ4645652FDOQ4645652

Danielle Ensign, Arnab Paul, Scott Neville, Suresh Venkatasubramanian

Publication date: 10 January 2019


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




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


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)



Cited In (1)

  • Challenges in Markov chain Monte Carlo for Bayesian 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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4645652&oldid=18836384"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 February 2024, at 16:03. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki