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,694 papers · 148 categories

Trend · papers per month

2535077601,013 · Jun 202019922001200920172026
48 results for minority generation

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.

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.

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 ↗

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 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 ↗

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.

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.

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.

The paper analyzes how minority group imbalance affects neural network performance.

problem The impact of minority group imbalance on neural network performance.
method Formulated group imbalance problem with Gaussian Mixture Model, quantified sample complexity, convergence rate, and testing performance.
result Increasing the minority group fraction does not necessarily improve the generalization performance of the minority group.

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 ↗

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.

A learning classifier must outperform a trivial solution, in case of imbalanced data, this condition usually does not hold true. To overcome this problem, we propose a novel data level resampling method - Clustering Based Oversampling for improved learning from class imbalanced datasets. The essential idea behind the p…

2018-11-02abs ↗pdf ↗

Develops variational framework for LQG risk-sensitive MFGs with major-minor interactions.

problem Risk-sensitive optimal control in LQG systems with major-minor interactions.
method Variational approach, nonlinear necessary and sufficient condition of optimality, equivalent risk-neutral measure, Markovian closed-loop best-response strategies.
result Derives optimal control strategies for LQG risk-sensitive MFGs with major-minor interactions, establishing Nash and ε\varepsilon-Nash equilibria.

A new CA-GAN architecture improves minority class data generation in health datasets.

problem Algorithmic bias due to health data poverty and underrepresentation of minority groups.
method Proposes CA-GAN architecture to address shortcomings of resampling and GAN-based approaches.
result CA-GAN outperforms SMOTE and WGAN-GP* in generating authentic minority class data and maintaining original distribution.

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 ↗

The Synthetic Minority Oversampling TEchnique (SMOTE) is widely-used for the analysis of imbalanced datasets. It is known that SMOTE frequently over-generalizes the minority class, leading to misclassifications for the majority class, and effecting the overall balance of the model. In this article, we present an approa…

2019-08-22abs ↗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.

Study embeddability of 2-complexes in 4-space, proving Heawood family's excluded minors.

problem Whether a 2-dimensional CW complex embeds in R4\mathbb{R}^4.
method Operations preserving embeddability, constructions of non-preserving transformations, study of 4-flat graphs.
result Prove 78 graphs of Heawood family are excluded minors for 4-flat graphs.

We say that a 22-dimensional CW complex is a multibranched surface if we remove all points whose open neighborhoods are homeomorphic to the 22-dimensional Euclidean space, then we obtain a 11-dimensional complex which is homeomorphic to a disjoint union of some S1S^1's. We define the genus of a multibranched surface…

2016-03-30abs ↗pdf ↗

A new LLM-based method enhances diversity in oversampling for imbalanced classification.

problem Limited diversity in synthetic minority samples generated by current LLM-based approaches reduces robustness and generalizability.
method Condition synthetic sample generation on minority labels and features, use permutation strategy for fine-tuning, fine-tune on minority and interpolated samples.
result Significantly outperforms eight SOTA baselines in diverse synthetic sample generation and downstream classification tasks.

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 datasets are ubiquitous. Classification performance on imbalanced datasets is generally poor for the minority class as the classifier cannot learn decision boundaries well. However, in sensitive applications like fraud detection, medical diagnosis, and spam identification, it is extremely important to classi…

2019-10-23abs ↗pdf ↗

Image classification datasets are often imbalanced, characteristic that negatively affects the accuracy of deep-learning classifiers. In this work we propose balancing GAN (BAGAN) as an augmentation tool to restore balance in imbalanced datasets. This is challenging because the few minority-class images may not be enou…

2018-03-26abs ↗pdf ↗

The Minority Game is a generic model of competing adaptive agents, which is often believed to be a model of financial markets. We discuss to which extend this is a reasonable statement, and present minimal modifications that make this model reproduce stylized facts. The resulting model shows that without speculators, p…

2001-03-01abs ↗pdf ↗

We solve the dynamics of the on-line minority game, with general types of decision noise, using generating functional techniques a la De Dominicis and the temporal regularization procedure of Bedeaux et al. The result is a macroscopic dynamical theory in the form of closed equations for correlation- and response functi…

2001-07-30abs ↗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 ↗

Proposes GMOTE for better handling imbalanced data.

problem Classification of imbalanced data.
method Generates minority class instances using Gaussian Mixture Model, considering outliers through Mahalanobis distance.
result Shows better accuracy and F1-Score when combined with CART or SVM.

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 many real-world binary classification tasks (e.g. detection of certain objects from images), an available dataset is imbalanced, i.e., it has much less representatives of a one class (a minor class), than of another. Generally, accurate prediction of the minor class is crucial but it's hard to achieve since there is…

2017-07-12abs ↗pdf ↗

Paper studies asymptotic dimension and Assouad-Nagata dimension of graphs and surfaces.

problem Understanding the asymptotic dimension and Assouad-Nagata dimension of graphs and surfaces.
method Analyzes asymptotic dimension of graph metrics and applies to surfaces, proving dimension bounds.
result Proves that complete Riemannian surfaces have Assouad-Nagata dimension at most 2.