Provable Optimization for Adversarial Fair Self-supervised Contrastive Learning
원문 초록
This paper studies learning fair encoders in a self-supervised learning (SSL) setting, in which all data are unlabeled and only a small portion of them are annotated with sensitive attribute. Adversarial fair representation learning is well suited for this scenario by minimizing a contrastive loss over unlabeled data while maximizing an adversarial loss of predicting the sensitive attribute over the data with sensitive attribute. Nevertheless, optimizing adversarial fair representation learning presents significant challenges due to solving a non-convex non-concave minimax game. The complexity deepens when incorporating a global contrastive loss that contrasts each anchor data point against all other examples. A central question is ``{\it can we design a provable yet efficient algorithm for solving adversarial fair self-supervised contrastive learning}?'' Building on advanced optimization techniques, we propose a stochastic algorithm dubbed SoFCLR with a convergence analysis under reasonable conditions without requring a large batch size. We conduct extensive experiments to demonstrate the effectiveness of the proposed approach for downstream classification with eight fairness notions.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
IPCL: Iterative Pseudo-Supervised Contrastive Learning to Improve Self-Supervised Feature Representation
Hypergraph Contrastive Learning for Drug Trafficking Community Detection
Multi-modal Siamese Network for Entity Alignment
Self-Supervised Learning for Multimedia Recommendation
Boosting Generative Adversarial Transferability with Self-supervised Vision Transformer Features
Topology-Aware Modeling for Unsupervised Simulation-to-Reality Point Cloud Recognition
토론
이 논문과 연결된 포럼 글이 아직 없습니다.