Hyperparameter optimization for randomized algorithms: a case study on random features

DOI10.1007/S11222-025-10587-WMaRDI QIDQ7016019zbMATH OpenFDO

Authors Oliver R. A. Dunbar, Nicholas H. Nelsen, Maya Mutic

Publication date 7 March 2025

Published in Statistics and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11222-025-10587-W

zbMATH Keywords

Bayesian inverse problemsensemble Kalman inversionGaussian process regressionhyperparameter learningrandom features

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Bayesian inference (62F15)

Cites work

• A well-conditioned estimator for large-dimensional covariance matrices
• Adaptive regularisation for ensemble Kalman inversion
• Affine invariant interacting Langevin dynamics for Bayesian inference
• Analysis of the ensemble Kalman filter for inverse problems
• Calibrate, emulate, sample
• Consistency of empirical Bayes and kernel flow for hierarchical parameter estimation
• Deterministic Nonperiodic Flow
• Do ideas have shape? Idea registration as the continuous limit of artificial neural networks
• Efficient derivative-free Bayesian inference for large-scale inverse problems
• Ensemble inference methods for models with noisy and expensive likelihoods
• Ensemble Kalman inversion: a derivative-free technique for machine learning tasks
• Ensemble Kalman methods for inverse problems
• Ensemble Kalman methods: a mean-field perspective
• Equation of state calculations by fast computing machines
• Gaussian processes for machine learning.
• scientific article; zbMATH DE number 6276119 (Why is no real title available?)
• Interacting Langevin diffusions: gradient structure and ensemble Kalman sampler
• Inverse Problems and Data Assimilation
• Inverse problems: a Bayesian perspective
• Kernel flows: from learning kernels from data into the abyss
• Learning about structural errors in models of complex dynamical systems
• On explaining the surprising success of reservoir computing forecaster of chaos? The universal machine learning dynamical system with contrast to VAR and DMD
• On Learning Vector-Valued Functions
• On the use of variance reducing multipliers in Monte Carlo computations of a global sensitivity index
• Operator-valued kernels for learning from functional response data
• Pattern recognition and machine learning.
• Quantifying and reducing model-form uncertainties in Reynolds-averaged Navier-Stokes simulations: a data-driven, physics-informed Bayesian approach
• Robust optimization and validation of echo state networks for learning chaotic dynamics
• Sensitivity measures,anova-like Techniques and the use of bootstrap
• Smaller generalization error derived for a deep residual neural network compared with shallow networks
• The mle algorithm for the matrix normal distribution
• The Random Feature Model for Input-Output Maps between Banach Spaces
• The random walk Metropolis: linking theory and practice through a case study
• Variance based sensitivity analysis of model output. Design and estimator for the total sensitivity index
• Variational Fourier features for Gaussian processes

Cited in

(1)

• On the choice of the non-trainable internal weights in random feature maps for forecasting chaotic dynamical systems

This page was built for publication: Hyperparameter optimization for randomized algorithms: a case study on random features

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7016019)