اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدFinding Symmetry Breaking Order Parameters with Euclidean Neural Networks
449
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Curies 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 Curies 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.
قيم البحث
اقرأ أيضاً
We introduce an exactly integrable version of the well-known leaky integrate-and-fire (LIF) model, with continuous membrane potential at the spiking event, the c-LIF. We investigate the dynamical regimes of a fully connected network of excitatory c-L
IF neurons in the presence of short-term synaptic plasticity. By varying the coupling strength among neurons, we show that a complex chaotic dynamics arises, characterized by scale free avalanches. The origin of this phenomenon in the c-LIF can be related to the order symmetry breaking in neurons spike-times, which corresponds to the onset of a broad activity distribution. Our analysis uncovers a general mechanism through which networks of simple neurons can be attracted to a complex basin in the phase space.
Machine learning has demonstrated great power in materials design, discovery, and property prediction. However, despite the success of machine learning in predicting discrete properties, challenges remain for continuous property prediction. The chall
enge is aggravated in crystalline solids due to crystallographic symmetry considerations and data scarcity. Here we demonstrate the direct prediction of phonon density of states using only atomic species and positions as input. We apply Euclidean neural networks, which by construction are equivariant to 3D rotations, translations, and inversion and thereby capture full crystal symmetry, and achieve high-quality prediction using a small training set of $sim 10^{3}$ examples with over 64 atom types. Our predictive model reproduces key features of experimental data and even generalizes to materials with unseen elements,and is naturally suited to efficiently predict alloy systems without additional computational cost. We demonstrate the potential of our network by predicting a broad number of high phononic specific heat capacity materials. Our work indicates an efficient approach to explore materials phonon structure, and can further enable rapid screening for high-performance thermal storage materials and phonon-mediated superconductors.
Floquet symmetry protected topological (FSPT) phases are non-equilibrium topological phases enabled by time-periodic driving. FSPT phases of 1d chains of bosons, spins, or qubits host dynamically protected edge states that can store quantum informati
on without decoherence, making them promising for use as quantum memories. While FSPT order cannot be detected by any local measurement, here we construct non-local string order parameters that directly measure general 1d FSPT order. We propose a superconducting-qubit array based realization of the simplest Ising-FSPT, which can be implemented with existing quantum computing hardware. We devise an interferometric scheme to directly measure the non-local string order using only simple one- and two- qubit operations and single-qubit measurements.
In this paper we investigate the family of functions representable by deep neural networks (DNN) with rectified linear units (ReLU). We give an algorithm to train a ReLU DNN with one hidden layer to *global optimality* with runtime polynomial in the
data size albeit exponential in the input dimension. Further, we improve on the known lower bounds on size (from exponential to super exponential) for approximating a ReLU deep net function by a shallower ReLU net. Our gap theorems hold for smoothly parametrized families of hard functions, contrary to countable, discrete families known in the literature. An example consequence of our gap theorems is the following: for every natural number $k$ there exists a function representable by a ReLU DNN with $k^2$ hidden layers and total size $k^3$, such that any ReLU DNN with at most $k$ hidden layers will require at least $frac{1}{2}k^{k+1}-1$ total nodes. Finally, for the family of $mathbb{R}^nto mathbb{R}$ DNNs with ReLU activations, we show a new lowerbound on the number of affine pieces, which is larger than previous constructions in certain regimes of the network architecture and most distinctively our lowerbound is demonstrated by an explicit construction of a *smoothly parameterized* family of functions attaining this scaling. Our construction utilizes the theory of zonotopes from polyhedral theory.
We demonstrate how graph neural networks can be used to solve combinatorial optimization problems. Our approach is broadly applicable to canonical NP-hard problems in the form of quadratic unconstrained binary optimization problems, such as maximum c
ut, minimum vertex cover, maximum independent set, as well as Ising spin glasses and higher-order generalizations thereof in the form of polynomial unconstrained binary optimization problems. We apply a relaxation strategy to the problem Hamiltonian to generate a differentiable loss function with which we train the graph neural network and apply a simple projection to integer variables once the unsupervised training process has completed. We showcase our approach with numerical results for the canonical maximum cut and maximum independent set problems. We find that the graph neural network optimizer performs on par or outperforms existing solvers, with the ability to scale beyond the state of the art to problems with millions of variables.
الأسئلة المقترحة
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
