scientific article; zbMATH DE number 7415099
From MaRDI portal
Publication:5159430
Publication date: 27 October 2021
Full work available at URL: https://arxiv.org/abs/2010.15979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
Post-training Quantization for Neural Networks with Provable Guarantees ⋮ A simple approach for quantizing neural networks ⋮ Approximation with one-bit polynomials in Bernstein form
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Discrepancy of set-systems and matrices
- Approximating a bandlimited function using very coarsely quantized data: a family of stable sigma-delta modulators of arbitrary order
- Moment conditions for a sequence with negative drift to be uniformly bounded in \(L^r\)
- A Beck-Fiala-type theorem for Euclidean norms
- The capacity of feedforward neural networks
- Non-homogeneous Random Walks
- Constructive Discrepancy Minimization for Convex Sets
- Constructive Discrepancy Minimization by Walking on the Edges
- Markov Chains and Stochastic Stability
- Six Standard Deviations Suffice
- Hitting-time and occupation-time bounds implied by drift analysis with applications
- On some vector balancing problems
- Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem
- High-Dimensional Probability
- Efficient algorithms for discrepancy minimization in convex sets
- Binary Component Decomposition Part I: The Positive-Semidefinite Case
- The Gram-Schmidt walk: a cure for the Banaszczyk blues
- Approximation by superpositions of a sigmoidal function
This page was built for publication:
