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

216432648864 · Jun 202019922001200920172026
48 results for training scheme

In this work, we explain the working mechanism of MixUp in terms of adversarial training. We introduce a new class of adversarial training schemes, which we refer to as directional adversarial training, or DAT. In a nutshell, a DAT scheme perturbs a training example in the direction of another example but keeps its ori…

2019-06-17abs ↗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 ↗

Neural Galerkin schemes use active learning to solve high-dimensional equations.

problem Inaccurate function approximations in high dimensions with limited training data.
method Neural Galerkin schemes based on deep learning with active learning for high-dimensional PDEs.
result Active data collection improves the numerical solution of high-dimensional equations.

Adaptive quantization improves SGD accuracy in data-parallel settings.

problem Fixed gradient quantization schemes lead to suboptimal performance in deep learning.
method Developed adaptive quantization schemes ALQ and AMQ that update compression schemes based on gradient statistics.
result Improved validation accuracy on CIFAR-10 and ImageNet datasets by 2% and 1% respectively.

A novel beam training scheme optimizes multi-hop THz communications with up to 75% performance gain.

problem Optimizing beam training for multi-hop THz communications with high data rates and low time overhead.
method Developed a reinforcement learning-based hierarchical beam training scheme with dynamic training levels.
result The proposed scheme achieves up to 75% performance gain in spectral efficiency compared to conventional methods.

Deep neural networks (DNNs) have set benchmarks on a wide array of supervised learning tasks. Trained DNNs, however, often lack robustness to minor adversarial perturbations to the input, which undermines their true practicality. Recent works have increased the robustness of DNNs by fitting networks using adversarially…

2018-11-19abs ↗pdf ↗

Paper derives CLT for Bayesian neural networks trained with variational inference.

problem Analyzing the fluctuation behavior of Bayesian neural networks trained with different variational inference schemes.
method Rigorous derivation of CLT for three variational inference schemes: idealized, Bayes-by-Backprop, and Minimal VI.
result Minimal VI scheme has larger variances but is more computationally efficient.

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.

New initialization schemes preserve fractional moments of weights in deep networks, improving training and test performance.

problem Heavy-tailed distribution of stochastic gradients in DNNs during training.
method Developed initialization schemes that preserve any given fractional moment of order s < 2 over layers for various activations.
result The network output admits a heavy-tailed distribution with finite moments, improving training and test performance.

New method uses randomized sparse neural networks to solve time-dependent PDEs more accurately and efficiently.

problem Numerical challenges in training neural networks sequentially in time to solve time-dependent PDEs.
method Introduces Neural Galerkin schemes that update randomized sparse subsets of network parameters at each time step.
result Up to two orders of magnitude more accurate and two orders of magnitude faster than dense update schemes.

We consider the effect of structure-agnostic and structure-dependent masking schemes when training a universal marginaliser (arXiv:1711.00695) in order to learn conditional distributions of the form P(xixb)P(x_i |\mathbf x_{\mathbf b}), where xix_i is a given random variable and xb\mathbf x_{\mathbf b} is some arbitrary sub…

2020-01-16abs ↗pdf ↗

Regularization is a big issue for training deep neural networks. In this paper, we propose a new information-theory-based regularization scheme named SHADE for SHAnnon DEcay. The originality of the approach is to define a prior based on conditional entropy, which explicitly decouples the learning of invariant represent…

2018-05-14abs ↗pdf ↗

Regularization is a big issue for training deep neural networks. In this paper, we propose a new information-theory-based regularization scheme named SHADE for SHAnnon DEcay. The originality of the approach is to define a prior based on conditional entropy, which explicitly decouples the learning of invariant represent…

2018-04-29abs ↗pdf ↗

Since the creation of Generative Adversarial Networks (GANs), much work has been done to improve their training stability, their generated image quality, their range of application but nearly none of them explored their self-training potential. Self-training has been used before the advent of deep learning in order to …

2017-10-27abs ↗pdf ↗

New method learns population dynamics from snapshots using JKO scheme and inverse optimization.

problem Recovering underlying process governing particle evolution from discrete time samples.
method Combines JKO scheme with inverse optimization techniques for end-to-end adversarial training.
result Improved performance over prior JKO-based methods with theoretical guarantees.

Symbol detection for Massive Multiple-Input Multiple-Output (MIMO) is a challenging problem for which traditional algorithms are either impractical or suffer from performance limitations. Several recently proposed learning-based approaches achieve promising results on simple channel models (e.g., i.i.d. Gaussian). Howe…

2019-06-11abs ↗pdf ↗

Large-batch training approaches have enabled researchers to utilize large-scale distributed processing and greatly accelerate deep-neural net (DNN) training. For example, by scaling the batch size from 256 to 32K, researchers have been able to reduce the training time of ResNet50 on ImageNet from 29 hours to 2.2 minute…

2019-01-24abs ↗pdf ↗

Traditionally, when generative models of data are developed via deep architectures, greedy layer-wise pre-training is employed. In a well-trained model, the lower layer of the architecture models the data distribution conditional upon the hidden variables, while the higher layers model the hidden distribution prior. Bu…

2014-05-06abs ↗pdf ↗

Improved performance of factorized neural layers through spectral initialization and Frobenius decay.

problem Improving the performance of factorized neural layers in various deep learning contexts.
method Spectral initialization and Frobenius decay for initialization and regularization.
result Spectral initialization and Frobenius decay lead to improved performance across multiple deep learning settings.

The convolutional layers are core building blocks of neural network architectures. In general, a convolutional filter applies to the entire frequency spectrum of the input data. We explore artificially constraining the frequency spectra of these filters and data, called band-limiting, during training. The frequency dom…

2019-11-21abs ↗pdf ↗

Non-parallel many-to-many voice conversion, as well as zero-shot voice conversion, remain under-explored areas. Deep style transfer algorithms, such as generative adversarial networks (GAN) and conditional variational autoencoder (CVAE), are being applied as new solutions in this field. However, GAN training is sophist…

2019-05-14abs ↗pdf ↗

Proposes dynamic channel pruning during neural network training.

problem Pruning neural networks during training to reduce computational cost and improve efficiency.
method Dynamic channel propagation to update channel utility values and selectively prune channels.
result Our scheme trains and prunes neural networks simultaneously, achieving superior performance.

We describe tests validating progress made toward acceleration and automation of hydrodynamic codes in the regime of developed turbulence by three Deep Learning (DL) Neural Network (NN) schemes trained on Direct Numerical Simulations of turbulence. Even the bare DL solutions, which do not take into account any physics …

2018-10-16abs ↗pdf ↗

Extracting a curriculum from a teacher network improves distillation efficiency.

problem Efficiently training a small network using a large teacher network's output.
method Random projection of teacher network's hidden representations to progressively train the student network.
result Extracted curriculum significantly outperforms one-shot distillation and achieves similar performance to progressive distillation.

The paper provides bounds for regression schemes using nonstationary training samples.

problem Developing confidence intervals for nonparametric regression with nonstationary data.
method The approach involves Rademacher and Vapnik-Chervonenkis theories to analyze the cost and optimality of regression schemes.
result The paper establishes nonasymptotic bounds for regression schemes and optimality in L2L^{2}-distance.

The paper analyzes Bayesian neural networks trained with VI, proving a law of large numbers for different schemes.

problem Training Bayesian neural networks with variational inference.
method Analyzes three training schemes: exact estimation, Bayes by Backprop, and Minimal VI.
result All training schemes converge to the same mean-field limit.

ALPS improves neural network robustness and generalization.

problem Challenges in designing effective regularization schemes for adversarial robustness.
method Adversarial Labelling of Perturbed Samples (ALPS) using synthetic samples and min-max formulation.
result ALPS achieves state-of-the-art regularization performance and adversarial robustness.

Deep artificial neural networks require a large corpus of training data in order to effectively learn, where collection of such training data is often expensive and laborious. Data augmentation overcomes this issue by artificially inflating the training set with label preserving transformations. Recently there has been…

2017-08-20abs ↗pdf ↗

We propose Sideways, an approximate backpropagation scheme for training video models. In standard backpropagation, the gradients and activations at every computation step through the model are temporally synchronized. The forward activations need to be stored until the backward pass is executed, preventing inter-layer …

2020-01-17abs ↗pdf ↗

We analyze the effect of quantizing weights and activations of neural networks on their loss and derive a simple regularization scheme that improves robustness against post-training quantization. By training quantization-ready networks, our approach enables storing a single set of weights that can be quantized on-deman…

2020-02-18abs ↗pdf ↗

A new numerical scheme approximates nonlinear filtering densities for noisy and partial measurements.

problem Approximating nonlinear filtering densities for noisy and partial measurements.
method Deep splitting scheme applied to the Fokker--Planck equation followed by Bayes' formula.
result Convergence rate established for the numerical scheme under parabolic Hörmander condition.

Deep neural networks with adversarial training achieve sup-norm convergence for nonparametric regression.

problem Achieving sup-norm convergence for deep neural network estimators in nonparametric regression.
method Developed an adversarial training scheme to address the sup-norm convergence issue.
result Deep neural network estimators achieve optimal sup-norm convergence with the proposed adversarial training.

The paper proposes a model reward scheme for collaborative ML based on Shapley value and information gain.

problem Designing fair incentives for collaborative machine learning.
method The paper proposes a reward scheme based on Shapley value and information gain, with properties like fairness and stability.
result The proposed reward scheme satisfies fairness and trade-offs between desirable properties via an adjustable parameter.