Geometric deep learning the erlangen programme to ml
Quote
- symmetry as wide or as narrow as you may define
- one idea by
Origins
- Euclid
- Ecuclides elements
- 300 bc
End of Euclid’s monopoly
Nineteeth centruy zoo
Erlangen Programme
- Euclidean
- Affine
- Projective
Revolution in Physics
- E. Noether
- H. Weyl
- C. N Yang
- R L Mills
Phyiscs is all about symmetry
20 CENTURY ZOO OF NEURAL NETWORK ARCHITECTURES
- GNN
- CNN
- DeepSets
- Transformers
- RNN
eRLANGEN pROGRAMME OF Machine Learning
- constructive knowledge
- Geometric Deep Learning
- Perceptions
- First wave of the preceptions
- Group Theory
sUPERVISED ml = fUNCTION aPPROXIMATION
The curse of dimensionality
The curse of dimensionality
- increasing the dimensions
- the decision boundaries are becoming increasing complex
Computer vision
-
imput image -
input vector -
Data argumentations
Computer vision
Beyond Grids
- graph
- chemical bond within them
- energy U
- Graphics types
- Molecular
- social networks
- messes
- functional networks
- Interaction networks
The curse of dimensionality
- Symmetry Prior
- domain
- Invariant functions: image classification
KaTeX parse error: Can't use function '\)' in math mode at position 4: f(\?)?
Scale separation Prior
f
≈
f \approx
f≈
scale separation in Physics
Geometric Deep Learning Blueprint
G
?
e
q
u
i
v
a
l
e
n
t
G-equivalent
G?equivalent
$$
$$
Learning
- Perceptrons
- CNN
- Group CNN
- LSTM
- DeepSets/ Transformers
- GNNS
Graphs= systems of relations and interections
Social network
Key structural propertities of Graphs
- adjacency atrix
- feature matrix
- Arbitrary ordering of nodes
Invariant Graph Functions
A general blueprint for constructing graph function
f
(
x
i
)
=
?
(
x
i
,
□
)
f(x_i)=\phi (x_i , □ )
f(xi?)=?(xi?,□)
Weisfeiler- Lehan Test
- graphic descriptors
- necessary but insufficient conditions
- non isomorphic graphs are WL equivalent
Special Cases of GNNs
Transformers
?
(
x
i
,
□
j
=
1
n
a
(
)
)
\phi (x_i, □_{j=1}^n a())
?(xi?,□j=1n?a())
Graph substructure network
-
?
(
x
i
,
□
j
∈
)
\phi (x_i , □_{j \in })
?(xi?,□j∈?)
Graph substructure network
- olecule property prediction on ZINC using GSN with k cycles
Grids
Conclusion
- the knowledge of certain principles easily compensates the lack of knowledge of certain facts
Overlooked
- standard hardware is not friendly for the graphs
- assume the stream of the data
- same operations to multiple data frames
- hardware archetecture
- how the graphics can be updated
- graphword
- Graph work loads
- important to undersatnd
- stike to the input graph
- next reinvent
- District
- models
- to difficution equations
- differentiations
- graph neural networks
- how to discritelize the
- make it user friendly
- super computing
- the computing without causing too much memory
- knowledge knowledge how
|