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

Trend · papers per month

2825638451,126 · Jun 202019922001200920172026
48 results for data 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.

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.

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.

Verification determines whether two samples belong to the same class or not, and has important applications such as face and fingerprint verification, where thousands or millions of categories are present but each category has scarce labeled examples, presenting two major challenges for existing deep learning models. W…

2017-06-12abs ↗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.

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.

New algorithms improve neural network verification by exploiting piecewise linear structure.

problem Efficiently verify the correctness of neural networks, especially those with high-dimensional inputs.
method Branch-and-Bound (BaB) framework applied to Mixed Integer Linear Programming (MIP) formulation.
result Significant performance improvements and new branching strategies for neural networks.

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.

Paper proposes a new method for robust speaker verification.

problem Improving robustness in speaker verification systems.
method Combines soft VAD and self-adaptive VAD with DNN-based VAD.
result Significant improvement in verification performance in real-world environments.

Improved far-field speaker verification for short utterances in noisy conditions.

problem Challenges in speaker verification on short utterances in uncontrolled noisy environments.
method Used deep neural network architectures (TDNN and ResNet) and experimented with various embedding extractors and training procedures.
result ResNet architectures outperform x-vector approach in speaker verification quality for both long and short utterances.

An empirical investigation of active/continuous authentication for smartphones is presented in this paper by exploiting users' unique application usage data, i.e., distinct patterns of use, modeled by a Markovian process. Variations of Hidden Markov Models (HMMs) are evaluated for continuous user verification, and chal…

2018-07-18abs ↗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.

Data taggants verify dataset ownership without harming models or requiring model internals.

problem Verifying dataset ownership without harming models or requiring model internals.
method Using pairs of out-of-distribution samples and random labels as secret keys, subtly altering a dataset to detect models trained on it.
result Data taggants reliably detect models trained on the protected dataset with high confidence, without compromising validation accuracy.

New algorithm speeds up robustness verification for tree-based models.

problem Formal robustness verification of tree-based models, especially ensembles.
method Reformulated as max-clique problem on a multi-partite graph with bounded boxicity; developed efficient multi-level verification algorithm.
result Tight lower bounds on robustness of decision tree ensembles, hundreds of times faster than previous approach.

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.

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.

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 ↗

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.

Semantify-NN verifies neural network robustness against semantic perturbations.

problem Verifying robustness of neural networks against semantic adversarial attacks.
method Inserting semantic perturbation layers (SP-layers) into neural networks to verify robustness.
result Semantify-NN significantly improves robustness verification performance over p\ell_p-norm-based methods.

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.

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

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.

SpeakerStew verifies 46 languages with reduced training and inference costs.

problem Speaker verification for 46 languages with smart speaker interactions.
method Pooling multilingual data, triage between text-dependent and text-independent models.
result Training on multiple languages generalizes well and reduces computational requirements.

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.

A new method for verifying deep learning architectures on FPGAs is proposed.

problem Design-time verification of deep learning architectures on FPGAs.
method 2-Level 3-Way (2L-3W) hardware-software co-verification methodology.
result Layer-by-layer similarity scores of 99% accuracy for successful mappings.

A neural network learns to improve verification of neural networks.

problem Efficient verification of neural networks for safety-critical applications.
method A graph neural network (GNN) learns to imitate strong branching heuristics for effective branching in the Branch and Bound (BaB) formulation.
result Reduces the number of branches and verification time by roughly 50% compared to hand-designed strategies.

For many years, i-vector based audio embedding techniques were the dominant approach for speaker verification and speaker diarization applications. However, mirroring the rise of deep learning in various domains, neural network based audio embeddings, also known as d-vectors, have consistently demonstrated superior spe…

2017-10-28abs ↗pdf ↗