Application of Langevin Dynamics to Advance the Quantum Natural Gradient Optimization Algorithm
National Science Center "Kharkiv Institute of Physics and Technology"(国家科学中心"基尔基亚物理与技术研究所");V.N. Karazin Kharkiv National University(V.N. 卡拉津基尔基亚国立大学);Università della Svizzera italiana(瑞士意大利大学)
A Quantum Natural Gradient (QNG) algorithm for optimization of variational quantum circuits has been proposed recently. In this study, we employ the Langevin equation with a QNG stochastic force to demonstrate that its discrete-time solution gives a generalized form of the above-specified algorithm, which we call Momentum-QNG. Similar to other optimization algorithms with the momentum term, such as the Stochastic Gradient Descent with momentum, RMSProp with momentum and Adam, Momentum-QNG is more effective to escape local minima and plateaus in the variational parameter space and, therefore, demonstrates an improved performance compared to the basic QNG. In this paper we benchmark Momentum-QNG together with the basic QNG, Adam and Momentum optimizers and explore its convergence behaviour. Among the benchmarking problems studied, the best result is obtained for the quantum Sherrington-Kirkpatrick model in the strong spin glass regime. Our open-source code is available at https://github.com/borbysh/Momentum-QNG
Convergence of mean-field Langevin dynamics: Time and space discretization, stochastic gradient, and variance reduction
University of Tokyo(东京大学);RIKEN Center for Advanced Intelligence Project(理化学研究所先进智能项目中心);University of Toronto(多伦多大学);Vector Institute for Artificial Intelligence(矢量人工智能研究所);Kyushu Institute of Technology(九州工业大学)
Dimension-free convergence rates for gradient Langevin dynamics in RKHS
CREST, ENSAE, IP Paris(巴黎理工学院国立统计与经济管理学院经济与统计研究中心);The University of Tokyo(东京大学);INRIA, Université Paris-Saclay(巴黎萨克雷大学法国国家信息与自动化研究所);Riken AIP(理化学研究所先进智能项目中心)
Taming neural networks with TUSLA: Non-convex learning via adaptive stochastic gradient Langevin algorithms
Alfréd Rényi Institute of Mathematics(阿尔弗雷德·雷尼数学研究所);The University of Edinburgh(爱丁堡大学);The Alan Turing Institute(艾伦·图灵研究所);National Technical University of Athens(雅典国立技术大学)
Fractional Underdamped Langevin Dynamics: Retargeting SGD with Momentum under Heavy-Tailed Gradient Noise
LTCI, Télécom Paris, Institut Polytechnique de Paris(巴黎理工学院巴黎电信学院LTCI实验室);Department of Statistics, University of Oxford(牛津大学统计系);Department of Mathematics, Florida State University(佛罗里达州立大学数学系);Department of Management Science and Information Systems, Rutgers Business School(罗格斯大学商学院管理科学与信息系统系)
带动量的随机梯度下降(SGDm)是深度学习中最流行的优化算法之一。虽然有丰富的SGDm理论用于凸问题,但该理论在深度学习的背景下发展得相当少,其中问题是非凸的,并且梯度噪声可能表现出重尾行为,正如最近的研究所观察到的那样。在这项研究中,我们考虑了一个\emph{continuous-time}变形的SGDm,称为欠阻尼朗之万动力学(ULD),并研究其渐近性质下的重尾扰动。支持最近的研究从统计物理,我们认为在理论上和经验上,这种扰动的重尾可以导致偏见,即使当步长很小,在这个意义上说,\emph{the optima of stationary distribution}的动态可能不匹配\emph{the optima of the cost function to be optimized}。作为补救措施,我们开发了一个新的框架,我们将其命名为\emph{fractional} ULD(FULD),并证明FULD针对所谓的吉布斯分布,其最优值与原始成本的最优值完全匹配。我们观察到,FULD的欧拉离散化与\emph{natural gradient}方法和\emph{gradient clipping}具有值得注意的算法相似性,为理解它们在深度学习中的作用带来了新的视角。我们支持我们的理论与合成模型和神经网络上进行的实验。
Error estimates between SGD with momentum and underdamped Langevin diffusion
Laboratoire de Mathematiques Blaise Pascal, CNRS-UMR 6620, Universite Clermont-Auvergne(克莱蒙奥弗涅大学);University of Macau(澳门大学);UM Zhuhai Research Institute(澳门大学珠海研究院);School of Mathematical Sciences, Peking University(北京大学数学科学学院);Beijing International Center for Mathematical Research (BICMR), Peking University(北京大学北京国际数学研究中心)
UNIST InnoCORE AI-Space Solar Initiative, Ulsan National Institute of Science and Technology (UNIST), Ulsan, 44919, Republic of Korea(UNIST InnoCORE AI-Space Solar Initiative,乌山国立科学与技术研究所(UNIST),乌山,44919,韩国);Artificial Intelligence Graduate School, Ulsan National Institute of Science and Technology (UNIST), Ulsan, 44919, Republic of Korea(人工智能研究生院,乌山国立科学与技术研究所(UNIST),乌山,44919,韩国);Department of Industrial Engineering, Ulsan National Institute of Science and Technology (UNIST), Ulsan, 44919, Republic of Korea(工业工程系,乌山国立科学与技术研究所(UNIST),乌山,44919,韩国);School of Mathematics, University of Edinburgh, Edinburgh, United Kingdom(爱丁堡大学数学学院,爱丁堡,英国);Department of Mathematics, National Technical University of Athens, Athens, Greece(雅典国家技术大学数学系,雅典,希腊);Archimedes, Athena Research and Innovation Centre, Marousi, Greece(Archimedes,雅典研究与创新中心,Marousi,希腊)
Ergodicity of the underdamped mean-field Langevin dynamics
Université Paris-Saclay(巴黎萨克雷大学);Université Paris-Dauphine, PSL(巴黎多芬大学,PSL大学);The Chinese University of Hong Kong(香港中文大学);Vienna University of Technology(维也纳工业大学)
Global Convergence of Stochastic Gradient Hamiltonian Monte Carlo for Non-Convex Stochastic Optimization: Non-Asymptotic Performance Bounds and Momentum-Based Acceleration
The Chinese University of Hong Kong(香港中文大学);Rutgers University(罗格斯大学);Florida State University(佛罗里达州立大学)
随机梯度Hamilton Monte Carlo(SGHMC)是一种动量随机梯度算法,在随机梯度中加入受控的、适当缩放的高斯噪声,使迭代过程趋于全局极小值。许多工作报告了其在解决随机非凸优化问题的实践中的经验成功,特别是它已被观察到优于过阻尼Langevin蒙特卡罗方法,如随机梯度Langevin动力学(SGLD)在许多应用中。虽然SGHMC的渐近整体收敛性质是众所周知的,其有限时间性能还没有得到很好的理解。在这项工作中,我们研究了两个变种的SGHMC的基础上两个替代离散的欠阻尼朗之万扩散。我们提供了有限时间性能界的整体收敛的SGHMC解决显式常数随机非凸优化问题的变种。我们的研究结果导致人口和经验风险最小化问题的非渐近保证。对于一个固定的目标精度水平,对一类非凸问题,我们得到的复杂性界SGHMC可以比SGLD更紧。这些结果表明,在全局非凸优化的背景下,动量加速是可能的。