Unbiased Matrix Rounding

From MaRDI portal



Abstract: We show several ways to round a real matrix to an integer one such that the rounding errors in all rows and columns as well as the whole matrix are less than one. This is a classical problem with applications in many fields, in particular, statistics. We improve earlier solutions of different authors in two ways. For rounding matrices of size mimesn, we reduce the runtime from O((mn)2Second,ourroundingsalsohavearoundingerroroflessthanoneinallinitialintervalsofrowsandcolumns.Consequently,arbitraryintervalshaveanerrorofatmosttwo.Thisisparticularlyusefulinthestatisticsapplicationofcontrolledrounding.Thesameresultcanbeobtainedvia(dependent)randomizedrounding.Thishastheadditionaladvantagethattheroundingisunbiased,thatis,forallentriesy_{ij}ofourrounding,wehaveE(y_{ij}) = x_{ij},wherex_{ij}$ is the corresponding entry of the input matrix.











This page was built for publication: Unbiased Matrix Rounding

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