activity
20202026
most citedLeafy Automata for Higher-Order Concurrency

1 citations · 1 across the 4 of their papers we have counts for

collaborators

5 papers

cs.LG2026

Minimal-Norm Univariate Two-Layer ReLU Classification: Exact Solutions and Global Optimality with Skip Connections

Karolina Drabik, Ben Lewis, Antoni Puch +4

We study minimal-norm interpolation and -regularized logistic-loss minimization for binary classification by univariate two-layer ReLU networks. We give complete geometric…

cs.LG2026

Mildly Overparameterized ReLU Networks on Orthogonal Data: Incremental Learning and Implicit Bias

James Town, Etienne Boursier, Ben Lewis +2

The successful training of neural networks hinges on the use of first order optimization methods, yet the theoretical characterization of these methods remains incomplete. This is…

cs.LG2025

Favorability of Loss Landscape with Weight Decay Requires Both Large Overparametrization and Initialization

Etienne Boursier, Matthew Bowditch, Matthias Englert +1

The optimization of neural networks under weight decay remains poorly understood from a theoretical standpoint. While weight decay is standard practice in modern training procedure…

cs.FL2021★ 1 cited

Leafy Automata for Higher-Order Concurrency

Alex Dixon, Ranko Lazić, Andrzej S. Murawski +1

Finitary Idealized Concurrent Algol (FICA) is a prototypical programming language combining functional, imperative, and concurrent computation. There exists a fully abstract game m…

cs.FL2020

Reachability in fixed dimension vector addition systems with states

Wojciech Czerwiński, Sławomir Lasota, Ranko Lazić +2

The reachability problem is a central decision problem for formal verification based on vector addition systems with states (VASS), which are equivalent to Petri nets and form one…