PS-IG improves feature attribution by reducing noise and variance.
problem Improving feature attribution in machine learning models.
method Path-sampled integrated gradients (PS-IG) computes expected value over sampled baselines.
result PS-IG reduces attribution variance by a factor of 1/3 under uniform sampling.
Study reduces dataset size by 3 attributes to 73% classification accuracy.
problem Reducing dataset size for gender classification in TSI Life Satisfaction Survey.
method Attribute selection using Chi2 algorithm, followed by classification tests with Naive Bayes and Random Forest.
result Best classification rate achieved with 3 attributes selected by Chi2 algorithm.
Paper studies fairness postprocessing with imperfect attribute information.
problem Ensuring fairness with imperfect protected attribute information.
method Equalized odds postprocessing method with imperfect attribute information.
result Conditions on perturbation ensure reduced bias in classifier.
TaCo prevents non-linear classifiers from detecting sensitive attributes.
problem Ensuring fairness in NLP models by preventing sensitive attribute detection.
method Targeted Concept Erasure (TaCo) removes sensitive information from final latent representations, even against non-linear classifiers.
result TaCo outperforms state-of-the-art methods in reducing sensitive attribute prediction accuracy while preserving overall task performance.
New algorithm selects features more efficiently than existing methods.
problem Feature selection and attribute reduction in machine learning.
method Hybridizes B-SFLA with FRDD for efficient feature selection.
result Significantly outperforms other metaheuristic methods in feature selection and classification accuracy.
Enhances SDR via Hellinger correlation for better data dependency understanding.
problem Improving sufficient dimension reduction in single-index models.
method Developed a new method using Hellinger correlation for detecting the dimension reduction subspace.
result Significantly enhances and outperforms existing SDR methods through deeper data dependency understanding.
Method reduces bias in occupation classification without protected attribute data.
problem Mitigating bias in occupation classification without access to protected attributes.
method Uses word embeddings to discourage correlation between predicted occupation probability and name.
result Reduces race and gender biases without significant loss in true positive rate.
Improved saliency maps for deep neural networks with reduced noise.
problem Noisy explanations in Integrated Gradients for deep neural networks.
method SmoothTaylor, adaptive noising, and SmoothGrad techniques.
result SmoothTaylor and adaptive noising generate better quality saliency maps.
Unified framework for fair representation learning in machine learning.
problem Ensuring fairness in machine learning models, especially when biased data representations lead to unfair predictions.
method Integrates nonlinear sufficient dimension reduction with deep learning to construct fair and informative representations, introducing a penalty term to enforce conditional independence between sensitive attributes and learned representations.
result Achieves a superior balance between fairness and utility, significantly outperforming state-of-the-art baselines on various data structures.
Paper applies ANOVA decomposition for interpretable data approximation.
problem High-dimensional data interpretation and dimensionality reduction.
method ANOVA decomposition and Grouped Transformations for interpretability.
result Ability to rank variable interactions and unimportant variables.
Extraction of missing attribute values is to find values describing an attribute of interest from a free text input. Most past related work on extraction of missing attribute values work with a closed world assumption with the possible set of values known beforehand, or use dictionaries of values and hand-crafted featu…
Unified bounds for DP risks reduce noise and improve accuracy.
problem Difficult interpretation and calibration of DP mechanisms.
method Hypothesis-testing interpretation of DP (f-DP) and unified bounds. result Unified bounds are tighter and tunable for specific risks.
CARV reduces compute cost for downstream pipelines using diffusion models.
problem High variance in Monte Carlo estimators from diffusion models limits compute efficiency.
method CARV uses hierarchical MC estimation with amortized upstream computation and stratified-inverse-CDF.
result CARV delivers 2-3x effective compute multipliers without changing the objective.
Modern LLMs fail at authorship attribution without fine-tuning, but topic embeddings outperform them.
problem Authorship attribution of the Federalist Papers using modern LLMs.
method Examined popular LLMs, compared word/phrase embeddings, and used Bayesian analysis with topic embeddings.
result Topic embeddings trained on 'function words' outperform default LLM embeddings in authorship attribution.
Improved biclustering algorithm reduces memory usage and runtime.
problem Efficiently enumerating maximal biclusters in numerical datasets.
method Online partitioning to guide biclustering results.
result RIn-Close_CVC3 reduces memory usage and runtime, handles missing values.
ARM estimator improves gradient backpropagation in binary networks.
problem Improving gradient backpropagation through stochastic binary layers.
method ARM estimator using augment-REINFORCE-merge approach.
result ARM estimator achieves state-of-the-art performance in binary models.
ZAPs rewards users based on activity, making them less susceptible to bots and sybil attacks.
problem Incentive programs in DeFi are vulnerable to bots and sybil operations.
method ZAPs combines percentile normalization, two-layer weighting, and anomaly detection.
result ZAPs reduces adversarial reward capture by 30-90 percent.
Unsupervised learning of time series data, also known as temporal clustering, is a challenging problem in machine learning. Here we propose a novel algorithm, Deep Temporal Clustering (DTC), to naturally integrate dimensionality reduction and temporal clustering into a single end-to-end learning framework, fully unsupe…
Improves node classification in graphs with active learning.
problem Difficult or expensive labeling in node classification tasks.
method Graph cognizant logistic regression and preemptive query generation.
result Significant improvement over state-of-the-art approaches.
SX-GeoTree improves spatially coherent explanations in geospatial regression trees.
problem Capturing spatial dependence and producing robust explanations in tabular prediction models.
method Integrates three objectives: impurity reduction, spatial residual control, and explanation robustness via modularity maximization on a consensus similarity network.
result Improves residual spatial evenness and doubles attribution consensus (modularity: Fujian 0.19 vs 0.09; Seattle 0.10 vs 0.05).
In this paper, we analyze the behavior of the multivariate symmetric uncertainty (MSU) measure through the use of statistical simulation techniques under various mixes of informative and non-informative randomly generated features. Experiments show how the number of attributes, their cardinalities, and the sample size …
The paper introduces fair regression methods to predict real-valued outcomes while ensuring fairness.
problem Predicting real-valued outcomes while ensuring fairness with respect to protected attributes.
method Proposes schemes for fair regression under statistical parity and bounded group loss, applicable to various losses.
result The schemes provide theoretical guarantees on the optimality and fairness of the obtained solutions.
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…
FEALM learns features for better nonlinear DR of hidden patterns.
problem DR misses important patterns on distorted manifolds.
method FEALM generates optimized projections using an optimization algorithm and neighbor-shape dissimilarity.
result FEALM captures important patterns on hidden manifolds.
Post-hoc explanations improve CNNs by replacing final linear layer with k-means classifier.
problem CNNs lack accurate data representation in their built-in prototypes.
method Introduces k-means-based post-hoc explanations for CNNs, leveraging spatial consistency of convolutional receptive fields.
result Using shallower, less compressed feature activations improves semantic fidelity at the cost of slight predictive performance.
Improved signal classification using multiple wavelets and their smooth coefficients.
problem Signal classification accuracy declines with reduced attributes.
method Transform data with multiple wavelets, combine outputs, apply ensemble classifiers.
result Proposed technique outperforms raw data and single wavelet approaches.
A fair PCA method using JEVD ensures balanced data representation.
problem PCA's bias in data with demographic characteristics.
method Joint Eigenvalue Decomposition (JEVD) for fair PCA.
result JEVD optimally balances fairness and PCA's data structure.
This paper presents a Semantic Attribute Modulation (SAM) for language modeling and style variation. The semantic attribute modulation includes various document attributes, such as titles, authors, and document categories. We consider two types of attributes, (title attributes and category attributes), and a flexible a…
The paper classifies cervical cancer using various techniques and feature selection.
problem Classifying cervical cancer from a dataset with missing values and imbalance.
method Feature selection, over-sampling, under-sampling, dimensionality reduction, and classification techniques.
result Age, first sexual intercourse, number of pregnancies, smokes, hormonal contraceptives, and STDs: genital herpes are the main predictive features with high accuracy.
Trajectory-wise CVs reduce variance in policy gradient methods.
problem High variance in estimating policy gradient estimates.
method Proposes trajectory-wise control variates to reduce variance without bias.
result Trajectory-wise CVs are optimal for variance reduction under reasonable assumptions.
Proposes a Taylor framework to unify and analyze attribution methods.
problem Lack of a unified guideline for feature contribution assignment in machine learning models.
method Introduces a Taylor attribution framework to model the attribution problem and reformulates fourteen mainstream methods.
result Empirically validates the Taylor reformulations and reveals a positive correlation between performance and principles followed.
Unified framework for analyzing machine learning model attributions.
problem Lack of a general and theoretical framework for understanding attribution methods.
method Proposes a Taylor attribution framework to unify and analyze seven mainstream attribution methods.
result Established three principles for good attribution and empirically validated the Taylor reformulations.
Deep models generate images with missing high-frequency details.
problem Malicious use of realistic deep-generated images.
method Analysis of Fourier spectrum discrepancies between real and generated images.
result Detection method achieves up to 99.2% accuracy in classifying real and generated images.
Improved deep learning models using new attribution priors and expected gradients.
problem Improving interpretability and performance of deep learning models.
method Introducing new attribution priors and expected gradients method that satisfies interpretability axioms.
result Improves model performance across various real-world tasks.
Facial attribute editing aims to manipulate single or multiple attributes of a face image, i.e., to generate a new face with desired attributes while preserving other details. Recently, generative adversarial net (GAN) and encoder-decoder architecture are usually incorporated to handle this task with promising results.…
Paper tackles attribute pattern learning in high-dimensional SLAMs.
problem Learning significant attribute patterns from high-dimensional SLAMs.
method Proposes a penalized likelihood method for selecting attribute patterns.
result Establishes selection consistency in overfitted SLAMs.
Wavelet Attribution Method (WAM) improves feature attribution for deep models.
problem Inability of pixel-based heatmaps to capture data structure and variability in feature attribution.
method Wavelet domain for feature attribution, leveraging spatial and scale-localized properties of wavelet coefficients.
result WAM provides quantitatively superior explanations across audio, image, and volume modalities.
GraphSAINT improves GCN training efficiency and accuracy with graph sampling.
problem Neighbor explosion problem in minibatch training of GCNs.
method GraphSAINT constructs minibatches by sampling the training graph, ensuring fixed well-connected nodes in all layers.
result GraphSAINT achieves new state-of-the-art F1 scores for PPI and Reddit.
Proposes VCLANC for attributed network clustering using node and attribute embeddings.
problem Lack of mutual affinity exploitation between nodes and attributes in graph convolution.
method Dual variational auto-encoders for node and attribute embeddings, Gaussian mixture model priors, mutual distance and clustering assignment hardening losses.
result Demonstrates effectiveness on real-world attributed network datasets.
Study finds cherry-picking load shaping strategies outperforms others in reducing grid CO2 emissions.
problem Lack of detailed counterfactual data makes it hard to assess load shaping strategies' effectiveness.
method Calibrated granular ERCOT simulations for counterfactual analysis of load shaping strategies.
result LMP-based load shaping outperforms other strategies in reducing grid CO2 emissions.
Generates missing node attributes for better graph-based tasks.
problem Missing or incomplete node attributes degrade graph-based algorithms' performance.
method Deep adversarial learning-based method (NANG) to generate node attributes.
result Generated node attributes improve node classification and link prediction.
Proposes a method to predict node attributes using network topology.
problem Predicting node attributes in graphs for various applications.
method Creates a feature map using all attributes of neighbors to predict attributes values for a node.
result Significantly improves prediction accuracy compared to baseline approaches.
Investors seek to attribute performance to various features using Shapley value method.
problem Attributing performance to different features in an investment process.
method Use Shapley value method for attribution, either exactly or approximately.
result Shapley value method provides a preferred attribution approach.
Unified analysis of removal-based feature attributions robustness.
problem Robustness of removal-based feature attributions is not well understood.
method Theoretical analysis and upper bounds derivation for removal-based feature attributions under input and model perturbations.
result Upper bounds for the difference between intact and perturbed attributions derived under various perturbation settings.
A new method for disentangled latent spaces in VAEs that can manipulate attributes.
problem Disentangled representation of attributes in latent spaces of VAEs.
method Attribute-based regularization loss to enforce monotonic relationships between attributes and latent codes.
result Manipulation of attributes in latent spaces post-training.
VarNet learns and manipulates high-level attributes from inputs.
problem Manipulating high-level attributes of inputs.
method Generative model that learns attributes from data and can handle predefined attributes.
result VarNet can learn and manipulate relevant attributes from datasets.
AVA combines feature attribution methods for better model explanations.
problem Improving feature attribution methods for machine learning models.
method AVA: Aggregate Valuation of Antecedents, fusing antecedent event influence and value attribution.
result AVA provides better local and global model explanations.
Develops framework to evaluate feature attribution methods.
problem Lack of ground truth for evaluating feature attribution methods.
method Proposes a framework including a dataset and metrics.
result Certain methods produce false positive explanations.