Scalable bounding of predictive uncertainty in regression problems with SLAC

DOI10.1007/978-3-030-00461-3_27MaRDI QIDQ6109630zbMATH OpenFDO

Authors Arno Blaas, Adam D. Cobb, Jan-P. Calliess, Stephen J. Roberts

Publication date 28 July 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://ora.ox.ac.uk/objects/uuid:1d451f01-740c-486b-ad26-9800e633cf5b

zbMATH Keywords

Lipschitz interpolationpredictive uncertainty boundsregression

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• Bayesian frequentist bounds for machine learning and system identification
• Approximation Bounds for Some Sparse Kernel Regression Algorithms
• Distribution-free, Risk-controlling Prediction Sets
• Distribution-free uncertainty quantification for kernel methods by gradient perturbations
• Quantifying uncertainty in online regression forests

Cited in

(1)

• Information aware max-norm Dirichlet networks for predictive uncertainty estimation

This page was built for publication: Scalable bounding of predictive uncertainty in regression problems with SLAC

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