Eluding oblivion with smart stochastic selection of synaptic updates

The variables involved in the equations that describe realistic synaptic dynamics always vary in a limited range. Their boundedness makes the synapses forgetful, not for the mere passage of time, but because new experiences overwrite old memories. The forgetting rate depends on how many synapses are modified by each new experience: many changes means fast learning and fast forgetting, whereas few changes means slow learning and long memory retention. Reducing the average number of modified synapses can extend the memory span at the price of a reduced amount of information stored when a new experience is memorized. Every trick which allows to slow down the learning process in a smart way can improve the memory performance. We review some of the tricks that allow to elude fast forgetting (oblivion). They are based on the stochastic selection of the synapses whose modifications are actually consolidated following each new experience. In practice only a randomly selected, small fraction of the synapses eligible for an update are actually modified. This allows to acquire the amount of information necessary to retrieve the memory without compromising the retention of old experiences. The fraction of modified synapses can be further reduced in a smart way by changing synapses only when it is really necessary, i.e. when the post-synaptic neuron does not respond as desired. Finally we show that such a stochastic selection emerges naturally from spike driven synaptic dynamics which read noisy pre and post-synaptic neural activities. These activities can actually be generated by a chaotic system.

Logical omniscience as infeasibility

Logical theories for representing knowledge are often plagued by the so-called Logical Omniscience Problem. The problem stems from the clash between the desire to model rational agents, which should be capable of simple logical inferences, and the fact that any logical inference, however complex, almost inevitably consists of inference steps that are simple enough. This contradiction points to the fruitlessness of trying to solve the Logical Omniscience Problem qualitatively if the rationality of agents is to be maintained. We provide a quantitative solution to the problem compatible with the two important facets of the reasoning agent: rationality and resource boundedness. More precisely, we provide a test for the logical omniscience problem in a given formal theory of knowledge. The quantitative measures we use are inspired by the complexity theory. We illustrate our framework with a number of examples ranging from the traditional implicit representation of knowledge in modal logic to the language of justification logic, which is capable of spelling out the internal inference process. We use these examples to divide representations of knowledge into logically omniscient and not logically omniscient, thus trying to determine how much information about the reasoning process needs to be present in a theory to avoid logical omniscience.

The block numerical range of analytic operator functions

We introduce the block numerical range Wn(L) of an operator function L with respect to a decomposition H = H1⊕. . .⊕Hn of the underlying Hilbert space. Our main results include the spectral inclusion property and estimates of the norm of the resolvent for analytic L . They generalise, and improve, the corresponding results for the numerical range (which is the case n = 1) since the block numerical range is contained in, and may be much smaller than, the usual numerical range. We show that refinements of the decomposition entail inclusions between the corresponding block numerical ranges and that the block numerical range of the operator matrix function L contains those of its principal subminors. For the special case of operator polynomials, we investigate the boundedness of Wn(L) and we prove a Perron-Frobenius type result for the block numerical radius of monic operator polynomials with coefficients that are positive in Hilbert lattice sense.

Dichotomous Hamiltonians with unbounded entries and solutions of Riccati equations

An operator Riccati equation from systems theory is considered in the case that all entries of the associated Hamiltonian are unbounded. Using a certain dichotomy property of the Hamiltonian and its symmetry with respect to two different indefinite inner products, we prove the existence of nonnegative and nonpositive solutions of the Riccati equation. Moreover, conditions for the boundedness and uniqueness of these solutions are established.