paper-with-me

홈 › Papers

Stochastic Gradient Descent Works Really Well for Stress Minimization

2020-08-24 · Katharina Börsig, Ulrik Brandes, Barna Pasztor

Stress minimization is among the best studied force-directed graph layout methods because it reliably yields high-quality layouts. It thus comes as a surprise that a novel approach based on stochastic gradient descent (Zheng, Pawar and Goodman, TVCG 2019) is claimed to improve on state-of-the-art approaches based on majorization. We present experimental evidence that the new approach does not actually yield better layouts, but that it is still to be preferred because it is simpler and robust against poor initialization.

📄 PDF Abstract BibTeX arXiv:2008.10376

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Non-convergence of stochastic gradient descent in the training of deep neural networks

2020-06-12 · Patrick Cheridito, Arnulf Jentzen, Florian Rossmannek

Deep neural networks have successfully been trained in various application areas with stochastic gradient descent. However, there exists no rigorous mathematical explanation why this works so well. The training of neural…

SGDEM: stochastic gradient descent with energy and momentum

2021-09-29 · Hailiang Liu, Xuping Tian

In this paper, we propose SGDEM, Stochastic Gradient Descent with Energy and Momentum to solve a large class of general nonconvex stochastic optimization problems, based on the AEGD method that originated in the work [AE…

Stochastic Optimization

Training of Deep Neural Networks based on Distance Measures using RMSProp

2017-08-06 · Thomas Kurbiel, Shahrzad Khaleghian

The vanishing gradient problem was a major obstacle for the success of deep learning. In recent years it was gradually alleviated through multiple different techniques. However the problem was not really overcome in a fu…

Stochastic Markov Gradient Descent and Training Low-Bit Neural Networks

2020-08-25 · Jonathan Ashbrock, Alexander M. Powell

The massive size of modern neural networks has motivated substantial recent interest in neural network quantization. We introduce Stochastic Markov Gradient Descent (SMGD), a discrete optimization method applicable to tr…

Quantization

Beyond Convexity: Stochastic Quasi-Convex Optimization

2015-07-08 · NeurIPS 2015 12 · Elad Hazan, Kfir. Y. Levy, Shai Shalev-Shwartz

Stochastic convex optimization is a basic and well studied primitive in machine learning. It is well known that convex and Lipschitz functions can be minimized efficiently using Stochastic Gradient Descent (SGD). The Nor…