New method learns collective variables using autoencoders for molecular simulations.
problem Learning low-dimensional slow degrees of freedom (collective variables) for molecular simulations.
method Iterative method involving CV learning with autoencoders and reweighting scheme.
result Achieves convergence of learned collective variables.
Noise in imputed values corrects biases in machine learning models.
problem Systematic biases in imputed values affect downstream analyses.
method Introducing noise to imputed values to correct biases.
result Noise-corrected imputation methods produce unbiased estimates.
MIP-GNN uses graph neural networks to predict variable biases for MIP solvers.
problem Improving combinatorial optimization through data-driven insights.
method Encoding MILP interactions as graphs, training a graph neural network to predict variable biases, and guiding the MIP solver with these predictions.
result Significant improvements in solving binary MILPs compared to default settings of state-of-the-art solvers.
Biased sampling and missing data complicates statistical problems ranging from causal inference to reinforcement learning. We often correct for biased sampling of summary statistics with matching methods and importance weighting. In this paper, we study nearest neighbor matching (NNM), which makes estimates of populati…
Integrates inductive biases into VAEs using intermediary latent variables.
problem Ineffective mechanisms for incorporating inductive biases into VAEs.
method InteL-VAEs use an intermediary latent space to control encoding, with a parametric function to enforce desired properties.
result InteL-VAEs lead to better generative models and representations.
We study high-dimensional Gaussian mixture classification using statistical physics methods.
problem Classifying high-dimensional Gaussian mixture with general covariance matrices.
method Replica method from statistical physics for asymptotic analysis of convex classifiers.
result Construction and validation of a de-biased estimator for variable selection.
Survey on biases in image analysis for industrial safety.
problem Bias in machine learning algorithms affects industrial safety-critical applications.
method Survey and analysis of recent advances in bias detection and mitigation.
result Need for new methods to detect and mitigate biases in image analysis for safety-critical applications.
Gradient-based methods can be biased by distributional asymmetries in bivariate categorical data.
problem Gradient-based causal discovery methods can be biased by distributional asymmetries in bivariate categorical data.
method Identified and examined two distributional biases: Marginal Distribution Asymmetry and Marginal Distribution Shift Asymmetry. Employed two simple models to demonstrate and control these biases.
result Gradient-based methods can be biased by distributional asymmetries, and these biases can be controlled.
The insurance industry uses predictions based on customer characteristics, but this can lead to discrimination. We propose using Wasserstein barycenters to mitigate biases.
problem Discrimination in insurance predictions based on sensitive features like gender or race.
method Propose using Wasserstein barycenters instead of simple scaling to mitigate biases in insurance predictions.
result Demonstrates the effectiveness of Wasserstein barycenters in mitigating biases in insurance predictions.
This paper tackles confounding biases in data augmentation.
problem Mitigating spurious correlations and confounding variables in training data.
method Formal analysis and counterfactual data augmentation.
result Removing confounding biases leads to invariant features and better generalization.
Chinchilla Approach 2 biases neural scaling law estimates, leading to unnecessary compute costs.
problem Systematic biases in Chinchilla Approach 2's parabolic fits of neural scaling laws.
method Analyzes three sources of error: IsoFLOP sampling grid width, uncentered sampling, and loss surface asymmetry.
result Chinchilla Approach 3 largely eliminates these biases, offering a more convenient or scalable alternative.
How do we learn from biased data? Historical datasets often reflect historical prejudices; sensitive or protected attributes may affect the observed treatments and outcomes. Classification algorithms tasked with predicting outcomes accurately from these datasets tend to replicate these biases. We advocate a causal mode…
Improved Cauchy-Schwarz inequality for L1 and L2 norms.
problem Refining the classical Cauchy-Schwarz inequality for different norms.
method Developed a new inequality for p and q with q>p>2. result Demonstrated a new bound for the L1 norm in terms of Lp and Lq norms. Mitigates biases in reward models using variational inference.
problem Spurious correlations in reward models that align large language models with human preferences.
method Formulates data-generating process, identifies non-spurious latent variables, and uses variational inference to recover them.
result Effective mitigation of spurious correlation issues, yielding more robust reward models.
The influence of human judgement is ubiquitous in datasets used across the analytics industry, yet humans are known to be sub-optimal decision makers prone to various biases. Analysing biased datasets then leads to biased outcomes of the analysis. Bias by protected characteristics (e.g. race) is of particular interest …
A new strategy for identifying the best arm in Gaussian bandits with improved exploration.
problem Best-arm identification for Gaussian bandits with bounded means and unit variance.
method Exploration-Biased Sampling, a non-asymptotic approach with improved exploration behavior.
result Improved exploration behavior makes the strategy more stable and interpretable.
Self-attention prefers sparse functions of input sequences, reducing sample complexity.
problem Understanding the inductive biases of self-attention in modeling long-range dependencies.
method Theoretical analysis and synthetic experiments to probe sample complexity of learning sparse functions with Transformers.
result Bounded-norm Transformer networks can represent sparse functions of the input sequence with logarithmic sample complexity.
Proposes a method to combine datasets with missing values using Gaussian process latent variables.
problem Combining datasets with missing values under non-Missing at Random (NMAR) missingness.
method Gaussian process latent variable model for non-MAR missing data.
result Valid estimates are obtained using the proposed method, while existing methods provide severely biased estimates.
New method detects and prevents unfairness in few-shot regression models.
problem Fairness issues in supervised few-shot meta-learning models.
method Causal Bayesian knowledge graph for dependency visualization, risk difference quantification, and fast-adapted bias-control approach.
result Efficiently detects and mitigates unfairness in model predictions.
We present a unified invariance framework for supervised neural networks that can induce independence to nuisance factors of data without using any nuisance annotations, but can additionally use labeled information about biasing factors to force their removal from the latent embedding for making fair predictions. Invar…
AI-generated variables bias regression estimates; methods correct for invalid inference.
problem Bias in regression estimates due to AI-generated variables.
method Two methods: bias correction and joint estimation.
result Valid inference restored through proposed methods.
Proposes a deep latent variable model for MNAR data.
problem Missing data leading to biased results in MAR assumptions.
method Deep latent variable models with conditional no self-censoring.
result Establishes identifiability of MNAR data distribution.
As machine learning (ML) models, trained on real-world datasets, become common practice, it is critical to measure and quantify their potential biases. In this paper, we focus on renal failure and compare a commonly used traditional risk score, Tangri, with a more powerful machine learning model, which has access to a …
SkewSize detects model biases by analyzing mistakes across subgroups.
problem Benchmarking model performance in the presence of spurious correlations.
method Introducing SkewSize, a metric that captures bias from model mistakes.
result SkewSize highlights biases not captured by other metrics.
Study aims to measure and mitigate biases in motor insurance pricing.
problem Ethical biases in motor insurance pricing that affect fairness and regulatory compliance.
method Statistical methodologies and data analysis to measure and mitigate biases.
result Developed tools to measure and mitigate ethical biases in motor insurance pricing.
Reanalysis datasets combining numerical physics models and limited observations to generate a synthesised estimate of variables in an Earth system, are prone to biases against ground truth. Biases identified with the NASA Modern-Era Retrospective Analysis for Research and Applications, Version 2 (MERRA-2) aerosol optic…
Macromolecular and biomolecular folding landscapes typically contain high free energy barriers that impede efficient sampling of configurational space by standard molecular dynamics simulation. Biased sampling can artificially drive the simulation along pre-specified collective variables (CVs), but success depends crit…
In this study, we propose an automatic learning method for variables selection based on Lasso in epidemiology context. One of the aim of this approach is to overcome the pretreatment of experts in medicine and epidemiology on collected data. These pretreatment consist in recoding some variables and to choose some inter…
Systematic discriminatory biases present in our society influence the way data is collected and stored, the way variables are defined, and the way scientific findings are put into practice as policy. Automated decision procedures and learning algorithms applied to such data may serve to perpetuate existing injustice or…
Framework learns physics-informed continuum models from molecular data.
problem Discovering accurate and robust data-driven continuum models from molecular simulation data.
method Operator regression framework using neural networks in modal space with physical inductive biases.
result Learned operators generalize to unseen system characteristics.
Confounding variables are a well known source of nuisance in biomedical studies. They present an even greater challenge when we combine them with black-box machine learning techniques that operate on raw data. This work presents two case studies. In one, we discovered biases arising from systematic errors in the data g…
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.
The paper shows how the generalization curve can have multiple peaks, influenced by data and learning algorithm biases.
problem Understanding the generalization behavior of linear regression models under varying parameterizations.
method Analyzes generalization loss in linear regression models with varying parameterizations, both under- and over-parameterized.
result The generalization curve can have an arbitrary number of peaks, and their locations can be controlled.
DML addresses biases in machine learning by estimating nuisance functions.
problem Bias in machine learning models due to nuisance functions.
method Double/Debiased Machine Learning (DML) approach to reduce biases.
result DML allows flexible estimation of nuisance functions without auxiliary assumptions.
DeepMaxent uses neural networks to improve species distribution models.
problem Sampling biases and lack of absence data in presence-only observations.
method DeepMaxent employs neural networks to learn shared features among species using the maximum entropy principle.
result DeepMaxent outperforms traditional methods in predicting species distributions, especially in unevenly sampled regions.
We propose a modification that corrects for split-improvement variable importance measures in Random Forests and other tree-based methods. These methods have been shown to be biased towards increasing the importance of features with more potential splits. We show that by appropriately incorporating split-improvement as…
We analyze the joint probability distribution on the lengths of the vectors of hidden variables in different layers of a fully connected deep network, when the weights and biases are chosen randomly according to Gaussian distributions, and the input is in {−1,1}N. We show that, if the activation function φ sat…
Jigsaw-VAE tackles feature imbalance in VAE latent variables, improving generalization across environments.
problem Feature imbalance in VAE latent variables leads to poor generalization and biased sample generation.
method Proposes a regularization scheme to balance features in VAE latent variables and introduces a metric to measure balance.
result The regularization scheme substantially addresses feature imbalance, leading to improved generalization and diverse sample generation.
RAMEN corrects observational data biases for multiple environments.
problem Bias in observational data for causal inference.
method RAMEN algorithm that leverages heterogeneity of multiple data sources.
result RAMEN produces unbiased treatment effect estimates.
Biases in observational data of treatments pose a major challenge to estimating expected treatment outcomes in different populations. An important technique that accounts for these biases is reweighting samples to minimize the discrepancy between treatment groups. We present a novel reweighting approach that uses bi-le…
The paper defines a hypothesis space for deep learning using DNNs.
problem Developing a mathematical framework for deep learning.
method Introducing a Banach space of functions of input variables based on DNNs, proving it's a RKBS, and establishing representer theorems for learning models.
result Solutions to learning problems can be expressed as finite sums of kernel expansions based on training data.
Bayesian Neural Networks with Latent Variables (BNN+LVs) capture predictive uncertainty by explicitly modeling model uncertainty (via priors on network weights) and environmental stochasticity (via a latent input noise variable). In this work, we first show that BNN+LV suffers from a serious form of non-identifiability…
Learning in models with discrete latent variables is challenging due to high variance gradient estimators. Generally, approaches have relied on control variates to reduce the variance of the REINFORCE estimator. Recent work (Jang et al. 2016, Maddison et al. 2016) has taken a different approach, introducing a continuou…
Current adoption of machine learning in industrial, societal and economical activities has raised concerns about the fairness, equity and ethics of automated decisions. Predictive models are often developed using biased datasets and thus retain or even exacerbate biases in their decisions and recommendations. Removing …
Study examines inference methods after variable selection in Cox models.
problem Bias and misleading inference after variable selection in Cox models.
method Simulation study of inference procedures for Lasso and adaptive Lasso in Cox models.
result Performance of inference procedures varies, with debiased Lasso showing promise.
The paper tackles fairness in machine learning by modeling latent unbiased labels.
problem Ensuring fairness in machine learning systems that use biased data.
method Explicitly models a latent variable representing a hidden, unbiased label to achieve demographic parity.
result The latent variable approach successfully retrieves fair labels from biased data.
The reparameterization trick enables optimizing large scale stochastic computation graphs via gradient descent. The essence of the trick is to refactor each stochastic node into a differentiable function of its parameters and a random variable with fixed distribution. After refactoring, the gradients of the loss propag…
Proposes a boosting framework for sparsity in grouped covariates.
problem Sparsity and selection bias in grouped covariates.
method Component-wise and group-wise gradient boosting with adjusted degrees of freedom.
result Reduces bias and improves predictability in variable selection.