S Bian, Z Song, J Yin - arXiv preprint arXiv:2305.17482, 2023 - arxiv.org
Many convex optimization problems with important applications in machine learning are formulated as empirical risk minimization (ERM). There are several examples: linear and …
Suppose an length signal has known frequency support of size. Given access to samples of this signal, how fast can we compute the DFT? The answer to this question depends on the …
We consider the problem of building numerically stable algorithms for computing Discrete Fourier Transform (DFT) of $ N $-length signals with known frequency support of size $ k …