A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
AlphaZero assesses new chess variants for balance and dynamics.
Crazyhouse is a chess variant that incorporates all of the classical chess rules, but allows users to drop pieces captured from the opponent as a normal move. Until 2018, all competitive computer engines for this board game made use of an alpha-beta pruning algorithm with a hand-crafted evaluation function for each pos…
We present an end-to-end learning method for chess, relying on deep neural networks. Without any a priori knowledge, in particular without any knowledge regarding the rules of chess, a deep neural network is trained using a combination of unsupervised pretraining and supervised training. The unsupervised training extra…
Transformers learn to predict chess moves with surprising accuracy and strength.
This article reports on an investigation of the use of convolutional neural networks to predict the visual attention of chess players. The visual attention model described in this article has been created to generate saliency maps that capture hierarchical and spatial features of chessboard, in order to predict the pro…
Chess engines Stockfish and LCZero differ in their approach to solving endgame puzzles.
AlphaZero learns human chess knowledge during training.
This paper demonstrates the use of genetic algorithms for evolving: 1) a grandmaster-level evaluation function, and 2) a search mechanism for a chess program, the parameter values of which are initialized randomly. The evaluation function of the program is evolved by learning from databases of (human) grandmaster games…
In this paper we demonstrate how genetic algorithms can be used to reverse engineer an evaluation function's parameters for computer chess. Our results show that using an appropriate expert (or mentor), we can evolve a program that is on par with top tournament-playing chess programs, outperforming a two-time World Com…
AlphaZero reveals new chess concepts learnable by top experts.
Dimensionality reduction is ubiquitous in analysis of complex dynamics. The conventional dimensionality reduction techniques, however, focus on reproducing the underlying configuration space, rather than the dynamics itself. The constructed low-dimensional space does not provide complete and accurate description of the…
In this paper we demonstrate how genetic algorithms can be used to reverse engineer an evaluation function's parameters for computer chess. Our results show that using an appropriate mentor, we can evolve a program that is on par with top tournament-playing chess programs, outperforming a two-time World Computer Chess …
This paper demonstrates the use of genetic algorithms for evolving a grandmaster-level evaluation function for a chess program. This is achieved by combining supervised and unsupervised learning. In the supervised learning phase the organisms are evolved to mimic the behavior of human grandmasters, and in the unsupervi…
Language models trained on chess board states outperform those on moves, even with causal masking.
ESCHER avoids importance sampling to estimate regret in large games.
We prove that the homotopy class of a Morin mapping f: P^p --> Q^q with p-q odd contains a cusp mapping. This affirmatively solves a strengthened version of the Chess conjecture [DS Chess, A note on the classes [S_1^k(f)], Proc. Symp. Pure Math., 40 (1983) 221-224] and [VI Arnol'd, VA Vasil'ev, VV Goryunov, OV Lyashenk…
Constructing agents with planning capabilities has long been one of the main challenges in the pursuit of artificial intelligence. Tree-based planning methods have enjoyed huge success in challenging domains, such as chess and Go, where a perfect simulator is available. However, in real-world problems the dynamics gove…
In this paper we present the first results of a pilot experiment in the capture and interpretation of multimodal signals of human experts engaged in solving challenging chess problems. Our goal is to investigate the extent to which observations of eye-gaze, posture, emotion and other physiological signals can be used t…
The paper proposes a method to evaluate superhuman models by checking for logical inconsistencies.
In this paper we construct and study a new 15-vertex triangulation of the complex projective plane $\CP^2$. The automorphism group of is isomorphic to . We prove that the triangulation is the minimal by the number of vertices triangulation of $\CP^2$ admitting a chess colouring of four-dimens…
New approach handles stochastic and partially-observable environments using discrete autoencoders and Monte Carlo tree search.
From the early days of computing, games have been important testbeds for studying how well machines can do sophisticated decision making. In recent years, machine learning has made dramatic advances with artificial agents reaching superhuman performance in challenge domains like Go, Atari, and some variants of poker. A…
Monte Carlo Tree Search improves financial derivative hedging efficiency.
In ranking problems, the goal is to learn a ranking function from labeled pairs of input points. In this paper, we consider the related comparison problem, where the label indicates which element of the pair is better, or if there is no significant difference. We cast the learning problem as a margin maximization, and …
A core novelty of Alpha Zero is the interleaving of tree search and deep learning, which has proven very successful in board games like Chess, Shogi and Go. These games have a discrete action space. However, many real-world reinforcement learning domains have continuous action spaces, for example in robotic control, na…
AlphaZero's reward function is replaced with a total ordering, enabling self-play without balancing.
AEC Games model represents software MARL environments better than POSGs.
Parallelizes MCTS for continuous domains using leaf and root parallelization.
The game of Chinese Checkers is a challenging traditional board game of perfect information that differs from other traditional games in two main aspects: first, unlike Chess, all checkers remain indefinitely in the game and hence the branching factor of the search tree does not decrease as the game progresses; second,…
Study shows Elo models fail to accurately measure transitive strength in competitive games.
AR CI framework handles complex confounders and sequential actions.
Zero-sum games such as chess and poker are, abstractly, functions that evaluate pairs of agents, for example labeling them `winner' and `loser'. If the game is approximately transitive, then self-play generates sequences of agents of increasing strength. However, nontransitive games, such as rock-paper-scissors, can ex…
The Bradley-Terry model is a popular approach to describe probabilities of the possible outcomes when elements of a set are repeatedly compared with one another in pairs. It has found many applications including animal behaviour, chess ranking and multiclass classification. Numerous extensions of the basic model have a…
MuZero visualizes its internal representations to stabilize planning.
FGNNs improve game-playing AI by exploiting symmetries.
A key feature of inductive logic programming (ILP) is its ability to learn first-order programs, which are intrinsically more expressive than propositional programs. In this paper, we introduce techniques to learn higher-order programs. Specifically, we extend meta-interpretive learning (MIL) to support learning higher…
GPT learns a causal world model from token predictions, validated in game sequences.
VEGN uses graph neural networks to predict disease-causing mutations from genetic variants.
Han discusses variants of digital covering maps and their equivalences.
Framework uses machine learning to distinguish major COVID-19 variants.
Counterexample disproves recent Penrose conjecture variant.
The paper evaluates three variants of the Gated Recurrent Unit (GRU) in recurrent neural networks (RNN) by reducing parameters in the update and reset gates. We evaluate the three variant GRU models on MNIST and IMDB datasets and show that these GRU-RNN variant models perform as well as the original GRU RNN model while…
Equivariant MuZero improves generalization in procedurally generated environments.
In this paper, we introduce and study various kinds of decomposition complexity. First, we give a characterization of residually finite groups having finite decomposition complexity (FDC). Secondly, we introduce equi-variant straight FDC (sFDC), and prove that a group having equi-variant sFDC if and only if its box spa…
Deep RL shows promise in algo trading, but more research needed.
The paper categorizes and analyzes various event-linked perpetual futures contracts.
DNA sequencing to identify genetic variants is becoming increasingly valuable in clinical settings. Assessment of variants in such sequencing data is commonly implemented through Bayesian heuristic algorithms. Machine learning has shown great promise in improving on these variant calls, but the input for these is still…
Fast and cheaper next generation sequencing technologies will generate unprecedentedly massive and highly-dimensional genomic and epigenomic variation data. In the near future, a routine part of medical record will include the sequenced genomes. A fundamental question is how to efficiently extract genomic and epigenomi…