Submodular Mini-Batch Training in Generative Moment Matching Networks
This article was withdrawn because (1) it was uploaded without the co-authors' knowledge or consent, and (2) there are allegations of plagiarism.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Submodular Batch Selection for Training Deep Neural Networks
Mini-batch gradient descent based methods are the de facto algorithms for training neural network architectures today. We introduce a mini-batch selection strategy based on submodular function maximization. Our novel sub…
Combinatorial OptimizationDiversityInformativenessOptimal approximation for unconstrained non-submodular minimization
Submodular function minimization is well studied, and existing algorithms solve it exactly or up to arbitrary accuracy. However, in many applications, such as structured sparse learning or batch Bayesian optimization, th…
Bayesian OptimizationSparse LearningPerfect Parallelization in Mini-Batch SGD with Classical Momentum Acceleration
Accelerating stochastic gradient methods with classical momentum schemes, such as Polyak's heavy ball, has proven highly successful in training large-scale machine learning models, particularly when combined with the har…
Increasing Batch Size Improves Convergence of Stochastic Gradient Descent with Momentum
Stochastic gradient descent with momentum (SGDM), which is defined by adding a momentum term to SGD, has been well studied in both theory and practice. Theoretically investigated results showed that the settings of the l…
Co-Mixup: Saliency Guided Joint Mixup with Supermodular Diversity
While deep neural networks show great performance on fitting to the training distribution, improving the networks' generalization performance to the test distribution and robustness to the sensitivity to input perturbati…
Diversity