Approximation with one-bit polynomials in Bernstein form
From MaRDI portal
\( \pm 1\) coefficientsBernstein polynomialsinteger constraintsnoise shapingsigma-delta quantization
Approximation by polynomials (41A10) Rate of convergence, degree of approximation (41A25) Approximation with constraints (41A29) Saturation in approximation theory (41A40) General harmonic expansions, frames (42C15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Recommendations
- Uniform approximation and Bernstein polynomials with coefficients in the unit interval
- Simultaneous approximation by Bernstein polynomials with integer coefficients
- On a result of Bernstein
- A note on a result of Bernstein
- Simultaneous Approximations of Polynomials and Derivatives and Their Applications to Neural Networks
Cites work
- A greedy algorithm for quantizing neural networks
- Approximating a bandlimited function using very coarsely quantized data: a family of stable sigma-delta modulators of arbitrary order
- Approximation by superpositions of a sigmoidal function
- Bernstein operators and their properties
- Deep Network Approximation for Smooth Functions
- Error bounds for approximations with deep ReLU networks
- scientific article; zbMATH DE number 1190534 (Why is no real title available?)
- scientific article; zbMATH DE number 3687942 (Why is no real title available?)
- scientific article; zbMATH DE number 477682 (Why is no real title available?)
- scientific article; zbMATH DE number 713342 (Why is no real title available?)
- scientific article; zbMATH DE number 3003951 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 3215519 (Why is no real title available?)
- scientific article; zbMATH DE number 3234590 (Why is no real title available?)
- Linearkombinationen von iterierten Bernsteinoperatoren
- Mathematics of analog-to-digital conversion
- Neural network approximation
- Noise-shaping quantization methods for frame-based and compressive sampling systems
- One-bit sigma-delta quantization with exponential accuracy
- Optimal approximation with sparsely connected deep neural networks
- Provable approximation properties for deep neural networks
- Sigma-delta (/spl Sigma//spl Delta/) quantization and finite frames
- Stochastic Markov gradient descent and training low-bit neural networks
- The saturation class and iterates of the Bernstein polynomials
- Uniform approximation and Bernstein polynomials with coefficients in the unit interval
Cited in
(3)
This page was built for publication: Approximation with one-bit polynomials in Bernstein form
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2700876)