深度置信网络重启深层学习
逐层预训练让更深的神经网络重新可训练
Hinton、Osindero 与 Teh 提出深度置信网络的快速逐层训练方法,让“深度学习”重新成为可实验的研究路线。
2006 年前后,「深层神经网络」在不少实验室里仍带着失败的气味。反向传播理论上可以训练多层感知机,实践中却常被糟糕的初始化、饱和的激活、有限的数据与算力拖住。支持向量机、核方法与手工特征在多种基准上更省心。
Hinton、Osindero 与 Teh 在 Neural Computation 上发表的《A Fast Learning Algorithm for Deep Belief Nets》,并没有宣布这些困难一夜消失。它给出一种可以动手做的流程,让更深的生成模型重新进入实验日志。
深度置信网络(DBN)由多层受限玻尔兹曼机(RBM)堆成。训练分两段。第一段是无监督的逐层预训练:把数据可见层与第一隐层当成一个 RBM,用对比散度等近似方法学习;固定这一层后,把它的隐单元激活当作下一层 RBM 的「数据」,继续往上堆。每一层先学会压缩并重建输入的一种表示,而不要求立刻完成分类。第二段再把整个栈当作多层网络,用带标签的数据做有监督微调,把生成式预训练得到的权重当作起点。
论文在 MNIST 手写数字等任务上展示,这种初始化使深层网络可以训练出有竞争力的识别与生成结果。关键不在于某一张图的漂亮程度,而在于「深度」重新变成可控变量:研究者可以加层,而不只是加宽一个浅模型。方法借用了生成模型与能量模型的语言——隐藏变量、解释消除、逐层信念网络——读起来更像概率图模型传统的延续,而不是后来那种纯判别式、端到端、ReLU 加 Dropout 的配方。
同一时期,Bengio、LeCun 等人也在无监督预训练、卷积网络与表示学习上持续发声;2006 年这篇 DBN 论文是其中算法最完整、影响最广的节点之一,而不是孤立的顿悟瞬间。后来的历史没有把 DBN 保留为工业默认。大数据集、GPU、更好的随机初始化、非饱和激活与正则化,让许多任务可以直接端到端训练,逐层 RBM 预训练逐渐退出主舞台。
可若把 2006 年从时间轴上挖掉,2010 年代前后的「深度学习」回潮会少一块制度性的铺垫:深层表示值得再试,而且有一篇可复现的算法说明怎么试。受限玻尔兹曼机的对比散度训练本身带有近似,层数增加时生成模型的似然估计与采样质量仍受限制;论文的贡献是「够快、够深、够能微调」,不是一劳永逸的生成模型终点。若干年后,当纯粹判别式深层网络在标注数据上直接成功,有人会觉得逐层预训练多余——但在标注稀缺、优化脆弱的年代,它是少数能让深层结构站住的梯子。
这篇论文的位置因此有些尴尬,也因此诚实。它不是现代卷积或 Transformer 的直系图纸,而是一次信心修复:在深层网络被视为难驯的年代,用逐层无监督步骤先把表示撑起来,再让监督信号往下传。深度学习作为研究纲领重新站稳,靠的不只是后来的竞赛成绩,也包括这种「先让模型变得可训」的中间形态。
Around 2006, “deep neural network” still smelled of failure in many labs. Backpropagation could train multilayer perceptrons in theory; in practice bad initialization, saturating activations, limited data, and limited compute often won. Support vector machines, kernel methods, and hand-engineered features were simply easier on many benchmarks.
Hinton, Osindero, and Teh’s A Fast Learning Algorithm for Deep Belief Nets, published in Neural Computation, did not claim those difficulties vanished overnight. It offered a procedure one could actually run, putting deeper generative models back into the lab notebook.
A deep belief network (DBN) stacks restricted Boltzmann machines (RBMs). Training has two phases. First comes unsupervised layer-wise pretraining: treat the visible data and the first hidden layer as an RBM and learn with approximate methods such as contrastive divergence; freeze that layer, treat its hidden activations as “data” for the next RBM, and climb. Each layer learns a representation that compresses and reconstructs before any label is required. Second comes supervised fine-tuning of the whole stack, using the generative weights as a starting point rather than a random guess.
On MNIST and related tasks the paper showed that this initialization made deep nets trainable for competitive recognition and generation. The point was less any single pretty sample than the return of depth as a controllable variable: researchers could add layers instead of only widening a shallow model. The language still belongs to generative and energy-based modeling—hidden variables, explaining away, layered belief nets—closer to the probabilistic graphical tradition than to the later default of purely discriminative end-to-end stacks with ReLU and dropout.
In the same period Bengio, LeCun, and others kept publishing on unsupervised pretraining, convolutions, and representation learning; the 2006 DBN paper is among the most complete and widely cited algorithmic nodes, not an isolated flash of insight. History did not keep DBNs as the industrial recipe. Large datasets, GPUs, better random initialization, non-saturating activations, and regularization later made many tasks trainable end to end, and layer-wise RBM pretraining left the main stage.
Remove 2006 from the timeline, though, and the early-2010s return of “deep learning” loses an institutional plank: deep representations were worth trying again, and a reproducible algorithm said how. Contrastive-divergence training for RBMs is itself approximate, and likelihood estimation remains limited as stacks grow. The paper’s gift is speed, depth, and fine-tunability—not a final generative model. Years later, purely discriminative deep nets trained end to end on large labeled sets made layer-wise pretraining look optional. In an era of scarce labels and fragile optimization, it was one of the few ladders deep structure could climb.
The paper’s place is therefore awkward and honest. It is not a direct blueprint for modern convolutions or Transformers. It is a confidence repair: in a period when deep nets were treated as intractable, unsupervised layer-wise steps first propped up representations so supervised signals could travel. Deep learning as a research program stood up again not only on later contest scores, but on intermediate forms whose job was simply to make models trainable.
展开完整事件档案人物、主题、模型与产品
- 人物
- Geoffrey HintonSimon OsinderoYee Whye Teh
- 模型
- —
- 产品
- —