paper-with-me

홈 › Papers

Generating functionals for computational intelligence: the Fisher information as an objective function for self-limiting Hebbian learning rules

2014-10-02 · Rodrigo Echeveste, Claudius Gros

Generating functionals may guide the evolution of a dynamical system and constitute a possible route for handling the complexity of neural networks as relevant for computational intelligence. We propose and explore a new objective function, which allows to obtain plasticity rules for the afferent synaptic weights. The adaption rules are Hebbian, self-limiting, and result from the minimization of the Fisher information with respect to the synaptic flux. We perform a series of simulations examining the behavior of the new learning rules in various circumstances. The vector of synaptic weights aligns with the principal direction of input activities, whenever one is present. A linear discrimination is performed when there are two or more principal directions; directions having bimodal firing-rate distributions, being characterized by a negative excess kurtosis, are preferred. We find robust performance and full homeostatic adaption of the synaptic weights results as a by-product of the synaptic flux minimization. This self-limiting behavior allows for stable online learning for arbitrary durations. The neuron acquires new information when the statistics of input activities is changed at a certain point of the simulation, showing however, a distinct resilience to unlearn previously acquired knowledge. Learning is fast when starting with randomly drawn synaptic weights and substantially slower when the synaptic weights are already fully adapted.

📄 PDF Abstract BibTeX arXiv:1410.0507

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Natural Gradient for Combined Loss Using Wavelets

2020-06-29 · Lexing Ying

Natural gradients have been widely used in optimization of loss functionals over probability space, with important examples such as Fisher-Rao gradient descent for Kullback-Leibler divergence, Wasserstein gradient descen…

HCQA: Hybrid Classical-Quantum Agent for Generating Optimal Quantum Sensor Circuits

2025-08-28 · Ahmad Alomari, Sathish A. P. Kumar arxiv

This study proposes an HCQA for designing optimal Quantum Sensor Circuits (QSCs) to address complex quantum physics problems. The HCQA integrates computational intelligence techniques by leveraging a Deep Q-Network (DQN)…

Hellinger-Kantorovich Gradient Flows: Global Exponential Decay of Entropy Functionals

2025-01-28 · Alexander Mielke, Jia-Jie Zhu

We investigate a family of gradient flows of positive and probability measures, focusing on the Hellinger-Kantorovich (HK) geometry, which unifies transport mechanism of Otto-Wasserstein, and the birth-death mechanism of…

Inference Optimization

Linear convergence of proximal descent schemes on the Wasserstein space

2024-11-22 · Razvan-Andrei Lascu, Mateusz B. Majka, David Šiška, Łukasz Szpruch

We investigate proximal descent methods, inspired by the minimizing movement scheme introduced by Jordan, Kinderlehrer and Otto, for optimizing entropy-regularized functionals on the Wasserstein space. We establish linea…

LEMMA

Implicit Bias of the JKO Scheme

2025-11-18 · Peter Halmos, Boris Hanin arxiv

Wasserstein gradient flow provides a general framework for minimizing an energy functional $J$ over the space of probability measures on a Riemannian manifold $(M,g)$. Its canonical time-discretization, the Jordan-Kinder…