Secure methods learn fair models without revealing sensitive attributes.
problem Training fair machine learning models without exposing sensitive data.
method Secure multi-party computation to encrypt sensitive attributes.
result Outcome-based fair models can be learned, checked, or verified without revealing sensitive attributes.
System helps scientists visualize deep learning model of x-ray images.
problem Understanding complex x-ray scattering images with multiple attributes.
method Interactive visualization system in feature space and classification output.
result Users can explore and compare images and attributes flexibly.
Enhances dialogue model with persona attributes using adversarial learning.
problem Improving dialogue models to better capture speaker identity and topic.
method Adversarial learning framework with a dual discriminator system.
result phredGAN outperforms persona Seq2Seq model in various datasets.
DSGC improves graph representation learning by modeling object links and attribute relations.
problem Limited modeling capability of existing GCN variants on noisy and sparse real-world networks.
method Dimensionwise separable 2-D graph convolution (DSGC) that filters node features.
result DSGC achieves significant performance gain over state-of-the-art methods for node classification and clustering.
Unified approach for conversational recommendation by integrating attributes and items.
problem Cold-start users' real-time personalization in online recommendation.
method Seamlessly unifies attributes and items in Thompson Sampling framework for interactive decision-making.
result Conversational Thompson Sampling (ConTS) outperforms existing methods in success rate and conversation turns.
The paper proposes a unified taxonomy for biclustering methods.
problem Lack of a unified taxonomy for biclustering methods.
method Using concept lattices and attribute exploration to build a taxonomy.
result A unified taxonomy for biclustering methods.
Algorithm optimizes a single attribute in multi-armed bandits with constraints.
problem Optimizing a single attribute under multiple constraints in multi-armed bandits.
method Successive Rejects framework, information theoretic lower bound.
result Upper bound on probability of error decays exponentially with budget, nearly optimal in certain cases.
New methods solve sparse linear regression with limited attribute observation.
problem Sparse linear regression with limited attribute observation.
method Stochastic gradient methods using hard thresholding and adaptive combination of exploration and exploitation.
result Achieves sample complexity of O(1/ε) for error ε under restricted eigenvalue condition.
Extends local attributions to Bayesian Neural Networks for improved explanations.
problem Lack of explanations for Bayesian Neural Networks' predictions.
method Extend local attributions to a probabilistic explanation distribution of BNNs.
result Enriches standard explanations with uncertainty information and visualizes explanation stability.
Bayesian model for analyzing mixed data types.
problem Automatic exploratory analysis of heterogeneous datasets.
method General Bayesian non-parametric latent feature model.
result Automatic inference of model complexity and binary-valued latent features.
Paper tackles product categorization with structured and unstructured attributes for large-scale eCommerce.
problem Challenges in categorizing products with thousands of classes and millions of products.
method Compares hierarchical and flat models, uses Deep Learning for feature extraction, combines structured and unstructured attributes.
result Flat models perform better in specific cases, and the proposed approach handles faulty attribute names and values.
Automates UI implementation from designer images.
problem Automating UI implementation from designer images.
method Generative model training and imitation learning.
result 92.5% accuracy on Android Button attribute inference.
This work tackles community detection in networks with node attributes, achieving exact recovery.
problem Community detection in networks with correlated node attributes.
method Information-theoretic criterion and iterative clustering algorithm maximizing joint likelihood.
result Exact recovery of community labels under a general model for network and node attributes.
A novel method compresses point cloud attributes by folding them onto a 2D grid.
problem Efficiently compressing point cloud attributes for storage and transmission.
method Interpreting point clouds as 2D manifolds, folding onto a grid, and mapping attributes to the grid using optimized methods.
result The proposed folding-based approach achieves performance comparable to state-of-the-art codecs.
The paper explores how to find relevant vertices in one graph using another graph's attributes and structure.
problem Finding relevant vertices in one graph using another graph's attributes and structure.
method Theoretical and practical exploration of vertex nomination schemes that leverage both content (edge and vertex attributes) and context (network topology).
result Necessary and sufficient conditions for schemes that use both content and context to outperform those using only one.
Method finds significant attribute interactions in medical data.
problem Identify significant attribute interactions in medical datasets.
method Statistical significance testing and ASTRID method.
result Identifies interactions useful for feature selection and data anonymization.
This research discovers model architecture and training dataset characteristics through strategic input probing.
problem Discovering model architecture and training dataset characteristics in black box models.
method Structured input probes and model outputs are used to train a deep classifier for image and text classification.
result The approach successfully distinguishes between different image and text datasets and architectures.
The paper explores maximal perturbations to hide certain attributes in data while keeping the model's performance intact.
problem Protecting sensitive attributes from both model and human detection.
method Adversarial perturbations applied to raw data to conditionally damage model's classification of one attribute while preserving the rest.
result Maximal perturbations can hide certain attributes from both model and human detection, impacting model performance but not human perception.
HyperBERT enhances BERT for node classification on text-attributed hypergraphs.
problem Challenges in capturing hypergraph structure and text attributes in node classification.
method Mixing hypergraph-aware layers with BERT for improved node classification.
result HyperBERT achieves state-of-the-art results on text-attributed hypergraph benchmarks.
Study shows data attribution methods are sensitive to hyperparameters, making tuning costly.
problem Hyperparameter sensitivity in data attribution methods makes tuning impractical.
method Theoretical analysis and lightweight procedure for selecting regularization value without retraining.
result Proposes a lightweight procedure for selecting regularization value without model retraining.
This research simplifies computation of feature attribution methods under certain conditions.
problem Computational complexity of feature attribution methods, especially power indices.
method Identifying conditions for polynomial computation and introducing new indices.
result Conditions for efficient computation of feature attribution methods are identified.
Paper explores alternative cooperative game theory methods for machine learning feature attribution.
problem Debate over Shapley values' relevance in feature attribution.
method Introduces Weber and Harsanyi sets as alternative allocation schemes.
result Provides a coherent framework for designing robust feature attributions.
Proposes GNAN model for detecting various network structures.
problem Detecting traditional communities in networks.
method GNAN model combining topology and node-attribute information.
result GNAN detects a broader range of network structures.
This paper debiases KG embeddings by filtering sensitive attributes.
problem Social and cultural biases in KG representations.
method Exploring and filtering popularity and gender biases in KGE.
result Sensitivity of KG embeddings to sensitive attributes like gender.
OpenTag extracts missing attribute values from product descriptions.
problem Extract missing attribute values from product descriptions.
method Developed a deep tagging model OpenTag using LSTM and CRF, with an attention mechanism and active learning.
result OpenTag discovers new attribute values with minimal human annotation, achieving high F-score.
A new copula model for multi-attribute data using optimal transport.
problem Relaxing the Gaussian assumption for multi-attribute graphical models.
method Introducing a new copula (Cyclically Monotone Copula) and using optimal transport theory.
result The model allows arbitrary continuous distributions and is more flexible than classical methods.
SWAG combines screening and wrapper methods for interpretable sparse learning.
problem Need for interpretable and replicable machine learning results in sparse settings.
method Greedy exploration of attribute space to find sparse learners.
result Library of equivalent learners for attribute availability.
Adversarial training improves the sparsity and stability of neural network explanations.
problem Creating concise and stable explanations for neural network outputs.
method Theoretical exploration and empirical verification of adversarial training's impact on feature attributions.
result Adversarial training leads to sparser and more stable feature attributions in neural networks.
New attack recovers user-level information from large batch images.
problem Recovering private information from user-level gradients in distributed learning.
method Proposes a gradient inversion attack using a denoising diffusion model as a prior.
result Demonstrates recovery of realistic facial images and private attributes.
Adversarial methods fail to remove demographic attributes from text data.
problem Demographic information of authors is encoded in text-based neural classifiers.
method Adversarial training to remove demographic attributes.
result Post-hoc classifiers trained on encoded sentences still achieve higher accuracies.
TSInsight improves interpretability of deep time-series models.
problem Lack of interpretability methods for time-series data.
method Attach auto-encoder to classifier with sparsity-inducing norm, fine-tune based on gradients and reconstruction penalty.
result TSInsight effectively boosts interpretability of deep time-series models.
New method predicts dynamic relationships in terrorist networks.
problem Dynamic co-evolution of multiplex graphs and nodal attributes in terrorism networks.
method Time-varying stochastic latent factor models with neural network Gaussian processes.
result Superior performance in predicting unobserved dynamic relationships.
New method clusters mixed data types using homogeneity analysis.
problem Clustering datasets with a mix of numerical and categorical attributes.
method Homogeneity analysis to determine a Euclidean representation.
result The method is useful for analyzing big datasets with mixed data types.
A new method improves node classification in graphs with limited labels.
problem Semi-supervised multi-label node classification in attributed graphs.
method Collaborative Graph Walk (Multi-Label-Graph-Walk) using reinforcement learning.
result Significantly better multi-label classification performance compared to state-of-the-art methods.
New method uses mutual info and network science to explain deep learning models.
problem Interpreting deep neural networks for understanding their decision-making process.
method Coupling mutual information with network science to quantify information flow in deep learning models.
result Proposed NIF technique for codifying information flow in deep learning models.
The study compares different game-theoretic attribution methods and finds that interventional Shapley values yield less consistent results than Aumann-Shapley due to path symmetry.
problem Investigating the influence of path choice on game-theoretic attribution algorithms.
method Comparative analysis of interventional Shapley values and Generalized Integrated Gradients (GIG) methods.
result Interventional Shapley values yield less consistent attributions than Aumann-Shapley due to path symmetry and extended away from the training data manifold.
New technique reduces bias in DNN models without sensitive attribute annotations.
problem Existing bias mitigation methods require instance-level annotations and do not guarantee removal of all sensitive information.
method Representation Neutralization for Fairness (RNF) debiases only the classification head of DNN models using neutralized representations.
result RNF effectively reduces discrimination of DNN models with minimal performance degradation.
Paper explores combining auto-encoder representations to fool adversarial discriminators.
problem Combining auto-encoder representations to fool adversarial discriminators.
method Mixing function to produce interpolations of hidden states or masked combinations of latent representations.
result Shows that mixing function can produce interpolations consistent with a conditioned class label.
Music FaderNets learns high-level musical qualities from low-level attributes.
problem Learning high-level musical qualities from limited data and subjective labels.
method Model low-level attributes through feature disentanglement and latent regularization; infer high-level features from low-level representations using GM-VAEs.
result Model successfully learns intrinsic relationships between high-level features and low-level attributes with minimal labeled data.
TimeInf estimates data contribution in time series data, improving model performance and anomaly detection.
problem Estimating data contribution in time series datasets with temporal dependencies.
method Model-agnostic data contribution estimation method using influence scores.
result TimeInf effectively detects time series anomalies and outperforms existing methods.
A simple data discretization method improves classifier performance.
problem Machine learning classifiers struggle with continuous attributes.
method Supervised discretization approach to maximize accuracy while minimizing loss of information.
result The modified approach outperforms MIL and MDLP in several cases.
ICAM creates interpretable feature attribution maps for brain images.
problem Challenges in predicting class relevance from brain images due to heterogeneity and background variation.
method A VAE-GAN framework for disentangling class relevance from background features.
result FA maps generated by ICAM outperform baseline methods and support phenotype variation exploration.
New framework analyzes pre-stock jump trading behaviors using multivariate time series analysis.
problem Understanding micro-trading behaviors before stock price jumps.
method Multivariate time series analysis considering temporal information.
result Identifies highly informative attributes for predicting price jumps.
The paper investigates how overfitting and influence affect privacy risks in machine learning.
problem Privacy risk in machine learning models trained on sensitive data.
method Formal and empirical analyses of several machine learning algorithms.
result Overfitting and influence significantly increase privacy risks in machine learning models.
Paper creates fair synthetic data ensuring equal predictions across sensitive attributes.
problem Ensuring fair predictions across sensitive attributes in synthetic data.
method Equalizing target probability distributions across sensitive attributes in synthetic data generation.
result Synthetic data provides strong fair predictions, equal across all thresholds.
This paper analyzes text in financial disclosures to improve financial analysis.
problem Insufficient analysis of unstructured text in financial disclosures.
method Reviews and explores methods in computational linguistics and NLP.
result Highlights limitations of sentiment metrics and suggests future research areas.
Fairness in biased data learned through causal modeling.
problem Learning from biased historical datasets that reflect historical prejudices.
method Causal modeling approach to learn from observational data, even with unobserved confounders.
result Fairness-aware causal modeling provides better estimates of causal effects and more accurate policies.
Hierarchical RL simplifies exploration in RL tasks.
problem Why does hierarchy work well in RL?
method Evaluated hierarchical RL on various tasks, focusing on exploration benefits.
result Most benefits of hierarchy can be attributed to improved exploration.