提出一种自适应混合采样的SGD方法,实现无需先验知识的迁移学习优化。
Mixed-Sample SGD: an End-to-end Analysis of Supervised Transfer Learning
- 设计动态混合采样SGD,根据源数据质量自动调整采样比例
- 理论证明收敛速度为1/√T,性能自适应源数据质量
- 适用于线性回归等凸损失任务,适合缺乏源数据质量信息的场景
监督迁移学习(STL)中,学习者同时拥有源域和目标域的标注样本。现有理论研究多关注统计特性,对高效优化关注较少。本文提出一种在源域与目标域间交替采样的随机梯度下降(SGD)算法,无需事先了解源数据质量即可保持统计迁移优势。核心挑战在于如何在每步SGD中设计自适应子采样机制,以在源数据有用时充分利用,在源数据无用甚至有害时减少其影响。我们证明,对于一般预测任务且损失函数为凸的情况,该混合采样SGD是可行的,其理论基础是跟踪一系列约束凸规划序列以维持迁移保证。在平方损失下的线性回归具体场景中,该方法可收敛至目标域上表现自适应于源数据质量的解,收敛速率为1/√T。合成与真实数据实验验证了理论结果。
原文摘要 · Abstract (English)
Theoretical works on supervised transfer learning (STL) -- where the learner has access to labeled samples from both source and target distributions -- have for the most part focused on statistical aspects of the problem, while efficient optimization has received less attention. We consider the problem of designing an SGD procedure for STL that alternates sampling between source and target data, while maintaining statistical transfer guarantees without prior knowledge of the quality of the source data. A main algorithmic difficulty is in understanding how to design such an adaptive sub-sampling mechanism at each SGD step, to automatically gain from the source when it is informative, or bias towards the target and avoid negative transfer when the source is less informative. We show that, such a mixed-sample SGD procedure is feasible for general prediction tasks with convex losses, rooted in tracking an abstract sequence of constrained convex programs that serve to maintain the desired transfer guarantees. We instantiate these results in the concrete setting of linear regression with square loss, and show that the procedure converges, with $1/\sqrt{T}$ rate, to a solution whose statistical performance on the target is adaptive to the a priori unknown quality of the source. Experiments with synthetic and real datasets support the theory.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。