paper-with-me

홈 › Papers

Discriminative Noise Robust Sparse Orthogonal Label Regression-based Domain Adaptation

2021-01-09 · Lingkun Luo, Liming Chen, Shiqiang Hu

Domain adaptation (DA) aims to enable a learning model trained from a source domain to generalize well on a target domain, despite the mismatch of data distributions between the two domains. State-of-the-art DA methods have so far focused on the search of a latent shared feature space where source and target domain data can be aligned either statistically and/or geometrically. In this paper, we propose a novel unsupervised DA method, namely Discriminative Noise Robust Sparse Orthogonal Label Regression-based Domain Adaptation (DOLL-DA). The proposed DOLL-DA derives from a novel integrated model which searches a shared feature subspace where source and target domain data are, through optimization of some repulse force terms, discriminatively aligned statistically, while at same time regresses orthogonally data labels thereof using a label embedding trick. Furthermore, in minimizing a novel Noise Robust Sparse Orthogonal Label Regression(NRS_OLR) term, the proposed model explicitly accounts for data outliers to avoid negative transfer and introduces the property of sparsity when regressing data labels. Due to the character restriction. Please read our detailed abstract in our paper.

📄 PDF Abstract BibTeX arXiv:2101.04563

Code (0)

등록된 구현이 없습니다.

Tasks

Domain Adaptationregression

Similar Papers 제목 키워드 기반

Embedded Multi-label Feature Selection via Orthogonal Regression

2024-03-01 · Xueyuan Xu, Fulin Wei, Tianyuan Jia, Li Zhuo 외

In the last decade, embedded multi-label feature selection methods, incorporating the search for feature subsets into model optimization, have attracted considerable attention in accurately evaluating the importance of f…

feature selectionModel OptimizationMulti-Label ClassificationMUlTI-LABEL-ClASSIFICATION+1

Feature Selection Based on Orthogonal Constraints and Polygon Area

2024-02-25 · Zhenxing Zhang, Jun Ge, Zheng Wei, Chunjie Zhou 외

The goal of feature selection is to choose the optimal subset of features for a recognition task by evaluating the importance of each feature, thereby achieving effective dimensionality reduction. Currently, proposed fea…

Dimensionality Reductionfeature selection

Orthogonal Matching Pursuit with Noisy and Missing Data: Low and High Dimensional Results

2012-06-05 · Yudong Chen, Constantine Caramanis

Many models for sparse regression typically assume that the covariates are known completely, and without noise. Particularly in high-dimensional applications, this is often not the case. This paper develops efficient OMP…

regression

Signal and Noise Statistics Oblivious Orthogonal Matching Pursuit

2018-06-02 · ICML 2018 7 · Sreejith Kallummil, Sheetal Kalyani

Orthogonal matching pursuit (OMP) is a widely used algorithm for recovering sparse high dimensional vectors in linear regression models. The optimal performance of OMP requires \textit{a priori} knowledge of either the s…

regression

Swapping Variables for High-Dimensional Sparse Regression with Correlated Measurements

2013-12-05 · Divyanshu Vats, Richard G. Baraniuk

We consider the high-dimensional sparse linear regression problem of accurately estimating a sparse vector using a small number of linear measurements that are contaminated by noise. It is well known that the standard ca…

regressionVocal Bursts Intensity Prediction