Entity usage

Showing below up to 50 results in range #1 to #50.

1. Faster Rates for Compressed Federated Learning with Client-Variance Reduction: Label: en
2. Sharp Analysis of Sketch-and-Project Methods via a Connection to Randomized Singular Value Decomposition: Label: en
3. Applications of No-Collision Transportation Maps in Manifold Learning: Label: en
4. On Design of Polyhedral Estimates in Linear Inverse Problems: Label: en
5. Data-Driven Mirror Descent with Input-Convex Neural Networks: Label: en
6. Statistical Analysis of Random Objects Via Metric Measure Laplacians: Label: en
7. Probabilistic Registration for Gaussian Process Three-Dimensional Shape Modelling in the Presence of Extensive Missing Data: Label: en
8. Wassmap: Wasserstein Isometric Mapping for Image Manifold Learning: Label: en
9. Efficient Global Optimization of Two-Layer ReLU Networks: Quadratic-Time Algorithms and Adversarial Training: Label: en
10. Measuring Complexity of Learning Schemes Using Hessian-Schatten Total Variation: Label: en
11. Moving Up the Cluster Tree with the Gradient Flow: Label: en
12. Post-training Quantization for Neural Networks with Provable Guarantees: Label: en
13. Time-Inhomogeneous Diffusion Geometry and Topology: Label: en
14. Taming Neural Networks with TUSLA: Nonconvex Learning via Adaptive Stochastic Gradient Langevin Algorithms: Label: en
15. Online MCMC Thinning with Kernelized Stein Discrepancy: Label: en
16. High-Dimensional Analysis of Double Descent for Linear Regression with Random Projections: Label: en
17. Optimization on Manifolds via Graph Gaussian Processes: Label: en
18. Poisson Reweighted Laplacian Uncertainty Sampling for Graph-Based Active Learning: Label: en
19. Moment Estimation for Nonparametric Mixture Models through Implicit Tensor Decomposition: Label: en
20. LASSO Reloaded: A Variational Analysis Perspective with Applications to Compressed Sensing: Label: en
21. Target Network and Truncation Overcome the Deadly Triad in \(\boldsymbol{Q}\)-Learning: Label: en
22. Deep Neural Networks Pruning via the Structured Perspective Regularization: Label: en
23. Entropic Optimal Transport on Random Graphs: Label: en
24. Estimating a Potential Without the Agony of the Partition Function: Label: en
25. Algorithmic Regularization in Model-Free Overparametrized Asymmetric Matrix Factorization: Label: en
26. Optimality Conditions for Nonsmooth Nonconvex-Nonconcave Min-Max Problems and Generative Adversarial Networks: Label: en
27. A Note on the Regularity of Images Generated by Convolutional Neural Networks: Label: en
28. An Improved Central Limit Theorem and Fast Convergence Rates for Entropic Transportation Costs: Label: en
29. Approximate Q Learning for Controlled Diffusion Processes and Its Near Optimality: Label: en
30. Robust Inference of Manifold Density and Geometry by Doubly Stochastic Scaling: Label: en
31. Approximation of Lipschitz Functions Using Deep Spline Neural Networks: Label: en
32. Causal Structural Learning via Local Graphs: Label: en
33. Nonbacktracking Spectral Clustering of Nonuniform Hypergraphs: Label: en
34. A Universal Trade-off Between the Model Size, Test Loss, and Training Loss of Linear Predictors: Label: en
35. Approximating Probability Distributions by Using Wasserstein Generative Adversarial Networks: Label: en
36. Adversarial Robustness of Sparse Local Lipschitz Predictors: Label: en
37. The GenCol Algorithm for High-Dimensional Optimal Transport: General Formulation and Application to Barycenters and Wasserstein Splines: Label: en
38. Understanding Graph Neural Networks with Generalized Geometric Scattering Transforms: Label: en
39. On the Inconsistency of Kernel Ridgeless Regression in Fixed Dimensions: Label: en
40. Group-Invariant Tensor Train Networks for Supervised Learning: Label: en
41. Optimally Weighted PCA for High-Dimensional Heteroscedastic Data: Label: en
42. A Simple and Optimal Algorithm for Strict Circular Seriation: Label: en
43. Accelerated and Instance-Optimal Policy Evaluation with Linear Function Approximation: Label: en
44. Safe Rules for the Identification of Zeros in the Solutions of the SLOPE Problem: Label: en
45. GAT–GMM: Generative Adversarial Training for Gaussian Mixture Models: Label: en
46. Numerical Considerations and a new implementation for invariant coordinate selection: Label: en
47. Manifold Oblique Random Forests: Towards Closing the Gap on Convolutional Deep Networks: Label: en
48. Stability of Deep Neural Networks via Discrete Rough Paths: Label: en
49. Efficient Identification of Butterfly Sparse Matrix Factorizations: Label: en
50. Core-Periphery Detection in Hypergraphs: Label: en