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.
Framework for multi-agent RL with human feedback in a Snake game.
This paper presents a novel approach to the technical analysis of wireheading in intelligent agents. Inspired by the natural analogues of wireheading and their prevalent manifestations, we propose the modeling of such phenomenon in Reinforcement Learning (RL) agents as psychological disorders. In a preliminary step tow…
Study reveals CR structure of snake robot's geometry.
Paper studies geometric and combinatorial properties of circular snakes.
The snake charmer algorithm permits us to deform a piecewise smooth curve starting from the origin in R^d, so that its end follows a given path. When this path is a loop, a holonomy phenomenon occurs. We prove that the holonomy orbits are closed manifolds diffeomorphic to real Stiefel manifolds. A survey of the snake c…
The purpose of this paper is to give a simpler proof to the problem of controllability of a Hilbert snake \cite{PeSa}. Using the action of the Möbius group of the unit sphere on the configuration space, in the context of a separable Hilbert space. We give a generalization of the Theorem of accessibility contained in \c…
The vision systems of the eagle and the snake outperform everything that we can make in the laboratory, but snakes and eagles cannot build an eyeglass or a telescope or a microscope. (Judea Pearl)
A new snake model improves segmentation of SEM images.
Quantum trace map connects Teichmüller theory and quantum groups.
We present a new and very concrete connection between cluster algebras and knot theory. This connection is being made via continued fractions and snake graphs. It is known that the class of 2-bridge knots and links is parametrized by continued fractions, and it has recently been shown that one can associate to each con…
Link Floer homology is split into snake complexes and local systems.
We show that the Snake on a square is homotopy equivalent to the space which was investigated in the previous work by Eda, Karimov and Repov\vs. We also introduce related constructions and and investigate homotopical differences between these four constructions. Finally, we explici…
We construct a privileged system of coordinates with respect to the controlling distribution of a trident snake robot and, furthermore, we construct a nilpotent approximation with respect to the given filtration. Note that all constructions are local in the neighbourhood of a particular point. We compare the motions co…
Lecture notes on Teichmüller spaces with boundary examples.
New q-deformed integers help compute Jones polynomials efficiently.
A regularized optimization problem over a large unstructured graph is studied, where the regularization term is tied to the graph geometry. Typical regularization examples include the total variation and the Laplacian regularizations over the graph. When applying the proximal gradient algorithm to solve this problem, t…
Under appropriate assumptions, we generalize the concept of linear almost Poisson struc- tures, almost Lie algebroids, almost differentials in the framework of Banach anchored bundles and the relation between these objects. We then obtain an adapted formalism for mechanical systems which is illustrated by the evolution…
The non-convexity of a smooth and compact connected component of a real algebraic plane curve can be measured by a combinatorial object called the Poincare-Reeb tree associated to the curve and to a direction of projection. In this paper we show that if the chosen projection avoids the bitangents and the inflectional t…
Recently, it has been shown that the Jones polynomial, in [LS19], and the Alexander polynomial, in [NT18], of rational knots can be obtained by specializing -polynomials of cluster variables. At the core of both results are continued fractions, which parameterize rational knots and are used to obtain cluster variabl…
We generalise surface cluster algebras to the case of infinite surfaces where the surface contains finitely many accumulation points of boundary marked points. To connect different triangulations of an infinite surface, we consider infinite mutation sequences. We show transitivity of infinite mutation sequences on tria…
This paper was motivated by work of Arnold where he explains how to count "snakes", i.e. Morse functions on the real axis with prescribed behavior at infinity. This leads immediately to a count of excellent Morse functions on the circle, where following Thom's terminology, excellent means that no two critical points li…
Paper presents content-based models for game recommendation in cold start scenarios.
In this work, we ask the following question: Can visual analogies, learned in an unsupervised way, be used in order to transfer knowledge between pairs of games and even play one game using an agent trained for another game? We attempt to answer this research question by creating visual analogies between a pair of game…
Potential games, originally introduced in the early 1990's by Lloyd Shapley, the 2012 Nobel Laureate in Economics, and his colleague Dov Monderer, are a very important class of models in game theory. They have special properties such as the existence of Nash equilibria in pure strategies. This note introduces graphical…
TAMIS improves MIA on synthetic data, reducing cost and requiring less knowledge.
IGGP learns game rules from varying quality game play, finding no overall trend.
We introduce a topological combinatorial game called the Region Smoothing Swap Game. The game is played on a game board derived from the connected shadow of a link diagram on a (possibly non-orientable) surface by smoothing at crossings. Moves in the game are performed on regions of the diagram and can switch the direc…
We present a new general board game (GBG) playing and learning framework. GBG defines the common interfaces for board games, game states and their AI agents. It allows one to run competitions of different agents on different games. It standardizes those parts of board game playing and learning that otherwise would be t…
Just as war is sometimes fallaciously represented as a zero sum game -- when in fact war is a negative sum game - stock market trading, a positive sum game over time, is often erroneously represented as a zero sum game. This is called the "zero sum fallacy" -- the erroneous belief that one trader in a stock market exch…
The existence of stationary Markov perfect equilibria in stochastic games is shown under a general condition called "(decomposable) coarser transition kernels". This result covers various earlier existence results on correlated equilibria, noisy stochastic games, stochastic games with finite actions and state-independe…
Game theory helps analyze ESOs/EBIs in production and service sectors.
Combinatorial two-player games have recently been applied to knot theory. Examples of this include the Knotting-Unknotting Game and the Region Unknotting Game, both of which are played on knot shadows. These are turn-based games played by two players, where each player has a separate goal to achieve in order to win the…
We start briefly surveying research on optimal stopping games since their introduction by E.B.Dynkin more than 40 years ago. Recent renewed interest to dynkin's games is due, in particular, to the study of Israeli (game) options introduced in 2000. We discuss the work on these options and related derivative securities …
The paper explores how regularization can lead to convergence in imperfect information games.
Educational game on crypto investment helps students grasp macroeconomics.
Simplified NFT games discussed with methods for extracting value.
We introduce TextWorld, a sandbox learning environment for the training and evaluation of RL agents on text-based games. TextWorld is a Python library that handles interactive play-through of text games, as well as backend functions like state tracking and reward assignment. It comes with a curated list of games whose …
Paper tackles hidden game problem in AI alignment and language games.
AEC Games model represents software MARL environments better than POSGs.
Gradient Descent Ascent converges to von-Neumann solution in hidden zero-sum games.
Generalizes region select game to -colored knot diagrams.
We introduce CSE for MLSF games and devise online learning algorithms for achieving no-external Stackelberg-regret.
Deep Reinforcement Learning automates match-3 game testing.
Unified framework for Bayesian and Frequentist statistics.
New game approximates mean curvature flow evolution.
Study on mean field games with singular controls and their applications.
Gradient methods converge exponentially in concave network games.
Federated learning linked to mean-field games for large-scale learning.