Optimal Transport-Based Domain Adaptation for Rotated Linear Regression
Optimal Transport (OT) has proven effective for domain adaptation (DA) by aligning distributions across domains with differing statistical properties. Building on the approach of Courty et al. (2016), who mapped source data to the target domain for improved model transfer, we focus on a supervised DA problem involving linear regression models under rotational shifts. This ongoing work considers cases where source and target domains are related by a rotation-common in applications like sensor calibration or image orientation. We show that in $\mathbb{R}^2$ , when using a p-norm cost with $p $\ge$ 2$, the optimal transport map recovers the underlying rotation. Based on this, we propose an algorithm that combines K-means clustering, OT, and singular value decomposition (SVD) to estimate the rotation angle and adapt the regression model. This method is particularly effective when the target domain is sparsely sampled, leveraging abundant source data for improved generalization. Our contributions offer both theoretical and practical insights into OT-based model adaptation under geometric transformations.
Code (0)
등록된 구현이 없습니다.
Tasks
Domain AdaptationregressionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Geometric Domain Adaptation via Optimal Transport for Linear Regression in R^2
Optimal Transport has become recently a powerful method for domain adaptation by aligning source and target distributions. We study a supervised domain adaptation problem where source and target domains are related by a …
Domain AdaptationStructured Optimal Transport
Optimal Transport has recently gained interest in machine learning for applications ranging from domain adaptation, sentence similarities to deep learning. Yet, its ability to capture frequently occurring structure beyon…
BIG-bench Machine LearningDomain AdaptationSentenceConcentration bounds for linear Monge mapping estimation and optimal transport domain adaptation
This article investigates the quality of the estimator of the linear Monge mapping between distributions. We provide the first concentration result on the linear mapping operator and prove a sample complexity of $n^{-1/2…
Domain AdaptationConnecting adversarial attacks and optimal transport for domain adaptation
We present a novel algorithm for domain adaptation using optimal transport. In domain adaptation, the goal is to adapt a classifier trained on the source domain samples to the target domain. In our method, we use optimal…
Domain AdaptationCycle monotonicity of adversarial attacks for optimal domain adaptation
We reveal an intriguing connection between adversarial attacks and cycle monotone maps, also known as optimal transport maps. Based on this finding, we developed a novel method named source fiction for semi-supervised op…
Domain AdaptationSemi-supervised Domain Adaptation