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

2985958931,190 · Jun 202019922001200920172026
48 results for verification methods

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.

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.

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 …

2018-12-04abs ↗pdf ↗

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.

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.

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.

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)O(\log T) verifications.

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 LL_\infty-norm and pseudo-polynomial time for LpL_p-norm verification.
result Polynomial time verification for LL_\infty-norm attackers, NP-hard for other norms, and pseudo-polynomial time for LpL_p-norm verification.

The success of Deep Learning and its potential use in many safety-critical applications has motivated research on formal verification of Neural Network (NN) models. In this context, verification involves proving or disproving that an NN model satisfies certain input-output properties. Despite the reputation of learned …

2019-09-14abs ↗pdf ↗

Simplified speaker verification backend improves calibration across varying conditions.

problem Improving calibration performance in speaker verification across different conditions.
method Jointly trained parameters and simplified calibration vectors.
result Simplified method achieves similar performance to previous method but is faster and easier to implement.

This paper tackles robustness of ensemble stumps and trees under general ℓ_p norm perturbations.

problem The vulnerability of ensemble stumps and trees to small input perturbations under the ℓ_∞ norm.
method Developed dynamic programming algorithms for robustness verification and certified defense under general ℓ_p norm perturbations.
result First certified defense method for ensemble stumps and trees under ℓ_p norm perturbations.

New method improves neural network verification by considering multivariate input space of ReLU neurons.

problem Improving the effectiveness of neural network verification algorithms.
method A new tightened convex relaxation for ReLU neurons considering multivariate input space.
result Our convex relaxation is significantly stronger than the commonly used univariate-input relaxation.

Authorship verification tries to answer the question if two documents with unknown authors were written by the same author or not. A range of successful technical approaches has been proposed for this task, many of which are based on traditional linguistic features such as n-grams. These algorithms achieve good results…

2019-08-20abs ↗pdf ↗

NTL protects AI models by restricting their generalization ability to specific domains.

problem Protecting AI models as intellectual property in a secure and robust manner.
method Non-Transferable Learning (NTL) captures exclusive data representation and restricts model generalization ability.
result NTL provides robust resistance to watermark removal and data-centric protection for usage authorization.

To use neural networks in safety-critical settings it is paramount to provide assurances on their runtime operation. Recent work on ReLU networks has sought to verify whether inputs belonging to a bounded box can ever yield some undesirable output. Input-splitting procedures, a particular type of verification mechanism…

2019-02-19abs ↗pdf ↗

An important step in speaker verification is extracting features that best characterize the speaker voice. This paper investigates a front-end processing that aims at improving the performance of speaker verification based on the SVMs classifier, in text independent mode. This approach combines features based on conven…

2013-06-12abs ↗pdf ↗

Despite significant progress made over the past twenty five years, unconstrained face verification remains a challenging problem. This paper proposes an approach that couples a deep CNN-based approach with a low-dimensional discriminative embedding learned using triplet probability constraints to solve the unconstraine…

2016-04-19abs ↗pdf ↗

NeuroDiff improves neural network equivalence verification with fine-grained approximations.

problem Verifying the equivalence of compressed neural networks.
method Symbolic and fine-grained approximation technique for differential verification.
result NeuroDiff achieves up to 1000X speedup and 5X accuracy improvement.

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.

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…

2019-06-17abs ↗pdf ↗

Authorship verification (AV) is a research subject in the field of digital text forensics that concerns itself with the question, whether two documents have been written by the same person. During the past two decades, an increasing number of proposed AV approaches can be observed. However, a closer look at the respect…

2019-06-24abs ↗pdf ↗

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.

Formal verification of neural networks is essential for their deployment in safety-critical areas. Many available formal verification methods have been shown to be instances of a unified Branch and Bound (BaB) formulation. We propose a novel framework for designing an effective branching strategy for BaB. Specifically,…

2019-12-03abs ↗pdf ↗

Trade-R1 bridges verifiable rewards to stochastic financial markets via process-level reasoning verification.

problem Extending RL to financial markets where rewards are verifiable but noisy.
method A verification method that transforms reasoning over financial documents into a structured RAG task, using a triangular consistency metric.
result DSR achieves superior cross-market generalization while maintaining reasoning consistency.

As deep neural networks are increasingly being deployed in practice, their efficiency has become an important issue. While there are compression techniques for reducing the network's size, energy consumption and computational requirement, they only demonstrate empirically that there is no loss of accuracy, but lack for…

2020-01-10abs ↗pdf ↗

Generalizes neural network verification by adding arbitrary cutting planes.

problem Handling general cutting plane constraints in neural network verification.
method Generalized bound propagation method (GCP-CROWN) that allows arbitrary cutting plane constraints.
result GCP-CROWN significantly improves neural network verification performance.

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…

2019-06-10abs ↗pdf ↗

DIFFRNN verifies RNNs for safety and equivalence.

problem Certifying safety and equivalence of RNNs for resource-constrained platforms.
method Bounding nonlinear activation functions with linear constraints, solving constrained optimization problems, and using dReal SMT solver.
result DIFFRNN certifies the equivalence of optimized and original RNNs.

Improved neural network verification using Lagrangian decomposition and parallel algorithms.

problem Formally proving input-output properties of neural networks efficiently.
method Novel bounding and branching algorithms based on Lagrangian Decomposition and activation-based heuristics.
result Significant reduction in verification times, up to 50x faster on adversarial robustness properties.

Study robustness of polynomial neural networks using algebraic geometry.

problem Certify robustness radius of polynomial neural networks.
method Metric algebraic geometry, Euclidean distance degree, symbolic elimination, homotopy-continuation methods.
result Found decision boundaries with lower ED degree than generic cubic hypersurfaces.

The area of Handwritten Signature Verification has been broadly researched in the last decades, but remains an open research problem. The objective of signature verification systems is to discriminate if a given signature is genuine (produced by the claimed individual), or a forgery (produced by an impostor). This has …

2015-07-28abs ↗pdf ↗

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.