Search Results for author:
Found 6 papers, 1 papers with code
Redistributor: Transforming Empirical Data Distributions
We present an algorithm and package, Redistributor, which forces a collection of scalar samples to follow a desired distribution.
How degenerate is the parametrization of neural networks with the ReLU activation function?
Approximation capabilities of neural networks can be used to deal with the latter non-convexity, which allows us to establish that for sufficiently large networks local minima of a regularized optimization problem on the realization space are almost optimal.
Towards a regularity theory for ReLU networks -- chain rule and global error estimates
Although for neural networks with locally Lipschitz continuous activation functions the classical derivative exists almost everywhere, the standard chain rule is in general not applicable.
The Oracle of DLphi
We present a novel technique based on deep learning and set theory which yields exceptional classification and prediction results.
Deep Neural Network Approximation Theory
This paper develops fundamental limits of deep neural network learning by characterizing what is possible if no constraints are imposed on the learning algorithm and on the amount of training data.
The universal approximation power of finite-width deep ReLU networks
We show that finite-width deep ReLU neural networks yield rate-distortion optimal approximation (B\"olcskei et al., 2018) of polynomials, windowed sinusoidal functions, one-dimensional oscillatory textures, and the Weierstrass function, a fractal function which is continuous but nowhere differentiable.
