ScholarGate
Асистент

Сравнение на методи

Прегледайте избраните методи един до друг; редовете с разлики са откроени.

Трениране с противникови атаки×Генеративна състезателна мрежа×
ОбластДълбоко обучениеДълбоко обучение
СемействоMachine learningMachine learning
Година на възникване20182014
СъздателAleksander Madry et al.Goodfellow, I. et al.
ТипRobust optimization training procedureGenerative deep learning (adversarial two-network game)
Основополагащ източникMadry, A., Makelov, A., Schmidt, L., Tsipras, D., & Vladu, A. (2018). Towards deep learning models resistant to adversarial attacks. International Conference on Learning Representations (ICLR). link ↗Goodfellow, I. et al. (2014). Generative Adversarial Nets. NeurIPS. link ↗
Други названияMin-Max Robust Training, PGD Adversarial Training, Robust Empirical Risk Minimization, Hasımsal EğitimÜretici Çekişmeli Ağ (GAN), GAN, generative adversarial nets, adversarial network
Свързани34
РезюмеAdversarial Training is a robust optimization procedure for deep neural networks in which the model is trained not on clean data alone but on worst-case perturbed inputs crafted during training. Formalized by Madry et al. (2018) as a min-max saddle-point problem, the method uses Projected Gradient Descent (PGD) to generate strong adversarial examples within a bounded Lp perturbation set before each gradient update, forcing the network to learn decision boundaries that are stable under such perturbations.A Generative Adversarial Network (GAN), introduced by Ian Goodfellow and colleagues in 2014, produces realistic synthetic data through the competition of two neural networks — a generator and a discriminator. It is widely used for image synthesis, data augmentation, and distribution estimation.
ScholarGateНабор от данни
  1. v1
  2. 1 Източници
  3. PUBLISHED
  1. v1
  2. 2 Източници
  3. PUBLISHED

Към търсенето Изтегляне на слайдове

ScholarGateСравнение на методи: Adversarial Training · Generative Adversarial Network. Извлечено на 2026-06-17 от https://scholargate.app/bg/compare