SIAM Journal on Mathematics of Data Science

Papers
(The median citation count of SIAM Journal on Mathematics of Data Science is 1. 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-10-01 to 2025-10-01.)
ArticleCitations
Taming Neural Networks with TUSLA: Nonconvex Learning via Adaptive Stochastic Gradient Langevin Algorithms35
A Simple and Optimal Algorithm for Strict Circular Seriation28
Spectral Barron Space for Deep Neural Network Approximation26
Adaptivity of Stochastic Gradient Methods for Nonconvex Optimization24
On the Inconsistency of Kernel Ridgeless Regression in Fixed Dimensions22
Randomized Nyström Approximation of Non-negative Self-Adjoint Operators22
A Note on the Regularity of Images Generated by Convolutional Neural Networks21
New Equivalences between Interpolation and SVMs: Kernels and Structured Features20
Poisson Reweighted Laplacian Uncertainty Sampling for Graph-Based Active Learning17
Block Majorization Minimization with Extrapolation and Application to \({\beta }\)-NMF15
Resolving the Mixing Time of the Langevin Algorithm to Its Stationary Distribution for Log-Concave Sampling14
Learning Functions Varying along a Central Subspace14
Quantitative Approximation Results for Complex-Valued Neural Networks13
Efficient Algorithms for Regularized Nonnegative Scale-Invariant Low-Rank Approximation Models13
Online Machine Teaching under Learner Uncertainty: Gradient Descent Learners of a Quadratic Loss12
Nonbacktracking Spectral Clustering of Nonuniform Hypergraphs12
Nonlinear Tomographic Reconstruction via Nonsmooth Optimization11
Wassmap: Wasserstein Isometric Mapping for Image Manifold Learning11
Persistent Laplacians: Properties, Algorithms and Implications11
Safe Rules for the Identification of Zeros in the Solutions of the SLOPE Problem10
Convergence of a Piggyback-Style Method for the Differentiation of Solutions of Standard Saddle-Point Problems10
CA-PCA: Manifold Dimension Estimation, Adapted for Curvature10
Scalable Tensor Methods for Nonuniform Hypergraphs9
The GenCol Algorithm for High-Dimensional Optimal Transport: General Formulation and Application to Barycenters and Wasserstein Splines9
Function-Space Optimality of Neural Architectures with Multivariate Nonlinearities9
Inverse Evolution Layers: Physics-Informed Regularizers for Image Segmentation9
Stochastic Variance-Reduced Majorization-Minimization Algorithms9
A Variational Formulation of Accelerated Optimization on Riemannian Manifolds9
Asymptotics of the Sketched Pseudoinverse8
Covariance Alignment: From Maximum Likelihood Estimation to Gromov–Wasserstein8
Group-Invariant Tensor Train Networks for Supervised Learning8
The Sample Complexity of Sparse Multireference Alignment and Single-Particle Cryo-Electron Microscopy8
Random Multitype Spanning Forests for Synchronization on Sparse Graphs8
Convergence of Gradient Descent for Recurrent Neural Networks: A Nonasymptotic Analysis7
Numerical Considerations and a new implementation for invariant coordinate selection7
Supervised Gromov–Wasserstein Optimal Transport with Metric-Preserving Constraints7
Optimal Dorfman Group Testing for Symmetric Distributions7
Bi-Invariant Dissimilarity Measures for Sample Distributions in Lie Groups7
Benefit of Interpolation in Nearest Neighbor Algorithms7
Finite-Time Analysis of Natural Actor-Critic for POMDPs7
The Geometric Median and Applications to Robust Mean Estimation7
A Nonlinear Matrix Decomposition for Mining the Zeros of Sparse Data6
Adaptive Joint Distribution Learning6
Computing Wasserstein Barycenters via Operator Splitting: The Method of Averaged Marginals6
ABBA Neural Networks: Coping with Positivity, Expressivity, and Robustness6
Efficient Identification of Butterfly Sparse Matrix Factorizations6
LASSO Reloaded: A Variational Analysis Perspective with Applications to Compressed Sensing6
Post-training Quantization for Neural Networks with Provable Guarantees6
Robust Classification Under $\ell_0$ Attack for the Gaussian Mixture Model5
Optimality Conditions for Nonsmooth Nonconvex-Nonconcave Min-Max Problems and Generative Adversarial Networks5
Randomized Wasserstein Barycenter Computation: Resampling with Statistical Guarantees5
Operator Shifting for General Noisy Matrix Systems5
Accelerated and Instance-Optimal Policy Evaluation with Linear Function Approximation5
Memory Capacity of Two Layer Neural Networks with Smooth Activations5
Sequential Construction and Dimension Reduction of Gaussian Processes Under Inequality Constraints5
Fast Kernel Summation in High Dimensions via Slicing and Fourier Transforms5
Stochastic Gradient Descent for Streaming Linear and Rectified Linear Systems with Adversarial Corruptions4
Convergence of a Constrained Vector Extrapolation Scheme4
KL Convergence Guarantees for Score Diffusion Models under Minimal Data Assumptions4
Insights into Kernel PCA with Application to Multivariate Extremes4
Lipschitz-Regularized Gradient Flows and Generative Particle Algorithms for High-Dimensional Scarce Data4
A Priori Estimates for Deep Residual Network in Continuous-Time Reinforcement Learning4
Spectral Properties of Elementwise-Transformed Spiked Matrices4
Sensitivity-Informed Provable Pruning of Neural Networks4
Stability of Sequential Lateration and of Stress Minimization in the Presence of Noise4
Approximating Probability Distributions by Using Wasserstein Generative Adversarial Networks4
Ensemble Linear Interpolators: The Role of Ensembling4
Multifidelity Covariance Estimation via Regression on the Manifold of Symmetric Positive Definite Matrices4
A Unifying Generative Model for Graph Learning Algorithms: Label Propagation, Graph Convolutions, and Combinations4
Feel-Good Thompson Sampling for Contextual Bandits and Reinforcement Learning4
A Generalized CUR Decomposition for Matrix Pairs4
Nonlinear Weighted Directed Acyclic Graph and A Priori Estimates for Neural Networks4
Network Online Change Point Localization3
Simple Alternating Minimization Provably Solves Complete Dictionary Learning3
First-Order Conditions for Optimization in the Wasserstein Space3
Causal Structural Learning via Local Graphs3
Approximate Message Passing with Rigorous Guarantees for Pooled Data and Quantitative Group Testing3
Entropic Optimal Transport on Random Graphs3
Block Bregman Majorization Minimization with Extrapolation3
Optimization on Manifolds via Graph Gaussian Processes3
Accelerated Bregman Primal-Dual Methods Applied to Optimal Transport and Wasserstein Barycenter Problems2
Efficiency of ETA Prediction2
The Common Intuition to Transfer Learning Can Win or Lose: Case Studies for Linear Regression2
On the Nonconvexity of Push-Forward Constraints and Its Consequences in Machine Learning2
Sharp Analysis of Sketch-and-Project Methods via a Connection to Randomized Singular Value Decomposition2
Estimating a Potential Without the Agony of the Partition Function2
Binary Classification of Gaussian Mixtures: Abundance of Support Vectors, Benign Overfitting, and Regularization2
Double Double Descent: On Generalization Errors in Transfer Learning between Linear Regression Tasks2
Diffeomorphic Measure Matching with Kernels for Generative Modeling2
Approximate Q Learning for Controlled Diffusion Processes and Its Near Optimality2
\({O({k})}\)-Equivariant Dimensionality Reduction on Stiefel Manifolds2
Optimally Weighted PCA for High-Dimensional Heteroscedastic Data2
$k$-Variance: A Clustered Notion of Variance2
Positive Semi-definite Embedding for Dimensionality Reduction and Out-of-Sample Extensions2
Applications of No-Collision Transportation Maps in Manifold Learning2
Faster Rates for Compressed Federated Learning with Client-Variance Reduction2
Wasserstein-Based Projections with Applications to Inverse Problems2
An Adaptively Inexact First-Order Method for Bilevel Optimization with Application to Hyperparameter Learning2
Enforcing Katz and PageRank Centrality Measures in Complex Networks1
Improving the Accuracy-Robustness Trade-Off of Classifiers via Adaptive Smoothing1
Finding Planted Cliques Using Gradient Descent1
The Positivity of the Neural Tangent Kernel1
Biwhitening Reveals the Rank of a Count Matrix1
Statistical Methods for Minimax Estimation in Linear Models with Unknown Design Over Finite Alphabets1
Sharp Estimates on Random Hyperplane Tessellations1
Overcomplete Order-3 Tensor Decomposition, Blind Deconvolution, and Gaussian Mixture Models1
Federated Primal Dual Fixed Point Algorithm1
What Kinds of Functions Do Deep Neural Networks Learn? Insights from Variational Spline Theory1
High-Dimensional Analysis of Double Descent for Linear Regression with Random Projections1
Fredholm Integral Equations for Function Approximation and the Training of Neural Networks1
Energy-Based Sequential Sampling for Low-Rank PSD-Matrix Approximation1
Determinantal Point Processes Implicitly Regularize Semiparametric Regression Problems1
Principles for Initialization and Architecture Selection in Graph Neural Networks with ReLU Activations1
Fast Cluster Detection in Networks by First Order Optimization1
Corrigendum: Post-training Quantization for Neural Networks with Provable Guarantees1
Random Projection Neural Networks of Best Approximation: Convergence Theory and Practical Applications1
Two Steps at a Time---Taking GAN Training in Stride with Tseng's Method1
Topological Fingerprints for Audio Identification1
On Design of Polyhedral Estimates in Linear Inverse Problems1
Core-Periphery Detection in Hypergraphs1
A Universal Trade-off Between the Model Size, Test Loss, and Training Loss of Linear Predictors1
Target Network and Truncation Overcome the Deadly Triad in \(\boldsymbol{Q}\)-Learning1
ReLU Neural Networks with Linear Layers Are Biased towards Single- and Multi-index Models1
Randomly Initialized Alternating Least Squares: Fast Convergence for Matrix Sensing1
Online MCMC Thinning with Kernelized Stein Discrepancy1
Identifying 3D Genome Organization in Diploid Organisms via Euclidean Distance Geometry1
Landmark Alternating Diffusion1
Structural Balance and Random Walks on Complex Networks with Complex Weights1
Data-Driven Mirror Descent with Input-Convex Neural Networks1
Overparameterization and Generalization Error: Weighted Trigonometric Interpolation1
Clustering in Pure-Attention Hardmax Transformers and Its Role in Sentiment Analysis1
Gradient Descent in the Absence of Global Lipschitz Continuity of the Gradients1
Approximation Bounds for Sparse Programs1
Maximum a Posteriori Inference for Factor Graphs via Benders’ Decomposition1
When Big Data Actually Are Low-Rank, or Entrywise Approximation of Certain Function-Generated Matrices1
Nonparametric Finite Mixture Models with Possible Shape Constraints: A Cubic Newton Approach1
Intrinsic Dimension Adaptive Partitioning for Kernel Methods1
0.09634804725647