SearcharxivSearch

arXiv subjects

Aleksandr Zimin

Publications and source records attributed to Aleksandr Zimin.

3 recordsLinked to original sources

YuriiFormer: A Suite of Nesterov-Accelerated Transformers

We propose a variational framework that interprets transformer layers as iterations of an optimization algorithm acting on token embeddings. In this view, self-attention implements a gradient step of an interaction energy, while MLP layers correspond to gradient updates of a potential energy. Standard GPT-style transformers emerge as vanilla gradient descent on the resulting composite objective, implemented via Lie--Trotter splitting between these two energy functionals. This perspective enables principled architectural design using classical optimization ideas. As a proof of concept, we introduce a Nesterov-style accelerated transformer that preserves the same attention and MLP oracles. The resulting architecture consistently outperforms a nanoGPT baseline on TinyStories and OpenWebText, demonstrating that optimization-theoretic insights can translate into practical gains.

cs.LG

Bond percolation does not simulate site percolation

We show that a site percolation is a stronger model than a bond percolation. We use the van den Berg -- Kesten (vdBK) inequality to prove that site percolation on a neighborhood of a vertex of degree $4$ cannot be simulated even approximately by bond percolation, and develop a decision tree technique to prove the same for a neighborhood of a vertex of degree $3$. This technique can be used to obtain inequalities for connectedness probabilities, including a conjectured inequality of Erik Aas.

math.PR

The bunkbed conjecture is false

We give an explicit counterexample to the Bunkbed Conjecture introduced by Kasteleyn in 1985. The counterexample is given by a planar graph on $7222$ vertices, and is built on the recent work of Hollom (2024).

math.CO