Showing 2025Show all
3 papers · 1 filter
cs.LG2025
Complexity of One-Dimensional ReLU DNNs
Jonathan Kogan, Hayden Jananthan, Jeremy Kepner
We study the expressivity of one-dimensional (1D) ReLU deep neural networks through the lens of their linear regions. For randomly initialized, fully connected 1D ReLU networks (He…
math.PR2025
Limiting behaviour of pattern counts in biased binary strings
Jon V. Kogan, Nicolò Paviato
For , sample a binary sequence from the infinite product measure of Bernoulli distributions. It is known that for , almost every binary sequence is Poisson…
math.CO2025
Vertex-Minimal Triangulation of Complexes with Homology
Jon V. Kogan
For a given pair of numbers , we establish the minimal number of vertices in pure -dimensional simplicial complexes with non-trivial homology in dimension . Furthermor…