跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+1111新增论文
+874其中 AI 相关
+133已有论文修订
+97新增 AI 导读

arXiv 最近完成扫描:2026-11-20 06:44 · 全站最近入库:2026-11-19 19:09各信源进度 →

统计口径与数据新鲜度

统计 2026-11-19 07:16 — 2026-11-20 07:16(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-20 06:44最近发现新增版本:2026-11-19 19:09库内论文最新更新时间:2026-11-19 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

27,982 已收录论文23,249 AI 相关8,559 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-20 06:42(北京时间)
版本更新 · v4arXiv:2608.12704

Efficient Hessian-Free Methods for Multi-Objective Bilevel Optimization with a Nonconvex Lower-Level Objective

Yicong Jiang, Feihu Huang

原文摘要

Multi-objective bilevel optimization has wide applications in the AI area such as automated learning and multi-task meta-learning. Although some recent studies have investigated multi-objective bilevel optimization, many existing methods rely on the (strongly) convex lower level problems. In fact, these multi-objective bilevel learning problems are generally nonconvex, and particularly their lower level problems are nonconvex. To fill this gap, we propose a class of Multi-Objective Moreau Envelope based Hessian-free Algorithms (MOMEHA) for the multi-objective bilevel learning problems with a nonconvex lower level. Specifically, our method uses the Moreau envelope to formulate a multi-objective single-level relaxation that enforces lower-level first-order stationarity. In particular, our method retains computational advantages of being single-loop and Hessian-free in the multi-objective setting by incorporating a smooth weighted Tchebycheff scalarization. Furthermore, we propose a momentum variant of MOMEHA (i.e., MB-MOMEHA) for the stochastic multi-objective bilevel learning problems. Under the stated assumptions, we establish finite-iteration bounds on the Moreau gap and Pareto stationarity residuals under dynamically relaxed gap constraints in both deterministic and stochastic settings. Some experiments on few-shot meta-learning and neural architecture search demonstrate that our methods outperform the existing approaches in terms of Pareto front quality, validating their effectiveness and robustness.

math.OC · cs.LG