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

3737451,1181,490 · Jun 202019922001200920172026
48 results for training data

New method reveals how training data influence diffusion model outputs.

problem Difficulty in assessing training data impact on diffusion model outputs.
method Use of ensembles trained on carefully engineered splits of training data to identify influential training examples.
result Demonstrated the viability of ensembles as generative models and validity of assessing influence.

Paper tackles model vulnerabilities by reconstructing training data.

problem Reconstructing training data from model parameters poses a security risk.
method Developed a mathematical framework and score matching method for both Bayesian and non-Bayesian models.
result First score matching framework for reconstructing data in Bayesian models.

Self-training outperforms pre-training on COCO object detection and segmentation datasets.

problem The effectiveness of pre-training in improving object detection and segmentation models is limited.
method Investigated self-training as an alternative method to utilize additional data.
result Self-training consistently improves model performance across various dataset sizes and data augmentation levels.

New algorithm efficiently trains machine learning models to atomic forces data.

problem Efficiently training machine learning models to large amounts of force data.
method Developed an efficient algorithm for training machine learning models to all available force data.
result Training to all available force data is only a few times more expensive than training to energies alone.

New MIP methods improve training of integer-valued neural networks.

problem Training integer-valued neural networks with limited data and resources.
method Formulated new MIP models to optimize training efficiency and handle more data.
result Significantly outperforms previous state-of-the-art methods in accuracy, training time, and data usage.

New method reconstructs significant parts of training data from neural networks.

problem Understanding and reconstructing training data from neural networks.
method Proposes a novel reconstruction scheme based on recent theoretical results about neural network training.
result Shows that a significant fraction of training data can be reconstructed from neural network parameters.

FR-Train improves fair and robust AI training by detecting and reducing poisoned data.

problem Training AI models that are fair and robust in the presence of data bias and poisoning.
method Mutual information-based adversarial training with an additional discriminator.
result FR-Train maintains fairness and accuracy even in the presence of poisoned data.

Extract synthetic data from pretrained models for tasks without training data.

problem Lack of training data for tasks requiring model initialization.
method Extract 'Data Impressions' from pretrained deep models' parameters.
result Data Impressions enable various tasks like unsupervised domain adaptation and continual learning.

Reweighting training data to better represent new tasks.

problem Deploying machine learning models to new tasks is challenging due to training data distribution.
method Formulate an exponential tilt distribution shift model and learn train data importance weights to minimize KL divergence.
result The learned train data weights improve target performance evaluation, fine-tuning, and model selection.

Study the effects of data parallelism and sparsity on neural network training.

problem Understanding the effects of data parallelism and sparsity on neural network training.
method Conducted extensive experiments and developed a theoretical analysis.
result Found a general scaling trend between batch size and number of training steps to convergence for the effect of data parallelism, and difficulty of training under sparsity.

Support Vector Data Description (SVDD) is a popular outlier detection technique which constructs a flexible description of the input data. SVDD computation time is high for large training datasets which limits its use in big-data process-monitoring applications. We propose a new iterative sampling-based method for SVDD…

2016-06-16abs ↗pdf ↗

In this paper, we present a deep neural network (DNN) training approach called the "DeepMimic" training method. Enormous amounts of data are available nowadays for training usage. Yet, only a tiny portion of these data is manually labeled, whereas almost all of the data are unlabeled. The training approach presented ut…

2019-11-24abs ↗pdf ↗

Synthetic reference strings are as effective as real ones for training citation parsing models.

problem Lack of training data for citation parsing, especially with deep neural networks.
method Trained Grobid with human-labelled and synthetically created reference strings, and evaluated retraining and out-of-sample data impact.
result Synthetic and real reference strings are equally effective for training Grobid, with retraining improving performance.

In this paper we propose the use of Generative Adversarial Networks (GAN) to generate artificial training data for machine learning tasks. The generation of artificial training data can be extremely useful in situations such as imbalanced data sets, performing a role similar to SMOTE or ADASYN. It is also useful when t…

2019-04-19abs ↗pdf ↗

Develops a robust training framework to detect backdoor attacks in DNNs.

problem Vulnerability of DNNs to backdoor attacks by poisoned training data.
method Collider framework selects prominent samples based on geometric structures and coreset selection objective.
result Significantly reduces backdoor success rate in various poisoned datasets.

A novel approach of training data augmentation and domain adaptation is presented to support machine learning applications for cognitive radio. Machine learning provides effective tools to automate cognitive radio functionalities by reliably extracting and learning intrinsic spectrum dynamics. However, there are two im…

2018-04-02abs ↗pdf ↗

Framework for few-shot relation classification with minimal training data.

problem Few-shot relation classification with limited training data.
method Meta-learning framework that combines instance and support knowledge.
result Framework outperforms state-of-the-art results and achieves competitive performance with large training data.

Denoising autoencoders (DAEs) are powerful deep learning models used for feature extraction, data generation and network pre-training. DAEs consist of an encoder and decoder which may be trained simultaneously to minimise a loss (function) between an input and the reconstruction of a corrupted version of the input. The…

2017-08-28abs ↗pdf ↗

Data loading can dominate deep neural network training time on large-scale systems. We present a comprehensive study on accelerating data loading performance in large-scale distributed training. We first identify performance and scalability issues in current data loading implementations. We then propose optimizations t…

2019-10-02abs ↗pdf ↗

Different types of training data have led to numerous schemes for supervised classification. Current learning techniques are tailored to one specific scheme and cannot handle general ensembles of training data. This paper presents a unifying framework for supervised classification with general ensembles of training dat…

2019-01-24abs ↗pdf ↗

Doubly robust self-training improves semi-supervised learning by balancing labeled and pseudo-labeled data.

problem Improving semi-supervised learning performance with limited labeled data.
method Introduces doubly robust self-training, a method that combines labeled and pseudo-labeled data to balance between labeled-only and pseudo-labeled-only training.
result Demonstrates superior performance of doubly robust self-training on ImageNet and nuScenes datasets.

The paper analyzes how generated data improves adversarial training in high-dimensional regression.

problem Improving adversarial training in high-dimensional regression.
method Theoretical analysis of a two-stage training approach with generated data and pseudo-labels.
result Two-stage adversarial training achieves better performance than ridgeless training in high-dimensional linear regression.

Paper tackles model collapse in recursive generative models using a weighted training scheme.

problem Model collapse in recursive generative models trained on synthetic data.
method Iteratively trains models on real and synthetic data, evaluates weighted training schemes.
result Optimal weighting scheme for synthetic data follows a unified expression, revealing a trade-off with model performance.

Adversarial training leads to clean data generalization with significant robust overfitting gap.

problem Significant robust generalization gap in adversarial training.
method Two theoretical views: representation complexity and training dynamics.
result ReLU nets with O(ND)O(N D) extra parameters can achieve CGRO.

Knowledge distillation deals with the problem of training a smaller model (Student) from a high capacity source model (Teacher) so as to retain most of its performance. Existing approaches use either the training data or meta-data extracted from it in order to train the Student. However, accessing the dataset on which …

2019-05-20abs ↗pdf ↗

The paper develops an algorithm to select a subset of training data for efficient regression models.

problem Designing an efficient algorithm for selecting a subset of training data to train regression models quickly without sacrificing accuracy.
method The paper tackles this problem by formulating it as a minimization of training loss with respect to both trainable parameters and subset of training data, subject to error bounds on the validation set. They use a novel problem formulation and represent it with simplified constraints using the dual of the original training problem. They then develop SELCON, an efficient majorization-minimization algorithm for data subset selection, which admits an approximation guarantee.
result The experiments show that SELCON trades off accuracy and efficiency more effectively than the current state-of-the-art.

The paper analyzes how adding gradient data affects overparameterized models' performance.

problem The impact of Sobolev training on high-dimensional predictive models.
method Combining replica method from statistical physics and operator-valued free probability theory.
result Sobolev training does not universally improve performance for target functions described by single-index models.

Neural networks can overfit perfectly to noisy data and then grok near-optimal generalization.

problem Neural networks' ability to overfit perfectly to noisy data and then generalize near-optimally.
method Two-layer ReLU networks trained by gradient descent on XOR cluster data.
result Neural networks can achieve perfect fit to noisy training data and then grok near-optimal generalization.