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

111222333444 · Jun 202019922001200920172026
48 results for local decision boundary

Local surrogate models, to approximate the local decision boundary of a black-box classifier, constitute one approach to generate explanations for the rationale behind an individual prediction made by the back-box. This paper highlights the importance of defining the right locality, the neighborhood on which a local su…

2018-06-19abs ↗pdf ↗

Measures neural network decision boundary volume to predict model performance.

problem Understanding the geometry of deep learning models for better performance.
method Local surface volumes to measure decision boundary, applying Weyl's tube formula.
result Smaller surface volume correlates with higher classification accuracy.

Local decision boundary approximation improves model explanations for complex models.

problem Challenges in explaining complex, opaque machine learning models.
method Train a variational autoencoder to learn a latent space and map it to meaningful attributes. Use these attributes to approximate the local decision boundary and explain model predictions.
result Can recover latent attributes that determine class decisions in a new benchmark data set.

Study decision boundaries using heat diffusion and probabilistic techniques.

problem Understanding the geometry of decision boundaries in machine learning.
method Using Brownian motion and probabilistic techniques to analyze decision boundaries.
result Decision boundaries exhibit persistent 'wiggly and fuzzy' regions, even under adversarial attacks.

Deep neural networks are vulnerable to adversarial attacks and hard to interpret because of their black-box nature. The recently proposed invertible network is able to accurately reconstruct the inputs to a layer from its outputs, thus has the potential to unravel the black-box model. An invertible network classifier c…

2019-09-30abs ↗pdf ↗

Deep neural networks achieve optimal learning rates for high-dimensional classification.

problem Learning classification functions from noisy data with smooth boundaries.
method Empirical risk minimization over deep neural networks for locally Barron-regular decision boundaries.
result Optimal estimation rates are independent of dimension and can be achieved by deep neural networks.

We study the robustness of classifiers to various kinds of random noise models. In particular, we consider noise drawn uniformly from the _p\ell\_p ball for p[1,]p \in [1, \infty] and Gaussian noise with an arbitrary covariance matrix. We characterize this robustness to random noise in terms of the distance to the decisio…

2018-02-22abs ↗pdf ↗

Unified framework improves cross-corpus EEG emotion recognition by aligning prototypes and refining decision boundaries.

problem Cross-corpus EEG emotion recognition suffers from performance degradation due to physiological variability and device inconsistencies.
method Prototype-driven Adversarial Alignment (PAA) framework with three configurations: local, contrastive, and boundary-aware.
result State-of-the-art performance improvements across four cross-corpus evaluation protocols.

This work connects the Hessian to the decision boundary complexity in neural networks.

problem Understanding the decision boundary complexity in high-dimensional input space.
method Characterizing the decision boundary using the Hessian top eigenvectors and analyzing the number of outliers.
result The number of outliers in the Hessian spectrum is proportional to the complexity of the decision boundary.

Deep learning models have been the subject of study from various perspectives, for example, their training process, interpretation, generalization error, robustness to adversarial attacks, etc. A trained model is defined by its decision boundaries, and therefore, many of the studies about deep learning models speculate…

2019-08-07abs ↗pdf ↗

We introduce the speculate-correct method to derive error bounds for local classifiers. Using it, we show that k nearest neighbor classifiers, in spite of their famously fractured decision boundaries, have exponential error bounds with O(sqrt((k + ln n) / n)) error bound range for n in-sample examples.

2014-10-09abs ↗pdf ↗

This work uses tropical geometry to understand neural network decision boundaries.

problem Characterizing neural network decision boundaries with piecewise linear activations.
method Tropical geometry applied to a simple neural network model.
result Decision boundaries are a subset of a tropical hypersurface related to a polytope formed by zonotopes.

Deep neural networks and in particular, deep neural classifiers have become an integral part of many modern applications. Despite their practical success, we still have limited knowledge of how they work and the demand for such an understanding is evergrowing. In this regard, one crucial aspect of deep neural network c…

2019-12-24abs ↗pdf ↗

New method measures generalizability of deep neural networks based on decision boundary complexity.

problem Lack of generalization methods for deep neural networks.
method Created Decision Boundary Complexity (DBC) score to measure DNN complexity.
result Simpler decision boundaries lead to better generalizability, supporting Occam's Razor.

The paper shows how neural networks with less decision boundary variability generalize better.

problem Improving neural network generalizability by reducing decision boundary variability.
method Introduces new measures (algorithm DB variability and (ε,η)(ε, η)-data DB variability) to quantify decision boundary variability and proves theoretical bounds on generalizability.
result Neural networks with lower decision boundary variability have better generalizability, as shown by extensive experiments and theoretical bounds.

Deep learning models generalize by extending decision boundaries outside the convex hull of training data.

problem Understanding how deep learning models generalize beyond their training data.
method Investigation of decision boundaries inside and outside the convex hull of training sets, using various neural network architectures and training regimes.
result Over-parameterization is necessary for deep learning models to extend decision boundaries outside the convex hull of their training data.

Study reveals how features influence deep network decision boundaries.

problem Understanding the role of features in neural network decision boundaries.
method Adopted adversarial robustness tools to measure changes in CNN decision boundaries.
result Neural networks exhibit high invariance to non-discriminative features and are sensitive to small perturbations of training samples.

We consider the classification problem and focus on nonlinear methods for classification on manifolds. For multivariate datasets lying on an embedded nonlinear Riemannian manifold within the higher-dimensional ambient space, we aim to acquire a classification boundary for the classes with labels, using the intrinsic me…

2017-10-21abs ↗pdf ↗

The goal of this paper is to analyze the geometric properties of deep neural network classifiers in the input space. We specifically study the topology of classification regions created by deep networks, as well as their associated decision boundary. Through a systematic empirical investigation, we show that state-of-t…

2017-05-26abs ↗pdf ↗

Proposes a method to speed up model selection for classification.

problem Time-consuming model selection process and lack of dataset-specific insights.
method Relaxes decision boundaries of neural decision trees to find equivalent or better models.
result Reduces the scope of exploration needed for model selection.

Decision making based on behavioral and neural observations of living systems has been extensively studied in brain science, psychology, and other disciplines. Decision-making mechanisms have also been experimentally implemented in physical processes, such as single photons and chaotic lasers. The findings of these exp…

2018-04-12abs ↗pdf ↗

Paper proposes a new classifier for hyperbolic spaces using horospherical boundaries.

problem Optimization of large margin classifiers in hyperbolic spaces.
method Horospherical decision boundaries for geodesically convex optimization.
result Geodesically convex optimization leads to globally optimal solutions.

A new framework explains GNN predictions by simulating graph structure and feature changes.

problem Lack of transparency in GNN predictions hinders understanding.
method TraP2 framework using a three-layer architecture: Translation, Perturbation, and Paraphrase layers.
result TraP2 achieves 10.2% higher explanation accuracy than state-of-the-art methods.

Decision trees are a popular technique in statistical data classification. They recursively partition the feature space into disjoint sub-regions until each sub-region becomes homogeneous with respect to a particular class. The basic Classification and Regression Tree (CART) algorithm partitions the feature space using…

2015-04-14abs ↗pdf ↗

Novel defense algorithm improves SVMs against data poisoning attacks.

problem Vulnerability of SVMs to targeted training data manipulations like poisoning attacks.
method Developed a weighted SVM using K-LID to de-emphasize suspicious data samples.
result Significant reduction in classification error rates (10% on average) with the proposed defense.

Classifies local boundary conditions for Dirac-type operators on manifolds.

problem Determining all local smooth boundary conditions for Dirac-type operators.
method Combining general theory of boundary value problems for Dirac operators and pointwise considerations.
result Classification of local self-adjoint regular boundary conditions for Dirac spinors in dimensions 3 and 4.

Study local structure of Einstein metrics with boundary conditions.

problem Understanding the local structure of Einstein metrics with boundary constraints.
method Analysis of moduli space of compact Einstein metrics, focusing on boundary conformal metric and mean curvature.
result For three dimensions, the map from Einstein metrics to boundary data is generically a local diffeomorphism.

Paper extends transfer learning for decision rules, improving treatment rule estimation.

problem Estimating optimal individualized treatment rules under changing conditions.
method Bayes decision rules and low-dimensional empirical risk minimization.
result Consistent estimators and risk bounds established under mild conditions.

The goal of a decision-based adversarial attack on a trained model is to generate adversarial examples based solely on observing output labels returned by the targeted model. We develop HopSkipJumpAttack, a family of algorithms based on a novel estimate of the gradient direction using binary information at the decision…

2019-04-03abs ↗pdf ↗

The paper characterizes boundaries in Turaev-Viro TQFTs and Dijkgraaf-Witten theories.

problem Characterizing boundaries in Turaev-Viro TQFTs and Dijkgraaf-Witten theories.
method Identifying explicit boundary locality conditions and proving consistency with state sum models.
result Turaev-Viro and Dijkgraaf-Witten theories with boundary defects admit a state sum description.

A set of introductory notes on the subject of data classification using a linear classifier and least-squares cost function, and the negative effect of the presence of outliers on the decision boundary of the linear discriminant. We also show how a simple scaling could make the outlier less significant, thereby obtaini…

2018-08-28abs ↗pdf ↗