Implicit Bayes Adaptation: A Collaborative Transport Approach

2023-04-17 · Bo Jiang, Hamid Krim, Tianfu Wu, Derya Cansever

The power and flexibility of Optimal Transport (OT) have pervaded a wide spectrum of problems, including recent Machine Learning challenges such as unsupervised domain adaptation. Its essence of quantitatively relating two probability distributions by some optimal metric, has been creatively exploited and shown to hold promise for many real-world data challenges. In a related theme in the present work, we posit that domain adaptation robustness is rooted in the intrinsic (latent) representations of the respective data, which are inherently lying in a non-linear submanifold embedded in a higher dimensional Euclidean space. We account for the geometric properties by refining the $l^2$ Euclidean metric to better reflect the geodesic distance between two distinct representations. We integrate a metric correction term as well as a prior cluster structure in the source data of the OT-driven adaptation. We show that this is tantamount to an implicit Bayesian framework, which we demonstrate to be viable for a more robust and better-performing approach to domain adaptation. Substantiating experiments are also included for validation purposes.

📄 PDF Abstract BibTeX arXiv:2304.08298

Code (0)

등록된 구현이 없습니다.

Tasks

Domain Adaptation Unsupervised Domain Adaptation

Collaborative Multi-source Domain Adaptation Through Optimal Transport

2024-04-09 · Omar Ghannou, Younès Bennani

Multi-source Domain Adaptation (MDA) seeks to adapt models trained on data from multiple labeled source domains to perform effectively on an unlabeled target domain data, assuming access to sources data. To address the c…

Domain Adaptation Federated Learning

Factorization Machines for Data with Implicit Feedback

2018-12-19 · Loni Babak, Larson Martha, Hanjalic Alan

In this work, we propose FM-Pair, an adaptation of Factorization Machines with a pairwise loss function, making them effective for datasets with implicit feedback. The optimization model in FM-Pair is based on the BPR (B…

Collaborative Filtering Learning-To-Rank

Probabilistic Geometric Alignment via Bayesian Latent Transport for Domain-Adaptive Foundation Models

2026-03-24 · Aueaphum Aueawatthanaphisut, Kuepon Auewattanapisut arxiv

Adapting large-scale foundation models to new domains with limited supervision remains a fundamental challenge due to latent distribution mismatch, unstable optimization dynamics, and miscalibrated uncertainty propagatio…

Transfer Learning Domain Adaptation

Move What Matters: Parameter-Efficient Domain Adaptation via Optimal Transport Flow for Collaborative Perception

2026-02-12 · Zesheng Jia, Jin Wang, Siao Liu, Lingzhi Li 외 arxiv

Fast domain adaptation remains a fundamental challenge for deploying multi-agent systems across diverse environments in Vehicle-to-Everything (V2X) collaborative perception. Despite the success of Parameter-Efficient Fin…

parameter-efficient fine-tuning Domain Adaptation

SetRank: A Setwise Bayesian Approach for Collaborative Ranking from Implicit Feedback

2020-02-23 · Chao Wang, HengShu Zhu, Chen Zhu, Chuan Qin 외

The recent development of online recommender systems has a focus on collaborative ranking from implicit feedback, such as user clicks and purchases. Different from explicit ratings, which reflect graded user preferences,…

Collaborative Ranking Recommendation Systems