跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2607.22149 · v2

Unbiased Open World Regularization for Fair Self-Supervised Learning

首次提交 2026-07-24 17:51
版本更新 2026-11-04 18:44
雷达观测 2026-11-05 11:10
arXiv ↗PDF ↗

摘要

Despite recent advances, self-supervised learning (SSL) models and Joint-Embedding Predictive Architectures (JEPAs) remain susceptible to spurious correlations. Many anti-collapse regularizers constrain the global representation distribution to match a prescribed target, such as a multivariate Gaussian or the uniform distribution on the sphere. However, global matching does not prevent groups defined by a bias attribute from occupying distinct regions of the representation space. We show that existing encoder-only debiasing regularizers, including EnD and FSCL, can be interpreted as restricted forms of conditional distribution matching. Building on this interpretation, we introduce Unbiased Open World (UOW), which matches the representation distribution within each observed bias group to a common target distribution. At the population optimum, using a discriminative conditional discrepancy guarantees independence between the representation and the targeted attribute. We instantiate UOW in Gaussian and spherical spaces and evaluate it across controlled synthetic settings and real-world fairness benchmarks. Across Synthetic Engraving, Colored MNIST, CelebA, and Waterbirds, conditional matching substantially reduces bias compared with global regularization while preserving useful downstream representations. Jointly conditioning on multiple bias attributes further reduces intersectional disparities missed by separate marginal constraints. Finally, experiments on CelebA show that models can be trained from random initialization using UOW as a pretraining objective, provided checkpoints are selected according to fairness-aware validation criteria.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只观测到一个版本,无法比较变化。之后收录新版本时,会在这里对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v2 · 2026-11-04 18:44 · 最新观测版本

Unbiased Open World Regularization for Fair Self-Supervised Learning

Despite recent advances, self-supervised learning (SSL) models and Joint-Embedding Predictive Architectures (JEPAs) remain susceptible to spurious correlations. Many anti-collapse regularizers constrain the global representation distribution to match a prescribed target, such as a multivariate Gaussian or the uniform distribution on the sphere. However, global matching does not prevent groups defined by a bias attribute from occupying distinct regions of the representation space. We show that existing encoder-only debiasing regularizers, including EnD and FSCL, can be interpreted as restricted forms of conditional distribution matching. Building on this interpretation, we introduce Unbiased Open World (UOW), which matches the representation distribution within each observed bias group to a common target distribution. At the population optimum, using a discriminative conditional discrepancy guarantees independence between the representation and the targeted attribute. We instantiate UOW in Gaussian and spherical spaces and evaluate it across controlled synthetic settings and real-world fairness benchmarks. Across Synthetic Engraving, Colored MNIST, CelebA, and Waterbirds, conditional matching substantially reduces bias compared with global regularization while preserving useful downstream representations. Jointly conditioning on multiple bias attributes further reduces intersectional disparities missed by separate marginal constraints. Finally, experiments on CelebA show that models can be trained from random initialization using UOW as a pretraining objective, provided checkpoints are selected according to fairness-aware validation criteria.

查看此版本解读 →查看此版本原文 ↗