Ants, like many other animals, use visual memory to follow extended routes through complex environments, but it is unknown how their small brains implement this capability. The mushroom body neuropils have been identified as a crucial memory circuit in the insect brain, but their function has mostly been explored for simple olfactory association tasks. We show that a spiking neural model of this circuit originally developed to describe fruitfly (Drosophila melanogaster) olfactory association, can also account for the ability of desert ants (Cataglyphis velox) to rapidly learn visual routes through complex natural environments. We further demonstrate that abstracting the key computational principles of this circuit, which include one-shot learning of sparse codes, enables the theoretical storage capacity of the ant mushroom body to be estimated at hundreds of independent images.

Honeybees are models for studying how animals with relatively small brains accomplish complex cognition, displaying seemingly advanced (or "non-elemental") learning phenomena involving multiple conditioned stimuli. These include "peak shift" [1-4]-where animals not only respond to entrained stimuli, but respond even more strongly to similar ones that are farther away from non-rewarding stimuli. Bees also display negative and positive patterning discrimination [5], responding in opposite ways to mixtures of two odors than to individual odors. Since Pavlov, it has often been assumed that such phenomena are more complex than simple associate learning. We present a model of connections between olfactory sensory input and bees' mushroom bodies [6], incorporating empirically determined properties of mushroom body circuitry (random connectivity [7], sparse coding [8], and synaptic plasticity [9, 10]). We chose not to optimize the model's parameters to replicate specific behavioral phenomena, because we were interested in the emergent cognitive capacities that would pop out of a network constructed solely based on empirical neuroscientific information and plausible assumptions for unknown parameters. We demonstrate that the circuitry mediating "simple" associative learning can also replicate the various non-elemental forms of learning mentioned above and can effectively multi-task by replicating a range of different learning feats. We found that PN-KC synaptic plasticity is crucial in controlling the generalization-discrimination trade-off-it facilitates peak shift and hinders patterning discrimination-and that PN-to-KC connection number can affect this trade-off. These findings question the notion that forms of learning that have been regarded as "higher order" are computationally more complex than "simple" associative learning.

No abstract

No abstract

No abstract

We examined how bees solve a visual discrimination task with stimuli commonly used in numerical cognition studies. Bees performed well on the task, but additional tests showed that they had learned continuous (non-numerical) cues. A network model using biologically plausible visual feature filtering and a simple associative rule was capable of learning the task using only continuous cues inherent in the training stimuli, with no numerical processing. This model was also able to reproduce behaviours that have been considered in other studies indicative of numerical cognition. Our results support the idea that a sense of magnitude may be more primitive and basic than a sense of number. Our findings highlight how problematic inadvertent continuous cues can be for studies of numerical cognition. This remains a deep issue within the field that requires increased vigilance and cleverness from the experimenter. We suggest ways of better assessing numerical cognition in non-speaking animals, including assessing the use of all alternative cues in one test, using cross-modal cues, analysing behavioural responses to detect underlying strategies, and finding the neural substrate.

Abstract. Discovering a concise schema from given XML documents is an important problem in XML applications. In this paper, we focus on the problem of learning an unordered schema from a given set of XML examples, which is actually a problem of learning a restricted regular expression with interleaving using positive example strings. Schemas with interleaving could present meaningful knowledge that cannot be disclosed by previous inference techniques. Moreover, inference of the minimal schema with interleaving is challenging. The problem of finding a minimal schema with interleaving is shown to be NP-hard. Therefore, we develop an approximation algorithm and a heuristic solution to tackle the problem using techniques different from known inference algorithms. We do experiments on real-world data sets to demonstrate the effectiveness of our approaches. Our heuristic algorithm is shown to produce results that are very close to optimal.

Caffeine in floral nectar enhances the memory of bees for the flowers' scent by altering response properties of neurons in the bee brain. [Also see Report by Wright et al. ]