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

24487195 · Jun 202019922001200920172026
48 results for small-data analytics

SmallML predicts customer churn for SMEs with small data, improving accuracy by 24.2 points.

problem AI exclusion of SMEs due to data scale mismatch.
method Bayesian transfer learning with hierarchical pooling and conformal prediction.
result 96.7% AUC on 100 obs SMEs, 24.2 point improvement over logistic regression.

GOAL algorithm reduces and rotates feature space for small data classification.

problem Challenges in identifying important features for classification in small data settings.
method GOAL algorithm reduces and rotates feature space in a lower-dimensional gauge, providing an analytically tractable solution.
result GOAL algorithm outperforms state-of-the-art ML tools in synthetic and real-world applications.

Meta-learning helps use small data from many tasks to compensate for lack of big data.

problem How to leverage small labeled data from many tasks to improve learning when big labeled data is scarce.
method Introduced a novel spectral approach to efficiently utilize small data tasks with the help of medium data tasks.
result The total number of examples necessary with only small data tasks scales similarly as when big data tasks are available.

Bayesian methods reduce variance in subspace identification for small data sets.

problem High variance in traditional subspace identification methods for large models or small sample sizes.
method Investigation of Bayesian estimation solutions (regularized and shrinkage estimators) for subspace identification.
result Bayesian estimators reduce estimation risk by up to 40% compared to traditional methods.

Improves probability estimates for small datasets in multi-class problems.

problem Inaccurate probability estimates in classification tasks, especially on small datasets.
method Introduced Data Generation and Grouping algorithm to improve calibration on small datasets, then applied to multi-class problems.
result Calibration error can be decreased using the proposed approach.

The CLT fails for LLM evaluations with small data, leading to underestimation of uncertainty.

problem Inaccurate uncertainty estimates in LLM evaluations with small datasets.
method Alternative frequentist and Bayesian methods for uncertainty quantification.
result CLT-based methods underestimate uncertainty in small data settings.

This paper explores object detection in the small data regime, where only a limited number of annotated bounding boxes are available due to data rarity and annotation expense. This is a common challenge today with machine learning being applied to many new tasks where obtaining training data is more challenging, e.g. i…

2019-10-16abs ↗pdf ↗

New method for density estimation without approximating posterior distributions.

problem Challenges in non-smooth data distributions for Bayesian density estimation.
method Autoregressive likelihood decomposition and Gaussian process prior in a quasi-Bayesian framework.
result Achieves state-of-the-art results in small-data regimes.

Gaussian Processes (GPs) are known to provide accurate predictions and uncertainty estimates even with small amounts of labeled data by capturing similarity between data points through their kernel function. However traditional GP kernels are not very effective at capturing similarity between high dimensional data poin…

2019-10-13abs ↗pdf ↗

Soft-constrained PINN solves ODEs with minimal data, improving efficiency and robustness.

problem Sparse and noisy data in experiments and simulations.
method Soft-constrained Physics-informed Neural Network (PINN) with minimal labeled data.
result Soft-constrained PINN reduces need for labeled data and achieves strong generalization.

Bayesian model updating uses VAEs to approximate likelihood with small data.

problem Approximating likelihood for small data sets in structural analysis.
method Uses multimodal VAEs to approximate likelihood, suitable for high-dimensional correlated observations.
result Demonstrates computational efficiency and accuracy compared to original VAE approach.

Proposes a model to generate high-dimensional financial returns using latent factor structure.

problem Challenges in financial scenario simulation, especially in high-dimensional and small data settings.
method Integrates latent factor structure into generative diffusion processes, decomposing the score function using time-varying orthogonal projections.
result Establishes rigorous statistical guarantees for score estimation and generated distribution, surpassing dimension-dependent limits.

A new meta-meta classification method tackles few-shot learning tasks.

problem Learning with limited data in small-data settings.
method Designing an ensemble of learners for a large set of problems, then learning how to combine them for a new problem.
result Meta-meta classification outperforms traditional meta-learning and ensembling approaches in one-shot learning tasks.

A new framework for optimizing interventions with limited data.

problem Small data, default intervention data, unmodeled objectives, unforeseen consequences.
method Bandit data-driven optimization combining online bandit learning and offline predictive analytics.
result PROOF algorithm achieves no-regret and superior performance in simulations and real-world application.

Model learns to select relevant clinical variables for disease subtype prediction from small data.

problem Few-shot disease subtype prediction from small genomic data.
method Meta learning Prototypical Network with feature selection and sample reweighting.
result Superior performance in predicting disease subtypes and identifying genes.

Paper tackles robust prediction of nuclear reactor materials under scarce data.

problem Challenges of data scarcity and uncertainty in nuclear reactor design.
method Meta-learning approach informed by uncertainty and prior knowledge.
result Achieves superior performance in rupture life prediction.

Study shows low-complexity models can perform as well as state-of-the-art on small datasets.

problem Performance of deep learning models on small datasets.
method Wide variety of experiments with different deep learning architectures on small datasets.
result Low-complexity models can perform comparably well or better than state-of-the-art models on small datasets.

PSiLON Net uses L1L_1 weight normalization and 1-path-norm regularization for efficient learning and sparsity.

problem Efficient learning and sparsity in neural networks with limited data.
method PSiLON Net employs L1L_1 weight normalization and 1-path-norm regularization to simplify the 1-path-norm and achieve efficient learning and near-sparse parameters.
result PSiLON Net achieves reliable optimization and strong performance in the small data regime.

Analyzes Willmore flow for graphs with boundary data, proving existence and convergence.

problem Willmore flow of graphs with boundary conditions over bounded domains.
method Developed low-regularity theory, reformulated graphical equation, used time-weighted parabolic Hölder spaces.
result Proved short-time and global existence for initial data in C1+α(Ω)C^{1+α}(\overlineΩ) and Lipschitz, with exponential convergence.

A new neural network model simulates financial markets without assuming underlying dynamics.

problem Modeling financial time series without assuming underlying dynamics.
method Neural network based generative model using a parsimonious Variational Autoencoder framework.
result Works reliably in small data environments, providing a new performance evaluation metric.

In this article we prove a family of local (in time) weighted Strichartz estimates with derivative losses for the Klein-Gordon equation on asymptotically de Sitter spaces and provide a heuristic argument for the non-existence of a global dispersive estimate on these spaces. The weights in the estimates depend on the ma…

2010-11-21abs ↗pdf ↗

Recent research shows that the following two models are equivalent: (a) infinitely wide neural networks (NNs) trained under l2 loss by gradient descent with infinitesimally small learning rate (b) kernel regression with respect to so-called Neural Tangent Kernels (NTKs) (Jacot et al., 2018). An efficient algorithm to c…

2019-10-03abs ↗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 ↗