Proposes RaT to mitigate bias in student-teacher estimation.
problem Systematic bias in teacher's predictions propagates to student model.
method Uses teacher to estimate residuals in student's predictions.
result RaT method reduces teacher bias effect and achieves optimal rate.
New method uses observational data to improve trial design efficiency.
problem Scarce randomized controlled trials; inefficiency of using observational data.
method Active Residual Learning, R-Design framework, R-EPIG criterion.
result Efficiently estimating residuals to correct observational bias improves trial design.
Deep ResNets favor low bottleneck rank with proper hyperparameters.
problem Understanding the inductive bias of deep neural networks.
method Computed minimum-norm weights of a deep linear ResNet.
result Deep nonlinear ResNets have an inductive bias towards minimizing bottleneck rank.
Improved stochastic approximation method reduces residual error.
problem Reducing residual error in stochastic approximation algorithms.
method Fixed-schedule one-quarter barrier and bias-corrected acceleration.
result Achieves T−1/2+o(1) residual reduction with O(1) primitive samples. This paper examines the use of a residual bootstrap for bias correction in machine learning regression methods. Accounting for bias is an important obstacle in recent efforts to develop statistical inference for machine learning methods. We demonstrate empirically that the proposed bootstrap bias correction can lead to…
Develops efficient inference for noise heterogeneity in machine learning models.
problem Downstream procedures based on residuals can be biased in additive noise models.
method Semiparametrically efficient inference using a novel Hilbert-valued one-step estimator.
result Constructs tests and confidence intervals for residual independence and goodness of fit.
A new principle minimizes residual and introduces momentum to improve PDE solution dynamics.
problem Ill-conditioning in Dirac-Frenkel residual minimization leads to non-unique parameter dynamics.
method Introduces a history variable (momentum) to select better-conditioned parameter velocities, preserving residual minimization while promoting smooth parameter evolutions.
result The approach leads to increased robustness in singular and near-singular PDE solution regimes.
Recent work in fairness in machine learning has proposed adjusting for fairness by equalizing accuracy metrics across groups and has also studied how datasets affected by historical prejudices may lead to unfair decision policies. We connect these lines of work and study the residual unfairness that arises when a fairn…
Bias correction needed after deep learning regression training.
problem Systematic error accumulation in deep learning regression models.
method Adjust bias of the machine learning model post-training.
result Bias correction efficiently solves error accumulation.
Flow-based generative models parameterize probability distributions through an invertible transformation and can be trained by maximum likelihood. Invertible residual networks provide a flexible family of transformations where only Lipschitz conditions rather than strict architectural constraints are needed for enforci…
In this paper we propose using the principle of boosting to reduce the bias of a random forest prediction in the regression setting. From the original random forest fit we extract the residuals and then fit another random forest to these residuals. We call the sum of these two random forests a \textit{one-step boosted …
A method to reduce bias in model-based policy evaluation by shifting operators.
problem Bias in value function computation from noisy estimated models.
method Operator shifting method to reduce the residual norm error.
result The shifting factor is always positive and upper bounded by $1+O\left(1/n
ight)$.
The study examines when to trust confidence thresholding in pseudo-labelling regression.
problem Calibrated probabilities from classifiers used for pseudo-labelling need careful handling to avoid bias in downstream regression.
method Developed a diagnostic apparatus to predict and bound the bias induced by confidence thresholding, derived a closed-form expression for the attenuation bias.
result The bias can be predicted from the residual score variance V∗, motivating a structural separation between classifier features and downstream controls. New estimator improves off-policy evaluation for large action spaces.
problem Conventional importance-weighting approaches suffer from excessive variance in off-policy evaluation for large discrete action spaces.
method Proposes OffCEM estimator based on conjunct effect model (CEM), applying importance weighting only to action clusters and using model-based reward estimation for residual effects.
result Proposed estimator is unbiased under local correctness condition, providing substantial improvements in OPE especially with many actions.
Inverse depth scaling found in LLMs due to similar layers averaging error.
problem Understanding how depth affects loss in large language models.
method Analysis of LLMs and toy residual networks.
result Loss scales inversely proportional to depth in LLMs.
Fast nonparametric conditional independence testing via two-stage regression
problem Fast nonparametric conditional independence testing
method BLITZ (Broad-to-Local Independence Testing via residualiZation)
result Better null calibration than fast kernel, random-feature, and regression-based competitors
Framework calculates positional influence in causal residual Transformers.
problem Understanding positional influence in causal residual Transformers.
method Adjoint-sensitivity framework for positional influence in causal residual Transformers.
result Exact evolution of adjoint-energy influence density and decomposition into residual transmission, nonlocal Volterra, and local channels.
Improved nonparametric regression with debiasing for root-n consistency.
problem Challenges in achieving root-n consistency and normal distribution for nonparametric estimators.
method Debiasing technique by adding a correction term to nonparametric estimators.
result Achieves root-n consistency and asymptotic normality.
Visualizes classification accuracy and label bias in neural nets and trees.
problem Identifying mislabeled cases in neural net and tree-based classifications.
method Silhouette plots and quasi residual plots of PAC (probability of alternative class).
result Comparison of different classifications using silhouette width and PAC plots.
We discovered secular trend bias in a drug effectiveness study for a recently approved drug. We compared treatment outcomes between patients who received the newly approved drug and patients exposed to the standard treatment. All patients diagnosed after the new drug's approval date were considered. We built a machine …
New method for evaluating and learning in complex decision-making scenarios.
problem Evaluating and learning from policies in contextual combinatorial bandits with high bias and variance.
method Factored action space decomposition and importance sampling-based estimator (OPCB).
result OPCB achieves superior performance in OPE and OPL compared to conventional methods.
PSiLON Net uses L1 weight normalization and 1-path-norm regularization for efficient learning and sparsity.
problem Efficient learning and sparsity in neural networks with limited data.
method PSiLON Net employs L1 weight normalization and 1-path-norm regularization to simplify the 1-path-norm and achieve efficient learning and near-sparse parameters. result PSiLON Net achieves reliable optimization and strong performance in the small data regime.
Proposes efficient calibration for indoor localization models.
problem Calibration data scarcity in wireless indoor localization.
method Uses synthetic labels and prediction sets to fine-tune a predictor and estimate bias.
result Yields rigorous coverage guarantees for prediction sets.
Enhanced TSFMs improve time series forecasting accuracy and reliability.
problem Variance, bias, and uncertainty in TSFMs' predictions on real data.
method Statistical and ensemble techniques including bagging, stacking, residual modeling, and prediction intervals.
result Hybrid models consistently outperform standalone TSFMs across multiple horizons.
The paper improves random forest models for non-Gaussian responses.
problem Improving random forest models for non-Gaussian responses.
method Extends boosting random forests to model exponential family responses using residuals and weights.
result Generalized boosted forests reduce bias and provide conservative confidence intervals.
GD iterates for non-homogeneous deep nets increase margin and converge in direction.
problem Understanding implicit bias in non-homogeneous deep networks.
method Characterization of GD iterates' properties starting from small empirical risk.
result GD iterates converge in direction despite diverging norms, satisfying KKT conditions.
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.
ProxySHAP approximates Shapley and Banzhaf interactions efficiently.
problem Efficient estimation of complex machine learning interactions.
method ProxySHAP combines tree-based proxy models with residual correction.
result ProxySHAP achieves state-of-the-art interaction approximation quality.
Study provides selective inference method for latent block models.
problem Challenges in constructing a test on a block structure selected by clustering algorithms.
method Developed a selective inference method for latent block models using squared residue minimization and simulated annealing.
result Proposed tests effectively handle selective bias in block structures compared to naive tests.
Itô processes are the most common form of continuous semimartingales, and include diffusion processes. This paper is concerned with the nonparametric regression relationship between two such Itô processes. We are interested in the quadratic variation (integrated volatility) of the residual in this regression, over a un…
CAM-GAN improves GANs for continual learning with efficient feature map transformations.
problem Efficient continual learning for GANs with reduced parameter growth.
method Designing and leveraging parameter-efficient feature map transformations, including global and task-specific parameters, residual bias, and Fisher information matrix.
result Significantly improved model performance and high-quality samples with fewer parameters.
GARCH-UGH improves VaR estimation for financial risk management.
problem Dynamic estimation of extreme VaR in financial time series.
method AR-GARCH filtering followed by a bias-reduced extreme value estimator.
result GARCH-UGH estimates are more accurate than conventional methods.
The paper connects neural collapse and low-rank bias in networks with L2 regularization.
problem Understanding the emergence of low-rank bias and neural collapse in L2-regularized networks.
method Unified theoretical framework linking TCV and rank of weight matrices, proving global optimality of DNC1, and establishing a benign landscape property.
result Zero TCV across intermediate layers minimizes representation cost under natural architectural constraints, and DNC1 is globally optimal.
Develops methods to correct bias in AI feedback for more accurate alignment.
problem Systematic bias in AI feedback compared to human labels.
method Two debiased alignment methods: DDPO and DIPO.
result Methods improve alignment efficiency and performance close to human-labeled data.
Method uses random forest with distance covariance for transfer learning in healthcare.
problem Transfer learning in random forests with sparse differences between source and target.
method Distance covariance-based feature weights in residual random forest.
result Upper bound on mean square error rate for transfer learning in RF.
We introduce an adversarial method for producing high-recall explanations of neural text classifier decisions. Building on an existing architecture for extractive explanations via hard attention, we add an adversarial layer which scans the residual of the attention for remaining predictive signal. Motivated by the impo…
Self-paced learning and hard example mining re-weight training instances to improve learning accuracy. This paper presents two improved alternatives based on lightweight estimates of sample uncertainty in stochastic gradient descent (SGD): the variance in predicted probability of the correct class across iterations of …
We find a novel correlation structure in the residual noise of stock market returns that is remarkably linked to the composition and stability of the top few significant factors driving the returns, and moreover indicates that the noise band is composed of multiple subbands that do not fully mix. Our findings allow us …
GRASP removes spurious correlations in fine-tuned models, improving task performance and reducing bias.
problem Fine-tuned models can latch onto spurious correlations, leading to bias and reduced generalization.
method GRASP identifies and removes spurious correlations from model weights without removing latent factors.
result GRASP significantly reduces bias and improves task performance in various fine-tuning tasks.
DAGR improves navigation by refining goal representations conditioned on the current state.
problem Goal-conditioned reinforcement learning lacks state awareness, leading to inefficient policy recovery.
method DAGR refines static goal embeddings into state-conditioned ones using gated cross-attention with a state-goal discrepancy map.
result DAGR improves navigation tasks on OGBench, matching or outperforming base methods.
DOLCE improves off-policy evaluation and learning by decomposing effects.
problem Bias in off-policy evaluation and learning due to policy mismatch.
method Uses lagged contexts and a moment-based training procedure to decompose and cancel bias.
result DOLCE achieves substantial improvements in off-policy evaluation and learning.
Deep networks can be biased to learn top eigenfunctions of the kernel outside the training set.
problem Spectral bias of deep networks in the kernel regime.
method Quantitative bounds on L2 difference between finite-width and infinite-width network trajectories. result Deep networks learn top eigenfunctions of the Neural Tangent Kernel over the entire input space, not just the training set.
This project demonstrated a methodology to estimating cooperate credibility with a Natural Language Processing approach. As cooperate transparency impacts both the credibility and possible future earnings of the firm, it is an important factor to be considered by banks and investors on risk assessments of listed firms.…
Abstract: Non-residually finite hyperbolic groups imply non-residually finite rigid hyperbolic groups.
problem Existence of non-residually finite hyperbolic groups
method Direct implication
result Existence of non-residually finite rigid hyperbolic groups
Residual finiteness is known to be an important property of groups appearing in combinatorial group theory and low dimensional topology. In a recent work [2] residual finiteness of quandles was introduced, and it was proved that free quandles and knot quandles are residually finite. In this paper, we extend these resul…
In this note, residual finiteness of quandles is defined and investigated. It is proved that free quandles and knot quandles of tame knots are residually finite and Hopfian. Residual finiteness of quandles arising from residually finite groups (conjugation, core and Alexander quandles) is established. Further, residual…
This work analyzes PINNs for advection-diffusion equations using NTK theory.
problem Understanding and resolving the training difficulties of PINNs for advection-diffusion equations.
method Neural Tangent Kernel (NTK) analysis of PINNs for the linear advection-diffusion equation (LAD).
result PINNs struggle due to spectral bias and convergence rate disparity, especially in advection-dominated and diffusion-dominated regimes.
Every non-trivial knot group is fully residually perfect.
problem Understanding the residual properties of knot groups.
method Analyzing the residual properties of knot groups using group theory.
result Every non-trivial knot group is fully residually perfect.