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.

169,042 papers · 148 categories

Trend · papers per month

3537061,0591,412 · Jun 202019922001200920172026
48 results for certified models

New method certifies regression robustness without data distribution assumptions.

problem Certifying robustness of regression models against poisoning attacks.
method Reduces certified regression to certified classification using median decision function.
result Proposes six new provably-robust regression models.

SAFER method certifies robustness to word substitutions without model structure.

problem Certified robustness against synonymous word substitutions in NLP models.
method Randomized smoothing with stochastic ensemble of randomized inputs.
result Significantly outperforms state-of-the-art methods for certified robustness.

BagCert efficiently certifies robustness against adversarial patches on image classifiers.

problem Adversarial patches pose a threat to autonomous systems' perception component.
method BagCert combines model architecture and certification procedure for efficient inference.
result BagCert certifies 10,000 examples in 43 seconds on a single GPU, achieving 86% clean and 60% certified accuracy against 5x5 patches.

This work improves certifiably robust models by distilling knowledge from adversarially robust teachers.

problem Certifiably robust models suffer from poor standard performance.
method Knowledge distillation from adversarially robust teachers to improve standard performance.
result Distillation from adversarially robust teachers consistently improves certified training performance.

New techniques extend certified unlearning to deep neural networks.

problem Applying certified unlearning to deep neural networks (DNNs) is challenging due to their nonconvex nature.
method Developed simple techniques and an efficient computation method for nonconvex objectives, considering nonconvergence training and sequential unlearning.
result Demonstrated the efficacy of the method on real-world datasets, showing advantages of certified unlearning in DNNs.

Paper improves robustness certification by integrating ML and logical reasoning.

problem Limited robustness certification under perturbation radius.
method Integrates statistical ML models with logical reasoning using Markov logic networks.
result First certified robustness bound for MLN derived and experimentally validated.

Improved defense against data poisoning attacks by aggregating smaller subsets.

problem Mitigating the impact of poisoned data on model robustness.
method Finite Aggregation method that combines duplicates of smaller disjoint subsets for training.
result Consistent improvement in certified robustness bounds, up to 4.77% on GTSRB.

Certified guidance ensures generative models always meet planning objectives.

problem Lack of guarantees for generated outputs satisfying planning objectives.
method Certified guidance modifies generative models without retraining, ensuring outputs meet STL specifications.
result Certified guidance produces models that are always correct, unlike non-certified methods.

This paper proposes a framework for certifying neural network defenses against data poisoning attacks.

problem Vulnerability of neural networks to data poisoning attacks.
method Random selection based defenses that average predictions on sub-datasets sampled from the training set.
result The certified radius of bagging derived by the framework is tighter than previous work.

SingleProp speeds up robust neural network training with minimal certification.

problem Efficiently defending neural networks against adversarial attacks with certified guarantees.
method SingleProp regularizer that requires only one forward pass per training iteration.
result Comparable certified accuracy to state-of-the-art defenses, but significantly faster training.

We show how to turn any classifier that classifies well under Gaussian noise into a new classifier that is certifiably robust to adversarial perturbations under the 2\ell_2 norm. This "randomized smoothing" technique has been proposed recently in the literature, but existing guarantees are loose. We prove a tight robu…

2019-02-08abs ↗pdf ↗

New framework solves low-rank optimization problems to certifiable optimality.

problem Low-rank optimization problems with certifiable solutions.
method Mixed-Projection Conic Optimization framework using symmetric projection matrices and outer-approximation algorithms.
result Solves low-rank problems to certifiable optimality, outperforming existing methods.

MACER trains robust models without adversarial training, faster and more effective.

problem Learning robust models without relying on attack-dependent adversarial training.
method MACER trains provably robust smoothed classifiers by maximizing certified radius.
result MACER achieves larger average certified radius and faster training time compared to state-of-the-art methods.

Paper proposes faster certified robust training methods with short warmup.

problem Certified robust training methods require long warmup schedules, making training costly.
method Proposes three improvements: new weight initialization, BN, and regularization.
result Achieves 65.03% verified error on CIFAR-10 and 82.36% on TinyImageNet with short warmup.

Framework certifies fairness of machine learning models interactively and privately.

problem Certifying fairness of machine learning models in privacy-preserving scenarios.
method Interactive test with cryptographic techniques for fairness certification.
result Empirical evaluation of fairness for various models and definitions.

Improved training boosts certified robustness of L-infinity distance nets.

problem Certified robustness of L-infinity distance nets is not as strong as conventional networks.
method Improved training process combining scaled cross-entropy and clipped hinge loss with a decaying mixing coefficient.
result Certified accuracy of L-infinity distance nets improved from 33.30% to 40.06% on CIFAR-10.

Work on making classifiers robust against adversarial attacks for top-k predictions.

problem Vulnerability of classifiers to adversarial perturbations, especially for top-k predictions.
method Randomized smoothing to turn any classifier into a robust one, using Gaussian noise.
result Derives a tight robustness in ℓ2 norm for top-k predictions, achieving 62.8% certified top-5 accuracy on ImageNet.

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.

Improves robustness of GNNs with minimal loss in accuracy.

problem Non-robustness of GNNs to adversarial attacks on node attributes.
method Certifiable robustness method for binary node attributes and L_0-bounded perturbations, combined with robust semi-supervised training.
result Certified robustness and non-robustness of GNNs, with minimal loss in accuracy.

Improves safety region certification for smoothed classifiers without changing smoothing scheme.

problem Certified safety regions for smoothed classifiers are often small compared to optimal.
method Generalizes certified radius calculation as nested optimization problem, uses 0th-1st order information, and designs efficient estimators.
result Certified safety regions are significantly larger than current methods, achieving significant improvements on various metrics.

Certified training improves robustness against adversarial attacks.

problem Certified training's gap with empirical robustness limits its practical utility.
method Combining adversarial attacks with network over-approximations.
result Certified training can prevent catastrophic overfitting and bridge the gap to multi-step baselines.

Proves the existence of accurate, certifiably robust neural networks.

problem Training neural networks to be robust against adversarial attacks.
method Proves the existence of networks that approximate continuous functions and ensure robustness through interval-bound propagation.
result Proves the existence of accurate, interval-certified ReLU networks.

Paper improves neural network robustness certification with tighter radii estimates.

problem Certifying neural networks' robustness against adversarial attacks.
method Advanced algorithms for discrete and continuous domains, optimizing sample size, standard deviation, and temperature.
result Significant improvement in certified test-set accuracy with tighter certified radii bounds.

LOT improves adversarial robustness by training 1-Lipschitz convolution layers.

problem Improving adversarial robustness of deep neural networks.
method LOT: Layer-wise Orthogonal Training for 1-Lipschitz convolution layers.
result LOT significantly enhances certified robustness of Lipschitz-bounded models.

Unified framework for certifying LLM reliability without extra supervision.

problem Improving reliability of large language models without additional supervision.
method Unified framework using majority voting and Martingale Majority Certificate (MMC).
result Certifiable inference in LLMs with statistical guarantees and adaptive stopping rules.

Extends randomized smoothing to certify robustness against various threat models and adversarial perturbations.

problem Certifying robustness of classifiers against adversarial perturbations.
method Develops a method to certify robustness against any p\ell_p (pN>0p\in\mathbb{N}_{>0}) minimized adversarial perturbation.
result Randomized smoothing suffers from the curse of dimensionality, reducing effective radius as pp increases.

We certify federated learning model performance under meta-distribution shifts.

problem Certifying model performance on unseen networks with heterogeneous distributions.
method Derive worst-case uniform guarantees for federated learning model's average loss and risk CDF.
result Asymptotically minimax optimal and privacy-preserving certification.

COLEP improves robustness of conformal prediction via probabilistic circuits.

problem Adversarial perturbations can undermine the coverage guarantees of conformal prediction.
method COLEP uses probabilistic circuits to learn and reason about different semantic concepts, providing certifiable coverage guarantees.
result COLEP achieves higher prediction coverage and accuracy than a single model, especially with non-trivial knowledge models.

Automates perturbation analysis for neural networks, enabling certified robustness on complex architectures.

problem Limited applicability of existing perturbation analysis methods to complex neural network architectures.
method Developed an automatic framework to generalize LiRPA algorithms to any neural network structure, enabling loss fusion and state-of-the-art certified defense results.
result Demonstrated LiRPA based certified defense on Tiny ImageNet and Downscaled ImageNet.