Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/27555
Title: A Robust Normalizing Flow using Bernstein-type Polynomials
Authors: Ramasinghe, S
Fernando, K
Khan, S
Barnes, N
Issue Date: 21-Nov-2022
Publisher: BMVC
Citation: Ramasinghe, S. et al. (2022) 'A Robust Normalizing Flow using Bernstein-type Polynomials', BMVC 2022 - 33rd British Machine Vision Conference Proceedings, London, UK, 21-24 November, pp. 1 - 19. Available at: https://bmvc2022.mpi-inf.mpg.de/532/
Abstract: Modeling real-world distributions can often be challenging due to sample data that are subjected to perturbations, e.g., instrumentation errors, or added random noise. Since flow models are typically nonlinear algorithms, they amplify these initial errors, leading to poor generalizations. This paper proposes a framework to construct Normalizing Flows (NFs) which demonstrate higher robustness against such initial errors. To this end, we utilize Bernstein-type polynomials inspired by the optimal stability of the Bernstein basis. Further, compared to the existing NF frameworks, our method provides compelling advantages like theoretical upper bounds for the approximation error, better suitability for compactly supported densities, and the ability to employ higher degree polynomials without training instability. We conduct a theoretical analysis and empirically demonstrate the efficacy of the proposed technique using experiments on both real-world and synthetic datasets.
Description: The conference website provides online access to the PDF file of the conference paper, a poster, a video of the conference presentation and supplementary material at: https://bmvc2022.mpi-inf.mpg.de/532/ .
URI: https://bura.brunel.ac.uk/handle/2438/27555
DOI: https://doi.org/10.48550/arXiv.2102.03509
Other Identifiers: arXiv:2102.03509v4 [cs.LG]
ORCID iD: Kasun Fernando https://orcid.org/0000-0003-1489-9566
Appears in Collections:Dept of Mathematics Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdfCopyright © 2022. The copyright of this document resides with its authors. It may be distributed unchanged freely in print or electronic forms.1.52 MBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.