We prove that every simple graph of order 12 which has minimum degree 6 contains a K_6 minor.
arXiv research
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.
Trend · papers per month
This paper classifies chiral graphs up to size 12.
Boost-and-Skip generates minority samples without guidance, faster and more effectively.
M2m method improves deep learning performance on class-imbalanced datasets.
New graph shows edge deletion/contraction doesn't always result in intrinsically linked graphs.
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…
We discuss a simple model based on the Minority Game which reproduces the main stylized facts of anomalous fluctuations in finance. We present the analytic solution of the model in the thermodynamic limit and show that stylized facts arise only close to a line of critical points with non-trivial properties. By a simple…
We introduce a simple extension of the minority game in which the market rewards contrarian (resp. trend-following) strategies when it is far from (resp. close to) efficiency. The model displays a smooth crossover from a regime where contrarians dominate to one where trend-followers dominate. In the intermediate phase,…
In this paper, we present a simple stock market model (the market game) which incorporates, as ab initio dynamics delayed majority dynamics, according to which agents (with heterogeneous strategies and price expectations) are rewarded if their actions at time t are the actions of the majority of agents at time t+1. We …
In this paper I give a brief introduction to a family of simple but non-trivial models designed to increase our understanding of collective processes in markets, the so-called Minority Games, and their non-equilibrium statistical mathematical analysis. Since the most commonly studied members of this family define disor…
A new sampling method balances imbalanced data using gamma distribution.
Optimizes portfolios using CPT utility via convex optimization.
New model explains neural collapse and limits on minority classes in imbalanced datasets.
We prove that if the minors of degree of a Sobolev map are smooth then the map is smooth, when are not both even. We use this result to derive a simple, self-contained proof of the famous Liouville theorem for conformal maps, under the weakest possible regularity assumptions, i…
In this paper we consider minors of ribbon graphs (or, equivalently, cellularly embedded graphs). The theory of minors of ribbon graphs differs from that of graphs in that contracting loops is necessary and doing this can create additional vertices and components. Thus the ribbon graph minor relation is incompatible wi…
We characterise positive braid links with positive Seifert form via a finite number of forbidden minors. From this we deduce a one-to-one correspondence between prime positive braid links with positive Seifert form and simply laced Dynkin diagrams, as well as a simple classification of alternating positive braid knots.
Paper examines fairness of data augmentation methods, finding vanilla Mixup outperforms Fair Mixup.
We propose an analytically tractable variation of the minority game in which rational agents use probabilistic strategies. In our model, agents choose between two alternatives repeatedly, and those who are in the minority get a pay-off 1, others zero. The agents optimize the expectation value of their discounted fu…
Ensembling DNNs improves minority group performance, leading to fairness.
A new oversampling framework generates minority samples by perturbing majority classes.
The paper explores how deep generative models can improve performance on imbalanced datasets.
We prove two results on the classification of trivial Legendrian embeddings of planar graphs. First, the oriented Legendrian ribbon and rotation invariant are a complete set of invariants. Second, if is 3-connected or contains as a minor, then the unique t…
The resolution and calibration of pure spectra of minority components in measurements of chemical mixtures without prior knowledge of the mixture is a challenging problem. In this work, a combination of band target entropy minimization (BTEM) and target partial least squares (T-PLS) was used to obtain estimates for sin…
Improves generation of minority samples using diffusion models.
We study a variation of the minority game. There are N agents. Each has to choose between one of two alternatives everyday, and there is reward to each member of the smaller group. The agents cannot communicate with each other, but try to guess the choice others will make, based only the past history of number of peopl…
Characterizes minor-minimal separating projective planar graphs and their generalizations.
Every infinitely edge-connected graph has a minor of Farey graph or .
Paper determines Assouad-Nagata dimension for all minor-closed metrics.
The study combines graph-minors and metric spaces, answering some questions and conjectures.
In this paper we study the continuum time dynamics of a stock in a market where agents behavior is modeled by a Minority Game and a Grand Canonical Minority Game. The dynamics derived is a generalized geometric Brownian motion; from the Black & Scholes formula the calibration of both the Minority Game and the Grand Can…
Robust cancer screening model using pre-trained ensembles for biomarkers.
Bayesian framework improves minority class performance in class-imbalanced data.
The complement of a non-separating planar graph contains a K_n minor.
Data-driven fault diagnostics and prognostics suffers from class-imbalance problem in industrial systems and it raises challenges to common machine learning algorithms as it becomes difficult to learn the features of the minority class samples. Synthetic oversampling methods are commonly used to tackle these problems b…
We review the recent approaches to modelling financial markets based on multi-agent systems. After a brief summary of the basic stylised facts observed in real-market time-series we discuss some simple agent-based systems which are currently used to model financial markets. One of the most prominent examples is here th…
The paper is partially withdrawn: in its current form, Lemma 2.3 is false, so that our proof of Theorem A and Proposition B has an important gap. We were unable to fix it yet. Any help is most welcome. We prove that the restriction of surface minority to fiber surfaces of divides is a well-quasi-order. Here surface min…
Model explains periodic trading in financial markets through game theory.
Overparameterized models can worsen minority group errors even when overall test error improves.
Bayesian model uses simple functions to forecast macroeconomic data.
In this paper it was developed a modification of the known multiagent model Minority Game, designed to simulate the behavior of traders in financial markets and the resulting price dynamics on the abstract resource. The model was implemented in the form of software. The modified version of Minority Game was investigate…
We introduce a minorization-maximization approach to optimizing common measures of discovery significance in high energy physics. The approach alternates between solving a weighted binary classification problem and updating class weights in a simple, closed-form manner. Moreover, an argument based on convex duality sho…
We introduce the minority game theory for two kinds of the Korean treasury bond (KTB) in Korean futures exchange markets. Since we discuss numerically the standard deviation and the global efficiency for an arbitrary strategy, our case is found to be approximate to the majority game. Our result presented will be compar…
Well-quasi-orders proved on embedded planar graphs.
We list more than 200 new examples of minor minimal intrinsically knotted graphs and describe many more that are intrinsically knotted and likely minor minimal.
AGGAN uses genetic algorithm with simulated annealing to generate minority class data.
We show that any self-complementary graph with vertices contains a minor. We derive topological properties of self-complementary graphs.
Imbalanced data classification problem has always been a popular topic in the field of machine learning research. In order to balance the samples between majority and minority class. Oversampling algorithm is used to synthesize new minority class samples, but it could bring in noise. Pointing to the noise problems, thi…
Framework learns to transform majority to minority samples for balanced classification.