arXiv Machine Learning
Same Loss, Different Gradients
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
2d ago
How Accurate Is Accurate Enough?
arXiv:2609.38785v1 Announce Type: new Abstract: How accurate must a numerical approximation be within a learning system? Primitive error alone cannot answer this question: errors of the same magnitud...
arXiv Statistics ML
Aug 25
Q-Learning with Stable Infinite-Dimensional Linear Function Approximation
arXiv:2608.22636v1 Announce Type: cross Abstract: Q-learning with linear function approximation can be unstable because an arbitrary approximation architecture need not preserve the Bellman contracti...
arXiv Machine Learning
Sep 15
ReLU Neural Network Approximation to Smooth Functional Operator: Dimensional Decay and Error Analysis
arXiv:2609.15355v1 Announce Type: cross Abstract: We study the uniform approximation of smooth scalar-valued functionals on an infinite-dimensional separable Hilbert space by deep ReLU neural network...
arXiv Machine Learning
Sep 4
A Closed-Form Formula for Consistent Lipschitz Regression on Metric Spaces with Sparse Neural Network Realizations
arXiv:2609. 03129v1 Announce Type: cross Abstract: Several classical machine-learning methods, such as KRRs and SVRs, are both computationally and analytically tractable since their estimators either admit closed-form expressions or are obtained by minimizing convex training objectives; neither feature is generally available for deep neural networks.
arXiv Machine Learning
Sep 15
Resolution-Independent Analysis of Encoder--Decoder Operator Learning via Limiting Kernels
The paper studies operator learning on function spaces using encoder–decoder architectures. It shows that as input and output resolutions grow, the induced kernels converge to a limiting kernel, enabling regularity assumptions independent of resolution. The authors derive upper and lower bounds for regularized stochastic gradient descent, extend the analysis to neural networks via the limiting neural tangent kernel, and provide error bounds and complexity guarantees for various kernel and encoding constructions.
arXiv Machine Learning
Jun 30
Learning from samples: inverse problems over measures
arXiv:2505. 07124v3 Announce Type: replace Abstract: We study inverse problems where an unknown potential is observed only through samples from the measure it induces by a convex variational principle.