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

0.3%0.5%0.8%0.8% · Oct 200419922001200920172026
48 results for example-based

Dual explanation method using convex hulls and example-based vectors.

problem Local and global explanation of complex models.
method Dual representation of instances as convex combinations, generating new dual dataset, training linear surrogate model, computing feature importance.
result Effective example-based and local/global explanation of complex models.

Model interpretability is an increasingly important component of practical machine learning. Some of the most common forms of interpretability systems are example-based, local, and global explanations. One of the main challenges in interpretability is designing explanation systems that can capture aspects of each of th…

2018-07-09abs ↗pdf ↗

We prove that closed symplectic four-manifolds do not admit any smooth free circle actions with contractible orbits, without assuming that the actions preserve the symplectic forms. In higher dimensions such actions by symplectomorphisms do exist, and we give explicit examples based on a construction of Fernandez, Gray…

2004-10-09abs ↗pdf ↗

Method trains deep models to explain predictions with fewer examples.

problem Difficulty in humans understanding deep model predictions.
method Simultaneously trains prediction and explanation models with sparse regularization.
result Improves faithfulness of explanations with fewer examples while maintaining predictive performance.

Cincer cleans both new and past data by identifying and relabeling suspicious and counter-examples.

problem Sequential learning under label noise, especially in applications with human supervision.
method Cincer uses example-based explanations to identify and relabel suspicious and counter-examples, leveraging Fisher information matrix approximation.
result Cincer achieves better data and models by clarifying the model's suspicions, especially with FIM approximation.

Survey reviews explainability in AI for healthcare, emphasizing trust and transparency.

problem Lack of transparency hinders AI adoption in healthcare.
method Comprehensive literature review to guide explainable AI design.
result Quantitative evaluation metrics are needed for some explainability properties.

Potential violent criminals will often need to go through a sequence of preparatory steps before they can execute their plans. During this escalation process police have the opportunity to evaluate the threat posed by such people through what they know, observe and learn from intelligence reports about their activities…

2019-07-03abs ↗pdf ↗

We introduce an unsupervised approach to efficiently discover the underlying features in a data set via crowdsourcing. Our queries ask crowd members to articulate a feature common to two out of three displayed examples. In addition we also ask the crowd to provide binary labels to the remaining examples based on the di…

2015-03-31abs ↗pdf ↗

Minimal surfaces in 3-sphere created by reflections from polygons, with new examples based on pentagons.

problem Constructing minimal surfaces in 3-sphere using reflections.
method Minimal nn-gon solves free boundary problem; curvature lines combinatorics investigated.
result New examples of minimal reflection surfaces based on pentagons.

We present MLRG Deep Curvature suite, a PyTorch-based, open-source package for analysis and visualisation of neural network curvature and loss landscape. Despite of providing rich information into properties of neural network and useful for a various designed tasks, curvature information is still not made sufficient us…

2019-12-20abs ↗pdf ↗

We review the Burghelea conjecture, which constitutes a full computation of the periodic cyclic homology of complex group rings, and its relation to the algebraic Baum-Connes conjecture. The Burghelea conjecture implies the Bass conjecture. We state two conjectures about groups of finite asymptotic dimension, which tog…

2016-10-31abs ↗pdf ↗

Topological gauge theories in four dimensions which admit surface operators provide a natural framework for realizing homological knot invariants. Every such theory leads to an action of the braid group on branes on the corresponding moduli space. This action plays a key role in the construction of homological knot inv…

2007-06-18abs ↗pdf ↗

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 ↗

We use tools from generalized complex geometry to develop the theory of SKT (a.k.a. pluriclosed Hermitian) manifolds and more generally manifolds with special holonomy with respect to a metric connection with closed skew-symmetric torsion. We develop Hodge theory on such manifolds showing how the reduction of the holon…

2012-03-02abs ↗pdf ↗

The paper constructs semistrict monoidal 2-categories from foam evaluations.

problem Creating examples of semistrict monoidal 2-categories.
method Using a closed foam evaluation formula as input, the paper rigorously constructs semistrict monoidal 2-categories.
result The constructed monoidal 2-categories are semistrict, have duals and adjoints, and carry a spatial duality structure.

Dualities are widely used in quantum field theories and string theory to obtain correlation functions at high accuracy. Here we present examples where dual data representations are useful in supervised classification, linking machine learning and typical tasks in theoretical physics. We then discuss how such beneficial…

2020-02-12abs ↗pdf ↗

Markov chain Monte Carlo (MCMC) methods have not been broadly adopted in Bayesian neural networks (BNNs). This paper initially reviews the main challenges in sampling from the parameter posterior of a neural network via MCMC. Such challenges culminate to lack of convergence to the parameter posterior. Nevertheless, thi…

2019-10-15abs ↗pdf ↗

The increasing complexity of the power grid, due to higher penetration of distributed resources and the growing availability of interconnected, distributed metering devices re- quires novel tools for providing a unified and consistent view of the system. A computational framework for power systems data fusion, based on…

2017-05-24abs ↗pdf ↗

Improved price bounds for multi-asset derivatives using market option data.

problem Creating robust price bounds for multi-asset derivatives under market-implied dependence.
method Extracting inter-asset dependence information from market option prices and applying modified martingale optimal transport.
result Improved price bounds for multi-asset derivatives, demonstrating relevance and tractability.

Robustness is an increasingly important property of machine learning models as they become more and more prevalent. We propose a defense against adversarial examples based on a k-nearest neighbor (kNN) on the intermediate activation of neural networks. Our scheme surpasses state-of-the-art defenses on MNIST and CIFAR-1…

2019-06-23abs ↗pdf ↗

Whitening, or sphering, is a common preprocessing step in statistical analysis to transform random variables to orthogonality. However, due to rotational freedom there are infinitely many possible whitening procedures. Consequently, there is a diverse range of sphering methods in use, for example based on principal com…

2015-12-02abs ↗pdf ↗

We propose a novel procedure which adds "content-addressability" to any given unconditional implicit model e.g., a generative adversarial network (GAN). The procedure allows users to control the generative process by specifying a set (arbitrary size) of desired examples based on which similar samples are generated from…

2019-05-14abs ↗pdf ↗

For the task of generating complex outputs such as source code, editing existing outputs can be easier than generating complex outputs from scratch. With this motivation, we propose an approach that first retrieves a training example based on the input (e.g., natural language description) and then edits it to the desir…

2018-12-04abs ↗pdf ↗

Deep learning improves probabilistic PPDE solution accuracy.

problem Approximating solutions to path-dependent PDEs with limited basis selection.
method Deep learning for conditional expectation estimation with error bounds.
result Deep learning yields more accurate PPDE solutions, especially in high dimensions.

The article proposes a method to make valid insurance claim predictions without relying on specific models.

problem Prediction of insurance claims using statistical models can be unreliable due to model misspecification, selection effects, and lack of finite-sample validity.
method The article employs conformal prediction, a machine learning strategy that is model-free and tuning-parameter-free, ensuring finite-sample validity.
result The proposed method guarantees valid predictions at a pre-assigned coverage probability level and performs well in insurance applications, including meeting Solvency II requirements.

Paper estimates differences in multi-attribute Gaussian graphical models using non-convex penalties.

problem Estimating differences in multi-attribute Gaussian graphical models with similar structure.
method Penalized D-trace loss function with non-convex (log-sum and SCAD) penalties, proximal gradient descent methods.
result Theoretical analysis and numerical examples support consistency in support recovery and estimation.

This work proves intrinsic robustness bounds for natural image distributions.

problem Understanding the robustness of natural image distributions against adversarial attacks.
method Assumes natural image distributions are captured by conditional generative models and proves robustness bounds for classifiers.
result Shows a large gap between theoretical robustness limits and current state-of-the-art adversarial robustness.

This paper evaluates targeted data poisoning attacks by focusing on the hardest samples, improving evaluation and defense strategies.

problem The effectiveness of targeted data poisoning attacks is often overestimated due to average evaluation methods.
method The paper introduces metrics to identify the hardest and easiest to poison samples based on clean model information.
result The proposed metrics reliably stratify samples by poisoning vulnerability, enabling rigorous worst-case evaluation and proactive defense.

State-of-the-art deep neural networks are known to be vulnerable to adversarial examples, formed by applying small but malicious perturbations to the original inputs. Moreover, the perturbations can \textit{transfer across models}: adversarial examples generated for a specific model will often mislead other unseen mode…

2018-02-27abs ↗pdf ↗