New method better identifies irrelevant variables for more accurate treatment effect estimation.
problem Handling irrelevant variables in treatment effect estimation with deep disentanglement.
method Deep embedding method to disentangle pre-treatment variables, explicitly identify and represent irrelevant variables, and orthogonalize them.
result Better identification and representation of irrelevant variables lead to more precise treatment effect prediction.
The paper investigates how irrelevant features affect clustering performance.
problem The challenge of identifying relevant features in unsupervised clustering tasks.
method Investigation of clustering performance with added irrelevant features.
result Different types of irrelevant features impact clustering outcomes differently.
The problem of finding a reduced dimensionality representation of categorical variables while preserving their most relevant characteristics is fundamental for the analysis of complex data. Specifically, given a co-occurrence matrix of two variables, one often seeks a compact representation of one variable which preser…
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…
LLMs are vulnerable to task-irrelevant data changes, limiting their use for data fitting.
problem LLMs' sensitivity to task-irrelevant variations in data representation.
method Analysis of LLMs' performance and attention patterns under various data manipulations.
result LLMs are sensitive to task-irrelevant variations, leading to significant prediction errors.
Deep learning and set theory improve prediction accuracy regardless of data relevance.
problem Improving prediction accuracy with limited relevant training data.
method Deep learning and set theory applied to large labeled training data.
result Exceptional prediction results achieved with irrelevant training data.
Improved RL for TBGs by pruning irrelevant tokens and bootstrapping.
problem RL methods fail to generalize in TBGs with small data.
method CREST for irrelevant token removal, bootstrapped Q-learning.
result Improved generalization in unseen TextWorld games.
High-dimensional data acquired from biological experiments such as next generation sequencing are subject to a number of confounding effects. These effects include both technical effects, such as variation across batches from instrument noise or sample processing, or institution-specific differences in sample acquisiti…
Proposes a new stability measure for model fitting on similar feature data sets.
problem Model fitting on data sets with similar features is challenging.
method Tuning hyperparameters in a multi-criteria fashion with predictive accuracy and feature selection stability.
result Our approach achieves similar or better predictive performance than single-criteria and stability selection approaches.
Study of local optima in neural networks for feature interactions.
problem NNs struggle with local optima in feature interactions for small datasets.
method Proposed a node pruning and feature selection algorithm to improve NN performance.
result NNs have many non-equivalent local optima in XOR-like data with irrelevant variables.
Anisotropic neural network selects relevant features from datasets.
problem Reduction of irrelevant features improves model interpretability and performance.
method General Regression Neural Network with an anisotropic Gaussian Kernel.
result The method robustly selects features from simulated and real-world datasets.
A network removes irrelevant structures from chest radiographs for better analysis.
problem Clutter in chest radiographs hinders visual inspection and analysis.
method Fully Convolutional Network to suppress undesired visual structure.
result Improved classifier performance with limited training data.
A new fuzzy k-means algorithm for high-dimensional data with variable feature weights.
problem Clustering high-dimensional data with varying feature significance.
method Proposes a modified fuzzy k-means algorithm using two entropy terms to weight features.
result Improved clustering performance on various datasets compared to state-of-the-art methods.
Proposes a method to learn invariant representations for interpretability and fairness.
problem Learning invariant representations to achieve interpretability in algorithmic fairness.
method Adversarially trained model with null-sampling procedure to produce invariant representations in the data domain.
result Shows effectiveness on image and tabular datasets.
This paper solves deep learning's edge sensitivity issue by swapping important and irrelevant segments in synthetic data.
problem Edge sensitivity and high computational cost in deep learning classification models.
method Synthetic data with swapped segments to implicitly define receptive fields, preserving label information.
result The method drives networks to early convergence and appropriate solutions, improving person re-identification.
This paper simplifies OPE in large state spaces using state abstractions.
problem Accurately evaluating policies offline in large state spaces.
method Developed a backward-model-irrelevance condition and an iterative state abstraction procedure.
result Deeply-abstracted states substantially simplify OPE sample complexity.
Estimating the difficulty level of math word problems is an important task for many educational applications. Identification of relevant and irrelevant sentences in math word problems is an important step for calculating the difficulty levels of such problems. This paper addresses a novel application of text categoriza…
This paper addresses the challenges in classifying textual data obtained from open online platforms, which are vulnerable to distortion. Most existing classification methods minimize the overall classification error and may yield an undesirably large type I error (relevant textual messages are classified as irrelevant)…
This paper solves parameter estimation with ordered ℓ2 regularization using ADMM.
problem Scaling up ordered ℓ2 regularization for large-scale data. method Alternating Direction Method of Multipliers (ADMM) for ordered ℓ2 regularization. result ADMM-Oℓ2 outperforms or matches state-of-the-art methods in parameter estimation. Data acquisition, storage and management have been improved, while the key factors of many phenomena are not well known. Consequently, irrelevant and redundant features artificially increase the size of datasets, which complicates learning tasks, such as regression. To address this problem, feature selection methods ha…
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal nets with the weaker notion of epistemic irrelevance, which is arguably more suited for a behavioural theory of probability. Focusing on direct…
Hypergraph is a general way of representing high-order relations on a set of objects. It is a generalization of graph, in which only pairwise relations can be represented. It finds applications in various domains where relationships of more than two objects are observed. On a hypergraph, as a generalization of graph, o…
We aim to create the highest possible quality of treatment-control matches for categorical data in the potential outcomes framework. Matching methods are heavily used in the social sciences due to their interpretability, but most matching methods do not pass basic sanity checks: they fail when irrelevant variables are …
Method learns representations invariant to task-irrelevant details in reinforcement learning tasks.
problem Learning representations that are invariant to task-irrelevant details in reinforcement learning.
method Uses bisimulation metrics to learn robust latent representations that encode only task-relevant information.
result Demonstrates SOTA performance in modified visual MuJoCo tasks and a first-person driving task.
Sparse Bayesian learning is a state-of-the-art supervised learning algorithm that can choose a subset of relevant samples from the input data and make reliable probabilistic predictions. However, in the presence of high-dimensional data with irrelevant features, traditional sparse Bayesian classifiers suffer from perfo…
OSIRIS reduces variance in off-policy evaluation by omitting irrelevant states.
problem High variance in importance sampling-based OPE estimators.
method OSIRIS reduces variance by omitting likelihood ratios associated with states irrelevant to return.
result OSIRIS is unbiased and has lower variance than ordinary importance sampling.
A new neural network learns from acoustic scenes by suppressing irrelevant patterns.
problem Acoustic scenes are rich and redundant, making classification challenging.
method Spatio-temporal attention pooling layer coupled with a convolutional recurrent neural network.
result The method outperforms a strong convolutional neural network baseline and sets new state-of-the-art performance.
When searching for gene pathways leading to specific disease outcomes, additional information on gene characteristics is often available that may facilitate to differentiate genes related to the disease from irrelevant background when connections involving both types of genes are observed and their relationships to the…
Paper tackles robust domain adaptation without target domain data.
problem Learning domain invariant representations without target domain data.
method Integrates deep autoencoder and causal structure learning into a unified model.
result CAE learns causal representations using only source domain data.
Genome-wide association studies (GWAS) offer new opportunities to identify genetic risk factors for Alzheimer's disease (AD). Recently, collaborative efforts across different institutions emerged that enhance the power of many existing techniques on individual institution data. However, a major barrier to collaborative…
In this paper we introduce a new feature selection algorithm to remove the irrelevant or redundant features in the data sets. In this algorithm the importance of a feature is based on its fitting to the Catastrophe model. Akaike information crite- rion value is used for ranking the features in the data set. The propose…
Co-TSFA improves time series forecasting by distinguishing between short-lived and persistent anomalies.
problem Standard forecasting models fail to distinguish between short-lived and persistent anomalies, leading to overreaction or underreaction.
method Co-TSFA learns to ignore forecast-irrelevant anomalies and respond to forecast-relevant ones through input-only and input-output augmentations and a latent-output alignment loss.
result Co-TSFA improves performance under anomalous conditions while maintaining accuracy on normal data.
The method approximates stationary distributions of Markov models by truncating irrelevant states.
problem Computing the stationary distribution of complex Markov models is computationally challenging.
method A state-space lumping scheme that aggregates states in a grid structure, iteratively refining the state-space.
result The method provides a well-justified finite-state projection tailored to the stationary behavior of Markov models.
This paper analyzes shallow ViTs, providing sample complexity and SGD behavior insights.
problem Theoretical understanding of shallow ViTs, especially their sample complexity and SGD behavior.
method Data model with label-relevant and label-irrelevant tokens, theoretical analysis of shallow ViT training.
result Characterization of sample complexity for zero generalization error in shallow ViTs.
FIBS extracts relevant features from IBTSs for classification.
problem Classifying interval-based temporal sequences (IBTSs) using common algorithms is challenging.
method FIBS extracts features from IBTSs based on relative frequency and temporal relations, incorporating a filter-based selection strategy to avoid irrelevant features.
result FIBS effectively represents IBTSs for classification algorithms, providing similar or better accuracy compared to state-of-the-art competitors.
The paper tackles spurious correlations in machine learning models and introduces counterfactual invariance.
problem Spurious correlations in machine learning models that depend on irrelevant parts of input data.
method The paper uses causal inference to stress test models and introduces counterfactual invariance as a formal requirement.
result Counterfactual invariance is a requirement for models to be robust to irrelevant perturbations in input data.
New research shows testing IIA in discrete choice is nearly impossible with current sample sizes.
problem Testing the Independence of Irrelevant Alternatives (IIA) in discrete choice models is challenging.
method Combinatorial analysis of Eulerian orientations of cycle decompositions of a bipartite graph.
result Any general test for IIA with low worst-case error requires an exponential number of samples in the number of alternatives.
XGBoost fails to accurately identify relevant features, while interpretable methods do.
problem Accurately identifying relevant features in black-box models like XGBoost.
method Comparison of variable importance methods (CART, Optimal Trees, XGBoost, SHAP) across various experiments.
result Interpretable methods outperform black-box models in feature selection accuracy.
We present a novel recurrent neural network (RNN) based model that combines the remembering ability of unitary RNNs with the ability of gated RNNs to effectively forget redundant/irrelevant information in its memory. We achieve this by extending unitary RNNs with a gating mechanism. Our model is able to outperform LSTM…
Improved interpretability methods for ML models using local regressions and variable importance.
problem Inability of existing interpretability methods to provide reliable explanations for ML models, especially in high-dimensional problems with irrelevant features and non-linear relationships.
method Introduces VarImp and SupClus methods using local regressions with weighted distance considering variable importance.
result VarImp and SupClus methods yield better explanations than state-of-the-art approaches, especially in high-dimensional problems with irrelevant features and non-linear relationships.
Adaptive LASSO improves model selection for functional geostatistical data.
problem Modeling georeferenced data with spatiotemporal dynamics and functional coefficients.
method Penalized maximum likelihood estimator with adaptive LASSO penalty for simultaneous selection of spline basis functions and regressors.
result The penalized estimator outperforms the unpenalized estimator in all scenarios tested.
The inversion formula for conservative multifractal measures was unveiled mathematically a decade ago, which is however not well tested in real complex systems. In this Letter, we propose to verify the inversion formula using high-frequency turbulent financial data. We construct conservative volatility measure based on…
The paper develops embeddings to estimate causal effects from text data.
problem Estimating causal effects from text data with confounding features.
method Causally sufficient embeddings combining supervised dimensionality reduction and efficient language modeling.
result Causally sufficient embeddings improve causal estimation over related methods.
Due to advances in sensors, growing large and complex medical image data have the ability to visualize the pathological change in the cellular or even the molecular level or anatomical changes in tissues and organs. As a consequence, the medical images have the potential to enhance diagnosis of disease, prediction of c…
This paper analyzes self-supervised learning from a multi-view perspective.
problem Understanding and optimizing self-supervised learning from multi-view data.
method Information-theoretical framework to understand and design self-supervised learning objectives.
result Self-supervised representations can extract task-relevant information and discard task-irrelevant information.
Proposes learning latent reward model for planning from rewards.
problem Planning in high-dimensional state spaces with limited reward information.
method Directly learns a latent dynamics model from rewards, planning in latent state-space.
result Successfully learns accurate latent reward prediction model, achieving strong performance and high sample efficiency.
We present a novel method for exact hierarchical sparse polynomial regression. Our regressor is that degree r polynomial which depends on at most k inputs, counting at most ℓ monomial terms, which minimizes the sum of the squares of its prediction errors. The previous hierarchical sparse specification aligns w…
Theoretical framework for data augmentation in finance improves portfolio construction.
problem Improving portfolio construction in speculative markets.
method Developed a theoretical framework for data augmentation and regularization in deep learning for finance.
result A simple noise injection algorithm improves portfolio construction over no noise.