Neural networks with random hidden nodes have gained increasing interest from researchers and practical applications. This is due to their unique features such as very fast training and universal approximation property. In these networks the weights and biases of hidden nodes determining the nonlinear feature mapping a…
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,742 papers · 148 categories
Trend · papers per month
48 results for “hidden biases”
Study evaluates bias mitigation methods in deep learning, finds they often exploit hidden biases.
problem Deep learning systems learn biases, affecting performance on minority groups.
method Improved evaluation protocol, new dataset, robustness across different tuning distributions.
result Bias mitigation methods often exploit hidden biases, are not robust to multiple forms of bias, and are sensitive to tuning set choice.
Regularized training of an autoencoder typically results in hidden unit biases that take on large negative values. We show that negative biases are a natural result of using a hidden layer whose responsibility is to both represent the input data and act as a selection mechanism that ensures sparsity of the representati…
It's easy to fool yourself: Case studies on identifying bias and confounding in bio-medical datasetscs.LG
Two case studies reveal hidden biases and confounders in machine learning models of biomedical data.
problem Hidden biases and confounders in machine learning models of biomedical data.
method Two case studies examining biases and confounders in machine learning models of biomedical data.
result Prediction models performed well but hidden biases and confounders were revealed.
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 . We show that, if the activation function sat…
New method uncovers bias mechanisms in observational studies.
problem Understanding the sources of bias in observational studies.
method Analyzing the relationship between bias magnitude and nuisance function estimators' performance.
result Method can distinguish between common sources of causal bias.
The standard method of generating random weights and biases in feedforward neural networks with random hidden nodes, selects them both from the uniform distribution over the same fixed interval. In this work, we show the drawbacks of this approach and propose a new method of generating random parameters. This method en…
New benchmark uncovers hidden biases in LLMs that refuse to answer certain queries.
problem Evaluating fairness in LLMs, especially in sensitive applications.
method Silenced Bias Benchmark (SBB) using activation steering to reduce model refusals during QA.
result Exposes hidden unfair preferences in LLMs' latent space, distinguishing direct responses from underlying fairness issues.
Caus-Modens uses deep ensembles to better predict causal outcomes in hidden confounding scenarios.
problem Predicting causal outcomes in the presence of hidden confounders.
method Caus-Modens employs a modulated ensemble approach to improve prediction intervals for causal outcomes using sensitivity models.
result Caus-Modens provides tighter prediction intervals for causal outcomes compared to existing methods.
Paper detects biases in medical imaging ML models using counterfactual analysis.
problem Bias in medical imaging ML models negatively impacts generalization performance.
method Counterfactual invariance framework combining conditional latent diffusion models and statistical hypothesis testing.
result The method identifies and quantifies biases without direct access to counterfactual data.
Bayesian optimization improved for biased data.
problem Adversarial bias in observations, especially hidden confounders.
method Reduction to dueling bandits, information-directed sampling (IDS).
result First efficient kernelized algorithm with regret guarantees.
Method estimates CATE using RCT data to handle hidden confounders.
problem Estimating CATE in the presence of hidden confounders.
method Pseudo-confounder generator and CATE model alignment.
result Method reduces bias in CATE estimation.
Stable unactivated neurons reduce expressiveness in ReLU networks.
problem Reducing expressiveness in ReLU neural networks due to stably unactivated neurons.
method Investigated the probability of neurons being stably unactivated in ReLU networks with symmetric weight and bias distributions.
result Proved the probability of a neuron being stably unactivated in the second hidden layer of a ReLU network.
Periodic activation functions improve neural network reliability and interpretability.
problem Neural networks reinforce hidden biases, making them unreliable and hard to interpret.
method Introduce periodic activation functions in Bayesian neural networks to establish a connection with stationary Gaussian process priors.
result Periodic activation functions, including sinusoidal, triangular, and ReLU, improve model performance and sensitivity to perturbations.
DWTS uses observational data to improve clinical trial efficiency.
problem Lack of definitive conclusions from randomized clinical trials due to insufficient patient cohorts and confounding biases.
method DWTS combines observational data with randomized clinical trials using Doubly Debiased LASSO (DDL) to identify reliable covariates.
result DWTS reduces cumulative regret in clinical trials compared to standard methods.
CausalGame benchmarks LLM agents' causal thinking in games.
problem Evaluating causal thinking in AI Scientists with LLMs.
method Interactive games with 14 scenarios incorporating selection bias, measurement error, and hidden confounders.
result None of the 30 LLM agents demonstrated reliable causal thinking, with the best model achieving only 68.0% survival.
The estimation of treatment effects is a pervasive problem in medicine. Existing methods for estimating treatment effects from longitudinal observational data assume that there are no hidden confounders, an assumption that is not testable in practice and, if it does not hold, leads to biased estimates. In this paper, w…
Feedforward neural networks with random hidden nodes suffer from a problem with the generation of random weights and biases as these are difficult to set optimally to obtain a good projection space. Typically, random parameters are drawn from an interval which is fixed before or adapted during the learning process. Due…
We describe a generalization of the Hierarchical Dirichlet Process Hidden Markov Model (HDP-HMM) which is able to encode prior information that state transitions are more likely between "nearby" states. This is accomplished by defining a similarity function on the state space and scaling transition probabilities by pai…
We found hidden convexity in FPCA and developed a faster algorithm.
problem Bias in PCA leading to unequal subgroup outcomes.
method Convex optimization via eigenvalue optimization.
result Faster and fairer PCA algorithm.
Hidden Markov Models analyze mobile health data to identify APNS states.
problem Subjective self-report measures of APNS lead to errors and biases.
method Exploratory hidden Markov factor models and Stabilized Expectation-Maximization algorithm.
result Identified homogeneous APNS states and dynamic transitions.
Randomly initialized transformers show extreme token preferences.
problem Structural biases in randomly initialized transformers.
method Dissection of transformer architecture at initialization.
result Initialization-induced biases persist throughout training.
We prove that the binary classifiers of bit strings generated by random wide deep neural networks with ReLU activation function are biased towards simple functions. The simplicity is captured by the following two properties. For any given input bit string, the average Hamming distance of the closest input bit string wi…
This study examines biases in flow matching samplers using finite-sample estimation.
problem Biases in flow matching samplers when using finite-sample surrogates.
method Finite-sample plug-in estimation and hierarchy of empirical FM models.
result Exact empirical minimizer and smoothed plug-in regime identified for affine conditional flows.
We provide a mathematical definition of fragility and antifragility as negative or positive sensitivity to a semi-measure of dispersion and volatility (a variant of negative or positive "vega") and examine the link to nonlinear effects. We integrate model error (and biases) into the fragile or antifragile context. Unli…
Extreme learning machine (ELM) is a new single hidden layer feedback neural network. The weights of the input layer and the biases of neurons in hidden layer are randomly generated, the weights of the output layer can be analytically determined. ELM has been achieved good results for a large number of classification ta…
Debias recommender systems by accounting for hidden confounders using network information.
problem Debiased recommender systems to reduce bias caused by hidden confounders.
method Leverage network information to disentangle user conformity and item popularity, modeling exposure and ratings while controlling hidden confounders.
result The proposed method effectively debiases recommender systems, improving recommendation accuracy.
Autoregressive state transitions, where predictions are conditioned on past predictions, are the predominant choice for both deterministic and stochastic sequential models. However, autoregressive feedback exposes the evolution of the hidden state trajectory to potential biases from well-known train-test discrepancies.…
Human annotations serve an important role in computational models where the target constructs under study are hidden, such as dimensions of affect. This is especially relevant in machine learning, where subjective labels derived from related observable signals (e.g., audio, video, text) are needed to support model trai…
The asymptotic behavior of the stochastic gradient algorithm with a biased gradient estimator is analyzed. Relying on arguments based on the dynamic system theory (chain-recurrence) and the differential geometry (Yomdin theorem and Lojasiewicz inequality), tight bounds on the asymptotic bias of the iterates generated b…
Estimating treatment effects in time series with hidden confounding.
problem Estimating treatment effects in time series with hidden confounding.
method A neural framework that learns individual-level counterfactuals and flexible matching procedures.
result Improves counterfactual estimation under latent bias.
Paper tackles unobserved confounding in human-AI collaborations.
problem Unobserved confounding undermines human-AI collaboration effectiveness.
method Combines sensitivity analysis from causal inference with AI-driven statistical modeling.
result Enhances robustness and reliability of collaborative outcomes.
RVFL NNs perform well without direct links and output bias for regression.
problem Effect of direct links and output bias on RVFL performance.
method Classical and two new methods for generating hidden nodes' parameters tested.
result Direct links and output bias do not significantly improve RVFL accuracy for typical nonlinear regression problems.
FreB protocol uses AI to infer hidden parameters with valid confidence regions.
problem Generating biased or overconfident conclusions from AI-generated posterior distributions.
method Frequentist-Bayes (FreB) protocol reshapes AI-generated posterior distributions into valid confidence regions.
result FreB provides valid confidence regions that consistently include true parameters with expected probability.
A new method removes biases in data integration by using surrogate control outcomes.
problem Data integration methods can be biased due to data-dependent processes.
method Post-integrated inference method using surrogate control outcomes to account for latent heterogeneity.
result The method provides consistent and efficient estimators under minimal assumptions and potential misspecifications.
New method removes hidden confounders for unbiased treatment effect estimation.
problem Bias in treatment effect estimation due to unobserved confounders.
method Proposes a new debiased estimation approach via SVD to handle heterogeneous confounding.
result Established rate of convergence for the estimator under different noise conditions.
A test detects unfairness in machine learning classifiers.
problem Detecting and mitigating algorithmic biases in machine learning.
method Optimal transport theory to quantify and mitigate bias.
result Proposes a statistical test for detecting unfair classifiers.
The principle of peer review is central to the evaluation of research, by ensuring that only high-quality items are funded or published. But peer review has also received criticism, as the selection of reviewers may introduce biases in the system. In 2014, the organizers of the ``Neural Information Processing Systems\r…
When predictive models are used to support complex and important decisions, the ability to explain a model's reasoning can increase trust, expose hidden biases, and reduce vulnerability to adversarial attacks. However, attempts at interpreting models are often ad hoc and application-specific, and the concept of interpr…
Conditional restricted Boltzmann machines are undirected stochastic neural networks with a layer of input and output units connected bipartitely to a layer of hidden units. These networks define models of conditional probability distributions on the states of the output units given the states of the input units, parame…
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.
When quantitative models are used to support decision-making on complex and important topics, understanding a model's ``reasoning'' can increase trust in its predictions, expose hidden biases, or reduce vulnerability to adversarial attacks. However, the concept of interpretability remains loosely defined and applicatio…
Unified predictive uncertainty disentangled using deep split ensembles.
problem Understanding and quantifying uncertainty in NNs for real-world applications.
method Deep split ensemble approach using multivariate Gaussian mixture model.
result Inherently well-calibrated models with high flexibility to group features.
Convexifying Sparse Interpolation with Infinitely Wide Neural Networks: An Atomic Norm Approachcs.LG
This study uses neural networks to solve interpolation problems with sparse, infinitely wide layers.
problem Exact data interpolation using sparse, infinitely wide neural networks.
method Atomic norm framework to derive convex hulls and equivalent convex formulations.
result Simple characterizations of convex hulls for different constraints on network weights and biases.
Emergence of Globally Attracting Fixed Points in Deep Neural Networks With Nonlinear Activationscs.LG
The paper studies how neural networks evolve representations, finding a unique fixed point for nonlinear activations.
problem Understanding how neural networks transform input data across layers.
method Theoretical framework for the evolution of the kernel sequence, using mean-field regime and Hermite polynomials.
result For nonlinear activations, the kernel sequence converges globally to a unique fixed point.
Paper explores how knowledge distillation transfers inductive biases between models.
problem Transferring inductive biases between models for tasks with limited data.
method Knowledge distillation applied to models with different inductive biases (LSTMs vs. Transformers, CNNs vs. MLPs).
result Effect of inductive biases is transferred through knowledge distillation, impacting both performance and solution characteristics.
Market makers optimize bid/ask quotes under hidden Markov chain uncertainty.
problem Optimizing market quotes with hidden factors affecting order intensities.
method Solves stochastic control problem using filtering, control, and PDMPs theory.
result Value function is unique viscosity solution of dynamic programming equation.
Noise in RNNs promotes flatter minima and more stable dynamics.
problem Understanding and optimizing the training of RNNs with noise.
method Formalizing RNNs as stochastic differential equations and analyzing the effect of noise in the hidden states.
result Noise injection in RNNs leads to flatter minima, more stable dynamics, and improved robustness.