Indexed text attachment
evolutionary-game-theory-in-machine-learning-and-ai.tex
Source for Evolutionary Game Theory in Machine Learning and AI: Naturality, Regret, and Recurrence
View paper · Download original file
Lines 441–540 of 725. Source text is displayed literally.
441Training by self-play, leagues and population-based methods all need to say which of a set of agents is442better \cite{Vin19,LZG17}. The data is an \term{evaluation matrix}: an antisymmetric $K$ with $K_{ij}$ the443advantage of agent $i$ over agent $j$, for instance the log-odds of winning. This is a symmetric zero-sum game444on the set of agents, and an \term{evaluation method} assigns to it a score vector or a distribution on agents.445 446\begin{theorem}[Ratings and cycles]\label{thm:hodge}447\Sli[\cite{JLYY11,BTPG18}] Every antisymmetric $K$ decomposes uniquely and orthogonally as448\[ K_{ij}=(r_i-r_j)+C_{ij},\quad r_i=\tfrac1n\textstyle\sum_jK_{ij},\quad\textstyle\sum_jC_{ij}=0. \]449The first part satisfies $G_{ij}+G_{jk}+G_{ki}=0$ on every triple, and every matrix satisfying this is of that450form. The second part carries the same curl $K_{ij}+K_{jk}+K_{ki}$ as $K$.451\end{theorem}452 453\noindent The ratings $r$ are the least-squares fit of an Elo-like scale; the \term{transitivity index}454$\|G\|^2/\|K\|^2$ measures how much of the data a scale can explain. For five agents with planted ratings and one455planted cycle of strength $0.5$ among three of them, the decomposition returned the ratings456$(0.7,0.3,0,-0.3,-0.7)$, index $0.885$ and curl $1.5$ on the planted triple. \chk{B12} That closed implies457exact is the vanishing of the first cohomology of a simplex.458 459\begin{proposition}[Incomplete comparisons]\label{prop:harmonic}460\Sli[\cite{JLYY11}] If only some pairs of agents have been compared, the decomposition acquires a third,461harmonic component: circulations around loops of the comparison graph that bound no triple of mutually462compared agents. It is locally consistent and globally not a rating, and its dimension is the first Betti463number of the comparison complex.464\end{proposition}465 466\noindent Four agents compared only around a square, each beating the next by one unit, give the smallest467example: zero divergence, no triangles, nothing to fit. \chk{B15} Sparse tournament schedules create such468classes by design.469 470The naturality criterion of \Cref{sec:setting} applies to evaluation unchanged. A league that contains two471copies of an agent, or ten near-copies obtained from one checkpoint, should not be ranked differently for472that reason.473 474\begin{proposition}[Naturality of evaluation methods]\label{prop:evalnat}475\Sob Let $f\colon(S,K)\to(T,K')$ be a clone map between evaluation games.476\begin{enumerate}[label=(\alph*),leftmargin=1.5em,itemsep=1pt,topsep=2pt]477\item Mean score against the field, $s_i=\frac1n\sum_jK_{ij}$, is not natural: duplicating an agent raises the478score of everything that beats it.479\item The set of Nash equilibria is natural: $x$ is an equilibrium of $(S,K)$ if and only if $f_*x$ is one of480$(T,K')$. When the equilibrium of $(T,K')$ is unique, every rule that selects an equilibrium is therefore481natural on types. Invariance to redundant agents is the stated aim of Nash averaging \cite{BTPG18}.482\item The time average of replicator self-play is natural, and when $(T,K')$ has a unique interior equilibrium483it assigns to each type its equilibrium mass.484\item The stationary distribution of the small-mutation chain in which a monomorphic population is invaded by485a mutant drawn uniformly from the other \emph{names}, with transition probability given by the fixation486probability, is not natural.487\end{enumerate}488\end{proposition}489\begin{proof}490(a) and (d) by example, below. (b) Payoffs against $f_*x$ at the types are the payoffs against $x$ at the491agents, and a clone map omits no type \cite[Prop.~1.10]{EGHC}. (c) By \Cref{thm:natural}(a), $f_*$ carries492trajectories to trajectories and hence time averages to time averages; the time-average theorem for the493replicator equation \cite{HoSi98} identifies the limit.494\end{proof}495 496\noindent \emph{The example.} Rock, a second copy of Rock, Paper, Scissors. Mean scores are $(0,0,0.25,-0.25)$:497Paper looks best and Scissors worst, although the game is symmetric among the three types. The498time-averaged replicator mass on the types is $(0.3334,0.3333,0.3333)$. \chk{B13} The small-mutation chain,499uniform on plain Rock--Paper--Scissors, gives $(0.2,0.2,0.4,0.2)$ on the four names: Rock's type has mass $0.4$,500Paper $0.4$ and Scissors $0.2$. \chk{B14} The reason is visible in the chain: a population of Scissors is now501invaded twice as often.502 503\begin{remark}[Chain components]\label{rem:mcc}504The chain in (d) is in the manner of $\alpha$-Rank \cite{OPP19}, which ranks agents by the stationary505distribution of a Markov chain on strategy profiles built from fixation probabilities, and which grounds the506construction in Conley's theory: the long-run behaviour of a dynamical system is carried by its chain507recurrent set, and Markov--Conley chains are a finite model of the sink components. This is the right508generalization of equilibrium for games that cycle \cite{PaPi19}, and the dynamical content is natural: chain509components of a natural flow map into chain components. Statement (d) concerns only the mutation kernel of510our small implementation, which counts names; we make no claim about $\alpha$-Rank as published or as used.511A kernel that draws mutants by type would restore invariance, at the price of knowing the types.512\end{remark}513 514\section{Finite populations of learners}\label{sec:pop}515 516Population-based training keeps $N$ agents, lets better ones overwrite worse ones, and perturbs the copies517\cite{Jad17}. With copying in proportion to fitness and one replacement at a time this is the Moran process518of population genetics, and its classical theory applies \cite{Now06,EGHC}.519 520\begin{theorem}[Fixation and the one-third law]\label{thm:third}521\Sli[\cite{NSTF04}] Let two variants play a coordination game: each does best against its own kind, and522the newcomer must exceed a fraction $x^*$ of the population before it is favoured. Under weak selection in a523large population a single newcomer takes over with probability greater than the neutral value $1/N$ if and524only if $x^*<\tfrac13$.525\end{theorem}526 527\noindent With $N=400$ and selection intensity $10^{-3}$, $N\rho$ was $1.021$, $1.009$, $0.991$ and $0.958$ at528$x^*=0.25$, $0.30$, $0.36$ and $0.45$. \chk{B16} The deterministic dynamics says that a new convention, protocol529or shared representation cannot invade from rarity at all when it needs partners; the finite population says530it can, by drift, and when it is more likely than chance to do so.531 532\begin{theorem}[The copying topology matters]\label{thm:graph}533\Sli[\cite{LHN05}] Let offspring of agent $i$ replace agent $j$ with probability $w_{ij}$. The fixation534probability of a variant of relative fitness $r$ equals the well-mixed value $(1-r^{-1})/(1-r^{-N})$ for all $r$535if and only if $W$ is doubly stochastic. A star amplifies selection. On a directed line, in which each536agent copies only its predecessor, fixation has probability $1/N$ whatever the fitness.537\end{theorem}538 539\noindent For $N=6$ and $r=1.2$ the exact values are $0.167$ on the line, $0.251$ well-mixed and $0.287$ on the540star. \chk{B17} The design reading is direct. Symmetric exchange between agents, of any shape, neither helps