On regularized Radon-Nikodym differentiation
We discuss the problem of estimating Radon-Nikodym derivatives. This problem appears in various applications, such as covariate shift adaptation, likelihood-ratio testing, mutual information estimation, and conditional probability estimation. To address the above problem, we employ the general regularization scheme in reproducing kernel Hilbert spaces. The convergence rate of the corresponding regularized algorithm is established by taking into account both the smoothness of the derivative and the capacity of the space in which it is estimated. This is done in terms of general source conditions and the regularized Christoffel functions. We also find that the reconstruction of Radon-Nikodym derivatives at any particular point can be done with high order of accuracy. Our theoretical results are illustrated by numerical simulations.
Code (0)
등록된 구현이 없습니다.
Tasks
Mutual Information EstimationSimilar Papers 제목 키워드 기반
On The Radon--Nikodym Spectral Approach With Optimal Clustering
Problems of interpolation, classification, and clustering are considered. In the tenets of Radon--Nikodym approach $\langle f(\mathbf{x})\psi^2 \rangle / \langle\psi^2\rangle$, where the $\psi(\mathbf{x})$ is a linear fu…
ClusteringGeneral ClassificationRadon-Nikodym approximation in application to image analysis
For an image pixel information can be converted to the moments of some basis $Q_k$, e.g. Fourier-Mellin, Zernike, monomials, etc. Given sufficient number of moments pixel information can be completely recovered, for insu…
Image ReconstructionProofs for Folklore Theorems on the Radon-Nikodym Derivative
In this paper, rigorous statements and formal proofs are presented for both foundational and advanced folklore theorems on the Radon-Nikodym derivative. The cases of conditional and marginal probability measures are care…
Multiple-Instance Learning: Radon-Nikodym Approach to Distribution Regression Problem
For distribution regression problem, where a bag of $x$--observations is mapped to a single $y$ value, a one--step solution is proposed. The problem of random distribution to random value is transformed to random vector …
Multiple Instance LearningregressionConvergence Analysis of Nyström Subsampling in Covariate Shift Adaptation for Misspecified case
This paper investigates convergence properties of regularized Nyström subsampling applied to the unsupervised domain adaptation problem under covariate shift. We focus on the low-smoothness (misspecified) case where the …
Unsupervised Domain Adaptation