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

Trend · papers per month

2575157721,029 · Jun 202019922001200920172026
48 results for training techniques

Data augmentation is a widely used technique in many machine learning tasks, such as image classification, to virtually enlarge the training dataset size and avoid overfitting. Traditional data augmentation techniques for image classification tasks create new samples from the original training data by, for example, fli…

2018-01-09abs ↗pdf ↗

Memory is increasingly often the bottleneck when training neural network models. Despite this, techniques to lower the overall memory requirements of training have been less widely studied compared to the extensive literature on reducing the memory requirements of inference. In this paper we study a fundamental questio…

2019-04-24abs ↗pdf ↗

Adversarial training was recently shown to be competitive against supervised learning methods on computer vision tasks, however, studies have mainly been confined to generative tasks such as image synthesis. In this paper, we apply adversarial training techniques to the discriminative task of learning a steganographic …

2017-03-01abs ↗pdf ↗

One of the challenges in the study of generative adversarial networks is the instability of its training. In this paper, we propose a novel weight normalization technique called spectral normalization to stabilize the training of the discriminator. Our new normalization technique is computationally light and easy to in…

2018-02-16abs ↗pdf ↗

Broad adoption of machine learning techniques has increased privacy concerns for models trained on sensitive data such as medical records. Existing techniques for training differentially private (DP) models give rigorous privacy guarantees, but applying these techniques to neural networks can severely degrade model per…

2019-10-02abs ↗pdf ↗

The pursuit of explaining and improving generalization in deep learning has elicited efforts both in regularization techniques as well as visualization techniques of the loss surface geometry. The latter is related to the intuition prevalent in the community that flatter local optima leads to lower generalization error…

2019-07-22abs ↗pdf ↗

Meta-learning techniques like MAML and Reptile fail to generalize well to out-of-distribution tasks compared to simple finetuning.

problem Generalization of meta-learning techniques in low-data scenarios.
method Investigation of MAML, Reptile, and finetuning on various tasks.
result MAML and Reptile specialize for fast adaptation but fail to generalize to out-of-distribution tasks.

Re-initializing neural networks improves generalization but not as much as other techniques.

problem Understanding when and how re-initialization improves neural network performance.
method Empirical comparison of re-initialization with standard training and various regularization techniques.
result Re-initialization is beneficial for generalization but not as much as other techniques, especially when combined with careful tuning of hyperparameters.

Low-rank approximation is an effective model compression technique to not only reduce parameter storage requirements, but to also reduce computations. For convolutional neural networks (CNNs), however, well-known low-rank approximation methods, such as Tucker or CP decomposition, result in degraded model accuracy becau…

2019-05-24abs ↗pdf ↗

We propose a novel technique for faster deep neural network training which systematically applies sample-based approximation to the constituent tensor operations, i.e., matrix multiplications and convolutions. We introduce new sampling techniques, study their theoretical properties, and prove that they provide the same…

2018-05-21abs ↗pdf ↗

Sourcerer uses deep learning to map land cover from limited labeled data.

problem Producing accurate land cover maps with scarce labeled data.
method Bayesian-inspired, deep learning approach with a novel regularizer.
result Sourcerer outperforms other methods, even with minimal labeled target data.

As neural networks become widely deployed in different applications and on different hardware, it has become increasingly important to optimize inference time and model size along with model accuracy. Most current techniques optimize model size, model accuracy and inference time in different stages, resulting in subopt…

2018-06-10abs ↗pdf ↗

Lapse improves parameter servers by dynamically allocating parameters, achieving near-linear scaling.

problem Efficiently managing distributed training with reduced communication overhead.
method Integrate dynamic parameter allocation into parameter servers, proposing Lapse.
result Lapse provides near-linear scaling and can be orders of magnitude faster than existing parameter servers.

Deep neural networks have enabled progress in a wide variety of applications. Growing the size of the neural network typically results in improved accuracy. As model sizes grow, the memory and compute requirements for training these models also increases. We introduce a technique to train deep neural networks using hal…

2017-10-10abs ↗pdf ↗

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.

We present DANTE, a novel method for training neural networks using the alternating minimization principle. DANTE provides an alternate perspective to traditional gradient-based backpropagation techniques commonly used to train deep networks. It utilizes an adaptation of quasi-convexity to cast training a neural networ…

2019-02-01abs ↗pdf ↗

An important problem in training deep networks with high capacity is to ensure that the trained network works well when presented with new inputs outside the training dataset. Dropout is an effective regularization technique to boost the network generalization in which a random subset of the elements of the given data …

2017-12-04abs ↗pdf ↗

HYDRA prunes robust neural networks to improve both benign and adversarial robustness.

problem Lack of robustness against adversarial attacks and large neural network size in deep learning.
method HYDRA integrates pruning techniques with adversarial training and verifiable robust training objectives.
result HYDRA achieves compressed networks with state-of-the-art benign and robust accuracy.

Trained neural networks perform Bayesian reasoning for tasks beyond their initial scope.

problem Performing Bayesian reasoning for tasks outside the trained neural networks' initial scope.
method Used deep generative models as priors and classification/regression networks as constraints. Approximated Bayesian inference through variational or sampling techniques.
result The approach built on top of already trained networks, expanding the addressable questions.

New method closes certification gap for adversarially trained models.

problem Certifying robustness of adversarially trained neural networks.
method Nonconvex low-rank SDP relaxation with polynomial-time optimization.
result Strong certifications comparable to SDP methods, but with fewer variables.

Study evaluates federated learning with differential privacy on MIMIC-III, improving model performance with careful parameter tuning.

problem Training machine learning models on privacy-sensitive data sets locked in healthcare facilities.
method Extensive evaluation of federated and differential privacy techniques on MIMIC-III dataset, analyzing various parameters.
result Careful parameter tuning is crucial for federated learning with differential privacy, especially for data distribution and communication strategies.

Simplifies RL training with fewer techniques, reducing bias and instability.

problem Training instabilities and high sample complexity in RL.
method Introduced a simple deterministic policy gradient, used propensity estimation, and delayed policy updates.
result Improved performance and reduced sample complexity through these techniques.

Screening is an effective technique for speeding up the training process of a sparse learning model by removing the features that are guaranteed to be inactive the process. In this paper, we present a efficient screening technique for sparse support vector machine based on variational inequality. The technique is both …

2013-10-30abs ↗pdf ↗

Framework combines adversarial training and provable robustness for neural networks.

problem Training certifiably robust neural networks with provable robustness guarantees.
method Formulates joint optimization problem with adversarial and provable robustness objectives; develops gradient-descent technique.
result Consistently matches or outperforms prior approaches for provable l infinity robustness on MNIST and CIFAR-10.

Machine learning techniques based on neural networks are achieving remarkable results in a wide variety of domains. Often, the training of models requires large, representative datasets, which may be crowdsourced and contain sensitive information. The models should not expose private information in these datasets. Addr…

2016-07-01abs ↗pdf ↗