The Glider Equation for Asymptotic Lenia
- URL: http://arxiv.org/abs/2508.04167v1
- Date: Wed, 06 Aug 2025 07:47:24 GMT
- Title: The Glider Equation for Asymptotic Lenia
- Authors: Hiroki Kojima, Ivan Yevenko, Takashi Ikegami,
- Abstract summary: Asymptotic Lenia is a continuous extension of Conway's Game of Life that exhibits rich pattern formations.<n>We analytically derive the conditions for glider patterns, which we term the Glider Equation''
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Lenia is a continuous extension of Conway's Game of Life that exhibits rich pattern formations including self-propelling structures called gliders. In this paper, we focus on Asymptotic Lenia, a variant formulated as partial differential equations. By utilizing this mathematical formulation, we analytically derive the conditions for glider patterns, which we term the ``Glider Equation.'' We demonstrate that by using this equation as a loss function, gradient descent methods can successfully discover stable glider configurations. This approach enables the optimization of update rules to find novel gliders with specific properties, such as faster-moving variants. We also derive a velocity-free equation that characterizes gliders of any speed, expanding the search space for novel patterns. While many optimized patterns result in transient gliders that eventually destabilize, our approach effectively identifies diverse pattern formations that would be difficult to discover through traditional methods. Finally, we establish connections between Asymptotic Lenia and neural field models, highlighting mathematical relationships that bridge these systems and suggesting new directions for analyzing pattern formation in continuous dynamical systems.
Related papers
- Online Non-Stationary Stochastic Quasar-Convex Optimization [1.9244735303181755]
Recent research has shown that quasar activation function can be found in applications such as identification of linear systems and logistic systems.
We develop algorithms that exploit quasar-inspired design problems in a dynamic environment.
arXiv Detail & Related papers (2024-07-04T03:24:27Z) - Stochastic Gradient Descent for Gaussian Processes Done Right [86.83678041846971]
We show that when emphdone right -- by which we mean using specific insights from optimisation and kernel communities -- gradient descent is highly effective.
We introduce a emphstochastic dual descent algorithm, explain its design in an intuitive manner and illustrate the design choices.
Our method places Gaussian process regression on par with state-of-the-art graph neural networks for molecular binding affinity prediction.
arXiv Detail & Related papers (2023-10-31T16:15:13Z) - On Learning Gaussian Multi-index Models with Gradient Flow [57.170617397894404]
We study gradient flow on the multi-index regression problem for high-dimensional Gaussian data.
We consider a two-timescale algorithm, whereby the low-dimensional link function is learnt with a non-parametric model infinitely faster than the subspace parametrizing the low-rank projection.
arXiv Detail & Related papers (2023-10-30T17:55:28Z) - Directed differential equation discovery using modified mutation and
cross-over operators [77.34726150561087]
We introduce the modifications that can be introduced into the evolutionary operators of the equation discovery algorithm.
The resulting approach, dubbed directed equation discovery, demonstrates a greater ability to converge towards accurate solutions.
arXiv Detail & Related papers (2023-08-09T14:50:02Z) - Dynamical chaos in nonlinear Schr\"odinger models with subquadratic
power nonlinearity [137.6408511310322]
We deal with a class of nonlinear Schr"odinger lattices with random potential and subquadratic power nonlinearity.
We show that the spreading process is subdiffusive and has complex microscopic organization.
The limit of quadratic power nonlinearity is also discussed and shown to result in a delocalization border.
arXiv Detail & Related papers (2023-01-20T16:45:36Z) - Stochastic Langevin Differential Inclusions with Applications to Machine Learning [5.274477003588407]
We show some foundational results regarding the flow and properties of Langevin-type Differential Inclusions.
In particular, we show strong existence of the solution, as well as an canonical- minimization of the free-energy functional.
arXiv Detail & Related papers (2022-06-23T08:29:17Z) - Whiplash Gradient Descent Dynamics [2.0508733018954843]
We introduce the symplectic convergence analysis for the Whiplash system for convex functions.
We study the algorithm's performance for various costs and provide a practical methodology for analyzing convergence rates.
arXiv Detail & Related papers (2022-03-04T05:47:26Z) - A Discrete Variational Derivation of Accelerated Methods in Optimization [68.8204255655161]
We introduce variational which allow us to derive different methods for optimization.
We derive two families of optimization methods in one-to-one correspondence.
The preservation of symplecticity of autonomous systems occurs here solely on the fibers.
arXiv Detail & Related papers (2021-06-04T20:21:53Z) - DiffPD: Differentiable Projective Dynamics with Contact [65.88720481593118]
We present DiffPD, an efficient differentiable soft-body simulator with implicit time integration.
We evaluate the performance of DiffPD and observe a speedup of 4-19 times compared to the standard Newton's method in various applications.
arXiv Detail & Related papers (2021-01-15T00:13:33Z)
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.