Enhancing Accuracy of Deep Learning Algorithms by Training with Low-Discrepancy Sequences

نویسندگان

چکیده

We propose a supervised deep learning algorithm based on low-discrepancy sequences as the training set. By combination of theoretical arguments and extensive numerical experiments we demonstrate that proposed significantly outperforms standard algorithms are randomly chosen data for problems in moderately high dimensions. The provides an efficient method building inexpensive surrogates many underlying maps context scientific computing.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Low Discrepancy Sequences and Learning

The Discrepancy Method is a constructive method for proving upper bounds that has received a lot of attention in recent years. In this paper we revisit a few important results, and show how it can be applied to problems in Machine Learning such as the Empirical Risk Minimization and Risk Estimation by exploiting connections with combinatorial dimension theory.

متن کامل

Discrete Low-Discrepancy Sequences

Holroyd and Propp used Hall’s marriage theorem to show that, given a probability distribution π on a finite set S, there exists an infinite sequence s1, s2, . . . in S such that for all integers k ≥ 1 and all s in S, the number of i in [1, k] with si = s differs from k π(s) by at most 1. We prove a generalization of this result using a simple explicit algorithm. A special case of this algorithm...

متن کامل

On Atanassov's methods for discrepancy bounds of low-discrepancy sequences

The aim of this survey paper is to give an updated overview of results on low discrepancy sequences obtained via Atanassov’s methods. These methods first initiated for Halton sequences have been later on extended to generalizations of these sequences and to (t, s)sequences, the other well known family of low discrepancy sequences, including polynomial arithmetic analogues of Halton sequences.

متن کامل

Adelic constructions of low discrepancy sequences

In [Fr2,Skr], Frolov and Skriganov showed that low discrepancy point sets in the multidimensional unit cube [0, 1)s can be obtained from admissible lattices in Rs. In this paper,we get a similar result for the case of (Fq((x))). Then we combine this approach with Halton’s construction of low discrepancy sequences.

متن کامل

Fast Generation of Low{discrepancy Sequences

The paper presents a fast implementation of a constructive method to generate a special class of low{discrepancy sequences which are based on Van Neumann{Kakutani transformations. Such sequences can be used in various simulation codes where it is necessary to generate a certain number of uniformly distributed random numbers on the unit intervall. From a theoretical point of view the uniformity ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Numerical Analysis

سال: 2021

ISSN: ['0036-1429', '1095-7170']

DOI: https://doi.org/10.1137/20m1344883