SearcharxivSearch

arXiv subjects

Rosa Gini

Publications and source records attributed to Rosa Gini.

7 recordsLinked to original sources

Score vs. Winrate in Score-Based Games: which Reward for Reinforcement Learning?

In the last years, the DeepMind algorithm AlphaZero has become the state of the art to efficiently tackle perfect information two-player zero-sum games with a win/lose outcome. However, when the win/lose outcome is decided by a final score difference, AlphaZero may play score-suboptimal moves because all winning final positions are equivalent from the win/lose outcome perspective. This can be an issue, for instance when used for teaching, or when trying to understand whether there is a better move. Moreover, there is the theoretical quest for the perfect game. A naive approach would be training an AlphaZero-like agent to predict score differences instead of win/lose outcomes. Since the game of Go is deterministic, this should as well produce an outcome-optimal play. However, it is a folklore belief that "this does not work". In this paper, we first provide empirical evidence for this belief. We then give a theoretical interpretation of this suboptimality in general perfect information two-player zero-sum game where the complexity of a game like Go is replaced by the randomness of the environment. We show that an outcome-optimal policy has a different preference for uncertainty when it is winning or losing. In particular, when in a losing state, an outcome-optimal agent chooses actions leading to a higher score variance. We then posit that when approximation is involved, a deterministic game behaves like a nondeterministic game, where the score variance is modeled by how uncertain the position is. We validate this hypothesis in AlphaZero-like software with a human expert.

cs.AI

SAI: a Sensible Artificial Intelligence that plays with handicap and targets high scores in 9x9 Go (extended version)

We develop a new model that can be applied to any perfect information two-player zero-sum game to target a high score, and thus a perfect play. We integrate this model into the Monte Carlo tree search-policy iteration learning pipeline introduced by Google DeepMind with AlphaGo. Training this model on 9x9 Go produces a superhuman Go player, thus proving that it is stable and robust. We show that this model can be used to effectively play with both positional and score handicap, and to minimize suboptimal moves. We develop a family of agents that can target high scores against any opponent, and recover from very severe disadvantage against weak opponents. To the best of our knowledge, these are the first effective achievements in this direction.

cs.AI

SAI, a Sensible Artificial Intelligence that plays Go

We propose a multiple-komi modification of the AlphaGo Zero/Leela Zero paradigm. The winrate as a function of the komi is modeled with a two-parameters sigmoid function, so that the neural network must predict just one more variable to assess the winrate for all komi values. A second novel feature is that training is based on self-play games that occasionally branch -- with changed komi -- when the position is uneven. With this setting, reinforcement learning is showed to work on 7x7 Go, obtaining very strong playing agents. As a useful byproduct, the sigmoid parameters given by the network allow to estimate the score difference on the board, and to evaluate how much the game is decided.

cs.AI

Reduction of Vaisman structures in complex and quaternionic geometry

We consider locally conformal Kaehler geometry as an equivariant (homothetic) Kaehler geometry: a locally conformal Kaehler manifold is, up to equivalence, a pair (K,Γ) where K is a Kaehler manifold and Γa discrete Lie group of biholomorphic homotheties acting freely and properly discontinuously. We define a new invariant of a locally conformal Kaehler manifold (K,Γ) as the rank of a natural quotient of Γ, and prove its invariance under reduction. This equivariant point of view leads to a proof that locally conformal Kaehler reduction of compact Vaisman manifolds produces Vaisman manifolds and is equivalent to a Sasakian reduction. Moreover we define locally conformal hyperkaehler reduction as an equivariant version of hyperkaehler reduction and in the compact case we show its equivalence with 3-Sasakian reduction. Finally we show that locally conformal hyperkaehler reduction induces hyperkaehler with torsion (HKT) reduction of the associated HKT structure and the two reductions are compatible, even though not every HKT reduction comes from a locally conformal hyperkaehler reduction.

math.DG

The graded cobordism group of codimension-one immersions

The cobordism group $N(M^n)$ of codimension-one immersions in the $n$-manifold $M^n$ has a natural filtration induced by any cellular decomposition. The problem addressed in this paper is the explicit computation of the graded group $gr^*N(M^n)$. We introduce some new invariants for immersions enlightening the Atiyah-Hirzebruch spectral sequence associated to $N(M)$, which are of combinatorial-geometric nature. Explicit computations are developed for $n\leq7$, and the group structure is also investigated for orientable 4-manifolds.

math.GT

Locally conformal Kaehler reduction

We define reduction of locally conformal Kaehler manifolds, considered as conformal Hermitian manifolds, and we show its equivalence with an unpublished construction given by Biquard and Gauduchon. We show the compatibility between this reduction and Kaehler reduction of the universal cover. By a recent result of Kamishima and the second author, in the Vaisman case (that is, when a metric in the conformal class has parallel Lee form) if the manifold is compact its universal cover comes equipped with the structure of Kaehler cone over a Sasaki compact manifold. We show the compatibility between our reduction and Sasaki reduction, hence describing a subgroup of automorphisms whose action causes reduction to bear a Vaisman structure. Then we apply this theory to construct a wide class of Vaisman manifolds.

math.DG