Procedure verifies if machine learning models assign fixed predictions that preclude access.
problem Models assign fixed predictions that preclude access to credit and employment.
method Model-agnostic recourse verification with reachable sets.
result Models can inadvertently preclude access by assigning fixed predictions.
Develops a new approach for algorithmic recourse in AI systems.
problem Tackles the problem of providing recommendations for reversing negative AI decisions.
method Introduces a causal framework that models recourse as a process over pre- and post-intervention outcomes, allowing for partial stability and resampling of latent variables.
result Demonstrates the value of the proposed methods on real and semi-synthetic datasets.
AReS framework provides interpretable recourses for entire populations.
problem Ensuring meaningful and non-discriminatory recourses for high-stakes decision-making.
method Model agnostic framework for global counterfactual explanations, optimizing correctness and interpretability while minimizing costs.
result AReS enables learning compact rule sets for recourses across subpopulations, with optimality guarantees.
New approach to meaningful and robust algorithmic recourse.
problem Ineffective and unmeaningful algorithmic recourse explanations.
method Meaningful Algorithmic Recourse (MAR) and Effective Algorithmic Recourse (EAR).
result Proposes new constraints for algorithmic recourse that improve both prediction and target.
Recourse explanations can become invalid if collective actions change statistical data.
problem Recourse explanations may become invalid due to collective behavior changing data statistics.
method Formal characterization of conditions under which recourse explanations remain valid under performativity.
result Recourse actions may become invalid if they are influenced by or intervene on non-causal variables.
New framework shows algorithmic recourse can be harmful.
problem Risks of providing algorithmic recourse in binary classification.
method Abstract learning-theoretic framework comparing risks with and without recourse.
result Providing recourse can be harmful, increasing class uncertainty and mistakes.
New probabilistic approaches offer recourse recommendations even when causal models are imperfect.
problem Limited causal knowledge makes guaranteeing algorithmic recourse impossible.
method Two probabilistic approaches: Bayesian model averaging and average effect computation.
result Probabilistic approaches lead to more reliable recourse recommendations.
Proposes a new method for algorithmic recourse in confounded settings.
problem Provides actionable recommendations for individuals affected by automated decisions.
method Relaxes assumptions of no hidden confounding and additive noise, requiring only causal graph and confounding structure.
result Bounds the expected counterfactual effect of recourse actions, ensuring favourable outcomes in expectation.
COMRECGC finds common recourse for global counterfactual explanations in GNNs.
problem Finding common recourse for global counterfactual explanations in GNNs.
method Formalized the common recourse explanation problem and designed COMRECGC algorithm.
result COMRECGC outperforms strong baselines on four real-world graph datasets.
Improves algorithmic recourse to guide towards both acceptance and improvement.
problem Algorithmic recourse recommendations may not lead to improvement.
method Improvement-Focused Causal Recourse (ICR) requires recommendations to guide towards improvement and leverages causal knowledge to design accurate decision systems.
result ICR guides towards both acceptance and improvement given correct causal knowledge.
Improves global counterfactual explanations for model recourse.
problem Inability to provide explanations beyond local instances.
method Investigates and improves Actionable Recourse Summaries (AReS) for global counterfactual explanations.
result Develops more efficient and interactive explainability tools.
New fairness criteria for algorithmic recourse actions that consider causal relationships.
problem Fairness of recourse actions in algorithmic classification.
method Proposes two new fairness criteria at group and individual levels, explicitly accounting for causal relationships.
result Fairness of recourse is complementary to fairness of prediction, and can be enforced by altering the classifier.
Proposes a new algorithm for accurate tree-based models with guaranteed recourse actions.
problem Ensuring recourse actions for models optimized for predictive performance.
method Formulates and solves an optimization task to ensure reasonable actions for as many instances as possible, using adversarial training techniques.
result Successfully provided reasonable actions to more instances than baselines without significantly degrading accuracy and computational efficiency.
Proposes a new method to explain model predictions for consumer recourse.
problem Current explanation methods fail to provide meaningful recourse to decision subjects.
method Develops feature responsiveness scores to highlight actionable features.
result Standard practices can undermine decision subjects by highlighting unresponsive features.
The paper proposes a method to measure fairness through equality of effort using algorithmic recourse.
problem Measuring fairness through equality of effort in automated systems.
method Applying algorithmic recourse to quantify equality of effort, overcoming previous limitations.
result An algorithm for assessing equality of effort has been developed and validated.
Paper proposes using pairwise feature comparisons to infer modification costs for user recourse.
problem Learning and inferring user preferences for modifying features in black-box models.
method Bradley-Terry model for inferring feature-wise costs from non-exhaustive human comparison surveys.
result Non-exhaustive human surveys can efficiently learn feature costs, enabling recourse finding.
Proposes minimal interventions over counterfactual explanations for algorithmic recourse.
problem Lack of actionable recommendations for algorithmic recourse.
method Causal reasoning to shift focus from explanations to recommendations.
result Minimal interventions provide more actionable recommendations for recourse.
Proposes sparse local and regional counterfactual rules for robust recourses.
problem Challenges in counterfactual explanations, especially stability, synthesis, and implementation.
method Probabilistic framework using Random Forest to derive sparse local and regional counterfactual rules.
result Effective recourses derived from high-density regions, providing sparse and robust counterfactual rules.
The rise in machine learning-assisted decision-making has led to concerns about the fairness of the decisions and techniques to mitigate problems of discrimination. If a negative decision is made about an individual (denying a loan, rejecting an application for housing, and so on) justice dictates that we be able to as…
This work surveys algorithmic recourse, aiming to clarify definitions and solutions.
problem Providing explanations and recommendations to individuals affected by automated decisions.
method Literature review and unified definitions, formulations, and solutions.
result Unified definitions and solutions for algorithmic recourse.
Machine learning models are increasingly used to automate decisions that affect humans - deciding who should receive a loan, a job interview, or a social service. In such applications, a person should have the ability to change the decision of a model. When a person is denied a loan by a credit score, for example, they…
New AR framework handles missing values for better recourse actions.
problem Existing AR methods fail with missing values, leading to invalid or costly actions.
method Formulates task using multiple imputation and mixed-integer linear optimization.
result Efficacy of new method demonstrated in experiments.
New findings show local attributions can't be both robust and provide recourse.
problem Ensuring machine learning systems are accountable and provide actionable recourse options.
method Formal definition of recourse sensitivity and counterexamples for popular attribution methods.
result It is impossible for any single attribution method to be both robust and provide recourse.
Machine learning based decision making systems are increasingly affecting humans. An individual can suffer an undesirable outcome under such decision making systems (e.g. denied credit) irrespective of whether the decision is fair or accurate. Individual recourse pertains to the problem of providing an actionable set o…
CounteRGAN generates realistic, actionable counterfactuals for machine learning models.
problem Creating realistic and actionable counterfactuals for machine learning models.
method Applying Residual GANs to improve counterfactual realism and actionability.
result CounteRGAN produces counterfactuals with improved realism and actionability, achieving real-time applicability.
Formalizes weak and strong verification for LLMs, controlling errors without assumptions.
problem Balancing cost and reliability in reasoning with LLMs.
method Formalizes weak-strong verification policies, introduces metrics, develops online algorithm.
result Optimal policies admit a two-threshold structure, and calibration and sharpness govern value of weak verifiers.
This work improves surrogate models for balancing accuracy and cost in multi-fidelity methods.
problem Balancing accuracy and computational cost in multi-fidelity methods.
method Develops context-aware surrogate models for multi-fidelity importance sampling and Bayesian inverse problems.
result Context-aware surrogate models can lead to runtime speedups of up to one order of magnitude.
We give an entirely geometric proof, without recourse to cellular homology, of the fact that ∂2=0 in the chain complex defined by a handle decomposition of a given manifold. Topological invariance of the resulting `handle homology' is a consequence of Cerf theory.
Develops first robustness verification for complex Transformers.
problem Certify prediction behavior of Transformers with complex self-attention layers.
method Resolves challenges of cross-nonlinearity and cross-position dependency in Transformers.
result Certified robustness bounds are significantly tighter than Interval Bound Propagation.
Paper develops PAC verification for hypothesis classes and statistical algorithms.
problem Verifying machine learning models interactively.
method Develops interactive proof for PAC verification, proves lower bounds, and introduces a generalization.
result Improved protocol for verifying unions of intervals and statistical query algorithms.
Study on maximizing submodular functions with limited updates, achieving tight bounds and poly-time algorithms.
problem Online submodular maximization with constant recourse.
method Information-theoretic bounds and poly-time randomized algorithms.
result Achieved tight bounds of 2/3 and 3/4 for general and coverage functions, respectively, with a 0.51 approximation.
Hypothesis testing is an important problem with applications in target localization, clinical trials etc. Many active hypothesis testing strategies operate in two phases: an exploration phase and a verification phase. In the exploration phase, selection of experiments is such that a moderate level of confidence on the …
New framework for contesting algorithmic decisions, not just explaining them.
problem Helping individuals review and correct erroneous algorithmic decisions.
method Operationalized contestability as a natural complement to explainable AI (XAI), identifying three types of evidence for reversal.
result Existing EU legislation already grants individuals legal rights to contest algorithmic decisions.
We explore the concept of co-design in the context of neural network verification. Specifically, we aim to train deep neural networks that not only are robust to adversarial perturbations but also whose robustness can be verified more easily. To this end, we identify two properties of network models - weight sparsity a…
Accelerates DNN robustness verification with target labels.
problem Improving the robustness of deep neural networks against adversarial attacks.
method Guiding robustness verification with target labels, reducing search space and using symbolic interval propagation and linear relaxation.
result Significantly improves DNN verification speed by 36X, especially when perturbation distance is reasonable.
New methods combat data poisoning attacks in bandit algorithms using limited verification.
problem Data poisoning attacks on bandit algorithms, especially in the UCB and ETC types.
method Verification-based mechanisms to restore optimal regret with limited verifications.
result A simple modified ETC type bandit algorithm can restore optimal regret with O(logT) verifications. Improved speaker verification with condition-aware backend.
problem Speaker verification calibration issues under unknown conditions.
method Discriminative PLDA model with joint training and condition integration.
result Out-of-the-box excellent calibration performance.
In this paper we demonstrate that performance of a speaker verification system can be improved by concatenating electroencephalography (EEG) signal features with speech signal features or only using EEG signal features. We use state-of-the-art end-to-end deep learning model for performing speaker verification and we de…
Improves neural network verification by merging abstract domains and Lagrangian methods.
problem Prove provable bounds for neural network outputs given input ranges.
method Uses zonotopes within a Lagrangian decomposition to verify deep neural networks.
result Yields bounds that improve upon existing techniques in both time and tightness.
In a simplified setting, we show how to price invoice non-recourse factoring taking into account not only the credit worthiness of the debtor but also the assignor's one, together with the default correlation between the two. Indeed, the possible default of the assignor might impact the payoff by means of the bankruptc…
This paper explores formal verification for autonomous systems, identifying limitations and proposing improvements.
problem Ensuring safety of autonomous systems like self-driving cars and drones.
method Formal verification techniques based on formal methods, analyzing three assumptions and their limitations.
result Preliminary work to improve the strength of evidence provided by formal verification.
Paper develops a model for verifying facts in tables without pre-retrieved evidence.
problem Verification of factual claims in structured data, especially in open-domain settings.
method Joint reranking-and-verification model that fuses evidence documents.
result Model achieves comparable performance to closed-domain state-of-the-art on TabFact dataset.
Efficiently verifies neural networks by handling neuron splits, improving speed and accuracy.
problem Handling neuron split constraints in incomplete neural network verification.
method β-CROWN, which optimizes parameters β to encode neuron splits and uses them in bound propagation.
result β-CROWN significantly speeds up verification while maintaining high accuracy.
Semantify-NN verifies neural network robustness against semantic perturbations.
problem Verifying robustness of neural networks against semantic adversarial attacks.
method Inserting semantic perturbation layers (SP-layers) into neural networks to verify robustness.
result Semantify-NN significantly improves robustness verification performance over ℓp-norm-based methods. Researchers find floating point errors can mislead neural network verifiers.
problem Floating point arithmetic inaccuracies mislead neural network verifiers.
method Efficiently searches inputs and constructs neural network architectures to exploit verification errors.
result Floating point errors can systematically mislead neural network verifiers.
We study the robustness verification problem for tree-based models, including decision trees, random forests (RFs) and gradient boosted decision trees (GBDTs). Formal robustness verification of decision tree ensembles involves finding the exact minimal adversarial perturbation or a guaranteed lower bound of it. Existin…
This study extends verifiable learning to boosted tree ensembles, enabling efficient security verification.
problem Efficiently verifying the robustness of boosted tree ensembles against norm-based attackers.
method Formal verification of robustness for large-spread boosted tree ensembles, considering L∞-norm and pseudo-polynomial time for Lp-norm verification. result Polynomial time verification for L∞-norm attackers, NP-hard for other norms, and pseudo-polynomial time for Lp-norm verification. Accelerating Speculative Diffusions via Block Verification
problem Adapting speculative decoding for continuous diffusion models
method Introducing a novel speculative sampling mechanism for diffusion models
result Improves acceptance rate and speeds up inference