SearcharxivSearch

arXiv · 2209.04087

A Variational Approach to Parameter Estimation for Characterizing 2-D Cluster Variation Method Topographies

Abstract

One of the biggest challenges in characterizing 2-D topographies is succinctly communicating the dominant nature of local configurations. In a 2-D grid composed of bistate units, this could be expressed as finding the characteristic configuration variables such as nearest-neighbor pairs and triplet combinations. The 2-D cluster variation method (CVM) provides a theoretical framework for associating a set of configuration variables with only two parameters, for a system that is at free energy equilibrium. This work presents a method for determining which of many possible two-parameter sets provides the ``most suitable'' match for a given 2-D topography, drawing from methods used for variational inference. This particular work focuses exclusively on topographies for which the activation enthalpy parameter (epsilon_0) is zero, so that the distribution between two states is equiprobable. This condition is used since, when the two states are equiprobable, there is an analytic solution giving the configuration variable values as functions of the h-value, where we define h in terms of the interaction enthalpy parameter (epsilon_1) as h = exp(2*epsilon_1). This allows the computationally-achieved configuration variable values to be compared with the analytically-predicted values for a given h-value. The method is illustrated using four patterns derived from three different naturally-occurring black-and-white topographies, where each pattern meets the equiprobability criterion. We achieve expected results, that is, as the patterns progress from having relatively low numbers of like-near-like nodes to increasing like-near-like masses, the h-values for each corresponding free energy-minimized model also increase. Further, the corresponding configuration variable values for the (free energy-minimized) model patterns are in approximate alignment with the analytically-predicted values.

Explore related subjects

Keep this discovery

BibTeXRIS

Alianna J. Maren. 2022-09-09. A Variational Approach to Parameter Estimation for Characterizing 2-D Cluster Variation Method Topographies. https://arxiv.org/abs/2209.04087

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Breaking the Central Bias: Spatially Partitioned Experts for Coordinate-Based Neuroevolution

Evolvable-Substrate HyperNEAT (ES-HyperNEAT), a bio-inspired indirect encoding that determines neuron placement and connection weights from spatial coordinates, exhibits a failure mode on MNIST as a diagnostic benchmark. Because input pixels map to a coordinate space centered at the origin, evolved networks converge on a small central cluster of input pixels, a spatial-concentration bias; prior work observed only 21% mean accuracy in this regime. Is this bias an optimization artifact or an architectural ceiling? Inspired by Mixture-of-Experts (MoE) principles, we partition the input into non-overlapping spatial segments, each assigned to a separately evolved specialist network. With 13 such experts, this design reaches 43% mean accuracy, a 106% relative improvement over the baseline. The architectural gain does not depend on data-driven aggregation: equal-weighted averaging, which uses no validation data, already yields a 70% improvement; the gain comes from partitioning, not the weighting. Receptive-field analysis shows the mechanism: partitioning forces evolution to discover features across the entire image, expanding active pixel coverage from 4% to 79%. Absolute accuracy stays below gradient-trained baselines, but the relative gain points to central bias, not the evolutionary search. Two tools are designed to generalize beyond MNIST: a receptive-field diagnostic for silent input-coverage collapse, and a spatial-partitioning remedy that restores coverage.

cs.NE

A Bio-Plausible Visual Neural Network for Locust-Inspired Collision Perception

Locust visual systems have long served as an important biological paradigm for studying looming perception and collision avoidance. Numerous computational models have successfully reproduced the selective responses of Lobula Giant Movement Detector (LGMD) neurons to approaching objects, thereby emulating the fundamental functionality of the biological system. However, existing models remain limited in biological plausibility and robustness when operating in complex and dynamic visual environments. To address these limitations, we propose a biologically plausible neural network for locust-inspired looming detection. The proposed framework incorporates a spatially isotropic sampling strategy that mimics the ommatidial organization of the locust compound eye, a population-voting mechanism inspired by population coding in biological neural systems, and leaky integrate-and-fire neuronal dynamics to replace conventional sigmoid-based membrane activation. Systematic experiments on synthetic stimuli, laboratory sequences, and real-world driving scenarios demonstrate that the proposed model improves robustness under challenging visual conditions while preserving computational efficiency and enhancing biological fidelity. These results highlight the potential of biologically grounded neural computation for robust and efficient collision perception.

cs.NE

Structural Fusion of Bayesian Networks with Limited Treewidth Using Genetic Algorithms

This paper introduces an evolutionary computation approach for consensus in structural Bayesian Network (BN) fusion under the constraint of limited treewidth. The consensus BN aims to reconcile multiple input BNs into a single one that retains key structural features present in the original networks. Treewidth, a graph-based parameter associated with computationally tractable inference, is utilized to restrict the complexity of the resulting network. A genetic algorithm is proposed to look for a BN that codifies as much information about the unrestricted fusion as possible while ensuring the treewidth restriction. Experimental evaluation demonstrates the genetic algorithm's ability to obtain consensus BNs with limited treewidth, providing a valuable tool for aggregating information from diverse sources while returning a computationally actionable model.

cs.NE