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.
Proposes a method to learn fair data representations without requiring fair target data.
problem Achieving fairness in machine learning models, especially for human outcomes.
method Data-to-data translation, learning a mapping from input to a fair target domain using residuals and protected characteristics.
result Enforces fairness (equality of opportunity) by adjusting specific regions in face images and tabular data.
The study tackles indirect discrimination in insurance pricing models.
problem Indirect discrimination in insurance pricing models.
method Presented a statistical model free of proxy discrimination.
result The canonical price in the model does not satisfy group fairness axioms.
New approach to counterfactual reasoning avoids demographic interventions.
problem Limitations of traditional counterfactual reasoning in AI systems.
method Backtracking counterfactual approach instead of interventional.
result Allows addressing social concerns without demographic interventions.
The paper tackles fairness in estimating graphical models, especially for protected attributes.
problem Fairness issues in estimating graphical models, particularly for sensitive characteristics.
method Integrates pairwise graph disparity error and a tailored loss function into a multi-objective optimization problem.
result Successfully mitigates bias in graphical model estimation without compromising model performance.
Differentially private ensemble classifiers adapt to data streams while protecting privacy.
problem Adapting to evolving data characteristics while protecting private information.
method Unbounded ensemble updates, model agnostic approach.
result Outperforms competitors on various privacy, drift, and distribution settings.
The paper values and hedges EPS products with jumps and default risks.
problem Valuation and risk management of EPS products under financial crises and default risks.
method Developed pricing frameworks using jump-diffusion and default models, derived closed-form formulas, and analysed hedging strategies.
result Quantified residual losses from counterparty default risk and defined default-adjusted premiums.
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.
New classifiers ensure fairness by adjusting a base classifier's operating characteristics.
problem Ensuring fairness in binary classification with multiple group constraints.
method Intervening directly on a base classifier's operating characteristics using group-wise ROC convex hulls and post-processing.
result Methods satisfy multiple fairness constraints (DP, EO, PP) with minimal interventions and near-oracle accuracy.
Study detects illegal discrimination by employers using correspondence experiments.
problem Detecting illegal discrimination by individual employers based on protected characteristics.
method Correspondence experiments, bounding higher moments of causal effects, decision rules for investigation.
result 85% of jobs contacting both white and black applicants are likely to discriminate.
DeepPeep attacks DNN architectures to reveal design details, posing IP theft risks.
problem Protecting DNN architecture from IP theft in cloud-based services.
method Two-stage attack methodology exploiting design characteristics.
result DeepPeep successfully reverses-engineers compact DNN architectures.
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.
Paper improves speaker verification with federated learning and differential privacy.
problem Improving speaker verification accuracy using private data.
method Combining federated learning and differential privacy to train an auxiliary model that predicts vocal characteristics.
result 6% relative improvement in equal error rate over a baseline system.
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.
Proposes Deep Fair Clustering for fair clustering with multiple protected groups.
problem Ensuring fair clustering with multiple protected groups.
method Deep Fair Clustering learns a fair cluster assignment function.
result Improves fairness while only slightly sacrificing clustering quality.
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.
AI model enhances grid monitoring with synchro-waveform tech.
problem Dynamic, stochastic, low-inertia future grids need advanced monitoring.
method AI Foundation Model with synchro-waveform tech.
result Significantly improved fault detection accuracy and speed.
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.
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.
Study SKK groups of manifolds to classify non-unitary TQFTs.
problem Classify non-unitary invertible topological quantum field theories.
method Apply Galatius-Madsen-Tillman-Weiss and Genauer-Schommer-Pries results to compute SKK groups.
result Complete classification of non-unitary invertible TQFTs in dimensions 1-5.
Sage platform protects ML models trained on sensitive data from leakage.
problem Protecting sensitive data in machine learning models exposed to untrusted domains.
method Develops block composition for privacy accounting and privacy-adaptive training to manage privacy budget and utility tradeoff.
result Enables continuous training of models on sensitive data streams while maintaining global DP guarantees.
We explore inverse and quanto inverse crypto options, their pricing, and applications.
problem Market incompleteness in crypto options trading.
method Comparison of direct and inverse options, and introduction of currency-protected 'quanto' options.
result Pricing and hedging characteristics of inverse and quanto inverse options in a Black-Scholes framework.
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.
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.
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.
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.
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.
In the market place, diversification reduces risk and provides protection against extreme events by ensuring that one is not overly exposed to individual occurrences. We argue that diversification is best measured by characteristics of the combined portfolio of assets and introduce a measure based on the information en…
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.
The paper tackles fairness in classification by learning fair latent representations.
problem Fairness issues in classification algorithms used in societally critical domains.
method Develops a minimax adversarial framework to learn fair latent representations.
result The framework provides theoretical guarantees for statistical parity and individual fairness.
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.
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.
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.
Paper addresses data reconstruction from privacy-protected templates using STCA.
problem Reconstructing privacy-sensitive data from protected templates.
method Sparse ternary coding with ambiguization (STCA) for privacy preservation.
result STCA maintains theoretical performance against deep reconstruction attacks for synthetic data but requires special measures for real images.
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. 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.
This paper develops synthetic mobility datasets to protect privacy while maintaining realism.
problem Privacy concerns restrict sharing real mobility datasets, leading to lack of reproducibility.
method The paper benchmarks RNNs, GANs, and copulas to generate realistic synthetic trajectories.
result The approach generates trajectories that are statistically and semantically similar to real-world data.
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.