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.
This paper tackles robustness of ensemble stumps and trees under general ℓ_p norm perturbations.
Trade-R1 bridges verifiable rewards to stochastic financial markets via process-level reasoning verification.
The area of Handwritten Signature Verification has been broadly researched in the last decades, but remains an open research problem. In offline (static) signature verification, the dynamic information of the signature writing process is lost, and it is difficult to design good feature extractors that can distinguish g…
DeepDyve uses simpler neural networks to verify DNNs for faults.
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 …
Formalizes weak and strong verification for LLMs, controlling errors without assumptions.
We describe an abstract control-theoretic framework in which the validity of the dynamic programming principle can be established in continuous time by a verification of a small number of structural properties. As an application we treat several cases of interest, most notably the lower-hedging and utility-maximization…
New approach generates optimal disturbances for controller verification.
Prior work on neural network verification has focused on specifications that are linear functions of the output of the network, e.g., invariance of the classifier output under adversarial perturbations of the input. In this paper, we extend verification algorithms to be able to certify richer properties of neural netwo…
Develops first robustness verification for complex Transformers.
Paper develops PAC verification for hypothesis classes and statistical algorithms.
Despite the tremendous advances that have been made in the last decade on developing useful machine-learning applications, their wider adoption has been hindered by the lack of strong assurance guarantees that can be made about their behavior. In this paper, we consider how formal verification techniques developed for …
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 …
We explore the concept of co-design in the context of neural network verification. Specifically, we aim to train deep neural networks that not only are robust to adversarial perturbations but also whose robustness can be verified more easily. To this end, we identify two properties of network models - weight sparsity a…
TS-Insight visualizes Thompson Sampling for better debugging and trust.
The paper uses RL to verify hypotheses, overcoming existing limitations.
Accelerates DNN robustness verification with target labels.
New methods combat data poisoning attacks in bandit algorithms using limited verification.
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…
Improves neural network verification by merging abstract domains and Lagrangian methods.
This paper explores formal verification for autonomous systems, identifying limitations and proposing improvements.
Paper develops a model for verifying facts in tables without pre-retrieved evidence.
Efficiently verifies neural networks by handling neuron splits, improving speed and accuracy.
Researchers find floating point errors can mislead neural network verifiers.
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…
This study extends verifiable learning to boosted tree ensembles, enabling efficient security verification.
Accelerating Speculative Diffusions via Block Verification
Verifying robustness of neural networks given a specified threat model is a fundamental yet challenging task. While current verification methods mainly focus on the -norm threat model of the input instances, robustness verification against semantic adversarial attacks inducing large -norm perturbations,…
We demonstrate that a number of sociology models for social network dynamics can be viewed as continuous time Bayesian networks (CTBNs). A sampling-based approximate inference method for CTBNs can be used as the basis of an expectation-maximization procedure that achieves better accuracy in estimating the parameters of…
Paper solves portfolio problem using improved stochastic methods.
GPUPoly verifies large neural networks robustly on GPUs.
New spoofing strategies show PoL verification is more vulnerable than previously thought.
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 …
NeuroDiff improves neural network equivalence verification with fine-grained approximations.
We consider a spread financial market defined by the multidimensional Ornstein--Uhlenbeck (OU) process. We study the optimal consumption/investment problem for logarithmic utility functions in the base of stochastic dynamical programming method. We show a special Verification Theorem for this case. We find the solution…
FPGAs have become a popular choice for deploying deep learning architectures (DLA). There are many researchers that have explored the deployment and mapping of DLA on FPGA. However, there has been a growing need to do design-time hardware-software co-verification of these deployments. To the best of our knowledge this …
Safe learning of stochastic dynamics with safety constraints.
Novel approach using Lagrangian Decomposition for neural network verification.
Validates neural networks inputs to protect against adversarial examples.
Paper improves speaker verification with federated learning and differential privacy.
We consider a discounted reward control problem in continuous time stochastic environment where the discount rate might be an unbounded function of the control process. We provide a set of general assumptions to ensure that there exists a smooth classical solution to the corresponding HJB equation. Moreover, some verif…
This paper presents an end-to-end text-independent speaker verification framework by jointly considering the speaker embedding (SE) network and automatic speech recognition (ASR) network. The SE network learns to output an embedding vector which distinguishes the speaker characteristics of the input utterance, while th…
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…
SFAVEL distills features from language models for fact verification without annotations.
Scalable verification for deep neural networks with formal guarantees.
Improved far-field speaker verification for short utterances in noisy conditions.
In this paper, we propose a new differentiable neural network alignment mechanism for text-dependent speaker verification which uses alignment models to produce a supervector representation of an utterance. Unlike previous works with similar approaches, we do not extract the embedding of an utterance from the mean redu…
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…