返回
Variance-Reduced Methods for Machine Learning
DOI:10.1109/JPROC.2020.3028013.png)
摘要
En 中文
Stochastic optimization lies at the heart of machine learning, and its cornerstone is stochastic gradient descent (SGD), a method introduced over 60 years ago. The last eight years have seen an exciting new development: variance reduction for stochastic optimization methods. These variance-reduced (VR) methods excel in settings where more than one pass through the training data is allowed, achieving a faster convergence than SGD in theory and practice. These speedups underline the surge of interest in VR methods and the fast-growing body of work on this topic. This review covers the key principles and main developments behind VR methods for optimization with finite data sets and is aimed at nonexpert readers. We focus mainly on the convex setting and leave pointers to readers interested in extensions for minimizing nonconvex functions.
Keyword:
Machine learning
Optimization
Data models
Computational modeling
Logistics
Stochastic processes
Training data
Machine learning
optimization
variance reduction
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
25.9
论文数:
9.9K
被引数:
4.5W
机构
引用论文
Facile Synthesis, Characterization, Nanocrystal Growth and Photoluminescence Properties of GeS Nanowires
Nano
IF0
Mechanical, but not infective, pacemaker erosion may be successfully managed by re-implantation of pacemakers.
Heart
IF0

