Origin of the computational hardness for learning with binary synapses.
about
Unsupervised feature learning from finite data by message passing: Discontinuous versus continuous phase transition.Unreasonable effectiveness of learning neural networks: From accessible states and robust ensembles to basic algorithmic schemes.Learning may need only a few bits of synaptic precision.Efficiency of quantum vs. classical annealing in nonconvex learning problems.Subdominant Dense Clusters Allow for Simple Learning and High Computational Performance in Neural Networks with Discrete Synapses.
P2860
Origin of the computational hardness for learning with binary synapses.
description
2014 nî lūn-bûn
@nan
2014年の論文
@ja
2014年学术文章
@wuu
2014年学术文章
@zh
2014年学术文章
@zh-cn
2014年学术文章
@zh-hans
2014年学术文章
@zh-my
2014年学术文章
@zh-sg
2014年學術文章
@yue
2014年學術文章
@zh-hant
name
Origin of the computational hardness for learning with binary synapses.
@en
Origin of the computational hardness for learning with binary synapses.
@nl
type
label
Origin of the computational hardness for learning with binary synapses.
@en
Origin of the computational hardness for learning with binary synapses.
@nl
prefLabel
Origin of the computational hardness for learning with binary synapses.
@en
Origin of the computational hardness for learning with binary synapses.
@nl
P2860
P1433
P1476
Origin of the computational hardness for learning with binary synapses.
@en
P2093
Haiping Huang
Yoshiyuki Kabashima
P2860
P304
P356
10.1103/PHYSREVE.90.052813
P407
P577
2014-11-17T00:00:00Z