SIAM Journal on Mathematics of Data Science

Papers
(The median citation count of SIAM Journal on Mathematics of Data Science is 2. 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 2020-11-01 to 2024-11-01.)
ArticleCitations
Scalable Semidefinite Programming50
The Gap between Theory and Practice in Function Approximation with Deep Neural Networks36
Implicit Deep Learning35
Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin30
Persistent Laplacians: Properties, Algorithms and Implications24
Nonbacktracking Eigenvalues under Node Removal: X-Centrality and Targeted Immunization22
Autodifferentiable Ensemble Kalman Filters18
On Stochastic Gradient Langevin Dynamics with Dependent Data Streams: The Fully Nonconvex Case18
Mean-Field Controls with Q-Learning for Cooperative MARL: Convergence and Complexity Analysis16
What Kinds of Functions Do Deep Neural Networks Learn? Insights from Variational Spline Theory15
Finite-Time Performance of Distributed Temporal-Difference Learning with Linear Function Approximation15
Multi-Reference Alignment in High Dimensions: Sample Complexity and Phase Transition14
An AO-ADMM Approach to Constraining PARAFAC2 on All Modes13
Core-Periphery Detection in Hypergraphs12
Nonbacktracking Spectral Clustering of Nonuniform Hypergraphs12
The Signature Kernel Is the Solution of a Goursat PDE11
Simplex-Structured Matrix Factorization: Sparsity-Based Identifiability and Provably Correct Algorithms11
Benefit of Interpolation in Nearest Neighbor Algorithms11
Variational Representations and Neural Network Estimation of Rényi Divergences10
An Improved Central Limit Theorem and Fast Convergence Rates for Entropic Transportation Costs10
Global Minima of Overparameterized Neural Networks10
Matrix Denoising for Weighted Loss Functions and Heterogeneous Signals10
Is Temporal Difference Learning Optimal? An Instance-Dependent Analysis9
Two Steps at a Time---Taking GAN Training in Stride with Tseng's Method9
Tensor Methods for Nonlinear Matrix Completion9
Satisficing Paths and Independent Multiagent Reinforcement Learning in Stochastic Games9
Train Like a (Var)Pro: Efficient Training of Neural Networks with Variable Projection9
A Generalized CUR Decomposition for Matrix Pairs9
Wasserstein Barycenters Are NP-Hard to Compute9
Doubly Stochastic Normalization of the Gaussian Kernel Is Robust to Heteroskedastic Noise8
Interpretable Approximation of High-Dimensional Data8
Multikernel Regression with Sparsity Constraint8
Diversity Sampling is an Implicit Regularization for Kernel Methods8
The Trimmed Lasso: Sparse Recovery Guarantees and Practical Optimization by the Generalized Soft-Min Penalty8
A Generative Variational Model for Inverse Problems in Imaging8
Towards Compact Neural Networks via End-to-End Training: A Bayesian Tensor Approach with Automatic Rank Determination8
Adaptivity of Stochastic Gradient Methods for Nonconvex Optimization8
Identifying 3D Genome Organization in Diploid Organisms via Euclidean Distance Geometry7
Randomized Wasserstein Barycenter Computation: Resampling with Statistical Guarantees7
A Unifying Generative Model for Graph Learning Algorithms: Label Propagation, Graph Convolutions, and Combinations7
Post-training Quantization for Neural Networks with Provable Guarantees7
Wasserstein-Based Projections with Applications to Inverse Problems7
Sharp Analysis of Sketch-and-Project Methods via a Connection to Randomized Singular Value Decomposition7
Robust Classification Under $\ell_0$ Attack for the Gaussian Mixture Model6
Balancing Geometry and Density: Path Distances on High-Dimensional Data6
Approximation of Lipschitz Functions Using Deep Spline Neural Networks6
Semi-supervised Learning for Aggregated Multilayer Graphs Using Diffuse Interface Methods and Fast Matrix-Vector Products6
Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries6
Binary Classification of Gaussian Mixtures: Abundance of Support Vectors, Benign Overfitting, and Regularization5
Binary Component Decomposition Part I: The Positive-Semidefinite Case5
Analysis of Spatial and Spatiotemporal Anomalies Using Persistent Homology: Case Studies with COVID-19 Data5
An Optimal Algorithm for Strict Circular Seriation5
Error Bounds for Dynamical Spectral Estimation5
Biwhitening Reveals the Rank of a Count Matrix5
Feel-Good Thompson Sampling for Contextual Bandits and Reinforcement Learning5
A Metric on Directed Graphs and Markov Chains Based on Hitting Probabilities5
Approximate Spectral Gaps for Markov Chain Mixing Times in High Dimensions5
A Variational Formulation of Accelerated Optimization on Riemannian Manifolds5
Diffusion State Distances: Multitemporal Analysis, Fast Algorithms, and Applications to Biological Networks4
Test Data Reuse for the Evaluation of Continuously Evolving Classification Algorithms Using the Area under the Receiver Operating Characteristic Curve4
Wassmap: Wasserstein Isometric Mapping for Image Manifold Learning4
Block Bregman Majorization Minimization with Extrapolation4
On the Bias, Risk, and Consistency of Sample Means in Multi-armed Bandits4
A Performance Guarantee for Spectral Clustering4
Optimality Conditions for Nonsmooth Nonconvex-Nonconcave Min-Max Problems and Generative Adversarial Networks4
GNMR: A Provable One-Line Algorithm for Low Rank Matrix Recovery4
Private Sampling: A Noiseless Approach for Generating Differentially Private Synthetic Data4
Accelerated Bregman Primal-Dual Methods Applied to Optimal Transport and Wasserstein Barycenter Problems4
The Convex Mixture Distribution: Granger Causality for Categorical Time Series4
Measuring Complexity of Learning Schemes Using Hessian-Schatten Total Variation4
Fast Cluster Detection in Networks by First Order Optimization4
Exponential-Wrapped Distributions on Symmetric Spaces3
Double Double Descent: On Generalization Errors in Transfer Learning between Linear Regression Tasks3
Time-Inhomogeneous Diffusion Geometry and Topology3
Communication-Efficient Distributed Eigenspace Estimation3
Stochastic Geometry to Generalize the Mondrian Process3
Normal-Bundle Bootstrap3
Sharp Estimates on Random Hyperplane Tessellations3
Algorithmic Regularization in Model-Free Overparametrized Asymmetric Matrix Factorization3
Convergence of Recursive Stochastic Algorithms Using Wasserstein Divergence3
Deterministic Tensor Completion with Hypergraph Expanders3
Consistency of Archetypal Analysis3
Efficient Global Optimization of Two-Layer ReLU Networks: Quadratic-Time Algorithms and Adversarial Training3
Approximation Properties of Ridge Functions and Extreme Learning Machines3
Numerical Considerations and a new implementation for invariant coordinate selection3
On the Inconsistency of Kernel Ridgeless Regression in Fixed Dimensions2
DESTRESS: Computation-Optimal and Communication-Efficient Decentralized Nonconvex Finite-Sum Optimization2
Statistical Methods for Minimax Estimation in Linear Models with Unknown Design Over Finite Alphabets2
Convergence of a Piggyback-Style Method for the Differentiation of Solutions of Standard Saddle-Point Problems2
Joint Community Detection and Rotational Synchronization via Semidefinite Programming2
Taming Neural Networks with TUSLA: Nonconvex Learning via Adaptive Stochastic Gradient Langevin Algorithms2
Quantitative Approximation Results for Complex-Valued Neural Networks2
On the Effectiveness of Richardson Extrapolation in Data Science2
Tukey Depths and Hamilton--Jacobi Differential Equations2
Understanding Graph Neural Networks with Generalized Geometric Scattering Transforms2
The GenCol Algorithm for High-Dimensional Optimal Transport: General Formulation and Application to Barycenters and Wasserstein Splines2
Approximate Q Learning for Controlled Diffusion Processes and Its Near Optimality2
Spectral Discovery of Jointly Smooth Features for Multimodal Data2
Robust Inference of Manifold Density and Geometry by Doubly Stochastic Scaling2
Generalization Error of Minimum Weighted Norm and Kernel Interpolation2
Adversarial Robustness of Sparse Local Lipschitz Predictors2
Optimally Weighted PCA for High-Dimensional Heteroscedastic Data2
MR-GAN: Manifold Regularized Generative Adversarial Networks for Scientific Data2
Accelerated and Instance-Optimal Policy Evaluation with Linear Function Approximation2
Sequential Construction and Dimension Reduction of Gaussian Processes Under Inequality Constraints2
LASSO Reloaded: A Variational Analysis Perspective with Applications to Compressed Sensing2
A Simple and Optimal Algorithm for Strict Circular Seriation2
0.029513835906982