Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

66131197262 · May 202619922001200920172026
48 results for directional bias

Stochastic Gradient Descent shows directional bias with moderate learning rates, impacting optimization outcomes.

problem Understanding the bias of SGD with moderate learning rates in practical scenarios.
method Analyzing SGD and GD on an overparameterized linear regression problem.
result SGD converges along large eigenvalue directions, GD along small ones, affecting early stopping outcomes.

Study reveals how neural network architectures bias their learning based on feature directions.

problem Understanding how neural network architectures bias their learning based on feature directions.
method Defined neural anisotropy directions (NADs) to encapsulate the directional inductive bias of architectures and provided an efficient method to identify them.
result NADs characterize the features used by CNNs to discriminate between different classes for the CIFAR-10 dataset.

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.

Deep ReLU networks escape from the origin via saddle points with a low-rank bias.

problem Understanding the dynamics of gradient descent in deep ReLU networks.
method Analysis of escape directions and singular values of weight matrices.
result The first singular value of the \ell-th layer weight matrix is at least 14\ell^{\frac{1}{4}} larger than any other singular value.

New algorithms estimate Hessians using random directions for faster stochastic optimization.

problem Efficiently estimating Hessians for stochastic optimization.
method Generalized Hessian estimators using random directions and noisy function measurements.
result Asymptotically unbiased estimators with lower bias for more measurements.

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.

We study the implicit bias of AdaGrad on separable linear classification problems. We show that AdaGrad converges to a direction that can be characterized as the solution of a quadratic optimization problem with the same feasible set as the hard SVM problem. We also give a discussion about how different choices of the …

2019-06-09abs ↗pdf ↗

Improved ridge regression with Frequent Directions for large-scale tasks.

problem Improving performance of ridge regression for large-scale data.
method Combines Frequent Directions with iterative optimization schemes.
result Achieves high accuracy in estimating bias and variance for sketched ridge regression.

An intriguing phenomenon observed during training neural networks is the spectral bias, which states that neural networks are biased towards learning less complex functions. The priority of learning functions with low complexity might be at the core of explaining generalization ability of neural network, and certain ef…

2019-12-03abs ↗pdf ↗

A bias classifier is introduced to resist adversarial attacks.

problem Resisting adversarial attacks on deep neural networks (DNNs).
method Introducing the bias part of a DNN with Relu as the activation function as a classifier, and adding a random first-degree part to make it information-theoretically safe.
result The bias classifier is more robust than DNNs of similar size against adversarial attacks.

Gradient descent implicitly follows regularization for general losses.

problem The implicit bias of gradient descent methods in machine learning.
method Empirical risk minimization over linear predictors with arbitrary convex, strictly decreasing losses.
result Gradient descent and regularization paths converge to the same direction for non-attained risks.

Ensembles improve classifier performance by reducing bias, not variance.

problem Improving classifier performance through ensemble methods.
method Extended bias-variance decomposition for classification tasks, introducing dual reparameterization.
result Ensembling reduces bias in classifiers, contrary to the traditional view.

Decomposes bias in linear models under demographic parity constraints.

problem Understanding and quantifying bias in linear models under fairness constraints.
method Post-processing framework to decompose bias into direct and indirect components.
result Analytical characterization of how demographic parity reshapes model coefficients.

Geometric framework explains and controls implicit bias in machine learning.

problem Understanding and controlling the selection of solutions in overparameterized models.
method Developed a theoretical and constructive framework based on geometric corrections induced by gradient noise and continuous symmetries of the loss.
result Computed the induced bias across various architectures and enabled inverse design to shape the bias.

We correct for sampling bias in training models to improve real-world performance.

problem Sampling bias causes discrepancies between lab and real-world model performance.
method Bayesian risk minimization and derived bias-corrected loss functions.
result Our approach integrates seamlessly into current learning paradigms and improves model performance.

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.

Geometric framework analyzes bias in variational inference for posterior functionals.

problem Analyzing the bias of posterior functionals under variational approximations.
method Developed a geometric framework to evaluate the bias of posterior functionals using the variational tangent space.
result The leading-order bias of a posterior functional is determined by its component orthogonal to the variational tangent space.

New algorithm identifies causal relationships from graphs, even with selection bias.

problem Identifying causal relationships from graphs with selection bias.
method Developed a measure-theoretic version of Pearl's causal calculus and a sound, complete identification algorithm.
result General measure-theoretic version of causal calculus allows for identification of causal relationships under selection bias.

Paper distinguishes causal structures under latent confounding and selection bias.

problem Distinguishing causal relationships when latent variables and selection bias are present.
method Formulated selected-marginalized directed graphs (smDGs) to distinguish causal structures.
result Two causal structures are indistinguishable if they have the same selected-marginalized directed graph.

This paper examines fairness and arbitrariness in bias mitigation methods.

problem Understanding how different bias mitigation strategies affect individual predictions and whether they introduce arbitrariness.
method FRAME framework to evaluate bias mitigation through five dimensions: Impact Size, Change Direction, Decision Rates, Affected Subpopulations, and Neglected Subpopulations.
result Significant differences in the behaviors of debiasing methods were exhibited, highlighting the limitations of current fairness criteria and the inherent arbitrariness in the debiasing process.

New methods correct bias in LLM-as-a-Judge evaluations, but reliability depends on judge quality and model calibration.

problem Systematic bias in LLM-as-a-Judge evaluations using naive estimators.
method Analytical results, simulations, and real-data case study to diagnose reliability of corrected estimates.
result Corrected estimates, especially shared-calibration comparisons, can be unreliable under certain conditions.

CPCR mitigates bias in PCR for overparameterized models.

problem Bias in Principal Component Regression (PCR) for overparameterized models.
method Calibrated Principal Component Regression (CPCR) learns a low-variance prior in the PC subspace and calibrates the model in the original feature space.
result CPCR outperforms standard PCR in overparameterized settings, improving prediction across multiple problems.

Study improves confidence measures in medical imaging pipelines by addressing bias.

problem Bias in metric-based imaging pipelines compromises the efficiency of prediction intervals.
method Formalized symmetric and asymmetric CP formulations, analyzed bias effects, and validated empirically.
result Symmetric intervals are inflated by bias, while asymmetric intervals remain unaffected.

Parametric images provide insight into the spatial distribution of physiological parameters, but they are often extremely noisy, due to low SNR of tomographic data. Direct estimation from projections allows accurate noise modeling, improving the results of post-reconstruction fitting. We propose a method, which we name…

2018-03-27abs ↗pdf ↗

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.

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~(sp(h)SAT)\widetilde{\mathrm{O}}(\sqrt{\mathrm{sp}(h^*) S A T}).

Two-layer networks favor simple features, especially in complex datasets.

problem Simplicity bias in neural networks over-reliing on simple features.
method Characterization of two-layer neural networks with small weights and gradient flow.
result Features learned in middle training stages are more useful for out-of-distribution transfer.

Unified framework for stability and generalization of Push-Sum in decentralized learning over directed graphs.

problem Understanding stability and generalization of Push-Sum in decentralized learning over directed networks.
method Developed a unified uniform-stability framework for SGP algorithm, incorporating imbalance-aware consistency bounds.
result Established finite-iteration stability and optimization guarantees for convex and non-convex objectives.

Gradient descent stagnates in low-precision, but unbiased rounding schemes improve convergence.

problem Stagnation of gradient descent in low-precision computation.
method Proposed unbiased stochastic rounding schemes that trade zero bias for larger probability of preserving small gradients.
result Unbiased rounding methods typically improve convergence rate of gradient descent for convex problems.

New insights into bias-variance tradeoff for data-driven optimization under local misspecification.

problem Understanding the relative performance of SAA, IEO, and ETO under local misspecification.
method Developed a local misspecification perspective using contiguity theory in statistics.
result Explicit expressions for decision bias and geometric understanding of variance.

Convolutional GANs favor low spatial frequencies, affecting fine detail generation.

problem Understanding GANs' limitations in high spatial frequency learning.
method Proposed method to manipulate GANs' bias against high spatial frequencies.
result Convolutional GANs have a bias against learning high spatial frequencies.