English
Related papers

Related papers: Testing Hypotheses by Regularized Maximum Mean Dis…

200 papers

Kernel mean embedding (KME) is a powerful tool to analyze probability measures for data, where the measures are conventionally embedded into a reproducing kernel Hilbert space (RKHS). In this paper, we generalize KME to that of von…

Machine Learning · Statistics 2020-07-30 Yuka Hashimoto , Isao Ishikawa , Masahiro Ikeda , Fuyuta Komura , Yoshinobu Kawahara

Sample reweighting is one of the most widely used methods for correcting the error of least squares learning algorithms in reproducing kernel Hilbert spaces (RKHS), that is caused by future data distributions that are different from the…

Machine Learning · Computer Science 2023-07-24 Duc Hoan Nguyen , Sergei V. Pereverzyev , Werner Zellinger

This paper explores methods for estimating or approximating the total variation distance and the chi-squared divergence of probability measures within topological sample spaces, using independent and identically distributed samples. Our…

Information Theory · Computer Science 2023-12-20 Chong Xiao Wang , Wee Peng Tay

In this paper, we propose a novel approach to detect heteroskedasticity in regression models with regressors contaminated by measurement error. Specifically, inspired by the integrated conditional moment (ICM) approach, we construct test…

Econometrics · Economics 2026-05-20 Xiaojun Song , Jichao Yuan

In this paper we study the problem of pointwise density estimation from observations with multiplicative measurement errors. We elucidate the main feature of this problem: the influence of the estimation point on the estimation accuracy. In…

Methodology · Statistics 2018-07-13 Denis Belomestny , Alexander Goldenshluger

Experiments often yield non-identically distributed data for statistical analysis. Tests of hypothesis under such set-ups are generally performed using the likelihood ratio test, which is non-robust with respect to outliers and model…

Statistics Theory · Mathematics 2017-07-25 Abhik Ghosh , Ayanendranath Basu

This article presents a general framework for the transport of probability measures towards minimum divergence generative modeling and sampling using ordinary differential equations (ODEs) and Reproducing Kernel Hilbert Spaces (RKHSs),…

Machine Learning · Statistics 2024-02-14 Biraj Pandey , Bamdad Hosseini , Pau Batlle , Houman Owhadi

We investigate the discrepancy principle for choosing smoothing parameters for kernel density estimation. The method is based on the distance between the empirical and estimated distribution functions. We prove some new positive and…

Statistics Theory · Mathematics 2015-03-19 Thoralf Mildenberger

We introduce two kernels that extend the mean map, which embeds probability measures in Hilbert spaces. The generative mean map kernel (GMMK) is a smooth similarity measure between probabilistic models. The latent mean map kernel (LMMK)…

Machine Learning · Computer Science 2010-05-04 Nishant A. Mehta , Alexander G. Gray

Kernelized Stein discrepancy (KSD) is a score-based discrepancy widely used in goodness-of-fit tests. It can be applied even when the target distribution has an unknown normalising factor, such as in Bayesian analysis. We show theoretically…

Machine Learning · Statistics 2023-06-06 Xing Liu , Andrew B. Duncan , Axel Gandy

We present an operator-free, measure-theoretic approach to the conditional mean embedding (CME) as a random variable taking values in a reproducing kernel Hilbert space. While the kernel mean embedding of unconditional distributions has…

Machine Learning · Computer Science 2021-01-11 Junhyung Park , Krikamol Muandet

In supervised learning using kernel methods, we often encounter a large-scale finite-sum minimization over a reproducing kernel Hilbert space (RKHS). Large-scale finite-sum problems can be solved using efficient variants of Newton method,…

Machine Learning · Computer Science 2022-06-07 Ting-Jui Chang , Shahin Shahrampour

In this paper we revisit the binary hypothesis testing problem with one-sided compression. Specifically we assume that the distribution in the null hypothesis is a mixture distribution of iid components. The distribution under the…

Information Theory · Computer Science 2022-07-07 Minh Thanh Vu

The maximum mean discrepancy and Wasserstein distance are popular distance measures between distributions and play important roles in many machine learning problems such as metric learning, generative modeling, domain adaption, and…

Machine Learning · Computer Science 2025-01-22 Dong Qiao , Jicong Fan

The distributed hypothesis testing problem with full side-information is studied. The trade-off (reliability function) between the two types of error exponents under limited rate is studied in the following way. First, the problem is…

Information Theory · Computer Science 2019-04-24 Nir Weinberger , Yuval Kochman

We propose a general method for constructing robust permutation tests under data corruption. The proposed tests effectively control the non-asymptotic type I error under data corruption, and we prove their consistency in power under minimal…

Machine Learning · Statistics 2025-04-28 Antonin Schrab , Ilmun Kim

We introduce a new discrepancy score between two distributions that gives an indication on their similarity. While much research has been done to determine if two samples come from exactly the same distribution, much less research…

Machine Learning · Computer Science 2012-10-16 Maayan Harel , Shie Mannor

In finite mixture models, apart from underlying mixing measure, true kernel density function of each subpopulation in the data is, in many scenarios, unknown. Perhaps the most popular approach is to choose some kernel functions that we…

Statistics Theory · Mathematics 2017-09-26 Nhat Ho , XuanLong Nguyen , Ya'acov Ritov

Randomly censored survival data are frequently encountered in applied sciences including biomedical or reliability applications and clinical trial analyses. Testing the significance of statistical hypotheses is crucial in such analyses to…

Methodology · Statistics 2019-01-08 Abhik Ghosh , Ayanendranath Basu , Leandro Pardo

Probabilistic generative models provide a powerful framework for representing data that avoids the expense of manual annotation typically needed by discriminative approaches. Model selection in this generative setting can be challenging,…

‹ Prev 1 8 9 10 Next ›