Numerics and analysis of Cahn–Hilliard critical points

04/08/2021
by   Tobias Grafke, et al.
0

We explore recent progress and open questions concerning local minima and saddle points of the Cahn–Hilliard energy in d≥ 2 and the critical parameter regime of large system size and mean value close to -1. We employ the String Method of E, Ren, and Vanden-Eijnden – a numerical algorithm for computing transition pathways in complex systems – in d=2 to gain additional insight into the properties of the minima and saddle point. Motivated by the numerical observations, we adapt a method of Caffarelli and Spruck to study convexity of level sets in d≥ 2.

READ FULL TEXT

page 10

page 11

research
06/12/2020

Complex Dynamics in Simple Neural Networks: Understanding Gradient Flow in Phase Retrieval

Despite the widespread use of gradient-based algorithms for optimizing h...
research
04/06/2018

The Loss Surface of XOR Artificial Neural Networks

Training an artificial neural network involves an optimization process o...
research
08/14/2020

Complexity aspects of local minima and related notions

We consider the notions of (i) critical points, (ii) second-order points...
research
03/23/2020

Symmetry critical points for a model shallow neural network

A detailed analysis is given of a family of critical points determining ...
research
07/18/2019

Who is Afraid of Big Bad Minima? Analysis of Gradient-Flow in a Spiked Matrix-Tensor Model

Gradient-based algorithms are effective for many machine learning tasks,...
research
01/31/2023

Archetypal Analysis++: Rethinking the Initialization Strategy

Archetypal analysis is a matrix factorization method with convexity cons...
research
01/29/2019

Numerically Recovering the Critical Points of a Deep Linear Autoencoder

Numerically locating the critical points of non-convex surfaces is a lon...

Please sign up or login with your details

Forgot password? Click here to reset