Unbiased methods for alpha-divergence minimization struggle in high dimensions.
problem The difficulty of unbiased alpha-divergence minimization in high dimensions.
method Signal-to-Noise Ratio (SNR) analysis of gradient estimators.
result The SNR of the gradient estimator worsens exponentially with dimensionality.
SUMO provides unbiased log marginal likelihood estimation for latent variable models.
problem Biased estimates of log marginal likelihood in latent variable models.
method Randomized truncation of infinite series for unbiased estimation.
result Models trained with SUMO give better test-set likelihoods than standard methods.
New unbiased gradient estimators for complex optimization problems.
problem Unbiased and variance-limited gradient estimation for conditional stochastic optimization.
method Developed multilevel Monte Carlo gradient estimators for conditional stochastic optimization problems.
result Unbiased and finite variance gradient estimators for conditional stochastic optimization problems.
New method reduces deep learning training costs by approximating vector-jacobian products.
problem Efficiently training deep neural networks with reduced computational and memory costs.
method Randomized, unbiased approximations of vector-jacobian products during backpropagation.
result Validated potential for reducing deep learning training costs through unbiased estimates.
Paper proposes an unbiased risk estimator for PLLAC, handling unseen classes.
problem Handling unseen classes in PLLAC where some classes are not present in the training set.
method Proposes an unbiased risk estimator that estimates the distribution of augmented classes by differentiating known classes from unlabeled data.
result The estimator provides theoretical guarantees and converges to true risk minimizer as data increases.
Paper proposes unbiased learning for recommendation causal effects.
problem Estimating the causal effect of recommendation when the ground truth is unobservable.
method Inverse propensity scoring technique to construct unbiased estimators, followed by empirical risk minimization with propensity capping.
result The proposed method outperforms other biased learning methods in various settings.
UREs lead to overfitting in complex models, especially in complementary label learning.
problem Overfitting in weakly supervised learning with complementary labels.
method Proposed a surrogate complementary loss (SCL) framework to reduce gradient variance.
result SCL mitigates overfitting and improves URE-based methods.
Pairwise similarities and dissimilarities between data points might be easier to obtain than fully labeled data in real-world classification problems, e.g., in privacy-aware situations. To handle such pairwise information, an empirical risk minimization approach has been proposed, giving an unbiased estimator of the cl…
We revisit resampling procedures for error estimation in binary classification in terms of U-statistics. In particular, we exploit the fact that the error rate estimator involving all learning-testing splits is a U-statistic. Thus, it has minimal variance among all unbiased estimators and is asymptotically normally dis…
From only positive (P) and unlabeled (U) data, a binary classifier could be trained with PU learning, in which the state of the art is unbiased PU learning. However, if its model is very flexible, empirical risks on training data will go negative, and we will suffer from serious overfitting. In this paper, we propose a…
A new framework for bilevel optimization tackles stochastic and global variance reduction.
problem Bilevel optimization challenges in large-scale empirical risk minimization.
method Introducing a novel framework where inner and main variables evolve simultaneously, leading to unbiased estimates and global variance reduction algorithms.
result SABA algorithm achieves $O( rac{1}{T})$ convergence rate and linear convergence under Polyak-Lojasciewicz assumption.
Develops unbiased averaging methods for second order optimization in distributed systems.
problem Computing the Hessian is challenging and communication is a bottleneck in distributed optimization.
method Unbiased parameter averaging methods using sampling and sketching of the Hessian.
result Provably minimizes bias for sketched Newton directions.
Estimates conversion probabilities from click sequences with privacy constraints.
problem Training models in advertising with limited direct click-conversion links.
method Formalizes learning from attribution sets, constructs unbiased estimator, applies Empirical Risk Minimization.
result Empirical Risk Minimization achieves generalization guarantees and robustness against prior errors.
Improved UIVI method shows better performance than state-of-the-art SIVI methods.
problem Estimating the likelihood of samples from complex distributions in high dimensions.
method Replaced the inner MCMC loop of UIVI with importance sampling and learned the optimal proposal distribution.
result The refined UIVI approach demonstrates superior performance or parity with state-of-the-art methods.
In this paper we address the problem of pool based active learning, and provide an algorithm, called UPAL, that works by minimizing the unbiased estimator of the risk of a hypothesis in a given hypothesis space. For the space of linear classifiers and the squared loss we show that UPAL is equivalent to an exponentially…
This work improves texture segmentation by automatically tuning hyperparameters for Total-Variation.
problem The challenge is to automatically select hyperparameters for Total-Variation texture segmentation.
method The approach involves extending Stein's unbiased gradient estimator to handle correlated Gaussian noise, leading to an automatic tuning method.
result The method provides an automatic way to select hyperparameters for Total-Variation texture segmentation.
Proposes an adversarial algorithm to learn unbiased representations via HGR coefficient.
problem Learning fair representations without sensitive attribute information.
method Adversarial algorithm using Hirschfeld-Gebelein-Renyi (HGR) maximal correlation coefficient.
result Significant improvements in bias mitigation compared to existing methods.
Using integration by parts on Gaussian space we construct a Stein Unbiased Risk Estimator (SURE) for the drift of Gaussian processes using their local and occupation times. By almost-sure minimization of the SURE risk of shrinkage estimators we derive an estimation and de-noising procedure for an input signal perturbed…
I explicitly work out closed form solutions for the optimal hedging strategies (in the sense of Bouchaud and Sornette) in the case of European call options, where the underlying is modeled by (unbiased) iid additive returns with Student-t distributions. The results may serve as illustrative examples for option pricing …
Stochastic gradient descent (SGD), which dates back to the 1950s, is one of the most popular and effective approaches for performing stochastic optimization. Research on SGD resurged recently in machine learning for optimizing convex loss functions and training nonconvex deep neural networks. The theory assumes that on…
New loss functions improve extreme classification with missing labels.
problem Large number of infrequent labels and missing labels in XMC.
method Derive unbiased loss functions for XMC, incorporating them into existing algorithms.
result Significant improvement in extreme classification performance (up to 20%) over existing methods.
Synthetic construction of 3D complex bases.
problem Creating a complete set of unbiased bases in 3D complex space.
method Synthetic construction using complex projective trigonometry.
result Synthetic construction of mutually unbiased bases in C^3.
Unbiased wealth exchanges always lead to inequality.
problem Understanding wealth distribution in unbiased binary exchange systems.
method Analytical demonstration of unbiased binary exchanges leading to perfect inequality.
result Any system driven by unbiased binary exchanges will reach perfect inequality and zero mobility.
VT-DIS improves sampling from Boltzmann distributions with minimal overhead.
problem Bias in Monte Carlo estimates from score-based diffusion models.
method Variance-Tuned Diffusion Importance Sampling (VT-DIS) adapts noise covariance to correct bias.
result VT-DIS achieves effective sample sizes of 80%, 35%, and 3.5% on benchmarks, using less computational budget.
MUSE provides unbiased stopping estimates for optimal problems.
problem Estimating the utility of optimal stopping problems.
method Backward recursive construction of the Multilevel Unbiased Stopping Estimator (MUSE).
result MUSE achieves ε-accuracy with O(1/ε^2) computational cost.
New method finds unbiased subnetworks in biased models for better OOD performance.
problem How to improve out-of-distribution generalization in deep models.
method Functional modular probing method and Modular Risk Minimization.
result Even in biased models, there are unbiased subnetworks that can achieve better OOD performance.
Randomized trials, also known as A/B tests, are used to select between two policies: a control and a treatment. Given a corresponding set of features, we can ideally learn an optimized policy P that maps the A/B test data features to action space and optimizes reward. However, although A/B testing provides an unbiased …
We give the first efficient algorithm for learning the structure of an Ising model that tolerates independent failures; that is, each entry of the observed sample is missing with some unknown probability p. Our algorithm matches the essentially optimal runtime and sample complexity bounds of recent work for learning Is…
We propose an estimator of prediction error using an approximate message passing (AMP) algorithm that can be applied to a broad range of sparse penalties. Following Stein's lemma, the estimator of the generalized degrees of freedom, which is a key quantity for the construction of the estimator of the prediction error, …
The paper explores effective data selection methods for weakly supervised learning.
problem Efficiently selecting a subset of unlabeled data for weakly supervised learning.
method Using a surrogate model to predict labels and selecting a subset of samples for training.
result Data selection can significantly improve model performance over training on the full dataset.
New algorithm finds unbiased subnetworks in biased datasets.
problem Finding unbiased subnetworks in biased neural networks.
method Debiased Contrastive Weight Pruning (DCWP) algorithm.
result DCWP significantly outperforms state-of-the-art debiasing methods.
Proposes unbiased estimators for training mixture of experts models.
problem Efficiently training large-scale mixture of experts models on modern hardware.
method Two unbiased estimators based on principled stochastic assignment procedures.
result Both estimators are more effective and robust than biased alternatives.
Unbiased gradient estimation for Markov chains
problem Estimating gradients of stationary means in Markov chains
method Propose new unbiased estimators
result Improves efficiency for slow mixing Markov chains
AIPS improves ranking policy evaluation by adapting to diverse user behavior.
problem Inaccurate Off-Policy Evaluation of ranking policies due to high variance under diverse user behavior.
method Developed Adaptive IPS (AIPS) that adapts to different user behaviors and minimizes MSE.
result AIPS achieves minimum variance among unbiased estimators and provides significant empirical accuracy improvement.
In this paper, we introduce a new approach to constructing unbiased estimators when computing expectations of path functionals associated with stochastic differential equations (SDEs). Our randomization idea is closely related to multi-level Monte Carlo and provides a simple mechanism for constructing a finite variance…
Extends unbiased simulation method to Asian options.
problem Simulating path-dependent dynamics for Asian options.
method Extension of unbiased simulation method for SDEs to path-dependent dynamics.
result Extension applies to numerical resolution of path-dependent PDEs.
Developed unbiased estimators for Heston model with stochastic interest rates.
problem Estimating the Heston model with stochastic interest rates.
method Combined unbiased estimators with the Heston model and developed a semi-exact log-Euler scheme.
result Convergence rate of O(h) in the L2 norm for a wide range of models. New method for unbiased regression reduces excess risk.
problem Least squares regression with optimal solution and Hessian matrix.
method Averaged stochastic gradient descent with time-average estimator.
result Unbiased estimator with O(1/k) expected excess risk.
Computing partition functions, the normalizing constants of probability distributions, is often hard. Variants of importance sampling give unbiased estimates of a normalizer Z, however, unbiased estimates of the reciprocal 1/Z are harder to obtain. Unbiased estimates of 1/Z allow Markov chain Monte Carlo sampling of "d…
Optimal Gaussian noise mechanisms achieve nearly optimal error in unbiased mean estimation.
problem Efficiently estimating the mean of high-dimensional data while preserving privacy.
method Differential privacy mechanisms with Gaussian noise, focusing on optimal covariance.
result Gaussian noise mechanisms achieve nearly optimal error among all private unbiased mean estimation mechanisms.
We consider the approximation of expectations with respect to the distribution of a latent Markov process given noisy measurements. This is known as the smoothing problem and is often approached with particle and Markov chain Monte Carlo (MCMC) methods. These methods provide consistent but biased estimators when run fo…
This paper tackles unbiased loss functions for multilabel classification with missing labels.
problem Missing labels in multilabel classification tasks, especially in extreme multi-label classification (XMC).
method Derives unbiased estimators for multilabel reductions, including non-decomposable ones, and addresses increased variance with convex upper-bounds.
result Switching to unbiased estimators can alter the bias-variance trade-off and may require stronger regularization.
Stochastic bridges are commonly used to impute missing data with a lower sampling rate to generate data with a higher sampling rate, while preserving key properties of the dynamics involved in an unbiased way. While the generation of Brownian bridges and Ornstein-Uhlenbeck bridges is well understood, unbiased generatio…
Existing deep architectures cannot operate on very large signals such as megapixel images due to computational and memory constraints. To tackle this limitation, we propose a fully differentiable end-to-end trainable model that samples and processes only a fraction of the full resolution input image. The locations to p…
Empirical risk minimization (ERM), with proper loss function and regularization, is the common practice of supervised classification. In this paper, we study training arbitrary (from linear to deep) binary classifier from only unlabeled (U) data by ERM. We prove that it is impossible to estimate the risk of an arbitrar…
New theory of sensitivity for unbiased estimators using Wasserstein geometry.
problem Estimating the instability of estimators under small perturbations.
method Developed a new theory based on Wasserstein geometry, analogous to classical Cramér-Rao theory.
result Wasserstein-Cramér-Rao lower bound for sensitivity of unbiased estimators.
MeanFlow training is unstable due to misusing conditional velocity, leading to variance issues.
problem Unstable training of MeanFlow due to variance problems.
method Theoretical analysis and derivation of optimal coefficient in closed form.
result The optimal coefficient in MeanFlow training minimizes variance but not necessarily quality.
We present Optimal Transport GAN (OT-GAN), a variant of generative adversarial nets minimizing a new metric measuring the distance between the generator distribution and the data distribution. This metric, which we call mini-batch energy distance, combines optimal transport in primal form with an energy distance define…