Max-Margin Invariant Features from Transformed Unlabelled Data
The study of representations invariant to common transformations of the data is important to learning. Most techniques have focused on local approximate invariance implemented within expensive optimization frameworks lacking explicit theoretical guarantees. In this paper, we study kernels that are invariant to a unitary group while having theoretical guarantees in addressing the important practical issue of unavailability of transformed versions of labelled data. A problem we call the Unlabeled Transformation Problem which is a special form of semi-supervised learning and one-shot learning. We present a theoretically motivated alternate approach to the invariant kernel SVM based on which we propose Max-Margin Invariant Features (MMIF) to solve this problem. As an illustration, we design an framework for face recognition and demonstrate the efficacy of our approach on a large scale semi-synthetic dataset with 153,000 images and a new challenging protocol on Labelled Faces in the Wild (LFW) while out-performing strong baselines.
Code (0)
등록된 구현이 없습니다.
Tasks
Face RecognitionOne-Shot LearningMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Max-Margin Invariant Features from Transformed Unlabeled Data
The study of representations invariant to common transformations of the data is important to learning. Most techniques have focused on local approximate invariance implemented within expensive optimization frameworks lac…
Face RecognitionOne-Shot LearningNeural View Synthesis and Matching for Semi-Supervised Few-Shot Learning of 3D Pose
We study the problem of learning to estimate the 3D object pose from a few labelled examples and a collection of unlabelled data. Our main contribution is a learning framework, neural view synthesis and matching, that ca…
3D Pose EstimationFew-Shot LearningPose EstimationLearning invariant features using the Transformed Indian Buffet Process
Identifying the features of objects becomes a challenge when those features can change in their appearance. We introduce the Transformed Indian Buffet Process (tIBP), and use it to define a nonparametric Bayesian model t…
Unsupervised Domain Adaptation for Brain Vessel Segmentation through Transwarp Contrastive Learning
Unsupervised domain adaptation (UDA) aims to align the labelled source distribution with the unlabelled target distribution to obtain domain-invariant predictive models. Since cross-modality medical data exhibit signific…
Contrastive LearningDomain AdaptationMedical Image AnalysisUnsupervised Domain AdaptationSemi-Generative Modelling: Covariate-Shift Adaptation with Cause and Effect Features
Current methods for covariate-shift adaptation use unlabelled data to compute importance weights or domain-invariant features, while the final model is trained on labelled data only. Here, we consider a particular case o…
Domain Adaptation