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.
Revel tackles safe exploration in RL with verified symbolic policies.
problem Computational infeasibility of verifying neural networks in RL learning loops.
method Two policy classes: neurosymbolic with approximate gradients and symbolic policies for efficient verification. Mirror descent over policies to safely update and project policies.
result Revel discovers policies that outperform prior approaches to verified exploration.
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.
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.
This work improves neural network robustness to symbol substitutions using formal verification.
problem Neural networks' vulnerability to adversarial attacks, especially under discrete text perturbations.
method Formal verification using Interval Bound Propagation on a simplex model of input perturbations.
result Models show improved verified accuracy under perturbations with formal guarantees.
Framework for verifying deep learning operators.
problem Complexity and errors in designing and implementing custom operators.
method Symbolic execution, syntax-guided synthesis, SMT-based verification.
result Effective synthesis and verification of deep learning operators.
CALVER verifies causal reasoning traces, improving over voting methods in complex queries.
problem Voting fails in causal reasoning due to repeated confounding errors and multiple valid answers.
method CALVER scores structured traces against causal criteria and selects the highest-scoring candidate.
result CALVER selects valid answers more accurately than voting methods, especially with larger sample sizes.
Stability of black holes proven in full subextremal range with positive cosmological constant.
problem Stability of Kerr-de Sitter black holes in the full subextremal range.
method Similar to previous proof in slowly rotating case, with implementation of constraint damping and verification of subprincipal symbol condition.
result Stability of Kerr-de Sitter black holes proven in the full subextremal range.
GoTube verifies neural networks over time, scaling to large horizons.
problem Verifying the robustness of time-continuous neural networks.
method Solves Go problems to construct a conservative execution set.
result Substantially outperforms existing tools in size, speed, and scalability.
Transformers learn to predict temporal logic solutions from classical solver outputs.
problem Training neural networks on logic problem solutions for verification.
method Training a Transformer on generated training data from classical solvers, focusing on one solution per formula.
result Transformers can predict correct solutions to temporal logic problems, even to unseen benchmarks.
PIRL generates interpretable reinforcement learning policies using programming languages.
problem Creating interpretable reinforcement learning policies.
method Neurally Directed Program Search (NDPS) for finding optimal programmatic policies.
result PIRL discovers human-readable, smoother, and transferable policies.
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.
EEG signals enhance speaker verification system robustness.
problem Improving speaker verification in noisy environments.
method Used end-to-end deep learning model with EEG and speech features.
result EEG signals improve speaker verification robustness, especially in noisy conditions.
We improve neural network robustness verification by training for faster stability.
problem Efficient verification of adversarial robustness in deep networks.
method Co-design of weight sparsity and ReLU stability to simplify verification.
result Improving ReLU stability leads to a 4-13x speedup in verification times.
Develops first robustness verification for complex Transformers.
problem Certify prediction behavior of Transformers with complex self-attention layers.
method Resolves challenges of cross-nonlinearity and cross-position dependency in Transformers.
result Certified robustness bounds are significantly tighter than Interval Bound Propagation.
Paper develops PAC verification for hypothesis classes and statistical algorithms.
problem Verifying machine learning models interactively.
method Develops interactive proof for PAC verification, proves lower bounds, and introduces a generalization.
result Improved protocol for verifying unions of intervals and statistical query algorithms.
Paper optimizes hypothesis verification in sequential experiments.
problem Maximizing confidence in a verified hypothesis after exploration.
method Formulated as a confidence maximization problem in a POMDP, characterized optimal solutions, and proposed a heuristic.
result Heuristic performs better than existing methods in some scenarios.
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) verifications. VaSST uses soft symbolic trees for probabilistic symbolic regression.
problem Efficiently recover symbolic expressions from noisy data.
method Variational inference with soft symbolic trees.
result Superior performance in structural recovery and predictive accuracy.
Improved speaker verification with condition-aware backend.
problem Speaker verification calibration issues under unknown conditions.
method Discriminative PLDA model with joint training and condition integration.
result Out-of-the-box excellent calibration performance.
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.
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.
Unified framework integrates symbolic planning and HRL for robust decision-making.
problem Combining reinforcement learning and symbolic planning for robust decision-making in dynamic environments.
method Integrates symbolic planning with hierarchical reinforcement learning to guide task execution and improve planning.
result Unified framework leads to rapid policy search and robust symbolic plans in complex domains.
Paper tackles speaker verification by removing reverberation using deep LSTM networks.
problem Improving speaker verification accuracy in reverberant environments.
method Dual-label deep LSTM networks trained to map reverberant to clean speech features.
result Evaluates performance using EERs, showing improved accuracy.
New neural network boosts authorship verification on social media.
problem Challenges in verifying authorship of short, diverse social media messages.
method Proposes a new neural network topology for similarity learning.
result Significantly improved performance on author verification tasks.
Handwritten signature verification remains challenging, especially offline.
problem Discriminate genuine from forged signatures in static scenarios.
method Review of past research and analysis of recent advancements in Deep Learning.
result Deep Learning has shown promise in feature representation learning from signature images.
New framework verifies neural networks with scalable guarantees.
problem Formal verification of neural networks with provable guarantees.
method Formulated as an optimization problem, solved with Lagrangian relaxation.
result Developed algorithms with tightness guarantees under special assumptions.
End-to-end speaker verification framework reduces text dependency.
problem Improving text-independent speaker verification.
method Jointly trains SE and ASR networks with triplet loss and adversarial gradient.
result Lower equal error rate and better text-independency compared to other approaches.
Paper proposes an ensemble model for writer-independent offline signature verification using deep learning.
problem Difficulty in distinguishing genuine signatures from skilled forgeries in writer-independent offline signature verification.
method Used an ensemble model with two CNNs for feature extraction, RGBT for classification, and stacking for final prediction.
result Achieved state-of-the-art performance on various datasets.
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-norm-based methods. Proposes a new neural network for text-dependent speaker verification.
problem Improves speaker verification by encoding phrase and speaker information.
method Uses differentiable alignment models to produce supervectors from utterances.
result Achieves competitive performance in text-dependent speaker verification tasks.
New method for constructing frames for vector distributions with specific symbols.
problem Constructing frames for vector distributions with given Jacobi symbols.
method Introducing Jacobi symbols, Optimal Control ideas, explicit construction of canonical frames, algebraic procedure.
result Explicit construction of canonical frames for all distributions with given Jacobi symbols, description of prolongation algebra for most Jacobi symbols.
We describe dimensionally constrained symbolic regression which has been developed for mass measurement in certain classes of events in high-energy physics (HEP). With symbolic regression, we can derive equations that are well known in HEP. However, in problems with large number of variables, we find that by constraini…
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.
SEVEN tackles verification challenges with semi-supervised deep learning.
problem Verification with scarce labeled examples across many categories.
method SEVEN combines generative and discriminative components for end-to-end training.
result SEVEN significantly outperforms other techniques in verification tasks with limited labeled data.
End-to-end system improves speaker verification using attention mechanism.
problem Improving text-dependent speaker verification accuracy.
method Speaker discriminative CNNs extract features, attention mechanism combines them, end-to-end training optimizes system.
result The proposed system achieves better performance on Windows 10 speaker verification task.
Paper closes neural-symbolic learning loop with grammar model and back-search algorithm.
problem Slow convergence in neural-symbolic learning due to error propagation issues.
method Introduces grammar model as symbolic prior and back-search algorithm for efficient error propagation.
result Significantly outperforms RL methods in performance, converging speed, and data efficiency.
Geometric symbols help compute heat invariants.
problem Computing heat invariants efficiently.
method Geometric symbol calculus of pseudodifferential operators.
result Efficient computation of heat invariants.
New technique reduces verification time for neural networks.
problem Verifying neural networks for safety-critical applications.
method Shadow prices for more efficient input partitioning.
result Significant reduction in computation times for verification.
For an arbitrary Riemannian manifold X and Hermitian vector bundles E and F over X we define the notion of the normal symbol of a pseudodifferential operator P from E to F. The normal symbol of P is a certain smooth function from the cotangent bundle T∗X to the homomorphism bundle Hom(E,F) and dep…
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 L∞-norm and pseudo-polynomial time for Lp-norm verification. result Polynomial time verification for L∞-norm attackers, NP-hard for other norms, and pseudo-polynomial time for Lp-norm verification. Paper proposes a new embedding method for face verification and clustering.
problem Unconstrained face verification remains challenging.
method Coupling deep CNN with triplet probability constraints for low-dimensional embedding.
result The proposed method outperforms state-of-the-art methods in verification and identification metrics.
Accelerating Speculative Diffusions via Block Verification
problem Adapting speculative decoding for continuous diffusion models
method Introducing a novel speculative sampling mechanism for diffusion models
result Improves acceptance rate and speeds up inference
Unified convex relaxation framework for neural network robustness verification.
problem Inability to achieve tight verification of neural networks against adversarial attacks.
method Unified convex relaxation framework for neural networks of various architectures and nonlinearities.
result Exact solution to convex-relaxed problem does not significantly improve verification gap.
Symbolic dynamics applied to share prices reveals complex, non-Markovian patterns.
problem Analyzing complex systems like share prices using symbolic dynamics.
method Symbolic dynamics applied to time series of share price returns.
result Nontrivial spectrum of Renyi entropies found, indicating non-Markovian behavior.