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

1234 · Oct 201819922001200920172026
48 results for over-sampling

Class imbalance is a challenging issue in practical classification problems for deep learning models as well as traditional models. Traditionally successful countermeasures such as synthetic over-sampling have had limited success with complex, structured data handled by deep learning models. In this paper, we propose D…

2017-04-25abs ↗pdf ↗

To train neural machine translation models simultaneously on multiple tasks (languages), it is common to sample each task uniformly or in proportion to dataset sizes. As these methods offer little control over performance trade-offs, we explore different task scheduling approaches. We first consider existing non-adapti…

2019-09-13abs ↗pdf ↗

Class imbalanced datasets are common in real-world applications that range from credit card fraud detection to rare disease diagnostics. Several popular classification algorithms assume that classes are approximately balanced, and hence build the accompanying objective function to maximize an overall accuracy rate. In …

2018-09-07abs ↗pdf ↗

EviTrack improves sequential prediction in delayed disambiguation scenarios.

problem Challenges in sequential prediction with delayed disambiguation where early observations are ambiguous.
method EviTrack operates over latent trajectories, applying evidence- and likelihood-ratio-based selection to delay commitment until supported by data.
result EviTrack outperforms sampling-based baselines in a controlled synthetic benchmark, achieving faster post-disambiguation recovery.

Bayesian network framework assesses urban risks across multiple domains.

problem Complex interdependencies in urban systems.
method Bayesian Belief Networks (BBNs) with DAGs, Hill-Climbing search, BIC, K2 scoring, synthetic data, SMOTE.
result Identifies key risk factors and quantifies likelihood of cascading failures.

The paper analyzes logistic regression for rare events data, deriving new insights on estimator efficiency and sampling strategies.

problem Binary logistic regression for rare events data with significantly fewer events than controls.
method Derives asymptotic distribution of MLE, proves under-sampling advantage, and compares over-sampling efficiency.
result Under-sampling a small proportion of nonevents can improve efficiency in rare events data analysis.

We propose a deep learning approach for discovering kernels tailored to identifying clusters over sample data. Our neural network produces sample embeddings that are motivated by--and are at least as expressive as--spectral clustering. Our training objective, based on the Hilbert Schmidt Information Criterion, can be o…

2019-08-09abs ↗pdf ↗

Research aims to predict fallen angel bonds' bankruptcy using machine learning.

problem Predicting which fallen angel bonds will become investment grade or go bankrupt.
method Used four classification methods (logistic regression, KNN, SVM, NN) and Google Cloud's automated machine learning.
result Google Cloud's machine learning model performed best in over-sampled and feature selection data sets.

The study predicts solar flare productivity using magnetic data from SDO/HMI.

problem Forecasting solar flares, especially M- and X-class, to mitigate space weather effects.
method Statistical and machine learning methods applied to 563 ARs' magnetic data.
result Improved accuracy in predicting AR's Flare Index, especially for large values.

Cervical cancer is the leading gynecological malignancy worldwide. This paper presents diverse classification techniques and shows the advantage of feature selection approaches to the best predicting of cervical cancer disease. There are thirty-two attributes with eight hundred and fifty-eight samples. Besides, this da…

2018-12-11abs ↗pdf ↗

Typical amortized inference in variational autoencoders is specialized for a single probabilistic query. Here we propose an inference network architecture that generalizes to unseen probabilistic queries. Instead of an encoder-decoder pair, we can train a single inference network directly from data, using a cost functi…

2019-12-05abs ↗pdf ↗

DRIO improves time series imputation by minimizing reconstruction error and distributional divergence.

problem Bias in imputation due to mismatch between observed and true data distributions.
method DRIO minimizes reconstruction error and worst-case divergence using Wasserstein ambiguity set.
result DRIO consistently provides robust imputation and improved forecasting.

Random Forest variable importance is improved by class balancing techniques.

problem Class imbalance problem in machine learning.
method Proposed a variable selection algorithm using RF variable importance and its confidence interval.
result Our algorithm efficiently selects an optimal feature set, leading to improved prediction performance.

In Reinforcement Learning (RL), an agent explores the environment and collects trajectories into the memory buffer for later learning. However, the collected trajectories can easily be imbalanced with respect to the achieved goal states. The problem of learning from imbalanced data is a well-known problem in supervised…

2019-02-20abs ↗pdf ↗

We improve kernel ridge regression for skewed responses using oversampling and adaptive partitioning.

problem Kernel ridge regression struggles with skewed response variables, leading to poor estimates.
method Combines adaptive partitioning with oversampling to address skewed responses in kernel ridge regression.
result The proposed method yields estimates with smaller risk compared to classical methods under mild conditions.

Better methods to detect insider threats need new anticipatory analytics to capture risky behavior prior to losing data. In search of the best overall classifier, this work empirically scores 88 machine learning algorithms in 16 major families. We extract risk features from the large CERT dataset, which blends real net…

2019-01-30abs ↗pdf ↗

We present a technique to perform dimensionality reduction on data that is subject to uncertainty. Our method is a generalization of traditional principal component analysis (PCA) to multivariate probability distributions. In comparison to non-linear methods, linear dimensionality reduction techniques have the advantag…

2019-05-03abs ↗pdf ↗

Before training a neural net, a classic rule of thumb is to randomly initialize the weights so the variance of activations is preserved across layers. This is traditionally interpreted using the total variance due to randomness in both weights \emph{and} samples. Alternatively, one can interpret the rule of thumb as pr…

2019-02-13abs ↗pdf ↗

The OSTSC package is a powerful oversampling approach for classifying univariant, but multinomial time series data in R. This article provides a brief overview of the oversampling methodology implemented by the package. A tutorial of the OSTSC package is provided. We begin by providing three test cases for the user to …

2017-11-27abs ↗pdf ↗

Study evaluates three class imbalance techniques across diverse datasets.

problem Class imbalance in binary classification tasks.
method Synthetic Minority Over-sampling Technique (SMOTE), Class Weights tuning, Decision Threshold Calibration.
result Decision Threshold Calibration is the most consistently effective technique.

Variance-Calibrated Modulation (VCM) addresses the likelihood trap in LLMs by reshaping the probability distribution before truncation.

problem LLMs fall into the likelihood trap, leading to repetitive degeneration and vocabulary dullness.
method VCM reshapes the probability distribution before truncation through Contextual Searchlight and Adaptive Self-Debiasing.
result VCM mitigates the likelihood trap across open-ended generation, factual QA, and mathematical reasoning.

PARIS reduces imbalanced regression datasets by pruning uninformative samples.

problem Imbalanced regression where models focus on high-frequency regions, ignoring rare but impactful events.
method PARIS uses the representer theorem to compute a closed-form representer deletion residual for iterative pruning of the training set.
result PARIS reduces training set by up to 75% while preserving or improving overall performance, outperforming other methods.

Enhances PCE surrogates using transfer learning for expensive simulations.

problem Over-sampling in PCE for expensive forward models.
method Transfer learning from similar tasks to a new task with limited training data.
result Improves scalability and accuracy of PCE surrogates.

HSSE framework embeds single-cell RNA-seq data at multiple scales.

problem Capturing heterogeneous local structure in single-cell RNA-seq data.
method Hierarchical sheaf spectral embedding (HSSE) framework.
result HSSE achieves competitive or improved performance in single-cell RNA-seq data representation learning.

Novel methods for splitting Gaussian mixtures improve uncertainty propagation in nonlinear systems.

problem Improving accuracy and efficiency in nonlinear uncertainty propagation.
method Preserving mean and covariance, novel heuristics for selecting splitting direction informed by initial uncertainty and nonlinear function properties.
result Improved accuracy and efficiency in uncertainty propagation compared to existing techniques.