Basins of Attraction to Multiple Fixed Points in Discrete-time Hysteresis Neural Networks

Yuta Arai; Seigo Nakamura; Ryoga Nakamura; Muzuki Ohira; Toshimichi Saito

Home/Archive/arXiv

arXiv · 2608.23225

Basins of Attraction to Multiple Fixed Points in Discrete-time Hysteresis Neural Networks

Yuta Arai·Seigo Nakamura·Ryoga Nakamura·Muzuki Ohira·Toshimichi Saito

View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper studies multiple fixed points in a discrete-time hysteresis neural network. The network consists of binary hysteresis neurons characterized by the threshold parameter. Depending on the parameter, the network can have a variety of multiple binary fixed points. Stability of each fixed point is characterized by basin of attraction (BOA): the set of initial points falling into the fixed point. In order to evaluate the distribution of BOA sizes, we present entropy. In order to escape from the curse of dimensionality, we introduce a simple problem: classification of binary data set. In the classification, BOAs correspond to classes. In the problem, we clarify that the threshold parameter can control the entropy, especially, can maximize the entropy: the distribution approaches to uniform. As a concrete example, we consider an item response data set in education. Using two fundamental metrics in the item response theory, the classification results are evaluated.

Explore related subjects

cs.NE

Keep this discovery

BibTeX RIS

Yuta Arai, Seigo Nakamura, Ryoga Nakamura, Muzuki Ohira, Toshimichi Saito. 2026-08-31. Basins of Attraction to Multiple Fixed Points in Discrete-time Hysteresis Neural Networks. https://arxiv.org/abs/2608.23225

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

Discover connections

cs.NE subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

arXiv2026

NE-R1: Enhancing Named Entity Recognition Model via Reinforcement Learning

Named Entity Recognition (NER) has achieved substantial progress since the advent of large language models (LLMs). Nevertheless, the recognition of long-tail and domain-specific entities remains challenging due to the deficiency in parametric knowledge. Retrieval-augmented generation (RAG) offers a promising remedy by injecting external knowledge, but it also introduces noise and unnecessary cost when dealing with familiar cases. In this paper, we propose NE-R1, a novel framework for adaptive retrieval-augmented NER. We design a "retrieval-on-demand" mechanism for NER. Then we integrate it into models by a two-stage training method: (1) multi-task instruction tuning initialization; (2) end-to-end RL optimization with CoT. To achieve reasonable selection between parameterized and external knowledge, we design a multi-dimensional reward considering both accuracy and retrieval benefit. NE-R1 achieves state-of-the-art performance on various benchmarks, with an average F1 score gain of 2.52% in in-domain evaluation and 1.18% in zero-shot cross-domain evaluation.

cs.CL↗

arXiv2026

Quality-diversity in dissimilarity spaces

The theory of magnitude provides a mathematical framework for quantifying and maximizing diversity. We apply this framework to formulate quality-diversity algorithms in generic dissimilarity spaces. In particular, we instantiate and demonstrate a very general version of Go-Explore with promising performance.

cs.AI↗

arXiv2026

TPR-Attention for Combinatorial Generalization

Systematic generalization remains a significant challenge in deep learning. In particular, combinatorial generalization - generalizing to new configurations of known factors of variation - is effortless for humans but difficult for standard neural architectures that rely on statistical correlations rather than explicit structural representations. We introduce a new architectural component that embeds structured inductive bias into deep learning: an attention mechanism operating over tensor-product representations (TPRs). Through controlled experiments on compositional tasks, we show that this TPR-attention mechanism outperforms existing architectural components in combinatorial generalization. These results highlight the value of integrating explicit compositional structure into neural attention and point toward a promising path for models capable of systematic generalization.

cs.LG↗