Robust 1-Bit Compressed Sensing via Hinge Loss Minimization. - Martin Genzel; Alexander Stollenwerk (CoRR, 2018)

Fast Binary Embeddings with Gaussian Circulant Matrices: Improved Bounds. - Sjoerd Dirksen; Alexander Stollenwerk (Discret. Comput. Geom., 2018)

One-bit compressed sensing and fast binary embeddings. - Alexander Stollenwerk (2019)

Binarized Johnson-Lindenstrauss embeddings. - Sjoerd Dirksen; Alexander Stollenwerk (CoRR, 2020)

A Unified Approach to Uniform Signal Recovery From Non-Linear Observations. - Martin Genzel; Alexander Stollenwerk (CoRR, 2020)

Quantized Compressed Sensing by Rectified Linear Units. - Hans Christian Jung; Johannes Maly; Lars Palzer; Alexander Stollenwerk (IEEE Trans. Inf. Theory, 2021)

The Separation Capacity of Random Neural Networks. - Sjoerd Dirksen; Martin Genzel; Laurent Jacques; Alexander Stollenwerk (J. Mach. Learn. Res., 2022)

Sharp Estimates on Random Hyperplane Tessellations. - Sjoerd Dirksen; Shahar Mendelson; Alexander Stollenwerk (SIAM J. Math. Data Sci., 2022)

A Unified Approach to Uniform Signal Recovery From Nonlinear Observations. - Martin Genzel; Alexander Stollenwerk (Found. Comput. Math., 2023)

Flattened one-bit stochastic gradient descent: compressed distributed optimization with controlled variance. - Alexander Stollenwerk; Laurent Jacques (CoRR, 2024)

Fast Metric Embedding into the Hamming Cube. - Sjoerd Dirksen; Shahar Mendelson; Alexander Stollenwerk (SIAM J. Comput., 2024)