output
20092020
most citedOn sampling and modeling complex systems

82 citations

19 papers

cond-mat.dis-nn2020★ 12 cited

Efficiency of local learning rules in threshold-linear associative networks

Francesca Schönsberg, Yasser Roudi, Alessandro Treves

We derive the Gardner storage capacity for associative networks of threshold linear units, and show that with Hebbian learning they can operate closer to such Gardner bound than bi…

cs.AI2020★ 8 cited

Self Punishment and Reward Backfill for Deep Q-Learning

Mohammad Reza Bonyadi, Rui Wang, Maryam Ziaei

Reinforcement learning agents learn by encouraging behaviours which maximize their total reward, usually provided by the environment. In many environments, however, the reward is p…

stat.ME2018★ 19 cited

Minimum Description Length codes are critical

Ryan John Cubero, Matteo Marsili, Yasser Roudi

In the Minimum Description Length (MDL) principle, learning from the data is equivalent to an optimal coding problem. We show that the codes that achieve optimal compression in MDL…

physics.data-an2018★ 50 cited

Statistical Criticality arises in Most Informative Representations

Ryan John Cubero, Junghyo Jo, Matteo Marsili +2

We show that statistical criticality, i.e. the occurrence of power law frequency distributions, arises in samples that are maximally informative about the underlying generating pro…

q-bio.NC2017★ 3 cited

Decoding of neural data using cohomological feature extraction

Erik Rybakken, Nils Baas, Benjamin Dunn

We introduce a novel data-driven approach to discover and decode features in the neural code coming from large population neural recordings with minimal assumptions, using cohomolo…

cond-mat.dis-nn2017★ 10 cited

The Stochastic complexity of spin models: Are pairwise models really simple?

Alberto Beretta, Claudia Battistin, Clélia de Mulatier +2

Models can be simple for different reasons: because they yield a simple and computationally efficient interpretation of a generic dataset (e.g. in terms of pairwise dependences) -…