Research
On-device research index

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.

168,742 papers · 148 categories

Trend · papers per month

75149224298 · Jun 202019922001200920172026
48 results for simple minors

Boost-and-Skip generates minority samples without guidance, faster and more effectively.

problem Generating minority samples in low-density regions of a data manifold.
method Boost-and-Skip approach with variance-boosted initialization and timestep skipping.
result Boost-and-Skip effectively promotes the emergence of underrepresented minority features.

M2m method improves deep learning performance on class-imbalanced datasets.

problem Class imbalance in labeled training datasets causes deep neural networks to generalize poorly to minority classes.
method Augment less-frequent classes by translating samples from more-frequent classes.
result Significantly improves generalization on minority classes compared to existing methods.

New graph shows edge deletion/contraction doesn't always result in intrinsically linked graphs.

problem Edge operations in intrinsically knotted graphs don't always produce intrinsically linked graphs.
method Presented a new intrinsically knotted graph.
result Edge operations in intrinsically knotted graphs don'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…

2007-06-29abs ↗pdf ↗

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,…

2004-03-26abs ↗pdf ↗

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 …

2003-11-26abs ↗pdf ↗

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…

2002-05-13abs ↗pdf ↗

New model explains neural collapse and limits on minority classes in imbalanced datasets.

problem Understanding and predicting performance limits of deep learning models on imbalanced datasets.
method Layer-Peeled Model, a nonconvex optimization program isolating top layers and applying constraints.
result Reveals a new phenomenon called Minority Collapse that limits deep learning models on minority classes.

We prove that if the minors of degree kk of a Sobolev map RdRd\mathbb{R}^d \to \mathbb{R}^d are smooth then the map is smooth, when k,dk,d 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…

2018-05-18abs ↗pdf ↗

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…

2013-11-09abs ↗pdf ↗

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.

2012-11-20abs ↗pdf ↗

Paper examines fairness of data augmentation methods, finding vanilla Mixup outperforms Fair Mixup.

problem Improving fairness in classification models with limited minority data.
method Uses multicalibration to rigorously evaluate and improve data augmentation methods for classification fairness.
result Vanilla Mixup outperforms Fair Mixup and baseline methods in fairness and accuracy, especially with small minority groups.

We propose an analytically tractable variation of the minority game in which rational agents use probabilistic strategies. In our model, NN 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…

2012-12-29abs ↗pdf ↗

A new oversampling framework generates minority samples by perturbing majority classes.

problem Oversampling in imbalanced classification often neglects majority classes, leading to samples spread across the minority space.
method Introduces a counterfactual objective to generate new minority samples by perturbing majority samples.
result Generated minority samples are near the decision boundary and significantly outperform state-of-the-art methods.

The paper explores how deep generative models can improve performance on imbalanced datasets.

problem Imbalanced datasets lead to poor classifier performance and misleading evaluation metrics.
method The paper studies deep generative models for oversampling minority classes in imbalanced tabular data.
result Deep generative models can improve performance on imbalanced classification tasks, but require different under- and oversampling ratios.

We prove two results on the classification of trivial Legendrian embeddings g:G(S3,ξstd)g: G \rightarrow (S^3,ξ_{std}) of planar graphs. First, the oriented Legendrian ribbon RgR_g and rotation invariant rotg\text{rot}_g are a complete set of invariants. Second, if GG is 3-connected or contains K4K_4 as a minor, then the unique t…

2016-04-04abs ↗pdf ↗

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…

2011-02-21abs ↗pdf ↗

Every infinitely edge-connected graph has a minor of Farey graph or T0tT_{\aleph_0}\ast t.

problem Characterizing edge-connected graphs with specific minor properties.
method Analyzing the minor structure of infinitely edge-connected graphs.
result Infinitely edge-connected graphs contain Farey graph or T0tT_{\aleph_0}\ast t as a minor.

Paper determines Assouad-Nagata dimension for all minor-closed metrics.

problem Understanding the Assouad-Nagata dimension of minor-closed metrics.
method Using edge-weighted graphs and edge-deletion/contraction to model minor-closed metrics, determining their Assouad-Nagata dimension.
result Determined the Assouad-Nagata dimension for every minor-closed metric.

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…

2012-05-11abs ↗pdf ↗

Robust cancer screening model using pre-trained ensembles for biomarkers.

problem Detecting early-stage cancer, especially in hard-to-diagnose cases like pancreatic cancer.
method Meta-trained Hyperfast model for robust classification, combined with ensembling of XGBoost and LightGBM.
result Achieved highest AUC of 0.9929 and robust performance on imbalanced datasets.

Bayesian framework improves minority class performance in class-imbalanced data.

problem Class imbalance in predictive toxicology models.
method Weighted likelihood approach modifying likelihood function weights inversely proportional to class proportions.
result Improves balanced accuracy and sensitivity for minority class (toxic compounds).

The complement of a non-separating planar graph contains a K_n minor.

problem Characterizing the structure of complements of planar graphs.
method Analyzing the structure of complements of non-separating planar graphs and using examples to illustrate hypotheses.
result The order 2n-3 is the lowest possible for a non-separating planar graph whose complement contains a K_n minor.

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…

2012-11-30abs ↗pdf ↗

Overparameterized models can worsen minority group errors even when overall test error improves.

problem Overparameterization exacerbates spurious correlations, harming minority groups.
method Simulations and experiments on image datasets, theoretical analysis of linear models.
result Subsampling the majority group can achieve low minority error in overparameterized models.

Bayesian model uses simple functions to forecast macroeconomic data.

problem Forecasting large datasets in macroeconomics with complex nonlinear relationships.
method Sum of simple two-component location mixtures, logistic function threshold, conjugate priors.
result Accurate point and density forecasts in US macroeconomic aggregates.

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…

2005-03-01abs ↗pdf ↗

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…

2019-08-30abs ↗pdf ↗

Framework learns to transform majority to minority samples for balanced classification.

problem Imbalanced classification leading to biased predictions.
method Minimizes MMD and uses triplet loss for global alignment and boundary awareness.
result Consistent improvements over classical and generative baselines in AUROC, G-mean, F1-score, and MCC.