Deep Learning Computer Science

6 个科学问题 · 计算机 Computer Science

本页目录

生成对抗网络(GAN)是怎样让两个网络『互相对抗』来造假图的?

How do generative adversarial networks (GANs) pit two networks against each other to fake images?

GAN 包含一个生成器负责造样本、一个判别器负责分辨真假,二者在极小极大博弈中互相提升,最终生成器能产出以假乱真的图像。Goodfellow 等在 2014 年提出该框架。
A GAN has a generator that fabricates samples and a discriminator that judges real from fake; the two improve against each other in a minimax game until the generator produces convincing fakes. Goodfellow et al. proposed the framework in 2014.
难度 专业 · 适合 高中(15-18) CC BY 4.0 · 已核验 · Verified 2026-10-04
来源 · Source

Goodfellow 等《生成对抗网络》(NeurIPS, 2014)

Goodfellow et al., 'Generative Adversarial Networks' (NeurIPS, 2014)

#GAN #生成器 #判别器 #对抗训练

残差网络(ResNet)靠什么让网络可以堆到上百层而不退化?

How do residual networks (ResNet) let models stack over a hundred layers without degrading?

深层网络训练时梯度易消失、误差反而上升;ResNet 引入『跳跃连接』,让每层只需学习输入到输出的残差,信息可直通,缓解退化与梯度问题。He 等在 2016 年提出,并在 ImageNet 上刷出极深网络的纪录。
Very deep nets suffer vanishing gradients and rising error; ResNet adds skip connections so each layer learns only a residual from input to output, letting information pass through and easing training. He et al. introduced it in 2016 and set depth records on ImageNet.
难度 专业 · 适合 高中(15-18) CC BY 4.0 · 来源待核验 · Source pending review
来源 · Source

出处备注:著录含书名,但缺版次 / 出版社 / 年份中的一部分,需编辑补全后才能做独立比对。

He 等《深度残差学习》(CVPR, 2016)

He et al., 'Deep Residual Learning' (CVPR, 2016)

#ResNet #跳跃连接 #残差 #梯度消失

Word2Vec 是怎么把词语变成可计算语义的向量的?

How does Word2Vec turn words into vectors that capture computable semantics?

Word2Vec 用『上下文相近的词语义相近』的假设,通过 skip-gram 或 CBOW 训练模型预测邻近词,使词义相近的词在向量空间里距离也近,还能浮现『国王-男+女≈女王』这类关系。Mikolov 等在 2013 年提出。
Word2Vec assumes nearby words share meaning and trains skip-gram or CBOW models to predict neighboring words, placing semantically similar words close in vector space and even capturing relations like king - man + woman ≈ queen. Mikolov et al. proposed it in 2013.
难度 专业 · 适合 高中(15-18) CC BY 4.0 · 来源待核验 · Source pending review
来源 · Source

出处备注:著录含书名,但缺版次 / 出版社 / 年份中的一部分,需编辑补全后才能做独立比对。

Mikolov 等《词的高效向量表示》(2013);Mikolov 等《分布式短语与语法表示》(2013)

Mikolov et al., 'Efficient Estimation of Word Representations' (2013); Mikolov et al., 'Distributed Representations of Words' (2013)

#Word2Vec #词向量 #skip-gram #语义空间

卷积神经网络(CNN)为什么特别适合处理图像?

Why are convolutional neural networks especially suited to images?

CNN 用局部卷积核在图像上滑动提取边缘、纹理等局部特征,并借权值共享和池化获得平移不变性与参数效率。LeCun 等 1998 年的 LeNet 用于手写数字识别,2012 年 AlexNet 在 ImageNet 上大放异彩。
A CNN slides local kernels over an image to extract edges and textures, and via weight sharing and pooling gains translation invariance and parameter efficiency. LeCun's LeNet (1998) recognized handwritten digits; AlexNet (2012) triumphed on ImageNet.
难度 专业 · 适合 高中(15-18) CC BY 4.0 · 已核验 · Verified 2026-11-04
来源 · Source

LeCun 等《基于梯度的卷积网络》(1998);Krizhevsky、Sutskever 与 Hinton《AlexNet》(NeurIPS, 2012)

LeCun et al., 'Gradient-based learning for document recognition' (1998); Krizhevsky, Sutskever & Hinton, 'AlexNet' (NeurIPS, 2012)

#CNN #卷积 #权值共享 #池化

Transformer 里的『自注意力机制』解决了循环网络哪些瓶颈?

What bottlenecks of recurrent networks does the self-attention mechanism in Transformers solve?

循环网络要逐词顺序处理、难以并行且长程依赖会衰减;自注意力让序列中任意两个位置直接交互,一步算出全局关系并可在 GPU 上高度并行。Vaswani 等在 2017 年提出 Transformer,成为大语言模型的基础。
Recurrent nets process tokens sequentially, hard to parallelize, with long-range dependencies fading; self-attention lets any two positions interact directly, computes global relations in one step, and parallelizes well on GPUs. Vaswani et al. introduced the Transformer in 2017, now the basis of large language models.
难度 专业 · 适合 高中(15-18) CC BY 4.0 · 已核验 · Verified 2026-11-03
来源 · Source

Vaswani 等《Attention Is All You Need》(NeurIPS, 2017);Devlin 等《BERT》(NAACL, 2019)

Vaswani et al., 'Attention Is All You Need' (NeurIPS, 2017); Devlin et al., 'BERT' (NAACL, 2019)

#Transformer #自注意力 #并行 #长程依赖

感知机作为最早的神经网络单元,为什么曾被说『连异或都学不会』?

As the earliest neural unit, why was the perceptron once said to be unable to learn even XOR?

单层感知机只能拟合输入空间的线性边界,而 XOR 这类问题本质是线性不可分的,因此单靠它无解。Minsky 与 Papert 在 1969 年指出这一局限;直到引入多层网络与反向传播,才突破这道关卡。
A single-layer perceptron can only fit a linear boundary, and problems like XOR are linearly inseparable, so it cannot solve them alone. Minsky and Papert highlighted this limit in 1969; only multi-layer networks with backpropagation broke through.
难度 进阶 · 适合 高中(15-18) CC BY 4.0 · 已核验 · Verified 2026-11-04
来源 · Source

Rosenblatt,《The perceptron: A probabilistic model for information storage and organization in the brain》,Psychological Review,1958 (DOI: 10.1037/h0042519);Minsky 与 Papert《感知机》(1969)

Rosenblatt, 'The perceptron: A probabilistic model for information storage and organization in the brain', Psychological Review, 1958, DOI: 10.1037/h0042519; Minsky & Papert, 'Perceptrons' (1969)

#感知机 #线性不可分 #异或 #多层网络