Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

51102153204 · Jun 202019922001200920172026
48 results for explanation constraints

The paper introduces a method to learn models with built-in explanations.

problem Lack of interpretability in deep learning models.
method Formalizes learning with explanation constraints and provides a learning theoretic framework.
result Models that satisfy these constraints have reduced Rademacher complexities, improving their performance.

Machine learning algorithms generally suffer from a problem of explainability. Given a classification result from a model, it is typically hard to determine what caused the decision to be made, and to give an informative explanation. We explore a new method of generating counterfactual explanations, which instead of ex…

2019-06-25abs ↗pdf ↗

A new method for generating counterfactual explanations in high-dimensional datasets.

problem Creating realistic counterfactual explanations in complex, high-dimensional data.
method A discretized approach using binary search and boundary approximation.
result Our method reduces the distance between counterfactuals by 5% to 50% in terms of the L2 norm.

This paper proposes new search algorithms for counterfactual explanations based upon mixed integer programming. We are concerned with complex data in which variables may take any value from a contiguous range or an additional set of discrete states. We propose a novel set of constraints that we refer to as a "mixed pol…

2019-01-02abs ↗pdf ↗

Method for explaining machine learning survival models using counterfactuals.

problem Tackles the challenge of explaining survival models in machine learning.
method Introduces a condition based on the difference of mean times to event for counterfactual explanation. Reduces the problem to a convex optimization problem for Cox models and applies Particle Swarm Optimization for other models.
result Demonstrates the effectiveness of the proposed method through numerical experiments.

Proposes a method to generate realistic counterfactuals by learning relationships.

problem Counterfactual explanations often ignore intrinsic relationships between data attributes.
method Uses a variational auto-encoder to learn relationships and perturb the latent space.
result The model preserves relationships and generates realistic counterfactuals.

Multi-SpaCE generates valid counterfactual explanations for multivariate time series data.

problem Lack of transparency in deep learning models for multivariate time series data.
method Multi-objective counterfactual explanation method using NSGA-II for multivariate time series data.
result Ensures perfect validity and superior performance compared to existing methods.

As data-driven predictive models are increasingly used to inform decisions, it has been argued that decision makers should provide explanations that help individuals understand what would have to change for these decisions to be beneficial ones. However, there has been little discussion on the possibility that individu…

2020-02-11abs ↗pdf ↗

New measure SEV shows non-sparse models can still have low decision sparsity.

problem Non-sparse models can still make accurate decisions based on a few features.
method Introduced Sparse Explanation Value (SEV) to measure decision sparsity, not overall model sparsity.
result Many non-sparse models have low decision sparsity, as measured by SEV.

This paper introduces collective counterfactual explanations for groups of instances in classification models.

problem Understanding how classification models make decisions for groups of instances.
method Novel Mathematical Optimization models to find collective counterfactual explanations that minimize total perturbation cost.
result Detects critical features for entire dataset classification and handles outliers.

Unified local and global explanations through functional decomposition of low dimensional structures.

problem Tackles the challenge of extracting meaningful local and global explanations from machine learning models.
method Proposes a new identification constraint to decompose the global representation into main and interaction components of arbitrary order.
result Unified local and global explanations by connecting partial dependence plots and interventional SHAP values.

Proposes a constraint for deep clustering to handle both simple and complex topologies.

problem Limited prior knowledge for deep clustering methods to perform well on complex topologies.
method Introduces a constraint using symmetric InfoNCE to enhance deep clustering performance.
result The constraint improves deep clustering methods' performance on both simple and complex topologies.

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.

Two oppositely charged droplets of (say) water in e.g. oil or air will tend to drift together under the influence of their charges. As they make contact, one might expect them to coalesce and form one large droplet, and this indeed happens when the charge difference is sufficiently small. However, Ristenpart et al disc…

2013-02-20abs ↗pdf ↗

As machine learning algorithms are increasingly applied to high impact yet high risk tasks, such as medical diagnosis or autonomous driving, it is critical that researchers can explain how such algorithms arrived at their predictions. In recent years, a number of image saliency methods have been developed to summarize …

2017-04-11abs ↗pdf ↗

Predictive models are being increasingly used to support consequential decision making at the individual level in contexts such as pretrial bail and loan approval. As a result, there is increasing social and legal pressure to provide explanations that help the affected individuals not only to understand why a predictio…

2019-05-27abs ↗pdf ↗

A technique scales symbolic methods with gradients for neural model explanation.

problem Limited scalability of symbolic methods for large neural networks.
method Combines gradient-based methods with symbolic techniques using Integrated Gradients to focus on a subset of neurons.
result Produces sparser and higher saliency regions compared to gradient-based methods alone.

A very interesting problem in the classical theory of minimal surfaces consists of the classification of such surfaces under some geometrical and topological constraints. In this short paper, we give a brief summary of the known classification results for properly embedded minimal surfaces with genus zero in $\mathbb{R…

2006-11-29abs ↗pdf ↗

Many methods to explain black-box models, whether local or global, are additive. In this paper, we study global additive explanations for non-additive models, focusing on four explanation methods: partial dependence, Shapley explanations adapted to a global setting, distilled additive explanations, and gradient-based e…

2018-01-26abs ↗pdf ↗

The paper proposes criteria and methods for evaluating and aggregating feature-based model explanations.

problem Lack of quantitative evaluation criteria for feature-based model explanations.
method Developed quantitative evaluation criteria (low sensitivity, high faithfulness, low complexity), devised a framework for aggregation, and derived a new aggregate Shapley value explanation function.
result A new aggregate Shapley value explanation function that minimizes sensitivity.

New definition reveals encoding explanations that retain predictive power.

problem Challenges in evaluating and identifying encoding explanations.
method Developed a definition of encoding based on conditional dependence.
result Existing evaluation scores do not rank non-encoding explanations correctly, but STRIPE-X does.

Paper introduces GAMs for interpretable learning-to-rank models.

problem Need for transparent ranking models in legal or policy scenarios.
method Developed generalized additive models (GAMs) for ranking tasks using neural networks.
result Neural ranking GAMs achieve better performance than traditional GAMs while maintaining interpretability.

GRANITE unifies feature-based explanation methods to reduce disagreement.

problem Disagreement among feature-based explanation methods.
method GRANITE partitions feature space into regions minimizing interaction and distribution influences.
result Unified and consistent feature explanations.

Differentially private algorithms protect model explanations from leaking training data.

problem Model explanations can leak training data, compromising privacy.
method Adaptive differentially private gradient descent algorithm to produce accurate, private explanations.
result Privacy amplification and reduction of overall privacy loss on explanation data.

We consider objective evaluation measures of saliency explanations for complex black-box machine learning models. We propose simple robust variants of two notions that have been considered in recent literature: (in)fidelity, and sensitivity. We analyze optimal explanations with respect to both these measures, and while…

2019-01-27abs ↗pdf ↗

Zipf's law states that the number of firms with size greater than S is inversely proportional to S. Most explanations start with Gibrat's rule of proportional growth but require additional constraints. We show that Gibrat's rule, at all firm levels, yields Zipf's law under a balance condition between the effective grow…

2010-12-01abs ↗pdf ↗

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.

G-SHAP generates multiple types of explanations for machine learning models.

problem Understanding model predictions and their differences across groups.
method Generalization of SHAP method to produce additional types of explanations.
result G-SHAP produces explanations for classification, intergroup differences, and model failure.

LLMs' explanations are often insufficient and vary with input distribution.

problem Evaluating the sufficiency of LLM explanations without predefined biases.
method Generalizing sufficiency to arbitrary explanations, using LLM's input beliefs, and introducing SCSuff metric.
result Explanation sufficiency can vary with input distribution and is weakly correlated with model size, accuracy, or output entropy.

Study finds visual explanations do not significantly improve human accuracy or trust in model predictions.

problem Measuring the impact of visual explanations on human accuracy and trust in model predictions.
method Randomized controlled trial with image-based age prediction task, varying levels of explanation quality.
result Visual explanations do not significantly alter human accuracy or trust in the model.

Despite a growing literature on explaining neural networks, no consensus has been reached on how to explain a neural network decision or how to evaluate an explanation. Our contributions in this paper are twofold. First, we investigate schemes to combine explanation methods and reduce model uncertainty to obtain a sing…

2019-03-01abs ↗pdf ↗

This research investigates reliable local explanations for machine listening models.

problem Generating reliable local explanations for machine listening models.
method Investigates the sensitivity of SoundLIME explanations to input perturbations and proposes a novel method for identifying suitable content types.
result SoundLIME explanations are sensitive to the content in occluded input regions, and the average magnitude of input mel-spectrogram bins is the most suitable content type for temporal explanations.

Defines explanations for classifier outcomes using causal concepts.

problem Understanding classifier outcomes in a causal context.
method Proposes a new definition of explanation based on causality, compares it with existing notions, and evaluates it experimentally.
result Experimental evaluation shows the new definition's effectiveness on financial datasets.