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

3927831,1751,566 · Jun 202019922001200920172026
48 results for black-box model classification

Improves model classification accuracy in black-box settings.

problem Difficulty in inferring model properties due to limited query access.
method Introduces discriminative factorization to distinguish high-quality queries.
result Probability of chance-level classification decreases exponentially with query budget.

Paper explores how black box models can deviate from average performance.

problem Understanding and interpreting predictions from sophisticated black box models.
method Two general approaches to provide interpretable descriptions of black box classification model performance.
result Identifies regions where black box models deviate significantly from their average performance.

Interpretable deep learning is a fundamental building block towards safer AI, especially when the deployment possibilities of deep learning-based computer-aided medical diagnostic systems are so eminent. However, without a computational formulation of black-box interpretation, general interpretability research rely hea…

2018-06-26abs ↗pdf ↗

Proposes a method for explaining black-box models with nested feature attributions.

problem Making black-box models transparent and trustworthy.
method Model-agnostic local explanation method exploiting nested feature structure and consistency property.
result Accurate and consistent HiFAs and LoFAs estimated using fewer model queries.

Study adversarial perturbations in classification, analyzing learning and certification.

problem Formal study of classification under adversarial perturbations from both learner and third-party perspectives.
method PAC-type semi-supervised learning framework, black-box certification under limited query budget, adversary analysis.
result Existence of a polynomial query complexity adversary implies the existence of a sample efficient robust learner.

Develops a method to find costly high-confidence errors in black box models.

problem Finding rare high-confidence errors missed by random sampling.
method Adversarial perturbation-guided search technique to find errors at rates greater than expected given model confidence.
result Our Adversarial Distance search discovers high-confidence errors at a rate greater than expected given model confidence.

As the use of black-box models becomes ubiquitous in high stake decision-making systems, demands for fair and interpretable models are increasing. While it has been shown that interpretable models can be as accurate as black-box models in several critical domains, existing fair classification techniques that are interp…

2019-09-09abs ↗pdf ↗

BAR reprograms black-box ML models for transfer learning with scarce data.

problem Transfer learning with limited data and resources.
method Zeroth-order optimization and multi-label mapping techniques to reprogram black-box models.
result BAR outperforms state-of-the-art methods and baseline transfer learning approaches.

We interpret black box predictive models using causal attribution.

problem Interpreting models trained using machine learning in high-stakes applications.
method Estimate causal effects of model inputs on output using observational data.
result Effective interpretation of black box predictive models via causal attribution.

New method turns optimization algorithms into uniformly stable learning algorithms for non-Euclidean norms.

problem Non-Euclidean norms in binary classification problems.
method Black-box reduction method using uniformly convex regularizers.
result Achieves optimal statistical risk bounds on excess risk for non-Euclidean norms.

DAEGEN generates adversarial inputs for neural networks using a black-box differential technique.

problem Generating adversarial inputs that highlight differences between neural network models.
method DAEGEN uses a local search-based optimization algorithm to find difference-inducing adversarial examples (DIAEs).
result DAEGEN is the first black-box differential technique for adversarial input generation and performs well compared to existing methods.

The paper tests semantic importance in opaque models using betting.

problem Precise statistical guarantees for semantic concepts in black-box models.
method Formalizes global and local statistical importance via conditional independence and SKIT.
result Shows effectiveness and flexibility of the framework on various models.

Interprets feature interactions in ad-click prediction models.

problem Improving interpretability of black-box recommender systems.
method Interprets feature interactions from a source model and encodes them in a target model.
result Interpretations significantly outperform existing recommender models.

We introduce a new model-agnostic explanation technique which explains the prediction of any classifier called CLE. CLE gives an faithful and interpretable explanation to the prediction, by approximating the model locally using an interpretable model. We demonstrate the flexibility of CLE by explaining different models…

2019-10-02abs ↗pdf ↗

We address the problem of training models with black-box and hard-to-optimize metrics by expressing the metric as a monotonic function of a small number of easy-to-optimize surrogates. We pose the training problem as an optimization over a relaxed surrogate space, which we solve by estimating local gradients for the me…

2020-02-20abs ↗pdf ↗

Recent works have demonstrated that machine learning models are vulnerable to model inversion attacks, which lead to the exposure of sensitive information contained in their training dataset. While some model inversion attacks have been developed in the past in the black-box attack setting, in which the adversary does …

2019-09-26abs ↗pdf ↗

Vision models are interpretable when they classify objects on the basis of features that a person can directly understand. Recently, methods relying on visual feature prototypes have been developed for this purpose. However, in contrast to how humans categorize objects, these approaches have not yet made use of any tax…

2019-06-25abs ↗pdf ↗

We study the AutoML problem of automatically configuring machine learning pipelines by jointly selecting algorithms and their appropriate hyper-parameters for all steps in supervised learning pipelines. This black-box (gradient-free) optimization with mixed integer & continuous variables is a challenging problem. We pr…

2019-05-01abs ↗pdf ↗

PredDiff measures prediction changes while marginalizing features, offering new insights into interaction effects.

problem Understanding interaction effects in black-box models.
method Model-agnostic, local attribution method based on probability theory.
result Introduced a new measure for interaction effects between arbitrary feature subsets.

This paper introduces a new metric for deep learning networks based on their classification performance.

problem The mystery and black-box nature of deep learning networks.
method Proposes a new distance measure based on the probabilistic performance of deep learning networks.
result The proposed metric space is compact and coincides with the quotient topological space.

New method attacks GNNs with limited node access, increasing misclassification rate.

problem Attacking GNNs with limited node access and limited attack nodes.
method Generalized gradient-based attacks using importance scores derived from random walks.
result Proposed greedy procedure significantly increases misclassification rate.

Adversarial Reprogramming has demonstrated success in utilizing pre-trained neural network classifiers for alternative classification tasks without modification to the original network. An adversary in such an attack scenario trains an additive contribution to the inputs to repurpose the neural network for the new clas…

2018-09-06abs ↗pdf ↗

Spanning attack improves black-box attacks with unlabeled data.

problem Query inefficiency in black-box attacks due to high input space dimensionality.
method Proposes spanning attack by constraining adversarial perturbations in a low-dimensional subspace via an auxiliary unlabeled dataset.
result Significantly improves query efficiency of black-box attacks.

Black-box alpha (BB-αα) is a new approximate inference method based on the minimization of αα-divergences. BB-αα scales to large datasets because it can be implemented using stochastic gradient descent. BB-αα can be applied to complex probabilistic models with little effort since it only requires as input the likel…

2015-11-10abs ↗pdf ↗