5 citations · 5 across the 3 of their papers we have counts for
5 papers
Approximation with one-bit polynomials in Bernstein form
C. Sinan Güntürk, Weilin Li
We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order. In the extreme, we draw the coefficients from $\{…
Approximation of functions with one-bit neural networks
C. Sinan Güntürk, Weilin Li
The celebrated universal approximation theorems for neural networks roughly state that any reasonable function can be arbitrarily well-approximated by a network whose parameters ar…
Quantization for spectral super-resolution
C. Sinan Güntürk, Weilin Li
We show that the method of distributed noise-shaping beta-quantization offers superior performance for the problem of spectral super-resolution with quantization whenever there is…
Unrestricted iterations of relaxed projections in Hilbert space: Regularity, absolute convergence, and statistics of displacements
C. Sinan Güntürk, Nguyen T. Thao
Given a finite collection of closed linear subspaces of a real Hilbert space , let denote the orthogonal projection operator onto and $…
Convergence of the randomized Kaczmarz method for phase retrieval
Halyun Jeong, C. Sinan Güntürk
The classical Kaczmarz iteration and its randomized variants are popular tools for fast inversion of linear overdetermined systems. This method extends naturally to the setting of…