























Abstract:We address the open problem of training hypernetworks for Controllable Pareto Front Learning (CPFL) under split feasibility conditions with rigorous theoretical guarantees. We reformulate the constrained Pareto problem as a Bi-Level Scalarized Split Problem (BSSP) and propose the Adaptive Balanced Penalty (ABP) algorithm, whose three gradient components -- optimality, set feasibility, and image feasibility -- are blended through an adaptive indicator driven by a computable lower bound. Using a novel convex surrogate technique, we prove full-sequence convergence under standard convexity and Robbins-Monro step-size assumptions. The ABP penalty structure is then translated into a two-phase, feasibility-first training strategy for Hyper-MLP and HyperTrans architectures (ABP-HyperNet). To evaluate constrained CPFL, we introduce the Expected Feasible Hypervolume (EFHV), which jointly captures solution quality and constraint satisfaction. Experiments on five multi-objective benchmarks validate the ABP solver against ground truth, while three multi-task learning datasets demonstrate that ABP-HyperNet achieves up to 2.3x higher EFHV than unconstrained baselines by raising feasibility from 36-49% to 87-100%.
| Comments: | 36 pages, 18 figures, 12 tables. Submitted to Neural Networks (Elsevier) |
| Subjects: | Machine Learning (cs.LG); Optimization and Control (math.OC) |
| MSC classes: | 90C29, 90C25, 68T07 |
| Cite as: | arXiv:2605.19306 [cs.LG] |
| (or arXiv:2605.19306v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2605.19306 arXiv-issued DOI via DataCite (pending registration) |
From: Hoang Nguyen Viet [view email]
[v1]
Tue, 19 May 2026 03:37:22 UTC (3,283 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。