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

59118176235 · May 202619922001200920172026
48 results for classical surrogation

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.

Local surrogate model improves time series forecasts and provides interpretable explanations.

problem Improving time series forecasting accuracy while maintaining interpretability.
method A local surrogate model is used to correct the base model's predictions, making the corrections interpretable by re-fitting the base model to the error-predicted data.
result The method can discover and explain underlying patterns in the data, improving both accuracy and interpretability.

The paper develops a faster surrogate model for simulators using hybrid methods.

problem The need for faster validation of automotive technologies using simulators.
method Testing classical methods and building hybrid models combining them.
result A hybrid surrogate model outperforms classical methods in multivariate time series prediction.

Empirical risk minimization frequently employs convex surrogates to underlying discrete loss functions in order to achieve computational tractability during optimization. However, classical convex surrogates can only tightly bound modular loss functions, sub-modular functions or supermodular functions separately while …

2016-04-12abs ↗pdf ↗

EPGP surrogate outperforms finite elements in solving wave equations.

problem Benchmarking Gaussian Process surrogates vs. finite elements for wave equation solutions.
method EPGP uses penalized least squares and exponential-polynomial bases; CN-FEM employs Crank--Nicolson time stepping.
result EPGP achieves lower error than CN-FEM under matched degrees-of-freedom.

Unified framework for learning quantum models from limited measurements.

problem Sample complexity and measurement shots in classical learning of quantum models.
method Unified learning framework considering probabilistic quantum measurements.
result Asymmetrical effects and interplay of sample size and measurement shots on learning performance.

Unified approach for federated learning using MM optimization.

problem Scaling stochastic optimization to federated learning.
method Unified Majorize-Minimize (MM) framework for stochastic optimization, extended to federated learning.
result Unified algorithm \QSMM\ for federated learning that aggregates surrogate majorizing functions.

A new Bayesian optimization method using Poisson process for better noise robustness.

problem Estimating relative rankings of candidates in noisy environments.
method Poisson process-based ranking surrogate model and tailored acquisition functions.
result PoPBO framework shows lower computation costs and better robustness to noise compared to GP-BO.

Bayesian framework predicts aerodynamic uncertainty from sparse measurements.

problem Calibrating aerodynamic models with sparse and uncertain measurements.
method Bayesian latent Gaussian process for surrogate model calibration.
result Calibrated surrogate model accurately predicts aerodynamic uncertainty.

We present a new machine learning approach to estimate personalized treatment effects in the classical potential outcomes framework with binary outcomes. To overcome the problem that both treatment and control outcomes for the same unit are required for supervised learning, we propose surrogate loss functions that inco…

2018-03-10abs ↗pdf ↗

ASADG improves data generation for accurate surrogate modeling of complex physical problems.

problem Training surrogate models on imbalanced data leads to inaccurate predictions.
method ASADG iteratively adds input data to improve the representation of the response manifold.
result ASADG generates more representative input data compared to LHS for better model accuracy.

Local surrogate models, to approximate the local decision boundary of a black-box classifier, constitute one approach to generate explanations for the rationale behind an individual prediction made by the back-box. This paper highlights the importance of defining the right locality, the neighborhood on which a local su…

2018-06-19abs ↗pdf ↗

Annealed Entropic Allocation improves ranking and selection by mitigating hard switching and improving finite-budget discrimination.

problem Sequential budget allocation in ranking and selection
method Annealed weighted soft-min framework
result Surrogate converges uniformly to the hard minimum, soft-min weights concentrate on active challengers, and target allocation map is continuous.

New algorithm uses machine learning to predict rewards for decision-making problems.

problem Sequential decision-making under uncertainty with scarce online data.
method Machine Learning-Assisted Upper Confidence Bound (MLA-UCB) algorithm.
result Proves to improve cumulative regret even with biased surrogate rewards.

Neural networks are increasingly used in complex (data-driven) simulations as surrogates or for accelerating the computation of classical surrogates. In many applications physical constraints, such as mass or energy conservation, must be satisfied to obtain reliable results. However, standard machine learning algorithm…

2019-04-29abs ↗pdf ↗

Surrogate models improve tidal model calibration efficiency.

problem Efficiently calibrate complex tidal models for climate change scenarios.
method Proposes two surrogate-based methods to replace complex models: PODEn3DVAR and POD-PCE-3DVAR.
result Both methods show superior convergence and robustness to noise compared to classical 3DVAR.

Study examines neural network surrogate models for uncertainty in heat conduction problems.

problem Capturing the full distribution of solution fields, especially at the tails.
method Comparison of feed-forward fully connected network and Deep Operator Network architectures using data-driven and physics-informed loss functions.
result Worst-case prediction errors are significantly larger than mean field errors, highlighting the importance of extreme samples.

New statistical guarantee improves conformal predictors for small datasets.

problem Uncertainty quantification for small datasets in surrogate models.
method Proposed a new statistical guarantee for conformal predictors, converging to standard CP for large datasets.
result The new guarantee offers relevant information about coverage for small data sizes, improving applicability.

Enhanced Gaussian process models accelerate optimization and posterior approximation.

problem Improving the accuracy and speed of Gaussian process models for optimization and inference.
method Introduces a random exploration step to classical GP-UCB algorithms, facilitating faster convergence.
result New algorithms achieve nearly optimal convergence rates and provide bounds for Hellinger distance.

This work shows how to efficiently simulate parts of quantum landscapes using classical computers.

problem Identifying where quantum computers are advantageous and offloading computations.
method Developed a quantum-enhanced classical algorithm to simulate sub-regions of quantum landscapes.
result It is possible to generate a classical surrogate of a sub-region of a quantum landscape.

OptIMIS method improves SRAM yield estimation efficiency and accuracy.

problem Efficient estimation of SRAM failure probability with shrinking technology nodes.
method Generalized norm minimization method, optimal manifold concept, onion sampling, neural coupling flow.
result OptIMIS method delivers up to 3.5x efficiency and 3x accuracy over state-of-the-art methods.

A new framework selects information sources to test hypotheses robustly, even with misclassifications.

problem Robust hypothesis testing with misclassification penalties.
method Introduces a misclassification penalty framework and an efficient greedy algorithm.
result Proposes a submodular surrogate metric for better selection.

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\mathbb{R}^d, assigns the original loss val…

2019-07-17abs ↗pdf ↗

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.

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.

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.

Quantum circuits reveal pathways to dequantization in machine learning models.

problem Navigating the complex landscape of quantum machine learning models and algorithms.
method Introducing a framework connecting quantum circuit structure to function representability.
result Fundamental properties of quantum circuits determine classical simulability of models.

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.