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

Trend · papers per month

2875738601,146 · Jun 202019922001200920172026
48 results for training distribution

Training on mixed distributions improves test performance even when components are unrelated.

problem Improving test performance with mismatched training and test distributions.
method Analyzing mixture distributions with different training and test proportions.
result Distribution shift can be beneficial, improving test performance even when components are unrelated.

Paper optimizes training data distribution for better model performance across various deployment conditions.

problem Improving model accuracy when deployed with parameters far from training data.
method Developed adaptive algorithms based on bilevel or alternating optimization in the space of probability measures.
result Optimized training distributions lead to models with improved sample complexity and robustness to distribution shift.

Training machine learning (ML) models on large datasets requires considerable computing power. To speed up training, it is typical to distribute training across several machines, often with specialized hardware like GPUs or TPUs. Managing a distributed training job is complex and requires dealing with resource contenti…

2019-03-24abs ↗pdf ↗

Distributed Lion optimizes large model training by reducing communication costs.

problem Training large AI models efficiently with reduced communication costs.
method Adapted Lion optimizer for distributed training, using binary or lower-precision vectors for communication.
result Distributed Lion achieves comparable performance to standard optimizers but with significantly reduced communication bandwidth.

In-N-Out improves model robustness to out-of-distribution data.

problem Learning robust models with few in-distribution labeled examples.
method Pre-training with auxiliary information and self-training with pseudolabels.
result In-N-Out outperforms auxiliary inputs or outputs alone on both in-distribution and OOD error.

Deep learning has led to tremendous advancements in the field of Artificial Intelligence. One caveat however is the substantial amount of compute needed to train these deep learning models. Training a benchmark dataset like ImageNet on a single machine with a modern GPU can take upto a week, distributing training on mu…

2018-10-28abs ↗pdf ↗

This work proposes efficient classical training protocols for IQP circuits to train quantum generative models.

problem Training quantum generative models on industrially relevant probability distributions is challenging due to high computational cost.
method Developed protocols for classical training of IQP circuits, which are hard to sample but have efficient gradient computation.
result Classically trained IQP circuits can efficiently sample from target probability distributions, demonstrating practical quantum advantage.

A distributed algorithm for training graph convolutional networks.

problem Training graph convolutional networks with sparse network topology and distributed agents.
method Formulate inference and optimization in a distributed scenario, propose a gradient descent procedure, and design communication topology.
result Convergence to stationary solutions of the GCN training problem under mild conditions.

Method diagnoses model performance under distribution shifts.

problem Understanding and improving model performance under distribution shifts.
method DIstribution Shift DEcomposition (DISDE) method to attribute performance drop to distribution shifts.
result Shows how model performance can be improved across different distribution shifts.

New method predicts model output distributions to improve data attribution.

problem Traditional training data attribution ignores randomness in model training.
method Distributional Training Data Attribution (d-TDA) using influence functions.
result Influence functions are effective and emerge naturally from d-TDA.

DistGP models multi-robot mapping with distributed Gaussian process learning.

problem Collaborative mapping by multiple robots with limited local data.
method Sparse Gaussian process with factorisation and distributed training via GBP.
result DistGP achieves superior accuracy and robustness compared to DiNNO.

Study on continuous sequence classification with distribution uncertainty.

problem Classifying continuous sequences with varying distribution uncertainty.
method Proposes distribution-free tests for three test designs: fixed-length, sequential, and two-phase tests.
result Error probabilities decay exponentially fast for all test designs.

Discriminatively trained neural classifiers can be trusted, only when the input data comes from the training distribution (in-distribution). Therefore, detecting out-of-distribution (OOD) samples is very important to avoid classification errors. In the context of OOD detection for image classification, one of the recen…

2019-04-27abs ↗pdf ↗

Public pretraining improves private model training even in extreme distribution shift scenarios.

problem Improving private model training accuracy in settings with large distribution shift.
method Empirical evaluation and theoretical explanation of public representations improving private training accuracy.
result Public representations can improve private training accuracy by up to 67% over private training from scratch in settings with large distribution shift.

Language models are generally trained on data spanning a wide range of topics (e.g., news, reviews, fiction), but they might be applied to an a priori unknown target distribution (e.g., restaurant reviews). In this paper, we first show that training on text outside the test distribution can degrade test performance whe…

2019-09-04abs ↗pdf ↗

Causal influence measures for machine learnt classifiers shed light on the reasons behind classification, and aid in identifying influential input features and revealing their biases. However, such analyses involve evaluating the classifier using datapoints that may be atypical of its training distribution. Standard me…

2018-03-28abs ↗pdf ↗

A decision-theoretic bootstrapping method for robust uncertainty quantification.

problem Uncertainty in finite data sets and distributional shift between training and testing data.
method Partition data, train models, sample UQ subsets, define adversarial game, identify optimal mixed strategies.
result Optimal model mixtures and UQ estimates for robust uncertainty quantification.

Combining self-training and contrastive learning improves performance under distribution shift.

problem Improving performance under distribution shift using unlabeled data.
method Combining self-training and contrastive learning techniques.
result Combined method achieves 3-8% higher accuracy than either approach independently.

SAPAG attacks distributed learning by reconstructing true training data from gradients.

problem Privacy attacks on distributed learning systems through gradients.
method SAPAG uses a Gaussian kernel-based gradient difference distance measure.
result SAPAG can reconstruct training data on various DNNs and at different training phases.

New methods reduce communication in distributed training for variational inequalities.

problem Reducing communication in distributed training for high-dimensional models.
method Distributed methods with compressed communication for solving variational inequalities.
result Theoretical guarantees and practical algorithms for compressed communication.

RATIO improves neural network robustness and explainability.

problem Neural networks' lack of robustness to adversarial changes and uncertainty on out-distribution samples.
method RATIO: Adversarial Training on In- and Out-distribution.
result RATIO leads to robust models with reliable confidence estimates on out-distribution samples.

FIRE method improves model performance in federated learning by penalizing fragmentation-induced covariate shifts.

problem Performance degradation in federated learning due to data fragmentation and covariate shift.
method FIRE method accumulates fragmentation-induced covariate shift divergences via approximate Fisher information and uses it as a per-fragment loss penalty.
result FIRE outperforms importance weighting and federated learning benchmarks by up to 5.3% on shifted validation sets.

TAET tackles long-tailed distributions in adversarial robustness.

problem Long-tailed distributions complicate adversarial robustness in real-world applications.
method TAET integrates an initial stabilization phase followed by a stratified equalization adversarial training phase.
result TAET achieves significant improvements in robustness and efficiency.

Adversarial training (AT) is among the most effective techniques to improve model robustness by augmenting training data with adversarial examples. However, most existing AT methods adopt a specific attack to craft adversarial examples, leading to the unreliable robustness against other unseen attacks. Besides, a singl…

2020-02-14abs ↗pdf ↗

New method trains neural samplers to sample from multi-modal distributions efficiently.

problem Mode-seeking behavior of reverse KL divergence hinders effective sampling from multi-modal target distributions.
method Minimizing reverse diffusive KL divergence along diffusion trajectories of model and target densities.
result Demonstrated enhanced sampling performance across various multi-modal distributions.

LSAM optimizes deep learning training with improved efficiency.

problem Inefficiency in distributed large-batch training with Sharpness-Aware Minimization (SAM).
method Integrates SAM's adversarial steps with an asynchronous distributed sampling strategy.
result Higher final accuracy compared to data-parallel SAM.

Deep learning with medical data often requires larger samples sizes than are available at single providers. While data sharing among institutions is desirable to train more accurate and sophisticated models, it can lead to severe privacy concerns due the sensitive nature of the data. This problem has motivated a number…

2018-12-04abs ↗pdf ↗

Study optimal ridge regularization for out-of-distribution prediction.

problem Optimal ridge regularization for predicting out-of-distribution data.
method Established conditions for optimal regularization under covariate and regression shifts, proving monotonic risk in data aspect ratio.
result Negative regularization can be optimal under shifts, even with isotropic or underparameterized training features.

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.

SMT trains generative models by estimating mixture scores, outperforming existing methods.

problem Training one-step generative models efficiently and effectively.
method Score-of-Mixture Training (SMT) estimates the score of mixture distributions between real and fake samples.
result SMT/SMD outperform existing methods on CIFAR-10 and ImageNet 64x64 datasets.