Pages that link to "Item:Q4959462"

The following pages link to SIAM Journal on Mathematics of Data Science (Q4959462):

Displaying 40 items.

• Group-Invariant Tensor Train Networks for Supervised Learning (Q6070296) (← links)
• On the Inconsistency of Kernel Ridgeless Regression in Fixed Dimensions (Q6070298) (← links)
• Understanding Graph Neural Networks with Generalized Geometric Scattering Transforms (Q6070299) (← links)
• The GenCol Algorithm for High-Dimensional Optimal Transport: General Formulation and Application to Barycenters and Wasserstein Splines (Q6070301) (← links)
• Adversarial Robustness of Sparse Local Lipschitz Predictors (Q6070302) (← links)
• Approximating Probability Distributions by Using Wasserstein Generative Adversarial Networks (Q6090834) (← links)
• A Universal Trade-off Between the Model Size, Test Loss, and Training Loss of Linear Predictors (Q6090836) (← links)
• Nonbacktracking Spectral Clustering of Nonuniform Hypergraphs (Q6104310) (← links)
• Causal Structural Learning via Local Graphs (Q6104311) (← links)
• Approximation of Lipschitz Functions Using Deep Spline Neural Networks (Q6104312) (← links)
• Robust Inference of Manifold Density and Geometry by Doubly Stochastic Scaling (Q6136229) (← links)
• Approximate Q Learning for Controlled Diffusion Processes and Its Near Optimality (Q6136230) (← links)
• An Improved Central Limit Theorem and Fast Convergence Rates for Entropic Transportation Costs (Q6136231) (← links)
• A Note on the Regularity of Images Generated by Convolutional Neural Networks (Q6136232) (← links)
• Optimality Conditions for Nonsmooth Nonconvex-Nonconcave Min-Max Problems and Generative Adversarial Networks (Q6136233) (← links)
• Algorithmic Regularization in Model-Free Overparametrized Asymmetric Matrix Factorization (Q6136234) (← links)
• Estimating a Potential Without the Agony of the Partition Function (Q6148349) (← links)
• Entropic Optimal Transport on Random Graphs (Q6148350) (← links)
• Deep Neural Networks Pruning via the Structured Perspective Regularization (Q6148352) (← links)
• Target Network and Truncation Overcome the Deadly Triad in \(\boldsymbol{Q}\)-Learning (Q6148353) (← links)
• LASSO Reloaded: A Variational Analysis Perspective with Applications to Compressed Sensing (Q6148354) (← links)
• Moment Estimation for Nonparametric Mixture Models through Implicit Tensor Decomposition (Q6148355) (← links)
• Poisson Reweighted Laplacian Uncertainty Sampling for Graph-Based Active Learning (Q6151664) (← links)
• Optimization on Manifolds via Graph Gaussian Processes (Q6151665) (← links)
• High-Dimensional Analysis of Double Descent for Linear Regression with Random Projections (Q6151666) (← links)
• Online MCMC Thinning with Kernelized Stein Discrepancy (Q6151668) (← links)
• Taming Neural Networks with TUSLA: Nonconvex Learning via Adaptive Stochastic Gradient Langevin Algorithms (Q6162009) (← links)
• Time-Inhomogeneous Diffusion Geometry and Topology (Q6171679) (← links)
• Post-training Quantization for Neural Networks with Provable Guarantees (Q6171681) (← links)
• Moving Up the Cluster Tree with the Gradient Flow (Q6171682) (← links)
• Measuring Complexity of Learning Schemes Using Hessian-Schatten Total Variation (Q6171683) (← links)
• Efficient Global Optimization of Two-Layer ReLU Networks: Quadratic-Time Algorithms and Adversarial Training (Q6171686) (← links)
• Wassmap: Wasserstein Isometric Mapping for Image Manifold Learning (Q6171687) (← links)
• Probabilistic Registration for Gaussian Process Three-Dimensional Shape Modelling in the Presence of Extensive Missing Data (Q6171688) (← links)
• Statistical Analysis of Random Objects Via Metric Measure Laplacians (Q6171689) (← links)
• Data-Driven Mirror Descent with Input-Convex Neural Networks (Q6171691) (← links)
• On Design of Polyhedral Estimates in Linear Inverse Problems (Q6202281) (← links)
• Applications of No-Collision Transportation Maps in Manifold Learning (Q6202282) (← links)
• Sharp Analysis of Sketch-and-Project Methods via a Connection to Randomized Singular Value Decomposition (Q6202283) (← links)
• Faster Rates for Compressed Federated Learning with Client-Variance Reduction (Q6202285) (← links)