Daniel Willhalm

collaborators

2 papers

math.CO2025

Playing Sudoku on random 3-regular graphs

Jack Dippel, Austin Eide, Pawel Pralat +1

The Sudoku number $s (G)$ of graph $G$ with chromatic number $I ¨ (G)$ is the smallest partial $I ¨ (G)$ -colouring of $G$ that determines a unique $I ¨ (G)$ -colouring of the entire graph.…

math.PR2025

Large deviations of one-hidden-layer neural networks

Christian Hirsch, Daniel Willhalm

We study large deviations in the context of stochastic gradient descent for one-hidden-layer neural networks with quadratic loss. We derive a quenched large deviation principle, wh…