Proposes a progressive label correction method for feature-dependent label noise.
problem Real-world large-scale datasets often suffer from heterogeneous, feature-dependent label noise.
method A progressive label correction algorithm that iteratively refines the model.
result A classifier trained with this strategy converges to be consistent with the Bayes classifier for various noise patterns.
GRANITE unifies feature-based explanation methods to reduce disagreement.
problem Disagreement among feature-based explanation methods.
method GRANITE partitions feature space into regions minimizing interaction and distribution influences.
result Unified and consistent feature explanations.
dGAP learns feature dependencies and predicts targets simultaneously.
problem Learning task-agnostic statistical dependencies and missing explicit feature dependencies.
method Jointly optimizes a neural dependency graph and target prediction loss.
result dGAP can recover correct feature dependencies and improve prediction accuracy.
New methods using vine copulas improve accuracy of feature dependence in predictive models.
problem Inaccurate feature dependence assumptions in Shapley values lead to incorrect explanations.
method Proposed two new approaches based on vine copulas to model feature dependence.
result Vine copula approaches give more accurate approximations to true Shapley values.
Two new regularization methods improve neural network performance and complexity control.
problem Improving neural network performance and complexity control with correlated or high-dimensional features.
method Two regularization strategies: covariance-aware ridge and covariance-aware lasso.
result Improves predictive performance and complexity control over standard penalties.
New approach to adversarial robustness with non-uniform perturbations.
problem Real-world adversaries craft adversarial examples with non-uniform perturbations.
method Proposes non-uniform perturbations based on feature dependencies and data distribution.
result Shows improved robustness to real-world attacks compared to uniform perturbations.
A new method predicts true classes from positive and unlabeled data with additional labeled observations.
problem Predicting true classes from positive and unlabeled data with selection bias.
method Introduces augmented PU prediction, allowing feature-dependent labeling, and compares various empirical Bayes rules.
result The variational autoencoder-based method performs similarly or better than other methods and improves accuracy for unlabeled samples.
Saliency methods can make deep neural network predictions more interpretable by identifying a set of critical features in an input sample, such as pixels that contribute most strongly to a prediction made by an image classifier. Unfortunately, recent evidence suggests that many saliency methods poorly perform, especial…
DCC separates marginal estimation from dependence modeling for improved classification accuracy.
problem Classifying with strong dependence between features.
method Deep Copula Classifier using neural copula densities.
result Achieves excess-risk O(n−r/(2r+d)) for r-smooth copulas. New gene selection method improves tumor classification accuracy.
problem Efficiently selecting relevant genes from high-dimensional tumor gene expression data.
method Fuzzy-Rough Set Theory for feature dependency analysis.
result The proposed method outperforms state-of-the-art techniques in tumor classification.
Learning a distribution conditional on a set of discrete-valued features is a commonly encountered task. This becomes more challenging with a high-dimensional feature set when there is the possibility of interaction between the features. In addition, many frequently applied techniques consider only prediction of the me…
SISR improves feature attribution in complex payoff schemes.
problem Distorted feature attributions due to non-additive payoff functions and high-dimensional feature spaces.
method Sparse Isotonic Shapley Regression (SISR) learns a monotonic transformation to restore additivity and enforces L0 sparsity.
result SISR achieves strong support recovery and stable attributions across various payoff schemes.
New method for mixed data FI controls type I error and achieves high power.
problem Statistical inadequacy of feature importance measures for mixed data.
method Combining CPI framework with sequential knockoffs for mixed data.
result Our method controls type I error and achieves high power for mixed data.
Matching pursuit (MP) methods are a promising class of feature construction algorithms for value function approximation. Yet existing MP methods require creating a pool of potential features, mandating expert knowledge or enumeration of a large feature pool, both of which hinder scalability. This paper introduces batch…
Modern bio-technologies have produced a vast amount of high-throughput data with the number of predictors far greater than the sample size. In order to identify more novel biomarkers and understand biological mechanisms, it is vital to detect signals weakly associated with outcomes among ultrahigh-dimensional predictor…
In this paper, we show how novel transfer reinforcement learning techniques can be applied to the complex task of target driven navigation using the photorealistic AI2THOR simulator. Specifically, we build on the concept of Universal Successor Features with an A3C agent. We introduce the novel architectural contributio…
This work combines recurrent models with diffusion for probabilistic time series forecasting.
problem Scalability and capturing high-dimensional distributions and cross-feature dependencies in time series forecasting.
method Combines recurrent neural networks' efficiency with diffusion models' probabilistic modeling, using stochastic interpolants and conditional generation.
result Offers scalable probabilistic time series forecasting methods.
The Minority Game framework was recently generalized to account for the possibility that agents adapt not only through strategy selection but also by diversifying their response according to the kind of dynamical regime, or the risk, they perceive. Here we study the effects of this mechanism in different information st…
In the problem of domain adaptation for binary classification, the learner is presented with labeled examples from a source domain, and must correctly classify unlabeled examples from a target domain, which may differ from the source. Previous work on this problem has assumed that the performance measure of interest is…
We consider the hypothesis testing problem of detecting conditional dependence, with a focus on high-dimensional feature spaces. Our contribution is a new test statistic based on samples from a generative adversarial network designed to approximate directly a conditional distribution that encodes the null hypothesis, i…
An inductive probabilistic classification rule must generally obey the principles of Bayesian predictive inference, such that all observed and unobserved stochastic quantities are jointly modeled and the parameter uncertainty is fully acknowledged through the posterior predictive distribution. Several such rules have b…
Already before systems malfunction one has to know if hardware components will fail in near future in order to counteract in time. Thus, unplanned downtime is ought to be avoided. In medical imaging, maximizing the system's uptime is crucial for patients' health and healthcare provider's daily business. We aim to predi…
PDSketch enables flexible robot planning by learning from domain structures.
problem Building general robots with flexible planning.
method Exploiting locality and sparsity in environmental models, PDSketch defines high-level structures for trainable neural networks.
result PDSketch automatically generates planning heuristics without additional training.
Recently, deep neural networks have demonstrated excellent performances in recognizing the age and gender on human face images. However, these models were applied in a black-box manner with no information provided about which facial features are actually used for prediction and how these features depend on image prepro…
The paper develops methods to create reliable prediction sets for complex mixture models in high-dimensional data.
problem Building accurate prediction sets for high-dimensional mixture models with feature-dependent weights.
method The authors introduce a debiasing procedure and a novel interval combination strategy to construct valid prediction sets.
result The proposed method provides reliable coverage guarantees for prediction sets in high-dimensional mixture models.
CACTI improves tabular data imputation by leveraging missingness patterns and contextual information.
problem Tabular data imputation with improved accuracy and robustness.
method Masked autoencoding approach with median truncated copy masking and contextual information.
result Average R2 gain of 7.8% over the next best method across various datasets and missingness conditions. Model-agnostic interpretation methods can mislead if not used carefully.
problem Misinterpretation of machine learning models due to improper use of techniques.
method General pitfalls of model-agnostic interpretation methods.
result Many pitfalls exist when using global interpretation techniques for machine learning models.
FoSR adds edges to graphs to prevent oversquashing and oversmoothing in GNNs.
problem Oversquashing and oversmoothing in graph neural networks (GNNs).
method First-order spectral rewiring to add edges based on spectral expansion, combined with a relational architecture.
result Our algorithm outperforms existing graph rewiring methods in graph classification tasks.
SA-FDR uses simulated annealing for feature selection in high-dimensional data.
problem Feature selection in high-dimensional datasets with high predictive accuracy.
method Simulated Annealing for combinatorial optimisation of feature subsets.
result SA-FDR selects more compact feature subsets with high predictive accuracy.
New measure of feature influence in classification problems considering feature dependencies.
problem Measuring the influence of features in classification problems with dependencies.
method Developed a new measure based on cooperative game theory, providing axiomatic characterization and demonstrating its equivalence to the Banzhaf-Owen value.
result The proposed influence measure effectively characterizes feature importance in classification problems with feature dependencies.
Paper uses VAEAC to estimate Shapley values for complex models with mixed features.
problem Estimating Shapley values for models with dependent mixed features.
method Uses variational autoencoder with arbitrary conditioning (VAEAC) to model feature dependencies.
result VAEAC approach outperforms state-of-the-art methods for various settings.
Explaining complex or seemingly simple machine learning models is an important practical problem. We want to explain individual predictions from a complex machine learning model by learning simple, interpretable explanations. Shapley values is a game theoretic concept that can be used for this purpose. The Shapley valu…
PENN neural network estimates parameter distributions for econ models.
problem Lack of interpretability in deep neural networks for econ applications.
method Generative neural network architecture for Bayesian inference.
result PENN provides interpretable parameter estimates and visualizations.
FedReLa: A novel data-level approach for imbalanced federated learning
problem Improving accuracy of federated learning models under class imbalance and data heterogeneity
method Re-labeling samples with a feature-dependent label re-allocator
result Significant improvements in accuracy for minority classes and overall accuracy on stepwise-imbalanced and long-tailed datasets
Conformal prediction fails under severe feature turnover in COVID-19 supply chain tasks.
problem Dealing with distribution shift in conformal prediction models.
method Using COVID-19 as a natural experiment across 8 supply chain tasks, analyzing SHAP explanations.
result Coverage drops vary widely (0% to 86.7%) and correlate with single-feature dependence.
EHBOS enhances HBOS by capturing feature interactions, improving anomaly detection.
problem Limited ability of HBOS to detect anomalies in datasets with feature interactions.
method Incorporates two-dimensional histograms to capture feature pair dependencies.
result EHBOS outperforms HBOS on datasets with critical feature interactions, achieving notable improvements in ROC AUC.
The logcosh loss function helps neural networks learn set-valued functions better.
problem Learning set-valued functions with neural networks.
method Using artificial neural networks with logcosh loss.
result Neural networks with logcosh loss can classify samples based on set-valued functions.
DiffKnock improves feature selection in neural networks with complex dependencies and non-linear associations.
problem Selecting important features in neural networks with complex dependencies and non-linear associations.
method DiffKnock uses diffusion models to generate knockoffs and neural network statistics to measure feature importance.
result DiffKnock outperforms existing methods in detecting non-linear associations and preserving feature dependencies.
Proposes a method to create shorter, more accurate prediction intervals.
problem Challenges in achieving both conditional validity and interval efficiency in complex settings.
method Uses a conformal-style calibration method for neural network responses, adjusting to empirical PIT distribution.
result Demonstrates better conditional calibration and shorter intervals than existing methods.
This paper explores good practices for AI explainability in finance.
problem Complex financial models lack transparency and interpretability.
method Exploring good practices for deploying explainability in AI-based financial systems.
result Developing effective XAI tools for the financial industry.
Study robustness of early-stopping GD for linear regression attacks.
problem Robustness of gradient-descent methods to adversarial attacks.
method Early-stopping strategies, gradient-descent, Mahalanobis attacks, feature-dependent learning rates, data transformations.
result Early-stopped GD is optimally robust to Euclidean-norm attacks but sub-optimal for Mahalanobis attacks.
A new framework detects anomalies in multivariate time-series data.
problem Lack of explicit relationships between time-series data.
method Graph Attention Network framework that considers temporal and feature dependencies.
result Outperforms state-of-the-art models on three real-world datasets.
Given a (genus 2) cube-with-holes M, i.e. the complement in S^3 of a handlebody H, we relate intrinsic properties of M (like its cut number) with extrinsic features depending on the way the handlebody H is knotted in S^3. Starting from a first level of knotting that requires the non-existence of a planar spine for H, w…
Recreating cyber-attack alert data with a high level of fidelity is challenging due to the intricate interaction between features, non-homogeneity of alerts, and potential for rare yet critical samples. Generative Adversarial Networks (GANs) have been shown to effectively learn complex data distributions with the inten…
New methods create counterfactuals for image regression models.
problem Creating interpretable explanations for regression models in images.
method Two methods using diffusion-based generative models to create counterfactuals.
result Diffusion-based methods produce realistic, semantic, and smooth counterfactuals.
CIRCE measures conditional independence for learning invariant features.
problem Learning invariant features while being conditionally independent of a distractor.
method CIRCE is a measure of conditional independence applied as a regularizer in feature learning.
result CIRCE provides a zero value if and only if features are conditionally independent of the distractor given the target.
CoI framework models clinical feature interactions, revealing temporal dependencies and enhancing transparency.
problem Capturing latent, time-varying dependencies among clinical features in time-series data.
method Chain-of-Influence (CoI) framework constructs an explicit, time-unfolded graph of feature interactions.
result Achieves state-of-the-art predictive performance (AUROC of 0.960 on CKD progression and 0.950 on ICU mortality).
A new algorithm optimizes unknown functions with noisy data and unmatched features.
problem Sequentially maximizing a function with unknown and noisy data and features not under control.
method Bayesian conditional mean embedding and Gaussian process for uncertainty.
result Empirically outperforms state-of-the-art algorithms.