Approximation with one-bit polynomials in Bernstein form

DOI10.1007/s00365-022-09608-yOpenAlexW4312106604MaRDI QIDQ2700876

Weilin Li, C. Sinan Güntürk

Publication date: 27 April 2023

Published in: Constructive Approximation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2112.09183

zbMATH Keywords

Bernstein polynomialsinteger constraintsnoise shapingsigma-delta quantization\( \pm 1\) coefficients

Mathematics Subject Classification ID

General harmonic expansions, frames (42C15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Approximation with constraints (41A29) Approximation by polynomials (41A10) Rate of convergence, degree of approximation (41A25) Saturation in approximation theory (41A40)

Related Items (1)

A simple approach for quantizing neural networks

Uses Software

• Delta Sigma

Cites Work

• Uniform approximation and Bernstein polynomials with coefficients in the unit interval
• Linearkombinationen von iterierten Bernsteinoperatoren
• Approximating a bandlimited function using very coarsely quantized data: a family of stable sigma-delta modulators of arbitrary order
• Provable approximation properties for deep neural networks
• Stochastic Markov gradient descent and training low-bit neural networks
• Error bounds for approximations with deep ReLU networks
• The saturation class and iterates of the Bernstein polynomials
• Noise-Shaping Quantization Methods for Frame-Based and Compressive Sampling Systems
• Bernstein Operators and Their Properties
• Sigma-delta (/spl Sigma//spl Delta/) quantization and finite frames
• One-bit sigma-delta quantization with exponential accuracy
• Mathematics of Analog‐to‐Digital Conversion
• Optimal Approximation with Sparsely Connected Deep Neural Networks
• Deep Network Approximation for Smooth Functions
• Neural network approximation
• Approximation by superpositions of a sigmoidal function
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximation with one-bit polynomials in Bernstein form