Generative Adversarial Networks: zero-sum game in game theory
سال انتشار: 1401
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 193
فایل این مقاله در 6 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
این مقاله در بخشهای موضوعی زیر دسته بندی شده است:
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
DCBDP07_048
تاریخ نمایه سازی: 7 خرداد 1401
چکیده مقاله:
Generative Adversarial Networks (GAN) has recently received considerable attention in the intelligence community because of their ability to generate high quality and significant data. GAN is a game between two players where one player’s loss is the gain of another and that is a way to reach Nash that is balanced by the sum of zero. Despite these networks over the years, this paper examines the theoretical aspects of the game in GAN and how it plays. Then the research discusses the type of game in these networks. Later, after examining the challenges of this network, it will be implemented while maintaining equilibrium.
کلیدواژه ها:
Generative Adversarial Network (GAN) ، Game Theory ، Zero-sum Game ، Nash Equilibrium ، Deep Learning
نویسندگان
Uranus Kazemi
Department of Computer Engineering Faculty of Engineering, Arak University ۳۸۱۵۶-۸-۸۳۴۹ Arak, Iran
Maryam Amiri
Department of Computer Engineering Faculty of Engineering, Arak University ۳۸۱۵۶-۸-۸۳۴۹ Arak, Iran