New bounds show polyhedral surrogates are optimal for generalization.
problem Proving generalization rates for polyhedral loss functions.
method Developed two general results for polyhedral surrogates.
result Polyhedral surrogates provide linear surrogate regret bounds, translating directly to target rates.
We present a framework for automatically structuring and training fast, approximate, deep neural surrogates of stochastic simulators. Unlike traditional approaches to surrogate modeling, our surrogates retain the interpretable structure and control flow of the reference simulator. Our surrogates target stochastic simul…
Randomizing the Fourier-transform (FT) phases of temporal-spatial data generates surrogates that approximate examples from the data-generating distribution. We propose such FT surrogates as a novel tool to augment and analyze training of neural networks and explore the approach in the example of sleep-stage classificat…
We formalize and study the natural approach of designing convex surrogate loss functions via embeddings, for problems such as classification, ranking, or structured prediction. In this approach, one embeds each of the finitely many predictions (e.g.\ rankings) as a point in Rd, assigns the original loss val…
The paper proposes a scalable framework for uncertainty quantification and propagation in surrogate-based Bayesian inference.
problem Uncertainty in surrogate models and its impact on inference and decision-making.
method Bayesian inference methods for surrogate models with measurement data.
result Scalable framework for uncertainty quantification and propagation in surrogate models.
Paper proposes hybrid modeling to improve surrogate accuracy using multiple data sources.
problem Improving surrogate model accuracy by integrating simulation and real-world data.
method Two novel probabilistic approaches: separate and combined surrogates with weighting strategy.
result Hybrid models improve predictive accuracy and coverage compared to single-source surrogates.
Improving predictive understanding of Earth system variability and change requires data-model integration. Efficient data-model integration for complex models requires surrogate modeling to reduce model evaluation time. However, building a surrogate of a large-scale Earth system model (ESM) with many output variables i…
The paper proposes a method to assess surrogate heterogeneity in non-randomized data.
problem Lack of methods to evaluate surrogate heterogeneity in non-randomized data.
method Proposes a framework using meta-learners to assess surrogate heterogeneity in real-world data.
result Identifies individuals for whom the surrogate is a valid replacement of the primary outcome.
Thanks to their versatility, ease of deployment and high-performance, surrogate models have become staple tools in the arsenal of uncertainty quantification (UQ). From local interpolants to global spectral decompositions, surrogates are characterised by their ability to efficiently emulate complex computational models …
This paper develops efficient surrogate models for optimization of complex dynamical systems.
problem Computational expense in solving complex dynamical systems through numerical simulation.
method Combination of proper orthogonal decomposition and radial basis functions for constructing low-dimensional surrogate models.
result Surrogate models reduce computational time for optimization problems while maintaining accuracy.
We present surrogate regret bounds for arbitrary surrogate losses in the context of binary classification with label-dependent costs. Such bounds relate a classifier's risk, assessed with respect to a surrogate loss, to its cost-sensitive classification risk. Two approaches to surrogate regret bounds are developed. The…
This work improves surrogate models for balancing accuracy and cost in multi-fidelity methods.
problem Balancing accuracy and computational cost in multi-fidelity methods.
method Develops context-aware surrogate models for multi-fidelity importance sampling and Bayesian inverse problems.
result Context-aware surrogate models can lead to runtime speedups of up to one order of magnitude.
Adversarial consistency depends on the uniqueness of adversarial Bayes classifiers.
problem Consistency of adversarial surrogate losses is not guaranteed.
method Connected consistency of adversarial surrogate losses to the uniqueness of adversarial Bayes classifiers.
result A convex surrogate loss is statistically consistent for adversarial learning if and only if the adversarial Bayes classifier is unique.
New method simplifies checking consistency of differentiable loss functions.
problem Verifying consistency of differentiable loss functions is difficult.
method Developed a new approach called strong indirect elicitation (strong IE) to simplify checking consistency.
result Strong IE is equivalent to calibration for strongly convex, differentiable surrogates.
Paper bounds convergence rate of adversarial surrogate risk.
problem Vulnerability of binary classification models to adversarial attacks.
method Characterizes conditions for adversarial consistency and provides surrogate risk bounds.
result Surrogate risk bounds quantify the rate of convergence of adversarial classification risk.
Paper introduces new loss functions for multi-class abstention learning.
problem Learning with multi-class classification and the ability to abstain.
method Developed new families of surrogate losses for abstention.
result Proved strong consistency guarantees for new surrogate losses.
Proposes a method to refine PDE-driven high-dimensional rare-event simulation.
problem Challenges in constructing accurate surrogates for rare-event simulation.
method Adaptive importance sampling framework that refines a locally constructed surrogate.
result Achieves accuracy comparable to true-model adaptive importance sampling with fewer high-fidelity evaluations.
We establish linear regret bounds for convex smooth losses using Fenchel-Young losses.
problem Establishing linear regret bounds for convex smooth losses.
method Constructing a convex smooth surrogate loss using Fenchel-Young losses generated by the convolutional negentropy.
result We derive a smooth loss with a linear surrogate regret bound.
We study the rates of convergence from empirical surrogate risk minimizers to the Bayes optimal classifier. Specifically, we introduce the notion of \emph{consistency intensity} to characterize a surrogate loss function and exploit this notion to obtain the rate of convergence from an empirical surrogate risk minimizer…
A new framework improves reinforcement learning algorithms with policy guarantees.
problem Designing efficient and stable reinforcement learning algorithms.
method A general framework (FMA-PG) based on functional mirror ascent that constructs surrogate functions enabling policy improvement guarantees.
result The proposed framework enables policy improvement guarantees that hold regardless of policy parameterization, and recovers important heuristics.
In this dissertation, we focus on several important problems in structured prediction. In structured prediction, the label has a rich intrinsic substructure, and the loss varies with respect to the predicted label and the true label pair. Structured SVM is an extension of binary SVM to adapt to such structured tasks. I…
Develops methods to create consistent surrogate models for agent-based simulators.
problem High computational costs and misjudgment of interventions in agent-based models.
method Causal abstractions to learn interventionally consistent surrogate models.
result Surrogates trained for interventional consistency closely mimic the agent-based model's behavior under interventions.
ASEs use surrogate estimation to efficiently evaluate model performance with minimal labels.
problem Efficient model evaluation with limited labels.
method Surrogate-based estimation and active learning.
result ASEs offer greater label-efficiency than current methods for deep neural networks.
In this work we provide a theoretical framework for structured prediction that generalizes the existing theory of surrogate methods for binary and multiclass classification based on estimating conditional probabilities with smooth convex surrogates (e.g. logistic regression). The theory relies on a natural characteriza…
New method integrates real and synthetic data to improve machine learning models.
problem Expensive or impractical collection of high-quality data limits machine learning.
method Weighted empirical risk minimization approach for integrating surrogate data.
result Integrating surrogate data can significantly reduce test error on the original distribution.
We study consistency properties of machine learning methods based on minimizing convex surrogates. We extend the recent framework of Osokin et al. (2017) for the quantitative analysis of consistency properties to the case of inconsistent surrogates. Our key technical contribution consists in a new lower bound on the ca…
This paper develops nudging algorithms using learned surrogates for state estimation in dynamical systems.
problem Estimating the state of a dynamical system from partial observations when dynamics are unknown or expensive to simulate.
method Unified finite-dimensional analysis of nudging algorithms employing learned surrogate models of the dynamics.
result Nudging algorithms with surrogate models retain exponential convergence up to an explicit error floor.
New method uses sparse random features for crashworthiness analysis.
problem Efficient surrogate modelling for uncertainty quantification.
method Sparse Random Features combined with self-supervised dimensionality reduction.
result Superiority over state-of-the-art techniques in crashworthiness analysis.
Optimal sampling strategy improves prediction accuracy with surrogate variables under measurement constraints.
problem Measurement-constrained datasets and lack of labeled data.
method A-optimality criterion for optimal sampling, leveraging surrogate variables.
result Achieves lower asymptotic variance and reduced empirical mean squared error.
We study the interplay between surrogate methods for structured prediction and techniques from multitask learning designed to leverage relationships between surrogate outputs. We propose an efficient algorithm based on trace norm regularization which, differently from previous methods, does not require explicit knowled…
Bayesian method refines surrogate models for accurate full waveform inversion.
problem Complex input/output relations in full waveform inversion make accurate surrogate models difficult.
method Iterative refinement of surrogate models using MCMC samples and progressively expanding frequency bandwidth.
result Highly accurate surrogate model across full bandwidth enables accurate final MCMC inversion.
UA-SABI uses surrogates to speed up Bayesian inference for expensive models.
problem Inference for computationally expensive models is slow and uncertain.
method Combines surrogate modeling with Amortized Bayesian Inference (ABI) to propagate uncertainties.
result Reliable, fast, and repeated Bayesian inference for expensive models is achieved.
Bayesian surrogate models reduce uncertainty in high-dimensional design optimisation problems.
problem Uncertainty in high-dimensional inputs for complex computational models.
method Variational Bayesian inference for constructing statistical surrogates with Gaussian process priors and KL divergence for approximation.
result The RDVGP surrogate provides accurate and versatile approximations for robust structural optimisation.
Generalizes NTK for surrogate gradient learning in neural networks.
problem Lack of theoretical foundation for surrogate gradient learning.
method Generalizes neural tangent kernel (NTK) for surrogate gradient learning (SGL).
result Surrogate gradient NTK provides a good characterization of SGL.
Study on calibration and consistency of adversarial surrogate losses.
problem Designing robust classifiers with theoretical guarantees.
method Extensive analysis of H-calibration and H-consistency of adversarial surrogate losses.
result Some convex loss functions and supremum-based convex losses are not H-calibrated for important hypothesis sets.
Study on learning to defer with multiple experts using new surrogate losses.
problem Learning to defer with multiple experts in a machine learning context.
method Introducing a new family of surrogate losses for the multiple-expert setting, proving H-consistency bounds, and designing learning algorithms. result Explicit guarantees for new learning to defer algorithms based on minimization of these surrogate losses.
GUESS improves surrogate model accuracy with adaptive sampling.
problem Creating accurate surrogate models with limited data.
method Gradient and Uncertainty Enhanced Sequential Sampling (GUESS) using predictive uncertainty and Taylor expansion.
result GUESS achieved highest sample efficiency compared to other strategies.
Interpretable surrogates of black-box predictors trained on high-dimensional tabular datasets can struggle to generate comprehensible explanations in the presence of correlated variables. We propose a model-agnostic interpretable surrogate that provides global and local explanations of black-box classifiers to address …
Surrogate explainers of black-box machine learning predictions are of paramount importance in the field of eXplainable Artificial Intelligence since they can be applied to any type of data (images, text and tabular), are model-agnostic and are post-hoc (i.e., can be retrofitted). The Local Interpretable Model-agnostic …
TgAE constructs surrogates for inverse modeling with theory-guided training.
problem Creating accurate surrogates for inverse modeling with limited data.
method Theory-guided Auto-Encoder (TgAE) framework based on CNN architecture.
result TgAE surrogate achieves satisfactory accuracy and efficiency in uncertainty quantification and parameter inversion.
Surrogate models speed up RL training in dynamic systems.
problem High computational cost of high-fidelity simulations.
method Developed and tested surrogate models for RL training.
result Surrogate models can significantly accelerate RL training.
Enhances PCE surrogates using transfer learning for expensive simulations.
problem Over-sampling in PCE for expensive forward models.
method Transfer learning from similar tasks to a new task with limited training data.
result Improves scalability and accuracy of PCE surrogates.
A new method SLIDE ensures fairness in AI models.
problem Ensuring fairness in AI models while maintaining computational feasibility.
method Proposes a new surrogate fairness constraint SLIDE.
result SLIDE ensures fairness in AI models asymptotically and converges fast.
The paper uses model-based trees to create interpretable surrogate models for complex machine learning models.
problem Interpreting complex machine learning models.
method Using model-based trees to partition feature space and create interpretable models.
result Model-based trees generate optimal surrogate models that balance interpretability and performance.
Study uses surrogate data to improve treatment effect estimation with scarce outcome data.
problem Limited outcome data hinders estimating treatment effects.
method Uses abundant surrogate data to estimate treatment effects without stringent assumptions.
result Improves precision of treatment effect estimation.
Meta-materials simulation sped up with energy surrogates.
problem Challenging simulation of complex meta-materials due to high-fidelity PDEs.
method Learned component-level surrogates using neural networks to model stored potential energy.
result Surrogates enable accurate macroscopic behavior simulation without full structure simulation.
This paper investigates the control of an ML component within the Covariance Matrix Adaptation Evolution Strategy (CMA-ES) devoted to black-box optimization. The known CMA-ES weakness is its sample complexity, the number of evaluations of the objective function needed to approximate the global optimum. This weakness is…
The paper explores trading off consistency and dimensionality in convex surrogates for multiclass classification.
problem Designing consistent surrogate losses for multiclass classification with high-dimensional outcomes.
method Investigates embedding outcomes into convex polytopes and examining consistency under low-noise assumptions.
result Consistency can be achieved with less than n−1 dimensions, but hallucination occurs for some distributions.