We find that binning-based estimators with bins of equal mass (number of instances) have lower bias than estimators with bins of equal width.
We introduce a similarity index that measures the relationship between representational similarity matrices and does not suffer from this limitation.
In reinforcement learning (RL) research, it is common to assume access to direct online interactions with the environment.
Efficient Neural Architecture Search methods based on weight sharing have shown good promise in democratizing Neural Architecture Search for computer vision models.
Stochastic classifiers arise in a number of machine learning problems, and have become especially prominent of late, as they often result from constrained optimization problems, e. g. for fairness, churn, or custom losses.
We propose a likelihood ratio method for deep generative models which effectively corrects for these confounding background statistics.
Out-of-Distribution Detection Out of Distribution (OOD) Detection
The estimation of an f-divergence between two probability distributions based on samples is a fundamental problem in statistics and machine learning.
From this observation, we propose extended rank and sort operators by considering optimal transport (OT) problems (the natural relaxation for assignments) where the auxiliary measure can be any weighted measure supported on $m$ increasing values, where $m \ne n$.
We propose an empirical measure of the approximate accuracy of feature importance estimates in deep neural networks.
We present a general framework for solving a large class of learning problems with non-linear functions of classification rates.