English
Related papers

Related papers: Multicalibrated Partitions for Importance Weights

200 papers

Multiple importance sampling (MIS) is an increasingly used methodology where several proposal densities are used to approximate integrals, generally involving target probability density functions. The use of several proposals allows for a…

Statistics Theory · Mathematics 2022-07-12 Rahul Mukerjee , Víctor Elvira

Mixture proportion estimation (MPE) is the problem of estimating the weight of a component distribution in a mixture, given samples from the mixture and component. This problem constitutes a key part in many "weakly supervised learning"…

Machine Learning · Computer Science 2016-06-01 Harish G. Ramaswamy , Clayton Scott , Ambuj Tewari

A multi-label classifier estimates the binary label state (relevant vs irrelevant) for each of a set of concept labels, for any given instance. Probabilistic multi-label classifiers provide a predictive posterior distribution over all…

Machine Learning · Computer Science 2022-09-12 Laurence A. F. Park , Jesse Read

A learned generative model often produces biased statistics relative to the underlying data distribution. A standard technique to correct this bias is importance sampling, where samples from the model are weighted by the likelihood ratio…

Machine Learning · Statistics 2019-11-05 Aditya Grover , Jiaming Song , Alekh Agarwal , Kenneth Tran , Ashish Kapoor , Eric Horvitz , Stefano Ermon

Missing data is an universal problem in statistics. We develop a unified framework for estimating parameters defined by general estimating equations under a missing-at-random (MAR) mechanism, based on generalized entropy calibration…

Methodology · Statistics 2026-03-31 Mst Moushumi Pervin , Hengfang Wang , Jae Kwang Kim

We consider the problem of cost sensitive multiclass classification, where we would like to increase the sensitivity of an important class at the expense of a less important one. We adopt an {\em apportioned margin} framework to address…

Machine Learning · Computer Science 2020-02-05 Lee-Ad Gottlieb , Eran Kaufman , Aryeh Kontorovich

Feature attribution a.k.a. input salience methods which assign an importance score to a feature are abundant but may produce surprisingly different results for the same model on the same input. While differences are expected if disparate…

Computation and Language · Computer Science 2022-11-10 Jasmijn Bastings , Sebastian Ebert , Polina Zablotskaia , Anders Sandholm , Katja Filippova

We introduce a framework for robust uncertainty quantification in situations where labeled training data are corrupted, through noisy or missing labels. We build on conformal prediction, a statistical tool for generating prediction sets…

Machine Learning · Computer Science 2026-02-27 Shai Feldman , Stephen Bates , Yaniv Romano

Pseudoentropy characterizations provide a quantitatively precise demonstration of the close relationship between computational hardness and computational randomness. We prove a unified pseudoentropy characterization that generalizes and…

Computational Complexity · Computer Science 2025-09-05 Lunjia Hu , Salil Vadhan

Calibration$\unicode{x2014}$the problem of ensuring that predicted probabilities align with observed class frequencies$\unicode{x2014}$is a basic desideratum for reliable prediction with machine learning systems. Calibration error is…

Machine Learning · Statistics 2026-03-02 Eugène Berta , Sacha Braun , David Holzmüller , Francis Bach , Michael I. Jordan

With the increasing penetration of machine learning applications in critical decision-making areas, calls for algorithmic fairness are more prominent. Although there have been various modalities to improve algorithmic fairness through…

Machine Learning · Computer Science 2024-05-21 Zhihao Hu , Yiran Xu , Mengnan Du , Jindong Gu , Xinmei Tian , Fengxiang He

Given a probability distribution P, what is the minimum amount of bits needed to store a value x sampled according to P, such that x can later be recovered (except with some small probability)? Or, what is the maximum amount of uniform…

Information Theory · Computer Science 2007-07-13 Thomas Holenstein , Renato Renner

Following [1], the aim of this paper is to analyze the relative weighted entropy involving the central moments weight functions. We compare the standard relative entropy with the weighted case in two particular forms of Gaussian…

Information Theory · Computer Science 2015-06-23 Salimeh Yasaei Sekeh , Adriano Polpo

In machine learning, classification tasks serve as the cornerstone of a wide range of real-world applications. Reliable, trustworthy classification is particularly intricate in biomedical settings, where the ground truth is often inherently…

Machine Learning · Computer Science 2023-11-14 Aina Tersol Montserrat , Alexander R. Loftus , Yael Daihes

Importance-weighting is a popular and well-researched technique for dealing with sample selection bias and covariate shift. It has desirable characteristics such as unbiasedness, consistency and low computational complexity. However,…

Machine Learning · Statistics 2019-03-12 Wouter M. Kouw , Marco Loog

Introduced as a notion of algorithmic fairness, multicalibration has proved to be a powerful and versatile concept with implications far beyond its original intent. This stringent notion -- that predictions be well-calibrated across a rich…

Machine Learning · Computer Science 2022-06-17 Parikshit Gopalan , Michael P. Kim , Mihir Singhal , Shengjia Zhao

Probabilistic classifiers output a probability distribution on target classes rather than just a class prediction. Besides providing a clear separation of prediction and decision making, the main advantage of probabilistic models is their…

Machine Learning · Computer Science 2019-02-20 Juozas Vaicenavicius , David Widmann , Carl Andersson , Fredrik Lindsten , Jacob Roll , Thomas B. Schön

Apportionment is the task of assigning resources to entities with different entitlements in a fair manner, and specifically a manner that is as proportional as possible. The best-known application is the assignment of parliamentary seats to…

Computer Science and Game Theory · Computer Science 2025-10-14 Julian Chingoma , Ulle Endriss , Ronald de Haan , Adrian Haret , Jan Maly

In information retrieval (IR) and related tasks, term weighting approaches typically consider the frequency of the term in the document and in the collection in order to compute a score reflecting the importance of the term for the…

Machine Learning · Computer Science 2021-09-22 Alejandro Moreo Fernández , Andrea Esuli , Fabrizio Sebastiani

In observational studies, propensity scores are commonly estimated by maxi- mum likelihood but may fail to balance high-dimensional pre-treatment covariates even after specification search. We introduce a general framework that unifies and…

Methodology · Statistics 2017-03-22 Qingyuan Zhao