13 resultados para POLYNOMIAL-MAPPINGS
em BORIS: Bern Open Repository and Information System - Berna - Suiça
Resumo:
Given the complex structure of the brain, how can synaptic plasticity explain the learning and forgetting of associations when these are continuously changing? We address this question by studying different reinforcement learning rules in a multilayer network in order to reproduce monkey behavior in a visuomotor association task. Our model can only reproduce the learning performance of the monkey if the synaptic modifications depend on the pre- and postsynaptic activity, and if the intrinsic level of stochasticity is low. This favored learning rule is based on reward modulated Hebbian synaptic plasticity and shows the interesting feature that the learning performance does not substantially degrade when adding layers to the network, even for a complex problem.
Resumo:
We quantify the extent to which a supercritical Sobolev mapping can increase the dimension of subsets of its domain, in the setting of metric measure spaces supporting a Poincaré inequality. We show that the set of mappings that distort the dimensions of sets by the maximum possible amount is a prevalent subset of the relevant function space. For foliations of a metric space X defined by a David–Semmes regular mapping Π : X → W, we quantitatively estimate, in terms of Hausdorff dimension in W, the size of the set of leaves of the foliation that are mapped onto sets of higher dimension. We discuss key examples of such foliations, including foliations of the Heisenberg group by left and right cosets of horizontal subgroups.