Stefano Recanatesi

dblp:180/0281 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
3since 2021 · last 2024
0000-0002-3576-9261ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 1 first-author · 3 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Kernel, tree and ensemble methods · 67% Probabilistic and Bayesian machine learning · 33%
Theoretical computer science
1 paper
Information theory · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › regression
distribution regression
0.812024
Learning to Embed Distributions via Maximum Kernel Entropy · NeurIPS 2024
Machine learning › Kernel, tree and ensemble methods › kernel methods
kernel learning
0.812024
Learning to Embed Distributions via Maximum Kernel Entropy · NeurIPS 2024
Machine learning › Kernel, tree and ensemble methods
kernel methods
0.812024
Learning to Embed Distributions via Maximum Kernel Entropy · NeurIPS 2024
Information theory › information measures › entropy
entropy minimization
0.212024
Learning to Embed Distributions via Maximum Kernel Entropy · NeurIPS 2024

Methods — techniques the papers use, named apart from their topics

maximum entropy · 1.5kernel embedding of distributions · 1.5
YearPublicationVenuePosition
2024 Learning to Embed Distributions via Maximum Kernel Entropy
abstract
Empirical data can often be considered as samples from a set of probability distributions. Kernel methods have emerged as a natural approach for learning to classify these distributions. Although numerous kernels between distributions have been proposed, applying kernel methods to distribution regression tasks remains challenging, primarily because selecting a suitable kernel is not straightforward. Surprisingly, the question of learning a data-dependent distribution kernel has received little attention. In this paper, we propose a novel objective for the unsupervised learning of data-dependent distribution kernel, based on the principle of entropy maximization in the space of probability measure embeddings. We examine the theoretical properties of the latent embedding space induced by our objective, demonstrating that its geometric structure is well-suited for solving downstream discriminative tasks. Finally, we demonstrate the performance of the learned kernel across different modalities.
Oleksii Kachaiev, Stefano Recanatesi
NeurIPS2
2022 Single Circuit in V1 Capable of Switching Contexts During Movement Using an Inhibitory Population as a Switch
abstract
As animals adapt to their environments, their brains are tasked with processing stimuli in different sensory contexts. Whether these computations are context dependent or independent, they are all implemented in the same neural tissue. A crucial question is what neural architectures can respond flexibly to a range of stimulus conditions and switch between them. This is a particular case of flexible architecture that permits multiple related computations within a single circuit. Here, we address this question in the specific case of the visual system circuitry, focusing on context integration, defined as the integration of feedforward and surround information across visual space. We show that a biologically inspired microcircuit with multiple inhibitory cell types can switch between visual processing of the static context and the moving context. In our model, the VIP population acts as the switch and modulates the visual circuit through a disinhibitory motif. Moreover, the VIP population is efficient, requiring only a relatively small number of neurons to switch contexts. This circuit eliminates noise in videos by using appropriate lateral connections for contextual spatiotemporal surround modulation, having superior denoising performance compared to circuits where only one context is learned. Our findings shed light on a minimally complex architecture that is capable of switching between two naturalistic contexts using few switching units.
Doris Voina, Stefano Recanatesi, Brian Hu 0001, Eric Shea-Brown, Stefan Mihalas
Neural Comput.2
2021 Autoencoder networks extract latent variables and encode these variables in their connectomes
Matthew Farrell, Stefano Recanatesi, R. Clay Reid, Stefan Mihalas, Eric Shea-Brown
Neural Networks2
2019 Dimensionality in recurrent spiking networks: Global trends in activity and local origins in connectivity
abstract
The dimensionality of a network's collective activity is of increasing interest in neuroscience. This is because dimensionality provides a compact measure of how coordinated network-wide activity is, in terms of the number of modes (or degrees of freedom) that it can independently explore. A low number of modes suggests a compressed low dimensional neural code and reveals interpretable dynamics [1], while findings of high dimension may suggest flexible computations [2, 3]. Here, we address the fundamental question of how dimensionality is related to connectivity, in both autonomous and stimulus-driven networks. Working with a simple spiking network model, we derive three main findings. First, the dimensionality of global activity patterns can be strongly, and systematically, regulated by local connectivity structures. Second, the dimensionality is a better indicator than average correlations in determining how constrained neural activity is. Third, stimulus evoked neural activity interacts systematically with neural connectivity patterns, leading to network responses of either greater or lesser dimensionality than the stimulus.
Stefano Recanatesi, Gabriel Koch Ocker, Michael A. Buice, Eric Shea-Brown
PLoS Comput. Biol.1
2017 Memory States and Transitions between Them in Attractor Neural Networks
abstract
Human memory is capable of retrieving similar memories to a just retrieved one. This associative ability is at the base of our everyday processing of information. Current models of memory have not been able to underpin the mechanism that the brain could use in order to actively exploit similarities between memories. The current idea is that to induce transitions in attractor neural networks, it is necessary to extinguish the current memory. We introduce a novel mechanism capable of inducing transitions between memories where similarities between memories are actively exploited by the neural dynamics to retrieve a new memory. Populations of neurons that are selective for multiple memories play a crucial role in this mechanism by becoming attractors on their own. The mechanism is based on the ability of the neural network to control the excitation-inhibition balance.
Stefano Recanatesi, Mikhail Katkov, Misha Tsodyks
Neural Comput.1