Paper proposes a bias-constrained deep learning approach to non-linear estimation.
problem Designing unbiased estimators for non-linear models.
method Bias Constrained Estimator (BCE) using deep learning with bias constraints.
result Asymptotic MVUEs with Cramer Rao bound performance.
Proposes bounds on bias from low-dimensional representations in CATE estimation.
problem Bias in CATE estimation due to low-dimensional representations.
method Proposes a refutation framework to estimate bounds on representation-induced confounding bias.
result Demonstrates effectiveness of refutation framework in practice.
In this paper, we propose a new method for estimation and constructing confidence intervals for low-dimensional components in a high-dimensional model. The proposed estimator, called Constrained Lasso (CLasso) estimator, is obtained by simultaneously solving two estimating equations---one imposing a zero-bias constrain…
New models reduce discrimination in machine learning without sacrificing explanatory bias.
problem Discrimination and explanatory bias in fairness measures.
method Causal effect estimators using propensity score analysis.
result Theoretical and practical superiority of FairCEEs over existing models.
We find the optimal error for a constrained regression model under a linear model.
problem Minimizing error while adhering to demographic parity constraints.
method Proposed a minimax optimal error analysis for a demographic parity-constrained regression problem within a linear model.
result The minimax optimal error is characterized by $Θ( rac{dM}{n})$ .
This paper studies a class of exponential family models whose canonical parameters are specified as linear functionals of an unknown infinite-dimensional slope function. The optimal minimax rates of convergence for slope function estimation are established. The estimators that achieve the optimal rates are constructed …
New methods for parameter estimation in mechanistic models using data-consistent inversion.
problem Parameter estimation bias in Bayesian analysis for mechanistic models.
method Data-consistent inversion methods based on rejection sampling, MCMC, GANs, and constrained optimization.
result Improved parameter estimation without bias from uninformative priors.
Machine learning models predict brain age with systematic bias, corrected in this study.
problem Systematic bias in machine learning regression models for brain age prediction.
method General constrained optimization approach to correct bias.
result Our method effectively eliminates the bias from brain age predictions.
New model reduces matrix factorization bias, yielding truly low-rank solutions.
problem Gradient descent's implicit bias in matrix factorization.
method Introducing a new factorization model with constrained factors and diagonal components.
result The new model consistently exhibits a strong implicit bias, yielding truly low-rank solutions.
This work compares regularization and constrained inference for label constraints in machine learning.
problem Improving model performance with label constraints in machine learning.
method Comparison of regularization and constrained inference strategies.
result Constrained inference reduces population risk by correcting model violations, while regularization narrows the generalization gap but introduces bias.
Estimates treatment effects in bipartite systems with partial eligibility and interference.
problem Randomized experiments in bipartite systems with partial treatment eligibility and interference.
method Formalizes eligibility-constrained bipartite experiments, defines PTTE and STTE, identifies conditions, develops ensemble estimators, introduces projection.
result Proposed estimators recover PTTE and STTE with low bias and variance, corrects interference bias in field experiments.
Develops an online method for solving constrained optimization problems with debiasing techniques.
problem Online inference of solutions to constrained optimization problems with equality and inequality constraints.
method Stochastic Sequential Quadratic Programming (SSQP) with momentum debiasing.
result Achieves global almost-sure convergence and local asymptotic normality with optimal primal-dual limiting covariance.
New algorithm achieves optimal regret in average reward MDPs without prior bias information.
problem Achieving optimal regret in average reward MDPs with computational efficiency and without prior bias information.
method Projective Mitigated Extended Value Iteration (PMEVI) to compute bias-constrained optimal policies efficiently.
result First tractable algorithm with minimax optimal regret of O ~ ( s p ( h ∗ ) S A T ) \widetilde{\mathrm{O}}(\sqrt{\mathrm{sp}(h^*) S A T}) O ( sp ( h ∗ ) S A T ) . Paper proposes SOTL framework for improving transfer learning accuracy and efficiency.
problem Statistical bias and computational efficiency in multi-source domain adaptation.
method Sparse Optimization for Transfer Learning (SOTL) with L0-regularization.
result SOTL significantly improves estimation accuracy and computational speed, especially under adversarial conditions.
AdamW optimizes a constrained loss with ℓ ∞ \ell_\infty ℓ ∞ norm constraint.
problem Understanding the optimization behavior of AdamW with ℓ ∞ \ell_\infty ℓ ∞ norm constraint. method Analyzing AdamW as a smoothed version of SignGD and connecting it to Frank-Wolfe optimization.
result AdamW implicitly performs constrained optimization with ℓ ∞ \ell_\infty ℓ ∞ norm constraint. Aggregation challenges causal interpretation of IV estimators.
problem Aggregation of fine-grained components into an aggregate treatment variable.
method Characterization of conditions for identifying aggregate causal effects.
result Standard IV estimators cannot identify aggregate causal effects due to ambiguous dependencies.
DE-PSGLD samples from constrained distributions in a decentralized manner.
problem Sampling from log-concave distributions with constraints.
method Decentralized Proximal Stochastic Gradient Langevin Dynamics with proximal regularization.
result DE-PSGLD converges to a regularized Gibbs distribution and maintains posterior concentration.
This study mainly investigates two common decoding problems in neural keyphrase generation: sequence length bias and beam diversity. To tackle the problems, we introduce a beam search decoding strategy based on word-level and ngram-level reward function to constrain and refine Seq2Seq inference at test time. Results sh…
Dynamic Vocabulary Pruning stabilizes LLM training by removing low-probability tokens.
problem Training Large Language Models (LLMs) with Reinforcement Learning (RL) causes numerical divergence between inference and training.
method Dynamic Vocabulary Pruning (DVP) constrains the RL objective to a safe vocabulary that excludes low-probability tokens.
result DVP stabilizes training by reducing systematic bias introduced by the extreme tail of the token distribution.
FAVANO improves federated learning for resource-constrained environments.
problem Asynchronous communication in federated learning leads to bias and scalability issues.
method FAVANO is a novel asynchronous federated learning framework for resource-constrained environments.
result FAVANO outperforms existing methods on standard benchmarks.
Study improves unbiased recommender learning by addressing missing-reward bias.
problem Data bias caused by missing-reward observations in recommender systems.
method Proposes a novel estimator using propensity scores to mitigate both position and reward bias.
result The proposed estimator outperforms other methods, even with increased reward observation bias.
Paper analyzes LPSA algorithm for constrained optimization, revealing phase transitions and bias-variance trade-offs.
problem Optimization problems with linear constraints.
method Loopless projection stochastic approximation (LPSA) with jump diffusion approximation.
result LPSA trajectories converge to SDEs, revealing asymptotic behaviors and phase transitions.
New bandit algorithm works without realizability assumption.
problem Contextual bandit problems without realizability assumption.
method Computes a constrained regression problem in every epoch, ensuring similar regret guarantees as realizability-based algorithms.
result Ensures similar regret guarantees as realizability-based algorithms, up to a misspecification term.
Centered plug-in estimators reduce bias in Wasserstein distance estimation.
problem Conservative bias in plug-in estimators of Wasserstein distances.
method Centering procedure based on linear combinations to reduce bias.
result Centered plug-in estimators provide informative upper and lower bounds on Wasserstein distances.
Study proposes a new method to estimate bias-correction term for ATE estimation.
problem Estimating the bias-correction term for ATE estimation.
method Directly estimating the bias-correction term by minimizing Bregman divergence.
result Automatic covariate balancing property achieved through specific model choices.
EBQL reduces bias in Q-learning for improved performance.
problem Over- and under-estimation biases in Q-learning degrade performance.
method Ensemble Bootstrapping to reduce both over- and under-estimation biases.
result EBQL outperforms other Q-learning methods in Atari games.
Extends Popularity Bias Memorization theorem to new conditions.
problem Estimating alignment with top-k singular hyperspace.
method Extending theorem to arbitrary degree distributions and proving upper and lower bounds.
result Upper and lower estimates for alignment with top-k singular hyperspace.
New attention model removes softmax, improving sequence length bias.
problem Softmax attention's limitations and sequence length bias.
method Replaces softmax with normalization in self-attention.
result Normalization leads to more robust and bias-free attention.
The paper explores the trade-off between bias and variance in high-dimensional models.
problem Understanding the unavoidable trade-off between bias and variance in high-dimensional statistical models.
method Proposes a general strategy to obtain lower bounds on the variance of estimators with a specified bias, and applies it to various statistical models.
result Shows the extent to which the bias-variance trade-off is unavoidable and quantifies the performance loss for methods that do not balance it.
We derive an interpolation version of constrained matrix Li-Yau-Hamilton estimate on Kähler manifolds. As a result, we first get a constrained matrix Li-Yau-Hamilton estimate for heat equation on a Kähler manifold with fixed Kähler metric. Secondly, we get a corresponding estimate for forward conjugate heat equation on…
Paper analyzes ECE bias and provides bounds for its estimation.
problem Understanding the estimation bias in ECE for machine learning models.
method Information-theoretic approach to analyze bias in uniform mass and uniform width binning strategies.
result Established upper bounds on ECE estimation bias and optimal number of bins.
We rebias estimates to improve interval calibration and prediction accuracy.
problem Constructing accurate intervals for noisy and biased estimates.
method Empirical Bayes rebiasing strategy that learns bias distribution from data.
result Substantial precision gains in prediction-powered inference.
New method reduces bias in estimating causal effects from discretized variables.
problem Bias in estimating causal effects from discretized continuous variables.
method Proposes a bias-reduced functional that evaluates outcome regression at within-bin conditional means.
result Demonstrates substantial bias reduction and near-nominal confidence interval coverage.
New algorithm improves sampling from constrained spaces.
problem Sampling from constrained spaces efficiently.
method Metropolis-adjusted Mirror Langevin algorithm.
result Unbiased sampling with improved mixing time.
A new method for state space partitioning in block particle filtering reduces bias and variance.
problem Overcoming the curse of dimensionality in non-linear, non-Gaussian state space estimation.
method Formulates state space partitioning as a clustering problem and uses spectral clustering with constraints.
result The proposed method effectively groups correlated state variables into smaller blocks, reducing bias and variance.
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…
Estimates causal effects with selection bias and confounding using regression.
problem Estimating causal effects in presence of selection bias and confounding.
method Two-step regression estimator (TSR) that corrects for selection bias and accounts for confounding.
result TSR estimator reduces variance and is validated in simulations.
New method corrects bias in CVaR estimation for extreme risks.
problem Limited data above VaR leads to poor CVaR estimation.
method Bias-corrected peaks-over-threshold (POT) estimation using GPD.
result Asymptotically unbiased CVaR estimator with lower threshold.
This study examines representation bias in open-source Qwen models for investment decisions.
problem Representation bias in financial applications of large language models.
method Balanced round-robin prompting over 150 U.S. equities, constrained decoding, token-logit aggregation.
result Firm size and valuation increase model confidence, while risk factors decrease it.
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.
Fair Adversarial Networks remove bias from data.
problem Bias in datasets leads to biased outcomes, making analysis illegal and sub-optimal.
method Remove bias from data by altering all proxy variables, ensuring fairness without changing analytical pipelines.
result Fair Adversarial Networks effectively remove bias from data.
Bias correction improves language model training performance.
problem Stochastic update bias in preconditioned optimizers.
method Cross-fitted preconditioning and variance-corrected inversion.
result Reduces held-out pretraining loss by 0.15 nats.
New method corrects selection bias in complex models.
problem Selection bias in statistical studies leading to systematic distortions.
method Amortized Bayesian inference with neural posterior estimation.
result Recover well-calibrated posterior distributions across diverse selection mechanisms.
New methods reduce bias in estimating calibration error.
problem Reducing bias in estimating calibration error.
method Synthesizing model outputs and using equal-mass bins.
result Two reliable calibration-error estimators found: debiased estimator and ECE_sweep.
Private statistics estimation faces a bias, accuracy, and privacy trilemma.
problem Balancing privacy, accuracy, and bias in statistical estimation.
method Use differential privacy (DP) for private statistics, but clip samples to control sensitivity and add noise for privacy, introducing bias.
result No algorithm can simultaneously have low bias, low error, and low privacy loss for arbitrary distributions.
The paper corrects biases in estimating intrinsic dimension and differential entropy.
problem Systematic bias in estimating intrinsic dimension and differential entropy.
method A bias-corrected estimator for both measures is proposed, highlighting shared steps and useful consequences.
result Simultaneous estimation of differential entropy and intrinsic dimension provides complementary perspectives on underlying manifolds.
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 Hessian estimators for Riemannian manifolds with reduced bias.
problem Estimating Hessians on Riemannian manifolds with reduced bias and computational efficiency.
method Introducing new stochastic zeroth-order Hessian estimators using O ( 1 ) O(1) O ( 1 ) function evaluations. result Achieved a bias bound of order O ( γ δ 2 ) O(γδ^2) O ( γ δ 2 ) for analytic real-valued functions.