arXiv:2604.06349cs.LGcs.AI2026-04

提出双层优化框架,让模型在无目标数据时也能泛化到未知领域。

Bi-Level Optimization for Single Domain Generalization

  • 用源数据构造代理域模拟分布变化,分离任务学习与领域建模。
  • 通过轻量级提示编码器生成调制信号,提升特征鲁棒性。
  • 无需二阶导数即可高效训练,适合缺乏目标数据的场景。

从单一标注源域泛化到未见目标域,且训练时不访问任何目标数据,是鲁棒机器学习中的核心挑战。本文针对这一研究较少的单域泛化(SDG)问题,提出BiSDG框架,通过双层优化显式解耦任务学习与领域建模。该方法利用标签保持变换对源数据构建代理域以模拟分布偏移;为捕捉领域特异性上下文,提出领域提示编码器,生成轻量级调制信号,通过特征逐元素线性调制生成增强特征。学习过程被建模为双层优化:内层在固定提示下优化任务性能,外层通过更新领域提示编码器来最大化跨代理域的泛化能力。进一步设计了无需二阶导数的实用梯度近似方案,实现高效双层训练。在多个SDG基准上的大量实验表明,BiSDG持续优于现有方法,在单域泛化设置下达到新最优性能。

原文摘要 · Abstract (English)

Generalizing from a single labeled source domain to unseen target domains, without access to any target data during training, remains a fundamental challenge in robust machine learning. We address this underexplored setting, known as Single Domain Generalization (SDG), by proposing BiSDG, a bi-level optimization framework that explicitly decouples task learning from domain modeling. BiSDG simulates distribution shifts through surrogate domains constructed via label-preserving transformations of the source data. To capture domain-specific context, we propose a domain prompt encoder that generates lightweight modulation signals to produce augmenting features via feature-wise linear modulation. The learning process is formulated as a bi-level optimization problem: the inner objective optimizes task performance under fixed prompts, while the outer objective maximizes generalization across the surrogate domains by updating the domain prompt encoder. We further develop a practical gradient approximation scheme that enables efficient bi-level training without second-order derivatives. Extensive experiments on various SGD benchmarks demonstrate that BiSDG consistently outperforms prior methods, setting new state-of-the-art performance in the SDG setting.

单域泛化双层优化领域自适应

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。