Geometric Clifford Algebra Networks
- URL: http://arxiv.org/abs/2302.06594v2
- Date: Mon, 29 May 2023 16:51:59 GMT
- Title: Geometric Clifford Algebra Networks
- Authors: David Ruhe, Jayesh K. Gupta, Steven de Keninck, Max Welling, Johannes
Brandstetter
- Abstract summary: We propose Geometric Clifford Algebra Networks (GCANs) for modeling dynamical systems.
GCANs are based on symmetry group transformations using geometric (Clifford) algebras.
- Score: 53.456211342585824
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We propose Geometric Clifford Algebra Networks (GCANs) for modeling dynamical
systems. GCANs are based on symmetry group transformations using geometric
(Clifford) algebras. We first review the quintessence of modern (plane-based)
geometric algebra, which builds on isometries encoded as elements of the
$\mathrm{Pin}(p,q,r)$ group. We then propose the concept of group action
layers, which linearly combine object transformations using pre-specified group
actions. Together with a new activation and normalization scheme, these layers
serve as adjustable $\textit{geometric templates}$ that can be refined via
gradient descent. Theoretical advantages are strongly reflected in the modeling
of three-dimensional rigid body transformations as well as large-scale fluid
dynamics simulations, showing significantly improved performance over
traditional methods.
Related papers
- Symmetry Preservation in Hamiltonian Systems: Simulation and Learning [0.9208007322096532]
This work presents a general geometric framework for simulating and learning the dynamics of Hamiltonian systems.
We propose to simulate and learn the mappings of interest through the construction of $G$-invariant Lagrangian submanifolds.
Our designs leverage pivotal techniques and concepts in symplectic geometry and geometric mechanics.
arXiv Detail & Related papers (2023-08-30T21:34:33Z) - Deep Learning Symmetries and Their Lie Groups, Algebras, and Subalgebras
from First Principles [55.41644538483948]
We design a deep-learning algorithm for the discovery and identification of the continuous group of symmetries present in a labeled dataset.
We use fully connected neural networks to model the transformations symmetry and the corresponding generators.
Our study also opens the door for using a machine learning approach in the mathematical study of Lie groups and their properties.
arXiv Detail & Related papers (2023-01-13T16:25:25Z) - A Practical Method for Constructing Equivariant Multilayer Perceptrons
for Arbitrary Matrix Groups [115.58550697886987]
We provide a completely general algorithm for solving for the equivariant layers of matrix groups.
In addition to recovering solutions from other works as special cases, we construct multilayer perceptrons equivariant to multiple groups that have never been tackled before.
Our approach outperforms non-equivariant baselines, with applications to particle physics and dynamical systems.
arXiv Detail & Related papers (2021-04-19T17:21:54Z) - ResNet-LDDMM: Advancing the LDDMM Framework Using Deep Residual Networks [86.37110868126548]
In this work, we make use of deep residual neural networks to solve the non-stationary ODE (flow equation) based on a Euler's discretization scheme.
We illustrate these ideas on diverse registration problems of 3D shapes under complex topology-preserving transformations.
arXiv Detail & Related papers (2021-02-16T04:07:13Z) - DSG-Net: Learning Disentangled Structure and Geometry for 3D Shape
Generation [98.96086261213578]
We introduce DSG-Net, a deep neural network that learns a disentangled structured and geometric mesh representation for 3D shapes.
This supports a range of novel shape generation applications with disentangled control, such as of structure (geometry) while keeping geometry (structure) unchanged.
Our method not only supports controllable generation applications but also produces high-quality synthesized shapes, outperforming state-of-the-art methods.
arXiv Detail & Related papers (2020-08-12T17:06:51Z) - Embed Me If You Can: A Geometric Perceptron [14.274582421372308]
We introduce an extension of the multilayer hypersphere perceptron (MLHP)
Our model is superior to the vanilla multilayer perceptron when classifying 3D Tetris shapes.
arXiv Detail & Related papers (2020-06-11T15:25:50Z) - Stochastic Flows and Geometric Optimization on the Orthogonal Group [52.50121190744979]
We present a new class of geometrically-driven optimization algorithms on the orthogonal group $O(d)$.
We show that our methods can be applied in various fields of machine learning including deep, convolutional and recurrent neural networks, reinforcement learning, flows and metric learning.
arXiv Detail & Related papers (2020-03-30T15:37:50Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.