paper-with-me

Papers

Finding Symmetry Breaking Order Parameters with Euclidean Neural Networks

2020-07-04 · Tess E. Smidt, Mario Geiger, Benjamin Kurt Miller

Curie's principle states that "when effects show certain asymmetry, this asymmetry must be found in the causes that gave rise to them". We demonstrate that symmetry equivariant neural networks uphold Curie's principle and can be used to articulate many symmetry-relevant scientific questions into simple optimization problems. We prove these properties mathematically and demonstrate them numerically by training a Euclidean symmetry equivariant neural network to learn symmetry-breaking input to deform a square into a rectangle and to generate octahedra tilting patterns in perovskites.

📄 PDF Abstract BibTeX arXiv:2007.02005

Code (1)

blondegeek/e3nn_symm_breaking 공식 구현 pytorch

Methods 이 논문이 사용한 방법론

Uphold 설명 없음

Similar Papers 제목 키워드 기반

Relaxed Equivariant Graph Neural Networks

2024-07-30 · Elyssa Hofgard, Rui Wang, Robin Walters, Tess Smidt

3D Euclidean symmetry equivariant neural networks have demonstrated notable success in modeling complex physical systems. We introduce a framework for relaxed $E(3)$ graph equivariant neural networks that can learn and r…

On the Complexity of Breaking Symmetry

2020-05-16 · Toby Walsh

We can break symmetry by eliminating solutions within a symmetry class that are not least in the lexicographical ordering. This is often referred to as the lex-leader method. Unfortunately, as symmetry groups can be larg…

A Group-Equivariant Autoencoder for Identifying Spontaneously Broken Symmetries

2022-02-13 · Devanshu Agrawal, Adrian Del Maestro, Steven Johnston, James Ostrowski

We introduce the group-equivariant autoencoder (GE-autoencoder) -- a deep neural network (DNN) method that locates phase boundaries by determining which symmetries of the Hamiltonian have spontaneously broken at each tem…

Symmetry-free SDP Relaxations for Affine Subspace Clustering

2016-07-25 · Francesco Silvestri, Gerhard Reinelt, Christoph Schnörr

We consider clustering problems where the goal is to determine an optimal partition of a given point set in Euclidean space in terms of a collection of affine subspaces. While there is vast literature on heuristics for t…

Clustering

Analyzing symmetry and symmetry breaking by computational aesthetic measures

2019-10-15 · Hendrik Richter

We study creating and analyzing symmetry and broken symmetry in digital art. Our focus is not so much on computer-generating artistic images, but rather on analyzing concepts and templates for incorporating symmetry and …

Sand