Empirically Estimable Classification Bounds Based on a New Divergence Measure
Information divergence functions play a critical role in statistics and information theory. In this paper we show that a non-parametric f-divergence measure can be used to provide improved bounds on the minimum binary classification probability of error for the case when the training and test data are drawn from the same distribution and for the case where there exists some mismatch between training and test distributions. We confirm the theoretical results by designing feature selection algorithms using the criteria from these bounds and by evaluating the algorithms on a series of pathological speech classification tasks.
Code (0)
등록된 구현이 없습니다.
Tasks
Binary ClassificationClassificationfeature selectionGeneral ClassificationSimilar Papers 제목 키워드 기반
Practicality of generalization guarantees for unsupervised domain adaptation with neural networks
Understanding generalization is crucial to confidently engineer and deploy machine learning models, especially when deployment implies a shift in the data domain. For such domain adaptation problems, we seek generalizati…
Domain AdaptationGeneralization Boundsimage-classificationImage Classification+1Convergence Rates for Empirical Estimation of Binary Classification Bounds
Bounding the best achievable error probability for binary classification problems is relevant to many applications including machine learning, signal processing, and information theory. Many bounds on the Bayes binary cl…
Binary ClassificationClassificationGeneral ClassificationPAC-Bayesian Bounds on Constrained f-Entropic Risk Measures
PAC generalization bounds on the risk, when expressed in terms of the expected loss, are often insufficient to capture imbalances between subgroups in the data. To overcome this limitation, we introduce a new family of r…
Novel Change of Measure Inequalities with Applications to PAC-Bayesian Bounds and Monte Carlo Estimation
We introduce several novel change of measure inequalities for two families of divergences: $f$-divergences and $\alpha$-divergences. We show how the variational representation for $f$-divergences leads to novel change of…
Learning to Approximate a Bregman Divergence
Bregman divergences generalize measures such as the squared Euclidean distance and the KL divergence, and arise throughout many areas of machine learning. In this paper, we focus on the problem of approximating an arbitr…
ClusteringMetric Learning