pith. sign in

arxiv: 1901.02354 · v2 · pith:H3YZF5YVnew · submitted 2019-01-06 · 💻 cs.LG · cs.AI· stat.ML

Geometrization of deep networks for the interpretability of deep learning systems

classification 💻 cs.LG cs.AIstat.ML
keywords deepgeometrizationlearningnetworkssystemsgeometryinterpretabilityproblem
0
0 comments X
read the original abstract

How to understand deep learning systems remains an open problem. In this paper we propose that the answer may lie in the geometrization of deep networks. Geometrization is a bridge to connect physics, geometry, deep network and quantum computation and this may result in a new scheme to reveal the rule of the physical world. By comparing the geometry of image matching and deep networks, we show that geometrization of deep networks can be used to understand existing deep learning systems and it may also help to solve the interpretability problem of deep learning systems.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

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

  1. Deep network as memory space: complexity, generalization, disentangled representation and interpretability

    cs.LG 2019-07 unverdicted novelty 5.0

    Deep networks are framed as memory spaces whose complexity is defined by a Fisher metric, with the least action principle linking this complexity to generalization and disentanglement for better interpretability.

  2. Gauge theory and twins paradox of disentangled representations

    cs.LG 2019-06 unverdicted novelty 3.0

    Authors propose a fibre bundle gauge theory model for disentangled representations and connect it to the relativity twins paradox.