192 citations · 482 across the 16 of their papers we have counts for
18 papers
Improved Convergence Guarantees for Shallow Neural Networks
Alexander Razborov
We continue a long line of research aimed at proving convergence of depth 2 neural networks, trained via gradient descent, to a global minimum. Like in many previous works, our mod…
Biregularity in Sidorenko's Conjecture
Leonardo N. Coregliano, Alexander A. Razborov
Sidorenko's Conjecture says that the minimum density of a bigraph in a bigraphon of a given edge density is attained when is a constant function. A consequence of a res…
Natural quasirandomness properties
Leonardo N. Coregliano, Alexander A. Razborov
The theory of quasirandomness has greatly expanded from its inaugural graph theoretical setting to several different combinatorial objects such as hypergraphs, tournaments, permuta…
Clique Is Hard on Average for Regular Resolution
Albert Atserias, Ilario Bonacina, Susanna F. de Rezende +3
We prove that for regular resolution requires length to establish that an Erdős-Rényi graph with appropriately chosen edge density does not contain a…
An Extremal Problem Motivated by Triangle-Free Strongly Regular Graphs
Alexander Razborov
We introduce the following combinatorial problem. Let be a triangle-free regular graph with edge density . What is the minimum value for which there always exist two…
Semantic Limits of Dense Combinatorial Objects
Leonardo N. Coregliano, Alexander A. Razborov
The theory of limits of discrete combinatorial objects has been thriving for the last decade or so. The syntactic, algebraic approach to the subject is popularly known as "flag alg…