1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
|
\documentclass[a4paper]{letter}
\usepackage[utf8]{inputenc} % why not type "Bézout" with unicode?
\usepackage[T1]{fontenc} % vector fonts plz
\usepackage{newtxtext,newtxmath} % Times for PR
\usepackage[
colorlinks=true,
urlcolor=purple,
linkcolor=black,
citecolor=black,
filecolor=black
]{hyperref} % ref and cite links with pretty colors
\usepackage{xcolor}
\usepackage[style=phys]{biblatex}
\addbibresource{bezout.bib}
\signature{
\vspace{-6\medskipamount}
\smallskip
Jaron Kent-Dobias \& Jorge Kurchan
}
\address{
Laboratoire de Physique\\
Ecole Normale Sup\'erieure\\
24 rue Lhomond\\
75005 Paris
}
\begin{document}
\begin{letter}{
Editorial Office\\
Physical Review Letters\\
1 Research Road\\
Ridge, NY 11961
}
\opening{To the editors of Physical Review,}
We wish to appeal the decision on our manuscript \emph{How to count in
hierarchical landscapes: A ‘full’ solution to mean-field complexity}, which was
rejected without being sent to referees.
The problem of characterizing the geometry of complex energy and cost
landscapes is long-standing. Until this work, no correct calculation had been
made for the complexity of systems without a so-called replica symmetric
solution, which represent an small minority of systems. We show explicitly how
such calculations can be made for the vast majority of cases.
Landscape complexity even for the simple models we consider is relevant to a
broad spectrum of physics disciplines. These models appear explicitly in modern
research of machine learning, like tensor denoising, and understanding how
complexity, dynamics, and equilibrium interplay in them provides powerful analogies
and insights into emergent phenomena in more complicated contexts, from
realistic machine learning models to the behavior of structural glasses.
Already in this work, we identify the surprising result that the purported
algorithmic threshold for optimization on mean-field cost functions lies
\emph{far above} the geometric threshold traditionally understood as the dynamic limit.
We urge you to allow this paper to go to referees and allow it to
be judged by other scientists at the forefront of these fields.
\closing{Sincerely,}
\vspace{1em}
\end{letter}
\end{document}
|
