arXiv Machine Learning By Philipp Grohs, Mat\v{e}j Tr\"odler

Limitations of Learning Tanh Neural Networks with Finite Precision

Read the original on arXiv Machine Learning →

arXiv:2606. 11104v1 Announce Type: new Abstract: We investigate limitations of learning $\tanh$ neural networks from point evaluations under finite-precision computations and $L^p$ accuracy guarantees, building on Berner, Grohs, and Voigtl\"ander (2023).

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Jul 30

On the robustness of noisy solutions in non-convex neural networks

arXiv:2607. 27000v1 Announce Type: cross Abstract: Optimization in non-convex neural network models is strongly influenced by the geometry of the solution space: sparse, isolated, point-like clusters are typically algorithmically inaccessible, whereas wide and flat regions can be found efficiently despite being relatively rare.

By Enrico M. Malatesta, Alessandra Passalacqua, Riccardo Zecchina
arXiv Machine Learning
Jun 2

Taming the Loss Landscape of PINNs with Noisy Feynman-Kac Supervision: Operator Preconditioning and Non-Asymptotic Error Bounds

arXiv:2606. 00643v1 Announce Type: cross Abstract: Physics-Informed Neural Networks (PINNs) often train slowly or fail to converge on challenging partial differential equations (PDEs), a behavior recently linked to severely ill-conditioned loss landscapes inherited from the underlying differential operator.

By Nathanael Tepakbong, Hanyu Hu, Chengyu Liu, Xiang Zhou