New datasets improve fairness research by revealing UCI Adult's limitations.
problem Limitations of UCI Adult dataset in fairness research.
method Reconstructed a superset of UCI Adult data from US Census sources.
result New datasets reveal trade-offs between fairness criteria and performance.
Study uses machine learning to predict income levels, achieving 88.16% accuracy.
problem Predicting income levels to reduce economic inequality.
method Used Gradient Boosting Classifier Model on UCI Adult Dataset.
result Achieved 88.16% accuracy in predicting income categories.
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.
New framework for fairness in machine learning models using SHAP values and adversarial learning.
problem Fairness of model predictions, especially for unprivileged groups.
method Develops a new fairness definition and a framework using SHAP values and adversarial learning to mitigate bias.
result Models produced are fairer and performant, demonstrating the approach on various datasets.
Noise-aware DP inference improves accuracy for complex models.
problem Inaccurate results and biases in DP inference for complex models.
method Noise-aware stochastic gradient variational inference.
result Accurate coverages and predictive probabilities for complex models.
Model predicts cannabis use disorder risk for adolescents and young adults.
problem Predicting cannabis use disorder progression in adolescents and young adults.
method Bayesian machine learning model trained on longitudinal data.
result Model provides personalized risk assessment with AUC of 0.68-0.75 and E/O ratio of 0.95-1.
Study optimizes fairness in predictive models by balancing utility and separation.
problem Balancing fairness and utility in predictive models.
method Information-theoretic approach using conditional mutual information (CMI).
result Reduces separation violations while maintaining or improving utility.
New method controls bias in training data for fair outcomes.
problem Ensuring equal treatment between different groups in machine learning.
method Contrastive information estimation to control mutual information between representations and protected attributes.
result Our method provides strong theoretical guarantees on the parity of any downstream algorithm.
The paper examines bias in ML models using the Adult dataset.
problem Understanding and mitigating bias in machine learning models.
method Mathematical framework for fair learning, Disparate Impact index, and evaluation of bias reduction methods.
result Some common bias reduction methods are ineffective.
This study observes accuracy variations of KNN, SVM, LMNN, and ENN on 11 UCI datasets.
problem To observe the variation of accuracies of KNN, SVM, LMNN, and ENN algorithms on different datasets.
method Implemented KNN, SVM, LMNN, and ENN on 11 UCI datasets and analyzed their accuracy.
result Comparison of algorithm performances on each dataset.
Differentially private method for synthetic data generation from vertically partitioned data.
problem Generating synthetic data from vertically partitioned data while preserving privacy.
method Differentially private stochastic gradient descent (DP-SGD) algorithm combined with secure multiparty computation (MPC).
result Comparable accuracy to non-partitioned data, demonstrating privacy-preserving synthetic data generation.
Neural linear model performs well on simple regression tasks but requires tuning.
problem Characterizing the neural linear model's performance on simple regression tasks.
method Characterized the neural linear model on UCI and gap datasets.
result The neural linear model shows good performance but requires good hyperparameter tuning.
A new method uses LLMs to discover causal pathways that affect fairness in machine learning.
problem Discovering fairness-relevant causal pathways in the presence of noise and confounding.
method Hybrid LLM-guided causal discovery framework combining active learning and dynamic scoring.
result LLM-guided methods, including the proposed active, dynamically scored variant, outperform baselines in recovering fairness-relevant structure under noisy conditions.
Decouples data privatization from user preferences for privacy-preserving data.
problem Privacy-preserving data with user-specific private information.
method Decouples data privatization from user preferences using a Variational Autoencoder (VAE) and a generative filter trained by a GAN-type robust optimization.
result Effective privatization of data with minimal disturbance to utility, as shown by experiments on MNIST, UCI-Adult, and CelebA.
Model predicts cognitive health risks based on smartphone usage patterns.
problem Identifying cognitive health risks through smartphone usage.
method Structured models of smartphone interactions analyzed over 12 weeks.
result AUROC of 0.79 in discriminating between healthy and symptomatic subjects.
Interpretable ML models for missing data and visualisation.
problem Understanding and evaluating fairness in ML models.
method Introduced angle-based variants of Learning Vector Quantization (LVQ) models.
result Models can handle missing values and extract knowledge from datasets.
Proposes a new network for accurate predictions and uncertainty estimation.
problem Uncertainty estimation in regression predictions without sacrificing accuracy.
method Decoupled two-stage training process with custom loss function.
result Reduces prediction error by 23-34% while maintaining 95% PICP.
Study reveals biases in facial landmark detection methods for dementia patients.
problem Challenges in facial landmark detection for older adults with dementia.
method Evaluation of seven facial landmark detection methods on frontal, profile, and various face regions.
result Significant performance differences between dementia patients and non-patients, and biases across face regions.
Combines k-NN and RVM for improved classification accuracy.
problem Improving k-NN's performance by considering relevancy.
method Integrates k-NN and RVM in kernel space, introduces a new stopping parameter.
result Significantly prunes irrelevant attributes and improves classification accuracy.
Paper optimizes TSK fuzzy systems for large datasets with MBGD and novel regularization.
problem Optimizing TSK fuzzy systems for large datasets with high dimensionality.
method Proposes MBGD with UR and BN for TSK fuzzy classifiers.
result UR and BN improve classification performance on various UCI datasets.
Eye tracking measures ADHD-related working memory deficits.
problem Diagnosing ADHD in adults requires reliable measures of working memory capacity.
method Eye tracking technology and machine learning applied to a working memory task.
result Machine learning generated features unique to ADHD.
Data mining techniques predict breast cancer types with high accuracy.
problem Early detection of breast cancer to reduce mortality rates.
method Twelve classification algorithms applied to the Breast Cancer Wisconsin dataset.
result High accuracy in predicting malignant and benign breast cancer.
The paper tackles fairness in algorithmic decision making using causal models.
problem Ensuring algorithmic decision making systems do not discriminate based on protected attributes.
method Introduces two definitions of group fairness (FACE and FACT) grounded in causal models and uses Rubin-Neyman potential outcomes framework for robust estimation.
result Demonstrates the effectiveness of FACE and FACT in detecting discrimination in real-world data sets.
Study shows explanation disparities in machine learning models are influenced by data and model properties.
problem Disparities in post-hoc machine learning explanation methods across race and gender.
method Simulations and experiments on a real-world dataset to assess challenges to explanation disparities.
result Increased covariate shift, concept shift, and omission of covariates increase explanation disparities, especially for neural network models.
Unified framework interprets SSL models, revealing biases.
problem Interpreting black-box SSL models for transparency.
method KREPES framework using Representer Landmarks and Nyström approximation.
result Direct audit of SSL latent space without supervision.
The study examines when to trust confidence thresholding in pseudo-labelling regression.
problem Calibrated probabilities from classifiers used for pseudo-labelling need careful handling to avoid bias in downstream regression.
method Developed a diagnostic apparatus to predict and bound the bias induced by confidence thresholding, derived a closed-form expression for the attenuation bias.
result The bias can be predicted from the residual score variance V∗, motivating a structural separation between classifier features and downstream controls. Gaussian Processes improve missing value imputation in datasets.
problem Handling missing values in large datasets.
method Sparse Gaussian Processes combined with stochastic variational inference.
result MGP significantly outperforms other imputation methods.
Evolutionary algorithms improve decision tree ensembles.
problem Improving predictive performance of decision trees.
method Real-valued vector representation of decision trees, evolutionary algorithms (Differential evolution, Evolution strategies).
result Proposed methods outperform classical decision tree induction algorithms.
New NHCAs improve multi-category classification efficiency.
problem Efficient multi-category classification for real-world problems.
method Twin SVM (TWSVM), Generalized eigenvalue proximal SVM (GEPSVM), Regularized GEPSVM (RegGEPSVM), and Improved GEPSVM (IGEPSVM) with OAA, BT, and TDS approaches.
result TDS-TWSVM outperforms other methods in classification accuracy.
Missing data imputation can help improve the performance of prediction models in situations where missing data hide useful information. This paper compares methods for imputing missing categorical data for supervised classification tasks. We experiment on two machine learning benchmark datasets with missing categorical…
Bayesian Deep Learning experiments often use weak baselines, leading to misleading conclusions.
problem Misleading conclusions in Bayesian Deep Learning due to weak baselines in experiments.
method Used a fixed number of iterations for baselines and compared them with models trained to convergence.
result Monte Carlo dropout baseline outperforms or performs competitively with superior methods.
FLDCRF improves sequence labeling performance with latent dynamics interactions.
problem Sequence labeling with improved performance and latent dynamics interactions.
method Factored Latent-Dynamic Conditional Random Fields (FLDCRF) with multiple latent dynamics interactions.
result FLDCRF outperforms state-of-the-art models across multiple datasets.
Automated method selects eye tracking variables for categorization tasks.
problem Limited duration of infant cooperation and biases in handpicked eye tracking variables.
method Automated selection of eye tracking variables using statistical techniques.
result Same eye tracking variables classify category learners from non-learners in adults and infants with high accuracy.
Framework generates fair synthetic data to avoid biases.
problem Societal and historic biases in training data lead to biased algorithms.
method Self-supervised learning with fairness constraints.
result Generated fair synthetic data maintains relationships while controlling biases.
Paper compares three regularization-based methods for HAR, highlighting their strengths and limitations.
problem Challenges in evolving ML models for dynamic health and well-being applications.
method Evaluation of three regularization-based continual learning approaches for Human Activity Recognition (HAR).
result No single technique outperformed all others in all scenarios considered.
Two new methods improve monotonic constraint enforcement in regression and classification trees.
problem Improving monotonic constraints in regression and classification trees.
method Proposed two new methods: one yields better results than LightGBM, the other yields even better results but is slower.
result The best method consistently beats the current implementation of LightGBM, achieving up to 1% loss reduction.
Proposes adversarial normalization for multi-domain image segmentation.
problem Current image normalization is per-dataset, limiting multi-domain segmentation.
method Adversarial training to learn common normalizing functions across multiple datasets.
result Optimal normalizer improves segmentation accuracy and realism.
In this paper we explore different regression models based on Clusterwise Linear Regression (CLR). CLR aims to find the partition of the data into k clusters, such that linear regressions fitted to each of the clusters minimize overall mean squared error on the whole data. The main obstacle preventing to use found re…
To improve accuracy and speed of regressions and classifications, we present a data-based prediction method, Random Bits Regression (RBR). This method first generates a large number of random binary intermediate/derived features based on the original input matrix, and then performs regularized linear/logistic regressio…
Maximal correlation framework improves fairness in machine learning algorithms.
problem Ensuring fairness in machine learning algorithms.
method Introducing maximal correlation framework for fairness constraints and deriving regularizers.
result The approach provides smooth performance-fairness tradeoff curves and competitive performance.
Regularization helps protect machine learning models from poisoning attacks.
problem Mitigating the impact of poisoned data on machine learning models.
method Distributionally-robust optimization using Wasserstein distance to find an upper bound for worst-case fitness.
result The regularizer is equal to the dual norm of the model parameters for regression models.
HAR-Net combines deep features with traditional hand-crafted features for better human activity recognition.
problem Challenges in traditional HAR methods, especially feature extraction.
method Combines deep learning and traditional feature engineering.
result Performance improvement of 0.9% compared to traditional SVM.
Efficiently approximates fairness-accuracy trade-offs for diverse datasets.
problem Inherent trade-off between fairness and accuracy in machine learning models.
method You-Only-Train-Once (YOTO) framework for computationally efficient approximation.
result Robust methodology for auditing model fairness with statistical guarantees.
Study uses ML to predict cancer patient mortality from FN onset.
problem Predicting mortality in cancer patients with FN to improve survival.
method Multi-domain machine learning models using HCUP data.
result Clinical diagnoses have highest predictive power for FN mortality.
A Bayesian treatment of latent directed graph structure for non-iid data is provided where each child datum is sampled with a directed conditional dependence on a single unknown parent datum. The latent graph structure is assumed to lie in the family of directed out-tree graphs which leads to efficient Bayesian inferen…
Differentially private fair binary classification algorithm developed.
problem Balancing privacy and fairness in binary classification.
method Decoupling technique for fairness, refinement for differential privacy.
result Algorithm maintains fairness, privacy, and utility guarantees.
Detecting depression early from social media texts.
problem Early diagnosis and prevention of depression.
method Topic analysis and learned confidence scores.
result Achieved good results compared to state of the art.
Stochastic Bayesian Neural Network improves scalability and performance.
problem Challenges in calculating posterior distribution in Bayesian Neural Networks.
method Maximizes Evidence Lower Bound using Stochastic Evidence Lower Bound objective function.
result Demonstrates improved performance and scalability over previous algorithms.