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.
Generalizes region select game to -colored knot diagrams.
New game defined on origami patterns, linking number introduced.
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…
New approach reduces simulator exploitation by improving strategic robustness.
New approach reduces simulator exploitation by learning robust models.
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…
Reinforcement Learning(RL) with sparse rewards is a major challenge. We propose \emph{Hindsight Trust Region Policy Optimization}(HTRPO), a new RL algorithm that extends the highly successful TRPO algorithm with \emph{hindsight} to tackle the challenge of sparse rewards. Hindsight refers to the algorithm's ability to l…
MF-TRPO optimizes MFGs with finite sample guarantees.
Despite being very effective in several classification tasks, Dynamic Ensemble Selection (DES) techniques can select classifiers that classify all samples in the region of competence as being from the same class. The Frienemy Indecision REgion DES (FIRE-DES) tackles this problem by pre-selecting classifiers that correc…
Dynamic classifier selection systems aim to select a group of classifiers that is most adequate for a specific query pattern. This is done by defining a region around the query pattern and analyzing the competence of the classifiers in this region. However, the regions are often surrounded by noise which can difficult …
Efficiently identifies best algorithms for game tasks.
New analysis shows rational actors will deploy AGI despite negative social value due to catastrophic risk.
Proposes CoPO, a new policy optimization method for competitive games.
Dynamic Ensemble Selection (DES) techniques aim to select locally competent classifiers for the classification of each new test sample. Most DES techniques estimate the competence of classifiers using a given criterion over the region of competence of the test sample (its the nearest neighbors in the validation set). T…
Visual attention serves as a means of feature selection mechanism in the perceptual system. Motivated by Broadbent's leaky filter model of selective attention, we evaluate how such mechanism could be implemented and affect the learning process of deep reinforcement learning. We visualize and analyze the feature maps of…
A game-theoretic approach selects features by testing their marginal contributions.
sBayFDNN bridges deep learning and functional data analysis for complex, structured data.
This paper gives a critical account of the minority game literature. The minority game is a simple congestion game: players need to choose between two options, and those who have selected the option chosen by the minority win. The learning model proposed in this literature seems to differ markedly from the learning mod…
Heavy-tailed distributions are frequently used to enhance the robustness of regression and classification methods to outliers in output space. Often, however, we are confronted with "outliers" in input space, which are isolated observations in sparsely populated regions. We show that heavy-tailed stochastic processes (…
New model considers wealth and time affecting risk aversion in portfolio selection.
This paper examines how adversarial perturbations affect model performance and equilibrium learning.
We study ranking quantilized mean-field games to select top-performing agents.
Selection of input features such as relevant pieces of text has become a common technique of highlighting how complex neural predictors operate. The selection can be optimized post-hoc for trained models or incorporated directly into the method itself (self-explaining). However, an overall selection does not properly c…
A new method selects regions of interest in GC-MS data without prior target selection.
si4onnx enables selective inference on deep learning models.
Study of portfolio management under relative performance concerns using mean field games.
Paper addresses theoretical risks in neural MCCFR, proposing Robust Deep MCCFR for improved performance.
We analyze the dynamics of a forecasting game which exhibits the phenomenon of information cascades. Each agent aims at correctly predicting a binary variable and he/she can either look for independent information or herd on the choice of others. We show that dynamics can be analitically described in terms of a Langevi…
Proposes a method to quantify the reliability of salient regions in deep learning models using p-values.
Paper resolves ambiguity in non-convex bilevel optimization problems.
We conduct large-scale studies on `human attention' in Visual Question Answering (VQA) to understand where humans choose to look to answer questions about images. We design and test multiple game-inspired novel attention-annotation interfaces that require the subject to sharpen regions of a blurred image to answer a qu…
CausalGame benchmarks LLM agents' causal thinking in games.
Proposes a new criterion for selecting Nash equilibria considering both utility and inequality.
Study proposes new OPE estimators for two-player zero-sum games.
Study optimal portfolios for many players in a market model with random coefficients.
New Bellman error estimator improves offline model selection performance.
Support vector data description (SVDD) is a popular technique for detecting anomalies. The SVDD classifier partitions the whole space into an inlier region, which consists of the region near the training data, and an outlier region, which consists of points away from the training data. The computation of the SVDD class…
DecoupleNets use neural networks to assess and select dependence models.
Study on investment strategy for agents with periodic preferences and discounting.
Proposes mCS for multivariate selection with FDR control.
Transforms game optimization dynamics into frequency domain for precise hyperparameter analysis.
We show that the introduction of Tobin taxes in agent-based models of currency markets can lead to a reduction of speculative trading and reduce the magnitude of exchange rate fluctuations at intermediate tax rates. In this regime revenues for the market maker obtained from speculators are maximal. We here focus on Min…
In this work we describe a novel deep reinforcement learning architecture that allows multiple actions to be selected at every time-step in an efficient manner. Multi-action policies allow complex behaviours to be learnt that would otherwise be hard to achieve when using single action selection techniques. We use both …
An automatic machine learning (AutoML) task is to select the best algorithm and its hyper-parameters simultaneously. Previously, the hyper-parameters of all algorithms are joint as a single search space, which is not only huge but also redundant, because many dimensions of hyper-parameters are irrelevant with the selec…
The paper reveals a spinning top geometry in real-world games.
We use martingale and stochastic analysis techniques to study a continuous-time optimal stopping problem, in which the decision maker uses a dynamic convex risk measure to evaluate future rewards. We also find a saddle point for an equivalent zero-sum game of control and stopping, between an agent (the "stopper") who c…
Algorithm improves RL model selection for repeated games with utility maximization.
A large body of research is currently investigating on the connection between machine learning and game theory. In this work, game theory notions are injected into a preference learning framework. Specifically, a preference learning problem is seen as a two-players zero-sum game. An algorithm is proposed to incremental…