Bayesian adaptive designs can be biased by active learning, especially with misspecified models.
problem Active learning bias in Bayesian adaptive experimental designs.
method Analysis of linear and preference learning models, empirical testing.
result Model misspecification and noise influence active learning bias in Bayesian designs.
The study reveals a persistent bias in the distribution of holonomy on compact hyperbolic 3-manifolds.
problem The distribution of holonomy on compact hyperbolic 3-manifolds is not uniformly distributed.
method An asymptotic count of closed geodesics by their length and holonomy, and analysis of spectral parameters.
result A normalized, smoothed bias count of holonomy is distributed according to a probability distribution, controlled by the number of zero spectral parameters.
This work shows how penalising bias terms in norm regularisation leads to sparse solutions.
problem Understanding the relation between parameter norm regularization and the sparsity of neural network solutions.
method Analyzes one hidden ReLU layer networks with unidimensional data, showing the norm required for function representation and the importance of the bias term's norm.
result Penalising the bias terms in regularisation leads to sparse solutions, enforcing the uniqueness and sparsity of the minimal norm interpolator.
Paper explores robust regression methods and their bias-variance trade-off.
problem Understanding the trade-off between robust estimation and optimization methods.
method Examines traditional outlier-resistant robust estimation and robust optimization.
result Both methods follow converse strategies due to a bias-variance trade-off.
We use tools from geometric statistics to analyze the usual estimation procedure of a template shape. This applies to shapes from landmarks, curves, surfaces, images etc. We demonstrate the asymptotic bias of the template shape estimation using the stratified geometry of the shape space. We give a Taylor expansion of t…
A method learns common bias for multiple low-variance tasks without hyper-parameter tuning.
problem Learning common bias for multiple low-variance tasks without manual tuning.
method Two variants of online learning methods (aggressive and lazy) that update bias after each datapoint or at the end of each task.
result Across-tasks regret bound derived for the method, showing faster rates for aggressive variant and standard rates for lazy variant.
Survey on why deep learning works despite having more parameters than data.
problem Understanding why deep learning algorithms generalize well despite having more parameters than training data.
method Explains the concept of implicit bias and reviews recent research findings.
result Implicit bias is a key factor in deep learning's ability to generalize.
The study examines methods to correct measurement error in nutritional epidemiology studies.
problem Measurement error in nutritional studies leads to biased and underconfident estimates.
method The article reviews various bias-correction models for exposure variables in nutritional epidemiology.
result Bias-correction methods are essential for accurate inference in nutritional studies.
New insights into bias and variance in over-parameterized models.
problem Understanding bias and variance in over-parameterized models.
method Analytic expressions derived from statistical physics for two minimal models.
result Over-parameterized models can overfit even in noiseless conditions.
The paper analyzes optimal implicit bias in linear regression for over-parameterized models.
problem Finding the best generalization performance in over-parameterized linear regression.
method Asymptotic analysis of generalization performance for convex functions/potentials.
result Optimal implicit bias that achieves the best generalization error under certain conditions.
A new Q-learning variant reduces underestimation bias in deep reinforcement learning.
problem Underestimation bias in deep reinforcement learning policies.
method Introducing a novel, parameter-free Deep Q-learning variant.
result Significantly outperforms existing approaches and improves state-of-the-art performance.
The paper debiases machine learning predictions to correct bias in regression coefficients.
problem Bias in regression coefficients from machine learning predictions.
method Proposes an adversarial machine learning algorithm to de-bias predictions.
result Adversarial predictions recover true coefficients, while naive predictions are biased.
New method to evaluate visual explanations from neural networks.
problem Lack of consensus on measuring effectiveness of visual explanations.
method Proposed a new procedure for evaluating explanations using a range of sources.
result Demonstrated the benefit of combining different sources and the impact of bias parameters.
New optimal prior avoids bias in complex models with limited data.
problem Bias in inference from limited data using Jeffreys prior.
method Developed a principled choice of measure that avoids bias, dependent on data quantity.
result Optimal prior leads to unbiased inference in complex models.
Matrix SMD converges to unique solution minimizing Bregman divergence.
problem High-dimensional multi-output classification and matrix completion problems.
method Stochastic Mirror Descent with matrix parameters and matrix mirror functions.
result Matrix SMD converges exponentially to the unique solution minimizing Bregman divergence.
This paper presents a bias-variance tradeoff of graph Laplacian regularizer, which is widely used in graph signal processing and semi-supervised learning tasks. The scaling law of the optimal regularization parameter is specified in terms of the spectral graph properties and a novel signal-to-noise ratio parameter, whi…
We introduce and show the existence of a Hawkes self-exciting point process with exponentially-decreasing kernel and where parameters are time-varying. The quantity of interest is defined as the integrated parameter T − 1 ∫ 0 T θ t ∗ d t T^{-1}\int_0^Tθ_t^*dt T − 1 ∫ 0 T θ t ∗ d t , where θ t ∗ θ_t^* θ t ∗ is the time-varying parameter, and we consider the high-frequency…
A new method for multi-task learning improves performance without weakening inductive bias.
problem Joint optimization of parameters for multiple tasks remains challenging.
method Maximum Roaming, a novel parameter partitioning method inspired by dropout.
result Maximum Roaming improves performance compared to recent multi-task learning formulations.
SkMM selects data for finetuning by balancing bias and variance.
problem Balancing bias and variance in high-dimensional finetuning.
method Gradient sketching for bias reduction and moment matching for variance reduction.
result Gradient sketching selects samples efficiently and accurately.
Bayesian active learning tackles nuisance parameters, leading to bias and dilemmas.
problem Bayesian active learning with nuisance parameters leads to bias and dilemmas.
method Characterizes and mitigates negative interference by accurately estimating nuisance parameters.
result The extent of negative interference can be extremely large, and accurate estimation of nuisance parameters is critical.
Modeling bias in evaluation processes using optimization.
problem Bias in evaluation processes based on socially-salient attributes.
method Optimization-based model with two parameters: resource-information trade-off and risk-averseness.
result Characterization of distributions and effect of parameters on observed distributions.
This work analyzes the maximum-margin bias in quasi-homogeneous neural networks.
problem Analyzing the maximum-margin bias in quasi-homogeneous neural networks.
method Geometric analysis of gradient dynamics for quasi-homogeneous models.
result Gradient flow implicitly favors a subset of parameters, leading to asymmetric norm minimization.
LatentNN corrects neural network attenuation bias in astronomical data.
problem Neural networks underestimate extreme values due to measurement errors.
method Jointly optimizes network parameters and latent input values.
result LatentNN reduces attenuation bias across various signal-to-noise ratios.
Paper proposes adaptive parameter selection for KGD algorithms.
problem Improving parameter selection for kernel-based gradient descent.
method Integrates bias-variance analysis with splitting method, introduces empirical effective dimension.
result Adaptive parameter selection strategy achieves optimal generalization error bound.
For many causal effect parameters of interest, doubly robust machine learning (DRML) estimators ψ ^ 1 \hatψ_{1} ψ ^ 1 are the state-of-the-art, incorporating the good prediction performance of machine learning; the decreased bias of doubly robust estimators; and the analytic tractability and bias reduction of sample splitting wi…
A new approach selects tuning parameters for embedding methods.
problem Difficulty in selecting tuning parameters for embedding methods.
method Minimize a stress notion to supervise tuning parameter selection.
result Uncover a new bias--variance tradeoff phenomenon.
New matching estimators correct bias in multivariate settings without smoothing parameters.
problem Bias in nearest-neighbor and matching estimators in multiple dimensions.
method Polynomial least squares fits on Voronoi tessellations.
result Novel estimators converge at n \sqrt{n} n rate under mild smoothness assumptions. Hierarchical probabilistic models are able to use a large number of parameters to create a model with a high representation power. However, it is well known that increasing the number of parameters also increases the complexity of the model which leads to a bias-variance trade-off. Although it is a classical problem, t…
Fine-tunes LLMs to correct bias in predictions.
problem LLMs exhibit bias in predictions from data.
method Supervised fine-tuning with Low-Rank Adaptation (LoRA).
result Fine-tuning corrects bias in both controlled and real-world settings.
A new method reduces bias in adaptive Lasso estimates.
problem Bias in adaptive Lasso estimates.
method Proximal gradient approach to learn penalty coefficients as decision variables.
result Reduces bias in estimates and encourages arbitrary sparsity structure.
Federated learning can propagate bias from a few parties to all participants.
problem Bias from a few parties in federated learning can spread to all participants.
method Analysis of naturally partitioned real-world datasets.
result Bias in federated learning is higher than in centralized training.
New method corrects selection bias in post-selective inference for Group LASSO.
problem Inference after Group LASSO selection is unreliable.
method Develops a consistent, post-selective Bayesian method to adjust for selection bias.
result Corrects bias in recovering effects of selected variables.
Noise in SGD affects overparameterized models, favoring sparse solutions.
problem Understanding and mitigating implicit bias in SGD with parameter-dependent noise.
method Theoretical analysis of a quadratically-parameterized model with label noise and Gaussian noise.
result SGD with label noise recovers sparse ground-truth solutions, while SGD with Gaussian noise overfits dense solutions.
Machine learning forecasts show bias at long horizons, contrary to standard tests.
problem Forecast efficiency tests misinterpret machine learning performance.
method Theoretical and empirical analysis of regularization and measurement noise.
result Machine learning forecasts exhibit overreaction at longer horizons, not bias.
Paper corrects bias in online learning algorithms with endogenous data.
problem Dynamic selection problems in online learning algorithms with endogenous data.
method Instrumental-variable-based algorithm to correct bias, proving central limit theorem.
result Obtains true parameter values and low regret levels.
A new estimator reduces bias and improves efficiency for staggered adoption studies.
problem Bias in difference-in-differences estimates for staggered adoption studies.
method Fused Extended Two-Way Fixed Effects (FETWFE) estimator with automatic parameter selection.
result FETWFE identifies correct restrictions with probability tending to one, improving efficiency.
This paper balances bias and variance in adaptive importance sampling using mirror descent.
problem Large variance in adaptive importance sampling weights.
method Regularization strategy with power raised importance weights connected to mirror descent.
result The regularization parameter balances bias and variance.
Analyzes bias-variance in overparameterized linear models using random features.
problem Understanding bias-variance trade-off in overparameterized models.
method Zero-temperature cavity method and random matrix theory.
result Three phase transitions in the linear random features model.
The paper develops a theory explaining how machine learning models can amplify biases.
problem Understanding and mitigating bias in machine learning models.
method Analytical theory of ridge regression with and without random projections.
result Observations and predictions align with empirical data on machine learning bias.
Quantile regression undercovers true uncertainty, revealing a bias in high dimensions.
problem Under-coverage bias in uncertainty estimation by quantile regression.
method Theoretical study on coverage of uncertainty estimation algorithms in learning quantiles.
result Quantile regression undercovers true uncertainty, revealing a bias in high dimensions.
A new method improves super learner validation efficiency.
problem Improving the efficiency of super learner validation.
method Bootstrap Bias Corrected Cross Validation applied to Super Learning.
result Bootstrap Bias Corrected Cross Validation proved efficient and cost-effective.
Q-Learning overestimation bias influenced by learning rate, discount factor, and reward signal.
problem Overestimation bias in Q-Learning algorithm.
method Investigated the influence of learning rate, discount factor, and reward signal on Q-Learning's overestimation bias. Tuned parameters and used an exponential moving average of reward signal.
result Q-Learning can achieve more accurate value estimates by tuning parameters and using an exponential moving average of reward signal.
Efficiently scales continuous kernels with sparse Fourier domain learning.
problem High computational and memory demands, spectral bias in continuous kernels.
method Sparse learning in the Fourier domain.
result Efficient scaling of continuous kernels, reduced computational and memory requirements, mitigated spectral bias.
Lectures on deep learning from a learning theory perspective.
problem Understanding how deep learning architectures lead to inductive bias.
method Statistical learning theory and stochastic optimization.
result Gradient descent on linear diagonal networks can lead to various forms of implicit bias.
A new bias score method optimizes fairness in classification.
problem Ensuring fairness in binary classification under group constraints.
method Introducing bias scores and developing a post-hoc approach to adapt to fairness constraints.
result The method maintains high accuracy while ensuring fairness constraints.
Study finds gender bias in human evaluators and shows how machine learning can mitigate it.
problem Gender bias in human decision-making on micro-lending platforms.
method Structural econometric model and machine learning algorithms trained on real-world data.
result Machine learning algorithms can mitigate both preference-based and belief-based biases.
We study the following three fundamental problems about ridge regression: (1) what is the structure of the estimator? (2) how to correctly use cross-validation to choose the regularization parameter? and (3) how to accelerate computation without losing too much accuracy? We consider the three problems in a unified larg…
New method corrects bias in datasets using cumulative distribution functions.
problem Varying domains and biased datasets lead to differences between training and target distributions.
method Empirical cumulative distribution function estimates of the target distribution, rigorously generalized.
result Method is more robust, not reliant on parameter tuning, and performs similarly to state-of-the-art techniques.