Predictive models can fail to generalize from training to deployment environments because of dataset shift, posing a threat to model reliability and the safety of downstream decisions made in practice. Instead of using samples from the target distribution to reactively correct dataset shift, we use graphical knowledge …
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 “removable variables”
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.
Debias concept-based explanations by removing confounding information.
problem Correlation between concepts and confounding features.
method Causal prior graph and two-stage regression technique.
result Success in removing biases and improving concept ranking.
Recursive causal discovery reduces errors and complexity in causal graph learning.
problem Challenges in causal discovery from limited data and computational complexity.
method Removable variables for recursive causal discovery, reducing problem size and CI tests.
result Worst-case performances nearly match lower bound, with state-of-the-art efficiency.
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 new method reduces CI tests for causal structure learning.
problem Exponential CI tests in constraint-based methods.
method Recursive Markov boundary-based approach.
result Significantly reduces CI tests compared to existing methods.
New method for accurate permutation inference in CCA.
problem Inaccurate permutation inference in CCA.
method Proposed solutions for permutation inference in CCA, including transforming residuals and stepwise estimation.
result Valid permutation tests for CCA with and without nuisance variables.
An econometric or statistical model may undergo a marginal gain if we admit a new variable to the model, and a marginal loss if we remove an existing variable from the model. Assuming equality of opportunity among all candidate variables, we derive a valuation framework by the expected marginal gain and marginal loss i…
A new method for joint noise removal and trend estimation from sparse signals.
problem Jointly removing noise and estimating trends from sparse signals.
method PENDANTSS combines SOOT/SPOQ penalties with BEADS algorithm in a Trust-Region block alternating variable metric forward-backward approach.
result Outperforms comparable methods in deconvolving analytical chemistry signals.
A new approach to quantum machine learning circuits reduces training difficulties.
problem Challenges in training deep quantum circuits due to flat training landscapes.
method Variable structure approach (VAns) to build ansatzes, applying rules for gate growth and removal.
result VAns successfully mitigates trainability and noise-related issues, improving performance in various applications.
Identification of informative variables in an information system is often performed using simple one-dimensional filtering procedures that discard information about interactions between variables. Such approach may result in removing some relevant variables from consideration. Here we present an R package MDFS (MultiDi…
Contingency Trainingcs.LG
When applied to high-dimensional datasets, feature selection algorithms might still leave dozens of irrelevant variables in the dataset. Therefore, even after feature selection has been applied, classifiers must be prepared to the presence of irrelevant variables. This paper investigates a new training method called Co…
Exogenous state variables and rewards can slow down reinforcement learning by injecting uncontrolled variation into the reward signal. We formalize exogenous state variables and rewards and identify conditions under which an MDP with exogenous state can be decomposed into an exogenous Markov Reward Process involving on…
New fairness approach removes direct effects of unprivileged groups through causal regularization.
problem Ensuring fairness in machine learning models for unprivileged groups.
method Proposes a new fairness definition based on causal effects and develops regularizations to remove the impact of unprivileged groups on model outcomes.
result Demonstrates effectiveness of the approach on various datasets, reducing unfairness with minimal performance loss.
Modified perturbation method removes non-smoothness in solving Black-Scholes equations.
problem Non-smoothness in solving Black-Scholes equations.
method Variable transformations and homotopy perturbation method.
result Excellent agreement with exact solutions for Black-Scholes and multi-asset options.
On the Ohsawa-Takegoshi extension theorem and removable singularities of plurisubharmonic functionsmath.CV
Paper extends Ohsawa-Takegoshi theorem to more general domains, proving removable singularities for plurisubharmonic functions.
problem Removable singularities of plurisubharmonic functions on complex domains.
method Extending Ohsawa-Takegoshi extension theorem to more general bounded complete Kähler domains.
result Proves removable singularities for plurisubharmonic functions across compact complete pluripolar sets.
Safe screening rules reduce -regression computation by fixing 76% of variables.
problem Efficiently solving -regression problems with large datasets.
method Convex relaxation and safe screening rules to eliminate variables.
result 76% of variables can be fixed to their optimal values, reducing computational burden.
Sources of variability in experimentally derived data include measurement error in addition to the physical phenomena of interest. This measurement error is a combination of systematic components, originating from the measuring instrument, and random measurement errors. Several novel biological technologies, such as ma…
Specialists tolerate defects to gain flexibility, which can be removed when needed.
problem The economic benefits and limitations of deliberately tolerating defects in decision-making.
method Analyzes the conditions under which defects can be kept and removed, using economic models and structural analysis.
result A defect is profitably removable if certain conditions are met, and the premium is the support function of the class's ROC set.
Specialists tolerate defects to gain flexibility, which can be removed when needed.
problem The economic benefits and limits of deliberately tolerating defects in decision-making.
method Analyzes the economic position of keeping and removing defects, using a coupling lemma and structural economic models.
result A defect is profitably removable if the detector-relevant distinction survives a restriction and the advantage condition holds.
To address the challenge of backpropagating the gradient through categorical variables, we propose the augment-REINFORCE-swap-merge (ARSM) gradient estimator that is unbiased and has low variance. ARSM first uses variable augmentation, REINFORCE, and Rao-Blackwellization to re-express the gradient as an expectation und…
Predictive modeling is increasingly being employed to assist human decision-makers. One purported advantage of replacing human judgment with computer models in high stakes settings-- such as sentencing, hiring, policing, college admissions, and parole decisions-- is the perceived "neutrality" of computers. It is argued…
Learning in models with discrete latent variables is challenging due to high variance gradient estimators. Generally, approaches have relied on control variates to reduce the variance of the REINFORCE estimator. Recent work (Jang et al. 2016, Maddison et al. 2016) has taken a different approach, introducing a continuou…
CPI overcomes limitations of permutation importance by providing accurate variable selection.
problem Misidentification of unimportant variables in complex models due to covariate correlations.
method Developed a model agnostic and computationally lean Conditional Permutation Importance (CPI) approach.
result CPI provides accurate type-I error control and more parsimonious variable selection.
OmniFold uses deep learning to deconvolve high-dimensional simulations.
problem Removing detector distortions and accounting for noise processes in high-dimensional simulations.
method OmniFold is a deep learning-based approach for maximum likelihood deconvolution.
result OmniFold can remove detector distortions and account for noise processes and acceptance effects.
Dimensionality reduction is one of the key issues in the design of effective machine learning methods for automatic induction. In this work, we introduce recursive maxima hunting (RMH) for variable selection in classification problems with functional data. In this context, variable selection techniques are especially a…
Predictive models learned from historical data are widely used to help companies and organizations make decisions. However, they may digitally unfairly treat unwanted groups, raising concerns about fairness and discrimination. In this paper, we study the fairness-aware ranking problem which aims to discover discriminat…
Proposes hybrid reinforcement learning for both discrete and continuous control problems.
problem Real-world control problems involving both discrete and continuous decision variables.
method Solves hybrid problems by optimizing for discrete and continuous actions simultaneously.
result Efficiently solves hybrid reinforcement learning problems and improves upon expert heuristics.
In practice, there are often explicit constraints on what representations or decisions are acceptable in an application of machine learning. For example it may be a legal requirement that a decision must not favour a particular group. Alternatively it can be that that representation of data must not have identifying in…
Proposes TSCI method to infer causal effects with weak or invalid instruments using machine learning.
problem Causal inference with weak or invalid instrumental variables.
method Two-stage curvature identification (TSCI) using machine learning.
result Asymptotically unbiased and Gaussian estimator for causal effects.
Benefiting Deep Latent Variable Models via Learning the Prior and Removing Latent Regularizationcs.LG
New findings suggest latent regularization is unnecessary for high-quality image generation.
problem Improving image generation quality without latent regularization.
method Investigated the effect of latent regularization on image generation using learned priors.
result In the case of a sufficiently expressive prior, latent regularization is not necessary and may harm image quality.
We propose a novel application of the Simultaneous Orthogonal Matching Pursuit (S-OMP) procedure for sparsistant variable selection in ultra-high dimensional multi-task regression problems. Screening of variables, as introduced in \cite{fan08sis}, is an efficient and highly scalable way to remove many irrelevant variab…
The paper proposes methods to extract and analyze individual variable information from complex dependencies.
problem Analyzing and understanding complex dependencies between multiple variables.
method Reversible normalization and iterative dependency reduction to extract individual information, and use it for direct mutual information and multi-feature Granger causality analysis.
result Decoupling of variables to analyze their individual information and direct mutual information transfers.
Mean representations of VAEs are correlated but still useful for tasks.
problem Correlation between mean and sampled representations of VAEs.
method Selective posterior collapse to identify active and passive variables.
result Passive variables in mean representations are correlated but uncorrelated in sampled ones.
Clustering analysis is one of the most widely used statistical tools in many emerging areas such as microarray data analysis. For microarray and other high-dimensional data, the presence of many noise variables may mask underlying clustering structures. Hence removing noise variables via variable selection is necessary…
We study the problem of estimating multiple linear regression equations for the purpose of both prediction and variable selection. Following recent work on multi-task learning Argyriou et al. [2008], we assume that the regression vectors share the same sparsity pattern. This means that the set of relevant predictor var…
Good data stewardship requires removal of data at the request of the data's owner. This raises the question if and how a trained machine-learning model, which implicitly stores information about its training data, should be affected by such a removal request. Is it possible to "remove" data from a machine-learning mode…
Generalized Linear Models (GLM) form a wide class of regression and classification models, where prediction is a function of a linear combination of the input variables. For statistical inference in high dimension, sparsity inducing regularizations have proven to be useful while offering statistical guarantees. However…
Elliptical slice samplingstat.CO
Many probabilistic models introduce strong dependencies between variables using a latent multivariate Gaussian distribution or a Gaussian process. We present a new Markov chain Monte Carlo algorithm for performing inference in models with multivariate Gaussian priors. Its key properties are: 1) it has simple, generic c…
Bayesian Black-Litterman model updated to use market data for latent variables.
problem Subjective investor views in BL model.
method Treating as latent variables and learning them from market data.
result Improved Sharpe ratios by 50% and reduced turnover by 55%.
Selective removal of data subsets can efficiently unlearn unwanted distributions.
problem Efficiently removing unwanted data subsets without losing important information.
method Formalized as distributional unlearning, using Kullback-Leibler divergence constraints to select a small subset of data.
result Proposed method achieves corresponding log-loss bounds and is quadratically more sample-efficient than random removal.
Proposes -CCA for sparse CCA with improved representation learning.
problem CCA models break with too many variables, and sparsity is beneficial.
method Sparse CCA with stochastic gates and -regularization.
result Improves representation learning by gating nuisance variables.
New method recovers latent confounders from high-dimensional proxy variables.
problem Detecting latent confounders from high-dimensional proxy variables.
method Proxy Confounder Factorization (PCF) framework using ICA-PCF and GD-PCF.
result ICA-PCF recovers confounders with high correlation and low error in synthetic and real-world data.
IETNet identifies important channels for MVTS classification.
problem Multivariate time series classification with blackbox deep networks.
method End-to-end network combining temporal feature extraction, variable selection, and interaction.
result IETNet improves model accuracy and reduces overfitting by identifying and removing non-predictive variables.
Random Intersection Treesstat.ML
Finding interactions between variables in large and high-dimensional datasets is often a serious computational challenge. Most approaches build up interaction sets incrementally, adding variables in a greedy fashion. The drawback is that potentially informative high-order interactions may be overlooked. Here, we propos…
To reduce human error and prejudice, many high-stakes decisions have been turned over to machine algorithms. However, recent research suggests that this does not remove discrimination, and can perpetuate harmful stereotypes. While algorithms have been developed to improve fairness, they typically face at least one of t…
Unified framework for explaining models by removing features.
problem Unclear relationships and preferences among existing model explanation methods.
method Removal-based explanations characterized by three dimensions.
result Unified framework unifies 26 existing methods.
Two important goals of high-dimensional modeling are prediction and variable selection. In this article, we consider regularization with combined and concave penalties, and study the sampling properties of the global optimum of the suggested method in ultra-high dimensional settings. The -penalty provides th…