Applied and Computational Harmonic Analysis

Papers
(The TQCC of Applied and Computational Harmonic Analysis is 6. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2021-12-01 to 2025-12-01.)
ArticleCitations
On the limits of neural network explainability via descrambling79
On the numerical evaluation of the prolate spheroidal wave functions of order zero45
Convergence of sparse grid Gaussian convolution approximation for multi-dimensional periodic functions41
Spatiotemporal analysis using Riemannian composition of diffusion operators38
Introduction to the Special Issue on Harmonic Analysis and Machine Learning37
A diffusion + wavelet-window method for recovery of super-resolution point-masses with application to single-molecule microscopy and beyond36
Kadec-type theorems for sampled group orbits34
Scale dependencies and self-similar models with wavelet scattering spectra33
Duality for neural networks through Reproducing Kernel Banach Spaces32
Editorial Board30
Beurling dimension of spectra for a class of random convolutions on R<29
Unlimited sampling beyond modulo23
Error estimate of the u-series method for molecular dynamics simulations21
Estimates on learning rates for multi-penalty distribution regression21
Biorthogonal Greedy Algorithms in convex optimization21
Dilational symmetries of decomposition and coorbit spaces20
A note on spike localization for line spectrum estimation20
Generalization error guaranteed auto-encoder-based nonlinear model reduction for operator learning19
On the evaluation of the eigendecomposition of the Airy integral operator19
Computing the proximal operator of the q-th power of the ℓ1,-norm for group sparsity18
Generalization error of random feature and kernel methods: Hypercontractivity and kernel matrix concentration17
Sharp error estimates for target measure diffusion maps with applications to the committor problem17
On the optimal approximation of Sobolev and Besov functions using deep ReLU neural networks16
Signal reconstruction using determinantal sampling16
Complete interpolating sequences for the Gaussian shift-invariant space15
Controlled learning of pointwise nonlinearities in neural-network-like architectures14
AP-frames and stationary random processes14
Finite alphabet phase retrieval14
Editorial Board14
A simple approach for quantizing neural networks14
Irregular Gabor frames of Cauchy kernels13
n-Best kernel approximation in reproducing kernel Hilbert spaces12
Gaussian random field approximation via Stein's method with applications to wide random neural networks12
A fractal uncertainty principle for the short-time Fourier transform and Gabor multipliers12
Marcinkiewicz–Zygmund inequalities for scattered and random data on the q-sphere12
On the number of faces and radii of cells induced by Gaussian spherical tessellations12
Eigenmatrix for unstructured sparse recovery12
Editorial Board11
Data-driven optimal shrinkage of singular values under high-dimensional noise with separable covariance structure with application11
On the relation between Fourier and Walsh–Rademacher spectra for random fields11
Adaptive parameter selection for kernel ridge regression11
An efficient spatial discretization of spans of multivariate Chebyshev polynomials11
Stable parameterization of continuous and piecewise-linear functions10
On the intermediate value property of spectra for a class of Moran spectral measures10
Regularization of inverse problems by filtered diagonal frame decomposition10
Divergence-free quasi-interpolation9
Solving phase retrieval with random initial guess is nearly as good as by spectral initialization9
On the accuracy of Prony's method for recovery of exponential sums with closely spaced exponents9
An unbounded operator theory approach to lower frame and Riesz-Fischer sequences9
Estimation under group actions: Recovering orbits from invariants9
A sufficient condition for mobile sampling in terms of surface density9
Frames of translates for model sets9
Weighted variation spaces and approximation by shallow ReLU networks8
Dimension reduction, exact recovery, and error estimates for sparse reconstruction in phase space8
Spectral analysis of weighted Laplacians arising in data clustering8
Lower bounds on the low-distortion embedding dimension of submanifolds of 8
A tighter generalization error bound for wide GCN based on loss landscape8
Sparse free deconvolution under unknown noise level via eigenmatrix8
Editorial Board7
Constructive subsampling of finite frames with applications in optimal function recovery7
Algebraic compressed sensing7
Positive definite multi-kernels for scattered data interpolations7
Generalization bounds for sparse random feature expansions7
Laplace-Beltrami operator on the orthogonal group in ambient (Euclidean) coordinates7
Tikhonov regularization for Gaussian empirical gain maximization in RKHS is consistent7
Fundamental component enhancement via adaptive nonlinear activation functions7
A unified approach to synchronization problems over subgroups of the orthogonal group7
A one-bit, comparison-based gradient estimator7
Synthesis-based time-scale transforms for non-stationary signals7
Editorial Board7
Optimal (α,d)-multi-completion of d-designs7
The springback penalty for robust signal recovery7
On a regularization of unsupervised domain adaptation in RKHS6
Frames by orbits of two operators that commute6
The G-invariant graph Laplacian part II: Diffusion maps6
Universal Approximation Property of Fully Convolutional Neural Networks with Zero Padding6
Solving PDEs on unknown manifolds with machine learning6
Sparsification of the regularized magnetic Laplacian with multi-type spanning forests6
Permutation-invariant representations with applications to graph deep learning6
Editorial Board6
Sparse signal recovery from phaseless measurements via hard thresholding pursuit6
Non-asymptotic bounds for discrete prolate spheroidal wave functions analogous with prolate spheroidal wave function bounds6
Linearized Wasserstein dimensionality reduction with approximation guarantees6
0.48334789276123