Paper tackles fairness in algorithms by predicting protected class from auxiliary data.
problem Protected class membership is often unobserved in data, leading to unfair algorithmic decisions.
method Use auxiliary datasets to predict protected class from proxy variables and provide characterizations of possible disparities.
result Common disparity measures are generally unidentifiable with auxiliary data, highlighting the need for robust assessments.
Framework for fair classification with noisy protected attributes and provable guarantees.
problem Fair classification with noisy protected attributes.
method Optimization framework for linear and linear-fractional fairness constraints, handling multiple non-binary attributes.
result Provably fair classifier with minimal accuracy loss, even with large noise.
New framework for fair classification in adversarial settings with provable guarantees.
problem Fairness in classification with adversarial perturbations of protected attributes.
method Optimization framework for learning fair classifiers with provable guarantees.
result Near-tightness of accuracy and fairness guarantees for multiple protected attributes and various hypothesis classes.
Topologically protected vortex knots and links are proposed and proven.
problem Decaying of tangled vortex structures through local reconnections and strand crossings.
method Proposed and proven topologically protected vortex structures using non-Abelian topological vortices.
result Existence of topologically protected Q8-colored links and classification using the Q-invariant. AdaFair boosts fairness in ML models by balancing accuracy and class imbalance.
problem Discrimination in ML models based on sensitive attributes.
method AdaBoost with cumulative fairness and class imbalance optimization.
result Achieves parity in true positive and true negative rates for both protected and non-protected groups.
Assessing the fairness of a decision making system with respect to a protected class, such as gender or race, is challenging when class membership labels are unavailable. Probabilistic models for predicting the protected class based on observable proxies, such as surname and geolocation for race, are sometimes used to …
A new model protects deep learning models from GAN attacks.
problem Vulnerability of collaborative learning to GAN attacks.
method Introduces a key-based classification model and a training scheme using private keys.
result Resilient against GAN attacks without increasing model complexity.
New EPS insurance offers partial protection against superannuation losses.
problem Lack of efficient investment insurance for superannuation holders.
method Developed a new financial derivative, equity protection swap (EPS), and derived a fair pricing formula.
result EPS can be an efficient investment insurance tool for superannuation accounts.
New algorithm mitigates bias in subset selection with noisy protected attributes.
problem Mitigating bias in subset selection when protected attributes are noisy.
method Formulated a denoised selection problem and developed a linear-programming based approximation algorithm.
result The approach can produce fairer subsets despite noisy protected attributes.
Ward2ICU dataset protects patient privacy while generating synthetic ICU transitions data.
problem Protecting patient privacy while creating synthetic ICU transition data.
method Wasserstein Generative Adversarial Network (GAN) to generate synthetic data, class label balancing.
result Quality of synthetic data generation assessed through binary classification task.
Quantum map counts BPS states in special theories.
problem Computing protected spin characters in class S theories.
method Geometric approach from 5D supersymmetric Yang-Mills theory.
result Explicit computation of protected spin characters in various examples.
New metrics differentiate effective OOD sets for training calibrated CNNs.
problem Vanilla CNNs struggle with out-of-distribution (OOD) samples.
method Developed metrics based on generalization errors of Augmented-CNN.
result Most protective OOD sets lead to better A-CNN performance.
Paper proposes protecting DNN models with secret key preprocessing.
problem Protecting deep learning models from unauthorized access.
method Block-wise pixel shuffling with secret key for preprocessing.
result Protected models maintain close performance to non-protected models with correct key, but accuracy drops significantly with incorrect key.
Intersectionality is a framework that analyzes how interlocking systems of power and oppression affect individuals along overlapping dimensions including race, gender, sexual orientation, class, and disability. Intersectionality theory therefore implies it is important that fairness in artificial intelligence systems b…
Paper presents a lightweight, unobtrusive method to protect edge device data privacy.
problem Protecting inference data privacy in IoT edge devices with limited compute power.
method A lightweight neural network at edge devices to obfuscate inference data without indicating obfuscation.
result Effectively protects inference data confidentiality while preserving backend accuracy.
Classifiers and rating scores are prone to implicitly codifying biases, which may be present in the training data, against protected classes (i.e., age, gender, or race). So it is important to understand how to design classifiers and scores that prevent discrimination in predictions. This paper develops computationally…
Paper proposes a new approach to GDPR compliance using data protection analytics.
problem Lack of research on data protection risk management and difficulty in GDPR compliance.
method Quantitative approach to data protection risk-based compliance.
result Improves data protection impact assessments by integrating analytics and expert opinions.
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.
Unified methods for hedging impermanent loss in decentralized exchanges.
problem Hedging impermanent loss in liquidity provision at decentralized exchanges.
method Static and dynamic approaches using arbitrage-based methods for valuation and risk management.
result Unified valuation and hedging formulas for IL protection claims.
Develops methods to measure and reduce fairness in datasets with limited protected attribute labels.
problem Measuring and reducing fairness in datasets with limited protected attribute labels.
method Proposes methods to estimate fairness metrics and train models to limit fairness violations using probabilistic protected attribute labels.
result Our methods provide tighter bounds on true disparity and effectively reduce fairness violations with lesser fairness-accuracy trade-offs.
Study protects federated learning models from eavesdropping attacks.
problem Protecting client models in federated learning from eavesdropping adversaries.
method Theoretical analysis and numerical experiments examining various factors.
result Theoretical and experimental results show the effectiveness of protection methods.
Fairness audits fail under missing protected labels, especially at zero access.
problem Understanding the reliability of fairness audits with incomplete protected-label data.
method Introduced a seed-calibrated stress test to separate missingness effects from seed-to-seed movement.
result Missing protected labels do not significantly alter fairness mitigation methods, but they can lead to harmful intersectional outcomes.
We study the question of fair clustering under the {\em disparate impact} doctrine, where each protected class must have approximately equal representation in every cluster. We formulate the fair clustering problem under both the k-center and the k-median objectives, and show that even with two protected classes th…
New algorithm shows how networked agents can protect against systemic risk.
problem Understanding and managing systemic risk in networked systems.
method Developed a simple algorithm to model protection dynamics in networked agents.
result Protection mechanisms can emerge even in random networks, reducing systemic risk.
New methods ensure fairness in noisy protected groups.
problem Noisy or biased protected group information complicates fairness audits.
method Robust optimization techniques to enforce fairness on true groups.
result Robust approaches achieve better true group fairness guarantees.
New algorithms protect user-level privacy in learning tasks.
problem Protecting user-level privacy in learning tasks with stringent constraints.
method Proposes algorithms for learning tasks under user-level differential privacy constraints.
result Privacy cost decreases as users provide more samples or as the number of users increases.
The paper analyzes how to combine self-protection and self-insurance for risk reduction.
problem Combining self-protection and self-insurance for risk reduction when market insurance is absent.
method The approach uses Value-at-Risk and Tail Value-at-Risk to evaluate residual risk and solves the problem using isoquant geometry based on marginal-balance curves.
result The analysis identifies the conditions under which self-protection and self-insurance behave as substitutes or complements.
Researchers create topologically protected knots in a realizable system.
problem Creating topologically protected vortex knots in experimentally realizable systems.
method Investigated non-Abelian vortices in tetrahedral order in spin-2 Bose--Einstein condensates and bent-core nematic liquid crystals.
result Discovered the first topologically protected knots in an experimentally realizable system.
The paper proposes methods to infer from privacy-protected data using simulation-based techniques.
problem Valid statistical inference from privacy-protected data is computationally challenging.
method Simulation-based inference methods, including sequential Monte Carlo and neural conditional density estimators.
result Valid statistical inferences can be made from privacy-protected data.
New attacks show ML models can be compromised even when targeting one concept.
problem Vulnerability of ML models to multi-concept attacks.
method Developed novel multi-concept attack techniques for deep learning.
result Successfully attacked one set of classifiers without impacting others.
Fair clustering under the disparate impact doctrine requires that population of each protected group should be approximately equal in every cluster. Previous work investigated a difficult-to-scale pre-processing step for k-center and k-median style algorithms for the special case of this problem when the number of …
A multi-task network avoids indirect discrimination in insurance pricing.
problem Indirect discrimination in insurance pricing models based on protected characteristics.
method Multi-task neural network architecture trained with partial protected characteristic information.
result Multi-task network produces discrimination-free insurance prices with comparable accuracy to conventional models.
Study removes bias from chest X-ray embeddings using orthogonalization.
problem Reduces bias in chest X-ray embeddings due to protected features.
method Orthogonalization technique to remove protected feature effects.
result Orthogonalization removes bias and makes predictions of protected attributes infeasible.
Machine learning models are vulnerable to simple model stealing attacks if the adversary can obtain output labels for chosen inputs. To protect against these attacks, it has been proposed to limit the information provided to the adversary by omitting probability scores, significantly impacting the utility of the provid…
Protects user privacy in models using optional personal data.
problem Ensuring fairness for users who opt-out of data sharing.
method Formalizes protection requirements, introduces Protected User Consent (PUC), devises data augmentation strategy.
result PUC-compliant models can improve performance without disadvantaging opt-out users.
The study examines how investor protection and past information affect stock returns and interest rates.
problem Empirical regularities related to investor protection and past information in asset pricing models.
method Developed a dynamic asset pricing model with a controlling shareholder and good/bad memory in budget dynamics.
result Good/bad memory of investors on historical market information affects stock returns and interest rates, strengthening investor protection in high ownership concentration.
ARL improves fairness without protected features, showing AUC improvements for worst-case groups.
problem Training fairness in ML without known protected features.
method Adversarially Reweighted Learning (ARL) using non-protected features and task labels.
result ARL improves Rawlsian Max-Min fairness with notable AUC improvements for worst-case groups.
A distributed framework protects privacy while maintaining fairness in machine learning.
problem Protecting personal demographic data while ensuring fair machine learning outcomes.
method A distributed framework with private third-party data communication, ensuring privacy and fairness.
result Four fair learning methods consistently outperform existing ones in fairness and accuracy across three real-world datasets.
Proposes a new method for fairness in machine learning with multiple protected attributes.
problem Ensuring fairness in machine learning models with continuous and multiple protected attributes.
method Distance covariance regularisation framework to mitigate association between model predictions and protected attributes.
result Demonstrates effectiveness in mitigating fairness gerrymandering in regression tasks.
Adds layers to NNs to protect them from reverse engineering.
problem Extracting the underlying model of a Neural Network.
method Introducing parasitic layers that approximate a noisy identity mapping with a Convolutional NN.
result The protected NN's predictions remain mostly unchanged while making reverse-engineering more complex.
DPLP predicts links while protecting some node-pairs' privacy.
problem Link prediction with protected connections in private networks.
method DPLP uses differential privacy on graphs to protect node-pairs, applying a monotone transform and noise to base scores.
result DPLP effectively balances privacy and link prediction accuracy.
Paper explores GAN generalization via privacy protection, proving bounds on generalization gap and reducing leakage.
problem Understanding and bounding the generalization gap of GANs.
method Theoretical proof using differential privacy, reinterpreting Bayesian GAN, membership attacks.
result Proven bounds on generalization gap and reduced information leakage.
New framework for fair ranking with noisy protected attributes.
problem Errors in socially-salient attributes undermine fairness guarantees.
method Modeling perturbations in protected attributes and incorporating probabilistic information.
result Framework provides provable guarantees on fairness and utility.
For the past two decades investors have observed long memory and highly correlated behavior of asset classes that does not fit into the framework of Modern Portfolio Theory. Custom correlation and standard deviation estimators consider normal distribution of returns and market efficiency hypothesis. It forced investors…
Fairness has become a central issue for our research community as classification algorithms are adopted in societally critical domains such as recidivism prediction and loan approval. In this work, we consider the potential bias based on protected attributes (e.g., race and gender), and tackle this problem by learning …
Invariants for colored links found, with topological protection of certain knots.
problem Finding invariants for colored links and understanding their topological stability.
method Equivariant bordism groups of Conner and Floyd, topological surgeries.
result Topological protection of certain tricolored knots, with specific transformations.
Proposes a general deep neural network method for digital watermarking.
problem Protecting intellectual content in a massive, IoT-acquired image dataset.
method Train a neural network on an image set and use it to protect distinct test images in bulk.
result Demonstrates the robustness and practicality of the proposed method.
New fairness criterion for risk-sensitive decisions in regulated industries.
problem Ensuring equitable outcomes in risk-sensitive decision-making.
method Marginal fairness for generalized distortion risk measures, two-step decision-making process.
result Ensures fairness in decision-making under risk measures, regardless of protected attributes.