Multivariate Regression on the Grassmannian for Predicting Novel Domains
We study the problem of predicting how to recognise visual objects in novel domains with neither labelled nor unlabelled training data. Domain adaptation is now an established research area due to its value in ameliorating the issue of domain shift between train and test data. However, it is conventionally assumed that domains are discrete entities, and that at least unlabelled data is provided in testing domains. In this paper, we consider the case where domains are parametrised by a vector of continuous values (e.g., time, lighting or view angle). We aim to use such domain metadata to predict novel domains for recognition. This allows a recognition model to be pre-calibrated for a new domain in advance (e.g., future time or view angle) without waiting for data collection and re-training. We achieve this by posing the problem as one of multivariate regression on the Grassmannian, where we regress a domain's subspace (point on the Grassmannian) against an independent vector of domain parameters. We derive two novel methodologies to achieve this challenging task: a direct kernel regression, and an indirect method with better extrapolation properties. We evaluate our methods on two cross-domain visual recognition benchmarks, where they perform close to the upper bound of full data domain adaptation. This demonstrates that data is not necessary for domain adaptation if a domain can be parametrically described.
Code (0)
등록된 구현이 없습니다.
Tasks
Domain AdaptationregressionSimilar Papers 제목 키워드 기반
Metrics for Multivariate Dictionaries
Overcomplete representations and dictionary learning algorithms kept attracting a growing interest in the machine learning community. This paper addresses the emerging problem of comparing multivariate overcomplete repre…
Clusteringcompressed sensingDictionary LearningEEG+1Subspace metrics for multivariate dictionaries and application to EEG
Overcomplete representations and dictionary learning algorithms are attracting a growing interest in the machine learning community. This paper addresses the emerging problem of comparing multivari-ate overcomplete dicti…
ClusteringDictionary LearningEEGElectroencephalogram (EEG)Multivariate Probabilistic Regression with Natural Gradient Boosting
Many single-target regression problems require estimates of uncertainty along with the point predictions. Probabilistic regression algorithms are well-suited for these tasks. However, the options are much more limited wh…
regressionMachine Learning for Multi-Output Regression: When should a holistic multivariate approach be preferred over separate univariate ones?
Tree-based ensembles such as the Random Forest are modern classics among statistical learning methods. In particular, they are used for predicting univariate responses. In case of multiple outputs the question arises whe…
regressionBayesian Multivariate Quantile Regression with alternative Time-varying Volatility Specifications
This article proposes a novel Bayesian multivariate quantile regression to forecast the tail behavior of energy commodities, where the homoskedasticity assumption is relaxed to allow for time-varying volatility. In parti…
quantile regressionregression