Dynamic stochastic optimization

Decision and Control(2014)

引用 4|浏览15
暂无评分
摘要
A framework for sequentially solving stochastic optimization problems with stochastic gradient descent is introduced. Two tracking criteria are considered, one based on being accurate with respect to the mean trajectory and the other based on being accurate in high probability (IHP). An off-line optimization problem is solved to find the constant step size and number of iterations to achieve the desired tracking accuracy. Simulations are used to confirm that this approach provides the desired tracking accuracy.
更多
查看译文
关键词
gradient methods,optimisation,probability,stochastic processes,tracking,IHP,dynamic stochastic optimization,in high probability,mean trajectory,off-line optimization problem,stochastic gradient descent,tracking criteria,adaptive optimization,gradient methods,stochastic optimization
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要