SearcharxivSearch

arXiv subjects

Zhenfeng Tu

Publications and source records attributed to Zhenfeng Tu.

2 recordsLinked to original sources

Oriented planar maps and annular mating of trees

We study a class of oriented annular planar maps which are closely related to bipolar-oriented maps. We prove that such maps can be encoded by a 2D lattice walk which converges to a 2D Brownian path in the scaling limit. We further prove a mating-of-trees result for the annulus, where the aforementioned Brownian path and a generalization encodes an LQG annulus decorated by a counterclockwise space-filling SLE loop with parameter $\gamma=16\kappa^{-1/2}\in(0,2)$.

math.PR

Mixed Dynamics In Linear Networks: Unifying the Lazy and Active Regimes

The training dynamics of linear networks are well studied in two distinct setups: the lazy regime and balanced/active regime, depending on the initialization and width of the network. We provide a surprisingly simple unifying formula for the evolution of the learned matrix that contains as special cases both lazy and balanced regimes but also a mixed regime in between the two. In the mixed regime, a part of the network is lazy while the other is balanced. More precisely the network is lazy along singular values that are below a certain threshold and balanced along those that are above the same threshold. At initialization, all singular values are lazy, allowing for the network to align itself with the task, so that later in time, when some of the singular value cross the threshold and become active they will converge rapidly (convergence in the balanced regime is notoriously difficult in the absence of alignment). The mixed regime is the `best of both worlds': it converges from any random initialization (in contrast to balanced dynamics which require special initialization), and has a low rank bias (absent in the lazy dynamics). This allows us to prove an almost complete phase diagram of training behavior as a function of the variance at initialization and the width, for a MSE training task.

cs.LG