Accelerated Optimization in the PDE Framework Formulations for the Active Contour Case.

IF 2.1 3区 数学 Q3 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
SIAM Journal on Imaging Sciences Pub Date : 2020-01-01 Epub Date: 2020-11-19 DOI:10.1137/19m1304210
Anthony Yezzi, Ganesh Sundaramoorthi, Minas Benyamin
{"title":"Accelerated Optimization in the PDE Framework Formulations for the Active Contour Case.","authors":"Anthony Yezzi, Ganesh Sundaramoorthi, Minas Benyamin","doi":"10.1137/19m1304210","DOIUrl":null,"url":null,"abstract":"<p><p>Following the seminal work of Nesterov, accelerated optimization methods have been used to powerfully boost the performance of first-order, gradient based parameter estimation in scenarios where second-order optimization strategies are either inapplicable or impractical. Not only does accelerated gradient descent converge considerably faster than traditional gradient descent, but it also performs a more robust local search of the parameter space by initially overshooting and then oscillating back as it settles into a final configuration, thereby selecting only local minimizers with a basis of attraction large enough to contain the initial overshoot. This behavior has made accelerated and stochastic gradient search methods particularly popular within the machine learning community. In their recent PNAS 2016 paper, <i>A Variational Perspective on Accelerated Methods in Optimization</i>, Wibisono, Wilson, and Jordan demonstrate how a broad class of accelerated schemes can be cast in a variational framework formulated around the Bregman divergence, leading to continuum limit ODEs. We show how their formulation may be further extended to infinite dimensional manifolds (starting here with the geometric space of curves and surfaces) by substituting the Bregman divergence with inner products on the tangent space and explicitly introducing a distributed mass model which evolves in conjunction with the object of interest during the optimization process. The coevolving mass model, which is introduced purely for the sake of endowing the optimization with helpful dynamics, also links the resulting class of accelerated PDE based optimization schemes to fluid dynamical formulations of optimal mass transport.</p>","PeriodicalId":49528,"journal":{"name":"SIAM Journal on Imaging Sciences","volume":"13 4","pages":"2029-2062"},"PeriodicalIF":2.1000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8320808/pdf/nihms-1676294.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Journal on Imaging Sciences","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1137/19m1304210","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2020/11/19 0:00:00","PubModel":"Epub","JCR":"Q3","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Following the seminal work of Nesterov, accelerated optimization methods have been used to powerfully boost the performance of first-order, gradient based parameter estimation in scenarios where second-order optimization strategies are either inapplicable or impractical. Not only does accelerated gradient descent converge considerably faster than traditional gradient descent, but it also performs a more robust local search of the parameter space by initially overshooting and then oscillating back as it settles into a final configuration, thereby selecting only local minimizers with a basis of attraction large enough to contain the initial overshoot. This behavior has made accelerated and stochastic gradient search methods particularly popular within the machine learning community. In their recent PNAS 2016 paper, A Variational Perspective on Accelerated Methods in Optimization, Wibisono, Wilson, and Jordan demonstrate how a broad class of accelerated schemes can be cast in a variational framework formulated around the Bregman divergence, leading to continuum limit ODEs. We show how their formulation may be further extended to infinite dimensional manifolds (starting here with the geometric space of curves and surfaces) by substituting the Bregman divergence with inner products on the tangent space and explicitly introducing a distributed mass model which evolves in conjunction with the object of interest during the optimization process. The coevolving mass model, which is introduced purely for the sake of endowing the optimization with helpful dynamics, also links the resulting class of accelerated PDE based optimization schemes to fluid dynamical formulations of optimal mass transport.

主动轮廓情况下的 PDE 框架公式加速优化。
在涅斯捷罗夫的开创性工作之后,加速优化方法已被用于在二阶优化策略不适用或不切实际的情况下,有力地提高基于梯度的一阶参数估计的性能。与传统梯度下降法相比,加速梯度下降法不仅收敛速度快得多,而且对参数空间进行的局部搜索更加稳健,最初会出现超调,然后在最终配置中振荡回调,从而只选择局部最小值,其吸引力基础大到足以包含最初的超调。这种行为使得加速和随机梯度搜索方法在机器学习界特别流行。在最近发表的 2016 年美国国家科学院院刊论文《优化加速方法的变分视角》(A Variational Perspective on Accelerated Methods in Optimization)中,Wibisono、Wilson 和 Jordan 展示了如何在围绕布雷格曼发散(Bregman divergence)制定的变分框架中采用一大类加速方案,从而引出连续极限 ODE。我们展示了如何通过用切线空间上的内积代替布雷格曼发散,并明确引入分布式质量模型,在优化过程中与感兴趣的对象共同演化,从而将他们的公式进一步扩展到无限维流形(这里从曲线和曲面的几何空间开始)。引入共同演化的质量模型纯粹是为了赋予优化以有益的动态性,同时也将由此产生的基于 PDE 的加速优化方案与最优质量传输的流体动力学公式联系起来。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
SIAM Journal on Imaging Sciences
SIAM Journal on Imaging Sciences COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE-COMPUTER SCIENCE, SOFTWARE ENGINEERING
CiteScore
3.80
自引率
4.80%
发文量
58
审稿时长
>12 weeks
期刊介绍: SIAM Journal on Imaging Sciences (SIIMS) covers all areas of imaging sciences, broadly interpreted. It includes image formation, image processing, image analysis, image interpretation and understanding, imaging-related machine learning, and inverse problems in imaging; leading to applications to diverse areas in science, medicine, engineering, and other fields. The journal’s scope is meant to be broad enough to include areas now organized under the terms image processing, image analysis, computer graphics, computer vision, visual machine learning, and visualization. Formal approaches, at the level of mathematics and/or computations, as well as state-of-the-art practical results, are expected from manuscripts published in SIIMS. SIIMS is mathematically and computationally based, and offers a unique forum to highlight the commonality of methodology, models, and algorithms among diverse application areas of imaging sciences. SIIMS provides a broad authoritative source for fundamental results in imaging sciences, with a unique combination of mathematics and applications. SIIMS covers a broad range of areas, including but not limited to image formation, image processing, image analysis, computer graphics, computer vision, visualization, image understanding, pattern analysis, machine intelligence, remote sensing, geoscience, signal processing, medical and biomedical imaging, and seismic imaging. The fundamental mathematical theories addressing imaging problems covered by SIIMS include, but are not limited to, harmonic analysis, partial differential equations, differential geometry, numerical analysis, information theory, learning, optimization, statistics, and probability. Research papers that innovate both in the fundamentals and in the applications are especially welcome. SIIMS focuses on conceptually new ideas, methods, and fundamentals as applied to all aspects of imaging sciences.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信