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

7152229 · May 202619922001200920172026
48 results for Bernstein certificates

Enhances robustness of deep neural networks with randomized smoothing.

problem Improving robustness of deep neural networks against noisy inputs and adversarial attacks.
method Introduces a variance-margin trade-off approach to increase certified robust radius using pre-trained models.
result Significant improvement in certified accuracy compared to state-of-the-art methods.

New algorithms learn stability certificates from data, avoiding complex dynamics.

problem Synthesizing stability certificates from complex dynamical systems.
method Developed algorithms to learn certificate functions from trajectory data, establishing generalization error bounds.
result Efficiently learned certificates can be used for adaptive control.

Improved neural network robustness certification through tighter convex relaxations.

problem Certifying neural network robustness to perturbed and adversarial inputs.
method Exploiting ReLU network structure, novel partition-based certification procedure.
result Tightens existing linear programming relaxations to achieve zero relaxation error asymptotically.

New method closes certification gap for adversarially trained models.

problem Certifying robustness of adversarially trained neural networks.
method Nonconvex low-rank SDP relaxation with polynomial-time optimization.
result Strong certifications comparable to SDP methods, but with fewer variables.

While neural networks have achieved high performance in different learning tasks, their accuracy drops significantly in the presence of small adversarial perturbations to inputs. Defenses based on regularization and adversarial training are often followed by new attacks to defeat them. In this paper, we propose attack-…

2019-02-01abs ↗pdf ↗

Bayesian method synthesizes barrier certificates for unknown systems with latent states.

problem Certifying safety in systems with unknown dynamics and latent states.
method Bayesian inference with Metropolis-Hastings sampler and sum-of-squares program.
result Probabilistic validity of barrier certificates for unknown systems.

CITE algorithm provides anytime-valid certification of model outputs.

problem Challenges in controlling error levels in LLM self-consistency.
method Certification by Intersection-union Testing with E-processes (CITE) algorithm.
result Provable control of false certification at any prescribed level under arbitrary stopping rules.

Adaptive Bernstein copulas improve risk management by preventing overfitting and reducing simulation effort.

problem Overfitting and high simulation effort in estimating dependence models.
method Constructive approach to Bernstein copulas with an admissible discrete skeleton.
result Comparison of different copula approaches in risk management shows improved accuracy and efficiency.

Paper develops tighter risk certificates for contrastive learning models.

problem Statistical theory for contrastive learning is lacking, especially for practical models like SimCLR.
method Develops non-vacuous PAC-Bayesian risk certificates considering practical SimCLR factors.
result Risk certificates for contrastive loss and downstream prediction are much tighter than previous results.

The performance of a reinforcement learning algorithm can vary drastically during learning because of exploration. Existing algorithms provide little information about the quality of their current policy before executing it, and thus have limited use in high-stakes applications like healthcare. We address this lack of …

2018-11-07abs ↗pdf ↗

Survey Bernstein-type theorems for graphical surfaces in Euclidean and Lorentz-Minkowski spaces.

problem Proving theorems for minimal and constant mean curvature graphs in Euclidean and Lorentz-Minkowski spaces.
method Explains several proofs and provides mean curvature estimates for graphs in Euclidean and Lorentz-Minkowski spaces.
result Bernstein-type theorems for constant mean curvature graphs in Euclidean 3-space and space-like graphs in Lorentz-Minkowski 3-space.

New method provides tighter robustness guarantees for adversarial attacks.

problem Ensuring robustness against adversarial attacks in machine learning models.
method Developed a Second-order Smoothing (SoS) robustness certificate using Gaussian random smoothing.
result SoS certificates are tighter and provide improved robustness on high-dimensional datasets.

TUV Austria proposes certification for ML applications to ensure reliability.

problem Ensuring trust in AI applications to meet societal reliance requirements.
method Holistic approach analyzing security, functionality, data quality, ethics, and criticality levels.
result Certification process for low-risk ML applications in supervised learning.

Improved analysis of UCRL2 with empirical Bernstein inequality reduces exploration-exploitation regret.

problem Exploration-exploitation in communicating Markov Decision Processes.
method Analysis of UCRL2 with Empirical Bernstein inequalities (UCRL2B).
result Regret bound of O~(DΓSAT)\widetilde{O}(\sqrt{DΓS A T}) for UCRL2B.

Paper provides efficient robustness certificates for neural networks.

problem Ensuring neural networks are robust against adversarial attacks.
method Two-step approach: 1) Efficient convex optimization for robustness certificates with bounded Hessian eigenvalues, 2) Curvature-based regularization during training.
result Significantly higher certified robust accuracy achieved compared to existing methods.

We present Bernstein-Sato identities for scalar-, spinor- and differential form-valued distribution kernels on Euclidean space associated to conformal symmetry breaking operators. The associated Bernstein-Sato operators lead to partially new formulae for conformal symmetry breaking differential operators on functions, …

2017-11-05abs ↗pdf ↗

New robustness certificates for streaming models with a sliding window.

problem Applying robustness certificates to streaming data with correlated inputs.
method Deriving robustness certificates for models using a sliding window over a sequence of potentially correlated inputs.
result Guarantees hold for the average model performance across the entire stream, independent of stream size.

The paper proves Calabi-Bernstein type results for minimal and maximal surfaces in 3D and 3D-L spacetime.

problem Characterizing minimal and maximal surfaces in 3D and 3D-L spacetime.
method Analyzing surfaces with specific properties and using geometric and functional methods.
result Calabi-Bernstein type results for critical points of a weighted area functional in R3\mathbb{R}^{3} and L3\mathbb{L}^{3}.

Article provides Bernstein gradient estimates for heat equations with potential terms.

problem Gradient estimates for heat equations with potential terms on weighted Riemannian manifolds.
method Derived Bernstein type gradient estimates for two systems of heat equations with linear, exponential, and combined potentials.
result Resolves part of the problem raised by Bhattacharyya et al. in \cite{SB-1}.

The paper improves risk certificate tightness for neural networks using PAC-Bayes bounds.

problem Improving the usability of risk certificates for neural networks based on PAC-Bayes bounds.
method Theoretical contributions including KL divergence bounds, efficient methodology for optimization, and methods for optimizing non-differentiable objectives.
result First non-vacuous generalization bounds on CIFAR-10 for neural networks.

The paper solves Bernstein problems for specific submanifolds in high-dimensional spaces.

problem Bernstein problem for smooth maps to lower dimensions forming calibrated submanifolds.
method Established conditions for maps to be affine based on the slope's second elementary symmetric polynomial.
result Conditions ensuring maps are affine for coassociative and Cayley submanifolds in R7\mathbb{R}^7 and R8\mathbb{R}^8.

Study adversarial perturbations in classification, analyzing learning and certification.

problem Formal study of classification under adversarial perturbations from both learner and third-party perspectives.
method PAC-type semi-supervised learning framework, black-box certification under limited query budget, adversary analysis.
result Existence of a polynomial query complexity adversary implies the existence of a sample efficient robust learner.

New method improves robustness of smoothed classifiers against adversarial attacks.

problem Improving robustness of smoothed classifiers against adversarial attacks.
method Proposes worst-case adversarial loss over input distributions as a robustness certificate, and uses duality and smoothness properties to provide an easy-to-compute upper bound.
result Shows superior robustness performance over state-of-the-art certified or heuristic methods.

SREC markets are a relatively novel market-based system to incentivize the production of energy from solar means. A regulator imposes a floor on the amount of energy each regulated firm must generate from solar power in a given period and provides them with certificates for each generated MWh. Firms offset these certif…

2019-04-12abs ↗pdf ↗

In this paper, we study the properties of potential function of the translating soliton MM in Rn+1R^{n+1} and the volume growth of the intersection of Euclidean balls with MM. We give a condition to obtain the Bernstein theorem for the translating solitons. We also give an outline of a simple proof of the Bernstein the…

2015-06-01abs ↗pdf ↗