Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Memristors for energy‐efficient new computing paradigms
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 …
neuromorphic computing architectures. For the former, a new logic computational process …
Statistical physics of inference: Thresholds and algorithms
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 …
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 …
engineering, ranging from statistical physics to machine learning and artificial intelligence …
Improved contact prediction in proteins: using pseudolikelihoods to infer Potts models
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 …
(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
Abstract Multilayer Neural Networks (MNNs) are commonly trained using gradient descent-
based methods, such as BackPropagation (BP). Inference in probabilistic graphical models …
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
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 …
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
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 …
a large number of connection weights are iteratively tuned through stochastic-gradient …
Passing messages between biological networks to refine predicted interactions
Regulatory network reconstruction is a fundamental problem in computational biology.
There are significant limitations to such reconstruction using individual datasets, and …
There are significant limitations to such reconstruction using individual datasets, and …
Message-passing algorithms for sparse network alignment
Network alignment generalizes and unifies several approaches for forming a matching or
alignment between the vertices of two graphs. We study a mathematical programming …
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
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 …
neural systems, and lead to unanticipated computational performance. We focus on the …