paper-with-me

홈 › Papers

Attention Regularized Laplace Graph for Domain Adaptation

2022-10-15 · Lingkun Luo, Liming Chen, Shiqiang Hu

In leveraging manifold learning in domain adaptation (DA), graph embedding-based DA methods have shown their effectiveness in preserving data manifold through the Laplace graph. However, current graph embedding DA methods suffer from two issues: 1). they are only concerned with preservation of the underlying data structures in the embedding and ignore sub-domain adaptation, which requires taking into account intra-class similarity and inter-class dissimilarity, thereby leading to negative transfer; 2). manifold learning is proposed across different feature/label spaces separately, thereby hindering unified comprehensive manifold learning. In this paper, starting from our previous DGA-DA, we propose a novel DA method, namely Attention Regularized Laplace Graph-based Domain Adaptation (ARG-DA), to remedy the aforementioned issues. Specifically, by weighting the importance across different sub-domain adaptation tasks, we propose the Attention Regularized Laplace Graph for class-aware DA, thereby generating the attention regularized DA. Furthermore, using a specifically designed FEEL strategy, our approach dynamically unifies alignment of the manifold structures across different feature/label spaces, thus leading to comprehensive manifold learning. Comprehensive experiments are carried out to verify the effectiveness of the proposed DA method, which consistently outperforms the state-of-the-art DA methods on 7 standard DA benchmarks, i.e., 37 cross-domain image classification tasks including object, face, and digit images. An in-depth analysis of the proposed DA method is also discussed, including sensitivity, convergence, and robustness.

📄 PDF Abstract BibTeX arXiv:2210.08170

Code (0)

등록된 구현이 없습니다.

Tasks

Domain AdaptationGraph Embeddingimage-classificationImage Classification

Similar Papers 제목 키워드 기반

Quadratically Regularized Optimal Transport: nearly optimal potentials and convergence of discrete Laplace operators

2022-11-20 · Gilles Mordant, Stephen Zhang

We consider the conjecture proposed in Matsumoto, Zhang and Schiebinger (2022) suggesting that optimal transport with quadratic regularisation can be used to construct a graph whose discrete Laplace operator converges to…

Unsupervised Domain Adaptation using Regularized Hyper-graph Matching

2018-05-22 · Debasmit Das, C. S. George Lee

Domain adaptation (DA) addresses the real-world image classification problem of discrepancy between training (source) and testing (target) data distributions. We propose an unsupervised DA method that considers the prese…

Domain AdaptationGraph Matchingimage-classificationImage Classification+2

Droplet-LNO: Physics-Informed Laplace Neural Operators for Accurate Prediction of Droplet Spreading Dynamics on Complex Surfaces

2026-04-22 · Ganesh Sahadeo Meshram, Partha Pratim Chakrabarti, Suman Chakraborty arxiv

Spreading of liquid droplets on solid substrates constitutes a classic multiphysics problem with widespread applications ranging from inkjet printing, spray cooling, to biomedical microfluidic systems. Yet, accurate comp…

Mitigating Forgetting in Low Rank Adaptation

2025-12-19 · Joanna Sliwa, Frank Schneider, Philipp Hennig, Jose Miguel Hernandez-Lobato arxiv

Parameter-efficient fine-tuning methods, such as Low-Rank Adaptation (LoRA), enable fast specialization of large pre-trained models to different downstream applications. However, this process often leads to catastrophic …

parameter-efficient fine-tuningMathematical Reasoning

Regularized Laplacian Estimation and Fast Eigenvector Approximation

2011-12-01 · NeurIPS 2011 12 · Patrick O. Perry, Michael W. Mahoney

Recently, Mahoney and Orecchia demonstrated that popular diffusion-based procedures to compute a quick approximation to the first nontrivial eigenvector of a data graph Laplacian exactly solve certain regularized Semi-De…

regression