Memristors for energy‐efficient new computing paradigms

DS Jeong, KM Kim, S Kim, BJ Choi… - Advanced Electronic …, 2016 - Wiley Online Library
In this Review, memristors are examined from the frameworks of both von Neumann and
neuromorphic computing architectures. For the former, a new logic computational process …

Statistical physics of inference: Thresholds and algorithms

L Zdeborová, F Krzakala - Advances in Physics, 2016 - Taylor & Francis
Many questions of fundamental interest in today's science can be formulated as inference
problems: some partial, or noisy, observations are performed over a set of variables and the …

The overlap gap property: A topological barrier to optimizing over random structures

D Gamarnik - Proceedings of the National Academy of Sciences, 2021 - pnas.org
The problem of optimizing over random structures emerges in many areas of science and
engineering, ranging from statistical physics to machine learning and artificial intelligence …

Improved contact prediction in proteins: using pseudolikelihoods to infer Potts models

M Ekeberg, C Lövkvist, Y Lan, M Weigt, E Aurell - Physical Review E …, 2013 - APS
Spatially proximate amino acids in a protein tend to coevolve. A protein's three-dimensional
(3D) structure hence leaves an echo of correlations in the evolutionary record. Reverse …

Expectation backpropagation: Parameter-free training of multilayer neural networks with continuous or discrete weights

D Soudry, I Hubara, R Meir - Advances in neural information …, 2014 - proceedings.neurips.cc
Abstract Multilayer Neural Networks (MNNs) are commonly trained using gradient descent-
based methods, such as BackPropagation (BP). Inference in probabilistic graphical models …

Collective influence algorithm to find influencers via optimal percolation in massively large social media

F Morone, B Min, L Bo, R Mari, HA Makse - Scientific reports, 2016 - nature.com
We elaborate on a linear-time implementation of Collective-Influence (CI) algorithm
introduced by Morone, Makse, Nature 524, 65 (2015) to find the minimal set of influencers in …

Unreasonable effectiveness of learning neural networks: From accessible states and robust ensembles to basic algorithmic schemes

C Baldassi, C Borgs, JT Chayes, A Ingrosso… - Proceedings of the …, 2016 - pnas.org
In artificial neural networks, learning from data is a computationally demanding task in which
a large number of connection weights are iteratively tuned through stochastic-gradient …

Passing messages between biological networks to refine predicted interactions

K Glass, C Huttenhower, J Quackenbush, GC Yuan - PloS one, 2013 - journals.plos.org
Regulatory network reconstruction is a fundamental problem in computational biology.
There are significant limitations to such reconstruction using individual datasets, and …

Message-passing algorithms for sparse network alignment

M Bayati, DF Gleich, A Saberi, Y Wang - ACM Transactions on …, 2013 - dl.acm.org
Network alignment generalizes and unifies several approaches for forming a matching or
alignment between the vertices of two graphs. We study a mathematical programming …

Subdominant dense clusters allow for simple learning and high computational performance in neural networks with discrete synapses

C Baldassi, A Ingrosso, C Lucibello, L Saglietti… - Physical review …, 2015 - APS
We show that discrete synaptic weights can be efficiently used for learning in large scale
neural systems, and lead to unanticipated computational performance. We focus on the …