Online Methods for Complex Stochastic Optimization Problems
Online Methods for Complex Stochastic Optimization Problems
批准号:
2585444
负责人:
金额:
$0.0万
依托单位:
依托单位国家:
英国
项目类别:
Studentship
财政年份:
2019
资助国家:
英国
项目状态:
未结题
起止时间:
2019 至 --
中文摘要
我的研究主要包括在随机优化的背景下检查这类自适应步长算法。近年来,这种算法已经成为深度学习领域成功的一个不可或缺的组成部分,使得以前不切实际的神经架构可以在大量数据上进行训练。用于随机优化的自适应步长算法扩展了随机梯度下降,这是一种用于拟合各类统计和ML模型的技术,通过在训练时利用额外的数据,使其更加健壮和高效。然而,直到最近,人们对这些自适应步长算法的实际性能知之甚少,因为许多重要的性质,如稳定性和概率收敛,都是不确定的。最近的工作是试图分离这些性质和它们成立的条件--我正在进行的研究将旨在扩大我们知道这些性质成立的条件,着眼于削弱标准设置中的假设(也加强性质本身),并考察算法在相关数据条件下的行为,主要集中在马尔可夫动力学上。这项工作将有助于增强对自适应步长算法性能的信心,鉴于关键基础设施中依赖于使用自适应步长算法的机器学习技术的日益普及,这一点将变得越来越重要。这项工作还将增加自适应步长算法可以应用的设置范围,例如训练经常需要马尔科夫条件的强化学习算法。
英文摘要
My research primarily consists of examining the class of adaptive stepsize algorithms in the context of stochastic optimisation. In recent years, such algorithms have been an integral component to the success of the field of deep learning, allowing previously impractical neural architectures to be trained on huge swathes of data. Adaptive stepsize algorithms for stochastic optimisation extend stochastic gradient descent, a technique for fitting classes of statistical and ML models, to be more robust and efficient by utilising additional data whilst training. Until recently, however, relatively little was known about the practical performance of these adaptive stepsize algorithms with many important properties, such as stability and probabilistic convergence, being undetermined. Recent work has been undertaken to try and isolate these properties and the conditions in which they hold - The research I am undertaking will aim to widen the conditions in which we know that these properties hold, looking toward weakening the assumptions in the standard setting (also strengthening the properties themselves), and also looking at how the algorithms behave in condition of dependent data, mostly focusing on markovian dynamics. This work will facilitate increased confidence in the performance of adaptive step size algorithms which will become increasingly more important given the growing prevalence of machine learning techniques using them being relied upon in critical infrastructure. This work will also increase the range of settings in which adaptive stepsize algorithms can be applied such as training reinforcement learning algorithms which often entail Markovian conditions.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
国内基金
海外基金
Computational Methods for Analyzing Toponome Data
-
批准号:60601030
-
项目类别:青年科学基金项目
-
资助金额:17.0万元
-
批准年份:2006
-
负责人:Axel Mosig
-
依托单位: