This article introduces an extremely simple and local learning rule for topographic map formation. The rule, called the maximum entropy learning rule (MER), maximizes the unconditional entropy of the map's output for any type of input distribution. The aim of this article is to show that MER is a viable strategy for building topographic maps that maximize the average mutual information of the output responses to noiseless input signals when only input noise and noise-added input signals are available.status: publishe
We are interested in distributions which are derived as a maximumentropy distribution given a set of...
In blind sourc separation (BSS), two di#erent separation tecration are mainly used: minimal mutual i...
Bayesian Maximum Entropy was used to estimate the probabilities of occurrence of soil categories in ...
Topographic map algorithms that are aimed at building "faithful representations" also yield maps tha...
A new learning algorithm for kernel-based topographic map formation is introduced. The kernel parame...
We discuss an unsupervised learning method which is driven by an information theoretic based criteri...
We introduce a new unsupervised learning algorithm for kernel-based topographic map formation of het...
Thematic maps are one of the most common tools for representing the spatial variation of a variable....
We propose a framework for learning hidden-variable models by optimizing entropies, in which entropy...
There are two major approaches for blind separation: maximum entropy (ME) and minimum mutual informa...
A classic approach for learning Bayesian networks from data is to select the maximum a posteriori (M...
The dynamics of a probabilistic neural network is characterized by the distribution nvux'\x) of...
Bayesian Maximum Entropy was used to estimate the probabilities of occurrence of soil categories in ...
Probabilistic graphical models are a very efficient machine learning technique. However, their only ...
We provide new perspectives and inference algorithms for Maximum Entropy (MaxEnt) Inverse Reinforcem...
We are interested in distributions which are derived as a maximumentropy distribution given a set of...
In blind sourc separation (BSS), two di#erent separation tecration are mainly used: minimal mutual i...
Bayesian Maximum Entropy was used to estimate the probabilities of occurrence of soil categories in ...
Topographic map algorithms that are aimed at building "faithful representations" also yield maps tha...
A new learning algorithm for kernel-based topographic map formation is introduced. The kernel parame...
We discuss an unsupervised learning method which is driven by an information theoretic based criteri...
We introduce a new unsupervised learning algorithm for kernel-based topographic map formation of het...
Thematic maps are one of the most common tools for representing the spatial variation of a variable....
We propose a framework for learning hidden-variable models by optimizing entropies, in which entropy...
There are two major approaches for blind separation: maximum entropy (ME) and minimum mutual informa...
A classic approach for learning Bayesian networks from data is to select the maximum a posteriori (M...
The dynamics of a probabilistic neural network is characterized by the distribution nvux'\x) of...
Bayesian Maximum Entropy was used to estimate the probabilities of occurrence of soil categories in ...
Probabilistic graphical models are a very efficient machine learning technique. However, their only ...
We provide new perspectives and inference algorithms for Maximum Entropy (MaxEnt) Inverse Reinforcem...
We are interested in distributions which are derived as a maximumentropy distribution given a set of...
In blind sourc separation (BSS), two di#erent separation tecration are mainly used: minimal mutual i...
Bayesian Maximum Entropy was used to estimate the probabilities of occurrence of soil categories in ...