Hugging Face Trending Papers

EML Trees Are Universal Approximators

Read the original on Hugging Face Trending Papers →

The recently introduced EML (Exp-Minus-Log) function acts as continuous analogue of NAND gates, providing a compositional building block capable of representing elementary functions. In this work, we study the expressive power of tree-structured compositions of EML functions.

Summary generated by The Flow from the publisher's feed. The full article lives at Hugging Face Trending Papers.

arXiv Machine Learning
Jul 24

Compiling to recurrent neurons

arXiv:2511. 14953v2 Announce Type: replace-cross Abstract: Discrete structures are currently second-class in differentiable programming.

By Joey Velez-Ginorio, Nada Amin, Konrad Kording, Steve Zdancewic