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,657 papers · 148 categories

Trend · papers per month

75150224299 · Jun 202019922001200920172026
48 results for practical verification

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 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.

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.

This paper addresses the problem of formally verifying desirable properties of neural networks, i.e., obtaining provable guarantees that neural networks satisfy specifications relating their inputs and outputs (robustness to bounded norm adversarial perturbations, for example). Most previous work on this topic was limi…

2018-03-17abs ↗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.

Verification helps prevent model collapse when training on synthesized data.

problem Model collapse when training on generated data.
method Theoretical characterization using Gaussian mixtures, linear classifiers, and linear verifiers to assess synthesized data quality.
result Verifiers can prevent model collapse and correlate with performance.

PRoA assesses deep learning robustness against practical functional perturbations.

problem Inadequate practical robustness verification methods for deep learning systems.
method Probabilistic robustness assessment based on adaptive concentration.
result Statistical guarantees on probabilistic robustness against functional perturbations.

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.

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 ↗

This paper provides a comprehensive benchmark and taxonomy for certifiably robust DNN defenses.

problem Certifiably robust defenses against adversarial attacks for deep neural networks.
method Taxonomy and benchmark of certifiably robust approaches.
result First comprehensive benchmark of certifiably robust approaches on different datasets.

This paper summarizes the applied deep learning practices in the field of speaker recognition, both verification and identification. Speaker recognition has been a widely used field topic of speech technology. Many research works have been carried out and little progress has been achieved in the past 5-6 years. However…

2019-11-14abs ↗pdf ↗

This research simplifies verification of machine learning systems using reparameterization.

problem Reduce or eliminate serious bugs in machine learning systems.
method Use proof assistants to construct machine-checked proofs of correctness, leveraging reparameterization to handle probabilistic claims.
result Demonstrates broad applicability of reparameterization to verify different types of machine learning systems.

We present a new approach to assessing the robustness of neural networks based on estimating the proportion of inputs for which a property is violated. Specifically, we estimate the probability of the event that the property is violated under an input model. Our approach critically varies from the formal verification f…

2018-11-17abs ↗pdf ↗

Recent advances in machine learning and artificial intelligence are now being considered in safety-critical autonomous systems where software defects may cause severe harm to humans and the environment. Design organizations in these domains are currently unable to provide convincing arguments that their systems are saf…

2019-05-10abs ↗pdf ↗

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 ↗

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.

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.

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 ↗

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.

A new framework for robustness analysis of deep neural networks using PAC-model learning.

problem Analyzing local robustness of deep neural networks.
method Black-box model learning with scenario optimisation to abstract DNN behaviour via an affine model with PAC guarantee.
result DeepPAC outperforms state-of-the-art statistical methods in practical robustness analysis.

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.

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.

Autonomous vehicles rely on machine learning to solve challenging tasks in perception and motion planning. However, automotive software safety standards have not fully evolved to address the challenges of machine learning safety such as interpretability, verification, and performance limitations. In this paper, we revi…

2019-12-20abs ↗pdf ↗

Robustness verification that aims to formally certify the prediction behavior of neural networks has become an important tool for understanding model behavior and obtaining safety guarantees. However, previous methods can usually only handle neural networks with relatively simple architectures. In this paper, we consid…

2020-02-16abs ↗pdf ↗

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.

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 ↗

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 spoofing strategies show PoL verification is more vulnerable than previously thought.

problem Vulnerability of Proof-of-Learning verification mechanisms.
method Developed new spoofing strategies that can be reproduced across different configurations and are more cost-effective.
result Current PoL verification is not robust to adversaries and requires further understanding of optimization in deep learning.

We present a scoring approach for speaker verification that mimics the standard PLDA-based backend process used in most current speaker verification systems. However, unlike the standard backends, all parameters of the model are jointly trained to optimize the binary cross-entropy for the speaker verification task. We …

2019-11-26abs ↗pdf ↗

This paper reviews methods for constructing confidence intervals for error rates in 1:1 matching tasks.

problem Challenges in assessing uncertainty of error rates in matching algorithms, especially when data are dependent and error rates are low.
method Derives and examines statistical properties of methods for constructing confidence intervals for error rates in 1:1 matching tasks.
result Coverage and interval width vary with sample size, error rates, and data dependence.

Paper improves speaker verification with federated learning and differential privacy.

problem Improving speaker verification accuracy using private data.
method Combining federated learning and differential privacy to train an auxiliary model that predicts vocal characteristics.
result 6% relative improvement in equal error rate over a baseline system.

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 ↗

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 ↗