Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-17T04:37:33.712Z Has data issue: false hasContentIssue false

A multi-level procedure for enhancing accuracy of machine learning algorithms

Published online by Cambridge University Press:  14 July 2020

KJETIL O. LYE
Affiliation:
SINTEF Digital, Oslo, Norway, email: kjetil.olsen.lye@sintef.no
SIDDHARTHA MISHRA
Affiliation:
Seminar for Applied Mathematics (SAM), D-Math, ETH Zürich, Rämistrasse 101, Zürich-8092, Switzerland, emails: smishra@sam.math.ethz.ch; roberto.molinaro@sam.math.ethz.ch
ROBERTO MOLINARO
Affiliation:
Seminar for Applied Mathematics (SAM), D-Math, ETH Zürich, Rämistrasse 101, Zürich-8092, Switzerland, emails: smishra@sam.math.ethz.ch; roberto.molinaro@sam.math.ethz.ch
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We propose a multi-level method to increase the accuracy of machine learning algorithms for approximating observables in scientific computing, particularly those that arise in systems modelled by differential equations. The algorithm relies on judiciously combining a large number of computationally cheap training data on coarse resolutions with a few expensive training samples on fine grid resolutions. Theoretical arguments for lowering the generalisation error, based on reducing the variance of the underlying maps, are provided and numerical evidence, indicating significant gains over underlying single-level machine learning algorithms, are presented. Moreover, we also apply the multi-level algorithm in the context of forward uncertainty quantification and observe a considerable speedup over competing algorithms.

Information

Type
Papers
Copyright
© The Author(s), 2020. Published by Cambridge University Press