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

Trend · papers per month

166331497662 · Jun 202019922001200920172026
48 results for small class size

Learnable multiclass hypothesis classes don't always have a sample compression scheme of fixed size.

problem The limitation of sample compression schemes for multiclass hypothesis classes.
method Analysis of DS dimension and sample compression schemes.
result Learnable multiclass hypothesis classes do not always have a sample compression scheme of fixed size.

Adversarial training can hurt robust accuracy in small sample size scenarios.

problem Adversarial training improves test accuracy but may degrade robustness in limited data settings.
method Analyzes high-dimensional linear classification with noiseless observations, and observes perceptible attacks on image datasets.
result Adversarial training can negatively impact robust generalization in small sample size regimes.

The paper revisits and improves on a Bayesian relevance vector machine method for small sample sizes.

problem Statistical modeling with small sample sizes relative to the number of covariates.
method Introduces a new class of global-local priors and provides theoretical properties.
result Results on posterior consistency and contraction rates are provided.

A new algorithm for robust causal discovery in small sample sizes.

problem Limited data leads to weak conditional independence tests in causal discovery.
method Proposes a kk-PC algorithm that bounds conditioning set size for robust causal discovery.
result The kk-PC algorithm enables more robust causal discovery in small sample sizes.

The paper shows that relaxing assumptions about causal graphs can lead to exponentially large equivalence classes.

problem The size of Markov equivalence classes under relaxed assumptions.
method Analytical proofs for three settings: sparse random directed acyclic graphs, uniformly random acyclic directed mixed graphs, and uniformly random directed cyclic graphs.
result Exponentially large lower bounds for the expected size of Markov equivalence classes.

Image classifiers are sensitive to small changes, affecting most images in a class.

problem Sensitivity of image classifiers to small perturbations.
method Demonstrated sensitivity for any classifier over images, showing that for most classes, a tiny perturbation can change the classification of a majority of images.
result Image classifiers are sensitive to small perturbations, affecting most images in a class.

Exact learning improves naive Bayes classifier performance for small samples.

problem Improving naive Bayes classifier performance with small sample sizes.
method Proposes an exact learning augmented naive Bayes classifier (ANB) that ensures a class variable with no parents.
result The proposed ANB method outperforms other methods in comparison experiments.

Mini-batch stochastic gradient descent (SGD) and variants thereof approximate the objective function's gradient with a small number of training examples, aka the batch size. Small batch sizes require little computation for each model update but can yield high-variance gradient estimates, which poses some challenges for…

2019-10-18abs ↗pdf ↗

Proving a conjecture of Dennis Johnson, we show that the Torelli subgroup of the mapping class group has a finite generating set whose size grows cubically with respect to the genus of the surface. Our main tool is a new space called the handle graph on which the Torelli group acts cocompactly.

2011-06-16abs ↗pdf ↗

Privacy affects how much data is needed for CVaR optimization.

problem Privacy constraints impact the effective sample size for CVaR optimization.
method Analyzes the privacy-relevant sample size and decomposes CVaR excess risk.
result The effective private tail sample size is εnτ, affecting CVaR learning rates.

Unified Bayesian model for multi-modal, small sample size biomedical data classification.

problem Classifying high-dimensional, multi-modal biomedical data with small sample sizes.
method Combines multi-modal data views into a latent space, prunes irrelevant features, and uses dual kernels for small sample size scenarios.
result Outperforms state-of-the-art models and identifies features aligned with existing markers.

Kernel adaptive filters (KAF) are a class of powerful nonlinear filters developed in Reproducing Kernel Hilbert Space (RKHS). The Gaussian kernel is usually the default kernel in KAF algorithms, but selecting the proper kernel size (bandwidth) is still an open important issue especially for learning with small sample s…

2014-01-23abs ↗pdf ↗

The paper investigates why GNNs struggle to generalize from small to large graphs.

problem Challenges in graph neural networks' ability to generalize across different graph sizes.
method Identified and studied the effect of local structure on size generalization; proposed a novel SSL task.
result GNNs can converge to non-generalizing solutions when there is a discrepancy in local structure.

SLdisco uses supervised learning to discover causal models from observational data.

problem Estimating causal effects from observational data with limited samples and sparse models.
method Supervised machine learning to map observational data to causal equivalence classes.
result SLdisco is more conservative, less sensitive to sample size, and provides better model inference.

The ability to learn from a small number of examples has been a difficult problem in machine learning since its inception. While methods have succeeded with large amounts of training data, research has been underway in how to accomplish similar performance with fewer examples, known as one-shot or more generally few-sh…

2017-08-22abs ↗pdf ↗

The two-sample hypothesis testing problem is studied for the challenging scenario of high dimensional data sets with small sample sizes. We show that the two-sample hypothesis testing problem can be posed as a one-class set classification problem. In the set classification problem the goal is to classify a set of data …

2017-06-18abs ↗pdf ↗

Recent advances in graph convolutional networks have significantly improved the performance of chemical predictions, raising a new research question: "how do we explain the predictions of graph convolutional networks?" A possible approach to answer this question is to visualize evidence substructures responsible for th…

2018-07-04abs ↗pdf ↗

Bob predicts a future observation based on a sample of size one. Alice can draw a sample of any size before issuing her prediction. How much better can she do than Bob? Perhaps surprisingly, under a large class of loss functions, which we refer to as the Cover-Hart family, the best Alice can do is to halve Bob's risk. …

2012-06-15abs ↗pdf ↗

In biospectroscopy, suitably annotated and statistically independent samples (e. g. patients, batches, etc.) for classifier training and testing are scarce and costly. Learning curves show the model performance as function of the training sample size and can help to determine the sample size needed to train good classi…

2012-11-06abs ↗pdf ↗

Class imbalance is an intrinsic characteristic of multi-label data. Most of the labels in multi-label data sets are associated with a small number of training examples, much smaller compared to the size of the data set. Class imbalance poses a key challenge that plagues most multi-label learning methods. Ensemble of Cl…

2018-07-30abs ↗pdf ↗

We employ techniques of machine-learning, exemplified by support vector machines and neural classifiers, to initiate the study of whether AI can "learn" algebraic structures. Using finite groups and finite rings as a concrete playground, we find that questions such as identification of simple groups by "looking" at the…

2019-05-02abs ↗pdf ↗

Naive Bayes estimator is widely used in text classification problems. However, it doesn't perform well with small-size training dataset. We propose a new method based on Naive Bayes estimator to solve this problem. A correlation factor is introduced to incorporate the correlation among different classes. Experimental r…

2019-05-08abs ↗pdf ↗

Two methods reduce BN and DNN complexity, balancing size and accuracy.

problem Balancing model size and prediction accuracy in Bayesian networks and deep neural networks.
method Quantization-aware training and tree-augmented naive Bayes structure learning extension.
result Pareto optimal models found for small-scale scenarios.

New conformal prediction methods for long-tailed classification problems.

problem Rare classes are systematically omitted in existing conformal prediction methods.
method Introduced a new conformal score function and a new interpolation procedure.
result Smoothly trade off set size and class-conditional coverage.

Regularized EM algorithm improves clustering performance with small sample sizes.

problem Performance reduction in EM algorithm due to small sample size and poorly conditioned covariance matrices.
method Regularized EM algorithm that uses prior knowledge to ensure positive definiteness of covariance matrices.
result The regularized EM algorithm outperforms standard EM in clustering tasks with small sample sizes.

Feature selection from wide datasets leads to misleading results.

problem Feature selection in wide datasets with few samples can lead to misleading results.
method Derived sample size requirement for declaring features different, used real datasets to illustrate issues.
result Feature selection from very wide datasets may lead to misleading results.

Study evaluates synthetic data augmentation for small datasets, highlighting inconsistencies in traditional metrics.

problem Inconsistent validation of synthetic data generated for small sample sizes.
method Proposes a normalized Bottleneck distance metric to evaluate synthetic tabular data.
result Common metrics like propensity scoring and MMD fail for small datasets, showing instability and high variability.

A new test optimizes detecting small communities in large networks.

problem Detecting small communities in large networks.
method Using Sinkhorn's theorem and a degree-corrected block model (DCBM), the study optimizes the SgnQ test for this challenging setting.
result The SgnQ test is optimal for detecting communities larger than √n, achieving the computational lower bound (CLB).

We find the wealth distribution for an economic agent in the financial market, in analogy with standard derivation of generaliz Boltzman (Tsallis) factor in statistical mechanics. In this respect, Tsallis entropic index separates two different regimes, the large and small size market. The Pareto like wealth distributio…

2004-04-28abs ↗pdf ↗

We propose a novel method to train deep convolutional neural networks which learn from multiple data sets of varying input sizes through weight sharing. This is an advantage in chemometrics where individual measurements represent exact chemical compounds and thus signals cannot be translated or resized without disturbi…

2019-10-01abs ↗pdf ↗

We demonstrate that the lowest possible price change (tick-size) has a large impact on the structure of financial return distributions. It induces a microstructure as well as it can alter the tail behavior. On small return intervals, the tick-size can distort the calculation of correlations. This especially occurs on s…

2010-01-28abs ↗pdf ↗

Decision trees have been a very popular class of predictive models for decades due to their interpretability and good performance on categorical features. However, they are not always robust and tend to overfit the data. Additionally, if allowed to grow large, they lose interpretability. In this paper, we present a mix…

2016-12-10abs ↗pdf ↗

Modern deep neural network training is typically based on mini-batch stochastic gradient optimization. While the use of large mini-batches increases the available computational parallelism, small batch training has been shown to provide improved generalization performance and allows a significantly smaller memory footp…

2018-04-20abs ↗pdf ↗

The classification of multi-class microarray datasets is a hard task because of the small samples size in each class and the heavy overlaps among classes. To effectively solve these problems, we propose novel Error Correcting Output Code (ECOC) algorithm by Enhance Class Separability related Data Complexity measures du…

2018-06-22abs ↗pdf ↗