Pricing bonus certificates and barrier products uses efficient interpolation and stochastic modeling.
problem Pricing bonus certificates and barrier products with American conditions.
method Efficient interpolation for European conditions, stochastic modeling for American conditions.
result Pricing can be done without stochastic modeling within a certain accuracy range.
The paper introduces bonus-malus systems with varying deductibles for different claim types and policyholder levels.
problem Designing bonus-malus systems with varying deductibles for policyholders of different claim types.
method Introducing bonus-malus systems with varying deductibles for policyholders in different levels and claim types, investigating restrictions and allocation principles.
result Possible introduction of varying deductibles for policyholders in the highest bonus-malus level, considering two allocation principles.
The paper calculates bonus values in complex insurance schemes.
problem Calculating bonus payments in multi-state with-profit life insurance.
method Combines financial risk simulation with insurance risk methods.
result Efficient numerical procedures for bonus calculation.
Develops a Bonus-Malus model for cyber risk insurance to incentivize cybersecurity.
problem Lack of effective insurance strategies to incentivize cybersecurity.
method Proposes a Bonus-Malus model and a mathematical model with a numerical algorithm.
result Demonstrates how a Bonus-Malus system resolves moral hazard and benefits the insurer.
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.
Study minimax optimal RL in factored MDPs with bonus exploration.
problem Optimal reinforcement learning in episodic factored MDPs.
method Proposes two model-based algorithms with bonus exploration for minimax optimal regret.
result Achieves minimax optimal regret guarantees for rich factored structures.
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.
The paper introduces robustness certificates for ReLU networks to protect against adversarial perturbations.
problem The vulnerability of ReLU networks to small adversarial perturbations.
method The paper proposes two lower bounds for the distance of a given input sample to the classification decision boundary of a ReLU network.
result The proposed simplex certificate is a closed-form, differentiable, and computationally efficient robustness measure.
Policy certificates improve reinforcement learning accountability and efficiency.
problem Lack of policy quality information in reinforcement learning algorithms.
method Propose and implement algorithms with policy certificates that bound sub-optimality and return.
result First algorithm achieves minimax-optimal PAC bounds and minimax regret bounds.
Develops structured noise for more accurate graph classifier robustness certificates.
problem Isotropic noise limits robustness certificates for graph classifiers.
method Randomized smoothing with anisotropic noise distribution.
result Structured-aware robustness certificates provide more accurate predictions.
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.
Improved analysis of UCBVI algorithm with better empirical performance.
problem Improving the UCBVI algorithm's performance and understanding its bounds.
method Refined analysis of UCBVI algorithm with improved bonus terms and regret analysis.
result Improving multiplicative constants in UCBVI bounds enhances empirical performance.
New framework improves adversarial robustness certification for various perturbations.
problem Certifying robustness against adversarial attacks in deep learning models.
method Unified functional optimization approach with non-Gaussian smoothing noise for multiple types of attacks.
result Achieves better certification results and identifies key trade-offs between accuracy and robustness.
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.
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.
New method for computing insurance premiums using expert information.
problem Premium computation in Bonus-Malus systems.
method Use of Ordered Weighted Averaging (OWA) operators for collective and Bayes premiums.
result Alternative methods for computing premiums described and illustrated.
Develops local population-risk certificates for model updates
problem Model updates in machine learning
method Certify population-risk increments around a model
result Certified upper endpoint yields a risk-controlled update rule
A new method for exploration in reinforcement learning improves performance on Atari games.
problem Improving exploration in reinforcement learning algorithms, especially for complex games.
method Random Network Distillation (RND) bonus combined with flexible reward combination.
result Significant progress on hard exploration Atari games, including Montezuma's Revenge.
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.
A new curiosity method uses episodic memory to reward novelty, improving learning from sparse rewards.
problem Sparse rewards in real-world reinforcement learning.
method Uses episodic memory to form novelty bonuses based on reachability.
result Improves learning from sparse rewards in various environments.
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.
Valid certifies LLMs' domain adherence, bounding out-of-domain behavior.
problem Adversarial susceptibility of LLMs to generate out-of-domain outputs.
method VALID approach providing adversarial bounds as a certificate.
result Validates LLMs' domain adherence with meaningful certificates.
The study analyzes how bonus-malus systems and delayed claims settlement affect insurance companies' financial stability.
problem Analyzing the impact of bonus-malus systems and delayed claims settlement on insurance companies' financial stability.
method Examined a discrete-time risk model with time-varying premiums, evaluating two types of claims and settlement delays.
result Delayed settlement of by-claims leads to lower ruin probabilities under specific assumptions.
New RL method finds near-optimal policies efficiently.
problem Efficient exploration in model-free RL.
method Modifies Delayed Q-learning with long-term exploration bonus.
result Polynomial time PAC-MDP solution for near-optimal policy finding.
New algorithm reduces reinforcement learning complexity, approaching contextual bandits.
problem Episodic reinforcement learning's difficulty compared to contextual bandits.
method Proposes MVP algorithm with a new Bernstein-type bonus for episodic reinforcement learning.
result Achieves near-optimal regret bound of $O\left(\left(\sqrt{SAK} + S^2A
ight) \poly\log \left(SAHK
ight)
ight)$, improving state-of-the-art results.
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.
New attack tricks certifiably robust models into mislabeling images.
problem Defeating certified defenses against adversarial examples.
method Spoofed robustness certificates and large perturbations.
result Certifiably robust models can be fooled by large perturbations.
Conformal Candidate Certification advances offline MBO by certifying candidate designs with statistical guarantees.
problem Offline model-based optimization
method Conformal Candidate Certification (CCC)
result CCC certifies 16.7% of an aggressive proposal pool with 0.990 empirical coverage at nominal 0.90.
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.
Survey examines challenges of ML in avionic systems certification.
problem Challenges in current certification standards for ML in avionic systems.
method Literature review focusing on robustness and explainability of ML results.
result Current certification standards do not support ML in avionic systems.
Geometric technique determines exactness of SDP robustness certificate.
problem Certifying robustness of neural networks to adversarial examples.
method Geometric projection onto hyperbola, SDP relaxation of ReLU activation.
result SDP certificate is exact for a single hidden layer under mild assumptions.
This paper improves entropy calculation for policy gradient in high-dimensional action spaces.
problem Calculating entropy and its gradient for high-dimensional action spaces is computationally infeasible.
method Developed unbiased estimators for entropy bonus and its gradient.
result Entropy estimators substantially improve performance with minimal additional computational cost.
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 introduces Bellman-consistent pessimism to improve offline reinforcement learning without overly pessimistic bias.
problem Offline reinforcement learning's challenge of discovering good policies without exhaustive exploration.
method Introduces Bellman-consistent pessimism for function approximation, improving sample complexity and adaptability.
result Improves sample complexity by O(d) in the action space finite case, and automatically adapts to bias-variance tradeoff. 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.
New framework certifies robustness for regression models.
problem Certifying robustness for regression models is challenging.
method Derives a prediction-centered certificate that exploits local geometry.
result Gradient information yields tighter robustness certificates.
Paper analyzes strategic underreporting in competitive insurance markets.
problem Strategic underreporting by insureds in competitive insurance markets.
method Develops a dynamic insurance market model with two competing companies and a continuum of insureds, examines the interaction between strategic underreporting and competitive pricing under a Bonus-Malus System framework.
result Establishes the existence and uniqueness of the insureds' optimal reporting barrier and its dependence on BMS premiums; proves the existence of Nash equilibrium premium strategies.
This paper develops a general theoretical framework to analyze structured sparse recovery problems using the notation of dual certificate. Although certain aspects of the dual certificate idea have already been used in some previous work, due to the lack of a general and coherent theory, the analysis has so far only be…
New algorithms improve exploration in MDPs with theoretical guarantees.
problem Efficient exploration in undiscounted MDPs with continuous states.
method Exploration bonuses for SCAL and C-SCAL algorithms.
result Achieves sublinear regret with improved computational efficiency.
The paper evaluates various bonus-based exploration methods in the ALE and finds limited improvement in performance.
problem Improving exploration in reinforcement learning algorithms, especially in challenging games.
method Empirical evaluation of different reward bonuses on the Arcade Learning Environment.
result Recently developed bonus-based exploration methods do not significantly improve performance in challenging games.
New method certifies robustness to sparse adversarial attacks.
problem Ensuring robustness of classifiers to sparse adversarial attacks.
method Randomized ablation of input features to provide robustness guarantees.
result Certifies robustness to sparse adversarial attacks with up to 31 pixels of distortion.
Given a tame knot K presented in the form of a knot diagram, we show that the problem of determining whether K is knotted is in the complexity class NP, assuming the generalized Riemann hypothesis (GRH). In other words, there exists a polynomial-length certificate that can be verified in polynomial time to prove that K…
New method defends against patch attacks with high-certainty guarantees.
problem Patch attacks on images, especially physical adversarial attacks.
method Randomized smoothing, exploiting patch constraints.
result Meaningfully large robustness certificates against patch attacks.
Optimal solar energy production and trading strategies in SREC markets identified.
problem Optimizing solar energy production and trading in SREC markets.
method Formulated a stochastic control problem, accounting for generation and trading costs, and developed a numerical algorithm to solve the control problem.
result An optimal firm's generation and trading behavior can be separated into various regimes based on the marginal benefit of obtaining an additional SREC.
Study predicts dropout and certification in MOOCs using student logs and forum data.
problem Predicting attrition and certification in MOOCs.
method Survival analysis, feature selection, and model evaluation.
result Identifies relevant features for predicting dropout and certification.
Study predicts infant mortality using birth certificate data.
problem High infant mortality rate in the U.S. and racial/ethnic disparities.
method Classification models trained on birth certificate features.
result Methodology outperforms standard classification methods.