Paper develops a robust HVA measure for dynamic hedging under liquidity stress.
problem Valuation of dynamic hedging under liquidity stress.
method Defines robust HVA as worst-case expected loss over a relative-entropy neighborhood of loss distributions for no-trade bands.
result Wider no-trade bands lower rebalancing costs but increase hedge-error risk.
Robust HVA adjusts deep hedging policies for market frictions and transaction costs.
problem Ensuring deep hedging policies are financially feasible under market frictions and transaction costs.
method Applying a robust hedging valuation adjustment (HVA) post-training to evaluate and adjust policies for funding and margin add-ons.
result A single HVA computation provides a consistent reserve for funding and margin, improving financial feasibility of deep hedging policies.
Develops a robust hedging valuation adjustment measure for dynamic hedging under liquidity-demand stress.
problem Dynamic hedging under liquidity-demand stress
method Define robust HVA as the worst-case expected loss over a relative-entropy neighborhood of the loss distribution generated by simulated rebalancing and maturity-unwind trades.
result Distinguishes fixed-radius convention from fixed benchmark-stress convention and shows wider no-trade bands lower rebalancing costs but raise hedge-error risk.
Paper revisits HVA to address model risk in banking.
problem Model risk and dynamic hedging frictions in banking.
method Reconciles global fair valuation with local bank models.
result Local models should be excluded rather than managed via reserves.
This paper addresses recalibration issues in hedging callable assets, proposing a new risk-adjusted approach.
problem The mismatch between dynamic hedging theory and practice due to daily recalibration.
method Extends HVA model risk approach to callable assets, focusing on recalibration and model risks.
result Model risk reserves adjusted for exercise decisions may significantly exceed basic valuation differences.
Boosts barely robust learners to be more adversarially robust.
problem Learning predictors robust to small perturbations on a small fraction of data.
method Oracle-efficient algorithm for robustness with larger perturbation set.
result Qualitative and quantitative equivalence between strongly robust and barely robust learning.
Study shows adversarial robustness and common perturbation robustness are independent.
problem Understanding the relationship between adversarial robustness and common perturbation robustness in neural networks.
method Conducted experiments to benchmark neural network robustness to common perturbations and adversarial examples.
result Adversarial robustness and common perturbation robustness are independent attributes.
This work proposes robustness curves to analyze model robustness.
problem Uncertainty in automated systems predictions due to adversarial examples.
method Introduces robustness curves to separate robustness analysis from threshold and norm choice.
result Robustness curves can qualitatively depend on the chosen norm.
AAT separates robust and non-robust features without supervision.
problem Adversarial vulnerability and accuracy reduction in machine learning models.
method Adversarial Asymmetric Training (AAT) algorithm.
result Preserves accuracy and achieves better disentanglement than previous methods.
New research shows flat minima in robust loss landscapes correlate with good adversarial robustness.
problem Adversarial training leads to robust overfitting, poor robust generalization.
method Average- and worst-case metrics to measure flatness in robust loss landscapes.
result Flatness in robust loss landscapes correlates with good adversarial robustness.
This paper improves robustness in small neural networks through distillation.
problem Vulnerability of small neural networks to adversarial attacks.
method Adversarially Robust Distillation (ARD) to transfer robustness from teacher to student networks.
result ARD produces small models with superior robust accuracy compared to adversarially trained networks.
Voting ensemble of robust models improves robustness.
problem Improving robustness of defensive models against adversarial attacks.
method Hard-label voting ensemble of pretrained robust models.
result Voting ensemble can boost robust error over individual models.
Study privacy and robustness in learning halfspaces, proving hard trade-offs.
problem Balancing privacy and robustness in learning halfspaces.
method Proves nearly tight bounds on sample complexity for robust private learning of halfspaces.
result Robust and private learning is harder than robust or private learning alone.
We introduce a new metric to evaluate corruption robustness of ML classifiers.
problem Evaluating corruption robustness of machine learning classifiers.
method We propose a test data augmentation method using minimal class separation distance to derive a robustness distance ε and a metric MSCR.
result The MSCR metric allows interpretable comparison of classifier robustness on different datasets.
Robust learning method combines kernel smoothing and robust optimization.
problem Certifying robustness against distribution shifts in machine learning models.
method Adapting integral operator using supremal convolution for robustness, leveraging optimal transport.
result The method provides theoretical guarantees for certified robustness and competitive performance.
Study shows how bias in optimization affects robustness in adversarial settings.
problem Understanding and mitigating implicit bias in adversarially robust models.
method Analyzes the implicit bias in robust empirical risk minimization and its impact on generalization.
result Implicit bias in optimization can significantly affect robust generalization.
ClusTR improves clustering-based models' robustness without adversarial training.
problem Improving clustering-based models' robustness.
method Proposes ClusTR, a clustering-based training framework for robust models without adversarial training.
result ClusTR outperforms adversarially-trained models by up to 4% under strong PGD attacks.
Adversarially robust transfer learning improves model robustness with minimal data.
problem Data scarcity and computational limitations in adversarially robust transfer learning.
method Train classifiers on top of robust feature extractors from source models, or fine-tune end-to-end in target domain using lifelong learning strategies.
result Accurate and robust models can be produced with little data and without adversarial training.
SCORE resolves the robustness vs accuracy trade-off by redefining robust error.
problem The inherent trade-off between robustness and accuracy in adversarial training.
method SCORE defines local equivariance as the ideal robust behavior, leading to a new robust error metric.
result SCORE reconciles robustness and accuracy, improving model performance on RobustBench.
Develops robust learning framework under distributional perturbations.
problem Learning robust to data distributional changes.
method Distributionally Robust Optimization (DRO) under Wasserstein metric.
result Establishes performance guarantees and tractable formulations.
The study examines robust decision-making in volatile financial markets, finding action robustness is more impactful than uncertainty tolerance.
problem Sequential decision making in high-frequency markets under evolving uncertainty.
method Analyzes two dimensions of robustness: uncertainty tolerance and action robustness, using simulations and empirical evidence.
result Action robustness has a larger impact on profitability than uncertainty tolerance, and excessive robustness can reduce profitability in illiquid markets.
Making neural networks robust against adversarial inputs has resulted in an arms race between new defenses and attacks. The most promising defenses, adversarially robust training and verifiably robust training, have limitations that restrict their practical applications. The adversarially robust training only makes the…
Proposes a new method for nonlinear models with robustness guarantees.
problem Distributional robustness in nonlinear models with causality.
method Representation learning and identifiable representation learning.
result First causality-inspired robustness method with finite-radius guarantees in nonlinear settings.
This work introduces new ways to compare adversarial robustness of classifiers globally.
problem The limitations of point-wise measures in comparing adversarial robustness.
method Robustness curves and scale analysis to uncover global properties of robustness.
result Point-wise measures fail to capture important global properties of adversarial robustness.
Batch normalization shifts models to rely more on non-robust features.
problem Understanding the impact of batch normalization on deep neural networks.
method Empirical analysis and a framework for disentangling robustness and usefulness.
result Batch normalization increases reliance on non-robust features, decreasing adversarial robustness.
Paper develops a robust Bayesian optimization method for noisy zeroth-order settings.
problem Achieving robustness to distributional shift in machine learning.
method Distributionally robust Bayesian optimization (DRBO) algorithm for noisy zeroth-order optimization.
result DRBO algorithm provably obtains sub-linear robust regret in various settings.
Framework for robust RL in continuous control with model misspecification.
problem Model misspecification in reinforcement learning for continuous control.
method Integrates robustness into MPO algorithm through worst-case expected return objective and entropy regularization.
result Robust and soft-robust policies outperform non-robust policies in various domains.
Paper proposes robust generative models using VAEs.
problem Lack of robustness in generative models.
method Formally defined robust lower bound, optimized during training.
result Generative models become more robust to adversarial attacks.
Paper proposes a robust metric learning algorithm.
problem Robustness of metric learning against adversarial perturbations is insufficient.
method Proposes a novel Mahalanobis distance metric learning algorithm.
result Certifiable robustness improvement over Euclidean distance.
HYDRA prunes robust neural networks to improve both benign and adversarial robustness.
problem Lack of robustness against adversarial attacks and large neural network size in deep learning.
method HYDRA integrates pruning techniques with adversarial training and verifiable robust training objectives.
result HYDRA achieves compressed networks with state-of-the-art benign and robust accuracy.
Study improves image classifier robustness to random p-norm corruptions.
problem Improving robustness of image classifiers to real-world imperceptible corruptions.
method Training and testing with random p-norm corruptions, evaluating robustness against different p-norms.
result Training with a combination of p-norm corruptions significantly improves robustness.
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.
VeriGB verifies robustness of gradient boosted models.
problem Proving robustness of gradient boosted models.
method VeriGB encodes model and robustness as SMT formula for verification.
result VeriGB proves robustness of large gradient boosted models.
The paper assesses machine learning robustness with covariate perturbations.
problem Ensuring robustness of machine learning models against adversarial attacks and data changes.
method Proposes a framework using covariate perturbation techniques to assess model robustness.
result Demonstrates the effectiveness of the approach in comparing robustness across models and identifying instabilities.
Study enhances robustness of In-CVaR based regression models under perturbation and contamination.
problem Enhancing robustness of nonlinear regression models under perturbation and contamination.
method Introduces interval conditional value-at-risk (In-CVaR) and rigorously analyzes its robustness properties under both perturbation and contamination.
result The In-CVaR based estimator is qualitatively robust in terms of the Prokhorov metric if and only if the largest portion of losses is trimmed.
New mechanisms from primate vision improve neural network robustness.
problem Demonstrating robust neural networks to small adversarial perturbations.
method Investigated two biologically plausible mechanisms: non-uniform retina sampling and receptive field diversity.
result Non-uniform retina sampling and receptive field diversity improve adversarial robustness.
Proposes robust model through Wasserstein geodesic interpolation of training data.
problem Improving model robustness through data augmentation.
method Augment data by finding worst-case Wasserstein barycenter on geodesic path.
result Improves robustness on CIFAR-10 up to 7.7% and on CIFAR-100 up to 16.8%.
Proposes RFQI for robust RL using offline data.
problem Learning robust policies in the presence of model uncertainty.
method RFQI algorithm using offline data to learn optimal robust policy.
result RFQI learns near-optimal robust policy under standard assumptions.
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.
Unified framework for robust submodular optimization with various constraints.
problem Robust optimization in machine learning applications.
method Unified framework for minimization and maximization under combinatorial constraints.
result Scalable approximation algorithms for various submodular optimization problems.
SEMs fail to provide robust explanations to adversarial inputs.
problem Lack of robustness in interpretability of self-explaining models.
method Evaluation of current SEMs and creation of adversarial inputs.
result Adversarial inputs can cause significant changes in explanations without affecting model outputs.
A robust aggregation method improves federated learning's accuracy in corrupted settings.
problem Making federated learning robust to corrupted updates from devices.
method Robust aggregation oracle based on geometric median for constant iterations of non-robust averaging.
result The robust aggregation oracle outperforms classical methods in high corruption levels.
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.
Paper reviews robustness in machine learning models and discusses training and certification methods.
problem Ensuring reliability of machine learning models in safety-critical systems.
method Reviews formalisms and discusses training and certification techniques.
result Identifies future research directions in robust machine learning.
This work enhances deep neural networks with robust features to improve their robustness against adversarial attacks.
problem Vulnerability of deep neural networks to adversarial images.
method Augmenting classification pipelines with robust features like binarization and group extraction.
result Improved robustness and training speed on adversarial inputs, with significant improvements over state-of-the-art methods.
RATIO improves neural network robustness and explainability.
problem Neural networks' lack of robustness to adversarial changes and uncertainty on out-distribution samples.
method RATIO: Adversarial Training on In- and Out-distribution.
result RATIO leads to robust models with reliable confidence estimates on out-distribution samples.
Proposes a framework for defining robustness in neural networks.
problem Lack of a precise foundation for robustness concepts in neural networks.
method Develops a rigorous and flexible framework based on mathematical postulates.
result Proposes new learning approaches for optimizing robustness objectives.
Paper explores robust regression methods and their bias-variance trade-off.
problem Understanding the trade-off between robust estimation and optimization methods.
method Examines traditional outlier-resistant robust estimation and robust optimization.
result Both methods follow converse strategies due to a bias-variance trade-off.