arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2307.08245math.OCcs.LG
收藏

具有非光滑外层目标函数的凸双层优化问题

Convex Bi-Level Optimization Problems with Non-smooth Outer Objective Function

Faculty of Data and Decision Sciences, Technion–Israel Institute of Technology(以色列理工学院数据与决策科学学院)

Roey Merchav, Shoham Sabach

AI总结:

针对外层目标非光滑的凸双层优化问题,提出易于实现的一阶Bi-SG方法,证明其内外层次线性收敛、外层强凸时线性收敛及迭代点收敛到最优解集。

摘要:

本文提出了双子梯度(Bi-Sub-Gradient,Bi-SG)方法,它将经典子梯度方法推广到凸双层优化问题的情形。这是一种一阶方法,非常易于实现:除了对内部优化问题执行一次近端梯度步外,它只需要计算相关的近端映射,或者计算外层非光滑目标函数的一个子梯度。我们在非常温和的假设下证明,Bi-SG能够求解双层优化问题,并且在内部和外部目标函数方面均达到次线性收敛速率。此外,如果外层目标函数还具有强凸性(仍可以是非光滑的),则外层收敛速率可以提升为线性速率。最后,我们证明了所生成序列到该双层问题最优解集的距离收敛于零。

英文摘要:

In this paper, we propose the Bi-Sub-Gradient (Bi-SG) method, which is a generalization of the classical sub-gradient method to the setting of convex bi-level optimization problems. This is a first-order method that is very easy to implement in the sense that it requires only a computation of the associated proximal mapping or a sub-gradient of the outer non-smooth objective function, in addition to a proximal gradient step on the inner optimization problem. We show, under very mild assumptions, that Bi-SG tackles bi-level optimization problems and achieves sub-linear rates both in terms of the inner and outer objective functions. Moreover, if the outer objective function is additionally strongly convex (still could be non-smooth), the outer rate can be improved to a linear rate. Last, we prove that the distance of the generated sequence to the set of optimal solutions of the bi-level problem converges to zero.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑