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

2995998981,197 · Jun 202019922001200920172026
48 results for neural net training

An important class of distance metrics proposed for training generative adversarial networks (GANs) is the integral probability metric (IPM), in which the neural net distance captures the practical GAN training via two neural networks. This paper investigates the minimax estimation problem of the neural net distance ba…

2018-11-02abs ↗pdf ↗

Learning to Optimize is a recently proposed framework for learning optimization algorithms using reinforcement learning. In this paper, we explore learning an optimization algorithm for training shallow neural nets. Such high-dimensional stochastic optimization problems present interesting challenges for existing reinf…

2017-03-01abs ↗pdf ↗

Meta-learning is a promising method to achieve efficient training method towards deep neural net and has been attracting increases interests in recent years. But most of the current methods are still not capable to train complex neuron net model with long-time training process. In this paper, a novel second-order meta-…

2018-05-22abs ↗pdf ↗

The sizes of deep neural networks (DNNs) are rapidly outgrowing the capacity of hardware to store and train them. Research over the past few decades has explored the prospect of sparsifying DNNs before, during, and after training by pruning edges from the underlying topology. The resulting neural network is known as a …

2019-04-30abs ↗pdf ↗

The sizes of deep neural networks (DNNs) are rapidly outgrowing the capacity of hardware to store and train them. Research over the past few decades has explored the prospect of sparsifying DNNs before, during, and after training by pruning edges from the underlying topology. The resulting neural network is known as a …

2018-09-14abs ↗pdf ↗

DP-Net uses dynamic programming for efficient deep neural network compression.

problem Efficiently compressing deep neural networks while maintaining accuracy.
method Dynamic Programming for optimal weight quantization and clustering-friendly training.
result Achieves up to 77X compression ratio on Wide ResNet with minimal accuracy loss.

We replace the output layer of deep neural nets, typically the softmax function, by a novel interpolating function. And we propose end-to-end training and testing algorithms for this new architecture. Compared to classical neural nets with softmax function as output activation, the surrogate with interpolating function…

2018-02-01abs ↗pdf ↗

Study measures impact of data and neural net similarity on transferability in restaurant sales data.

problem Identify indicators for successful transferability of neural nets across different data sets.
method Empirical study on sales data from six restaurants, calculating indicators based on data and neural net similarities.
result Negative correlations between transferability and indicators, allowing better model performance and fewer transfers.

This paper evaluates heuristics and hyperparameters in weight-sharing NAS methods.

problem Improving the performance of weight-sharing NAS methods.
method Systematic evaluation of heuristics and hyperparameters in weight-sharing NAS algorithms.
result Some heuristics negatively impact super-net and stand-alone performance correlation.

New method efficiently learns positive-definite curvature for neural nets.

problem Efficiently learn positive-definite curvature for neural net training.
method Spectral-factorized positive-definite curvature learning approach.
result Efficiently applies arbitrary matrix roots and generic curvature learning.

Bonsai-Net efficiently discovers state-of-the-art models with fewer parameters.

problem Efficiently discovering state-of-the-art neural architectures with minimal computational expense.
method Bonsai-Net uses a modified differential pruner to explore a relaxed search space.
result Bonsai-Net consistently discovers better architectures than random search with fewer parameters.

Parameter reduction has been an important topic in deep learning due to the ever-increasing size of deep neural network models and the need to train and run them on resource limited machines. Despite many efforts in this area, there were no rigorous theoretical guarantees on why existing neural net compression methods …

2018-12-26abs ↗pdf ↗

Study on how reparametrization affects neural nets' parameter spaces from a geometric perspective.

problem Inconsistencies in flatness measures, optimization, and probability densities under reparametrization.
method Riemannian geometry to study invariance of neural nets under reparametrization.
result Invariance of neural nets is an inherent property if the metric is explicitly represented and transformation rules are correct.

Bayesian method improves neural net convergence for character recognition.

problem Improving convergence rate of neural network training algorithms.
method Customization of Kalman filter into Bayesian statistics for initialization of weights.
result Improved convergence rate for backpropagation training algorithm.

Deterministic neural nets have been shown to learn effective predictors on a wide range of machine learning problems. However, as the standard approach is to train the network to minimize a prediction loss, the resultant model remains ignorant to its prediction confidence. Orthogonally to Bayesian neural nets that indi…

2018-06-05abs ↗pdf ↗

How well does a classic deep net architecture like AlexNet or VGG19 classify on a standard dataset such as CIFAR-10 when its width --- namely, number of channels in convolutional layers, and number of nodes in fully-connected internal layers --- is allowed to increase to infinity? Such questions have come to the forefr…

2019-04-26abs ↗pdf ↗

The study examines how shallow neural nets converge to training samples or manifold points during diffusion.

problem Understanding when and how shallow neural nets converge to training samples or manifold points during diffusion.
method Analysis of shallow ReLU neural network denoisers trained with minimal 2\ell^2 norm, comparing score flow and diffusion flow.
result Probability flow converges to training points, sums of training points, or manifold points, depending on the diffusion time scheduler.

This paper introduces the QMDP-net, a neural network architecture for planning under partial observability. The QMDP-net combines the strengths of model-free learning and model-based planning. It is a recurrent policy network, but it represents a policy for a parameterized set of tasks by connecting a model with a plan…

2017-03-20abs ↗pdf ↗

Deep neural network compression techniques such as pruning and weight tensor decomposition usually require fine-tuning to recover the prediction accuracy when the compression ratio is high. However, conventional fine-tuning suffers from the requirement of a large training set and the time-consuming training procedure. …

2018-12-05abs ↗pdf ↗

Convolutional nets require fewer samples than fully-connected nets for image classification.

problem Understanding why convolutional nets are more sample-efficient than fully-connected nets.
method Construction of a natural distribution and target function to demonstrate a sample complexity gap.
result Convolutional nets require O(1)O(1) samples for a single target function, while fully-connected nets require Ω(d2)Ω(d^2) samples.

Improved training boosts certified robustness of L-infinity distance nets.

problem Certified robustness of L-infinity distance nets is not as strong as conventional networks.
method Improved training process combining scaled cross-entropy and clipped hinge loss with a decaying mixing coefficient.
result Certified accuracy of L-infinity distance nets improved from 33.30% to 40.06% on CIFAR-10.

Deep nets trained with MSE loss exhibit Neural Collapse, collapsing features and classifiers to class means.

problem Understanding Neural Collapse in MSE-trained deep nets.
method Developed a new MSE loss decomposition and introduced the central path concept.
result Exact dynamics of Neural Collapse along the central path can be predicted.

We consider ill-posed inverse problems where the forward operator TT is unknown, and instead we have access to training data consisting of functions fif_i and their noisy images TfiTf_i. This is a practically relevant and challenging problem which current methods are able to solve only under strong assumptions on the t…

2021-08-05abs ↗pdf ↗

New method uses neural nets in Hilbert space for option pricing on flow forwards.

problem Pricing options on flow forwards with neural networks in Hilbert space.
method Optimization problem in Hilbert space solved by a novel feedforward neural network architecture.
result Excellent numerical efficiency and superior performance over classical methods.

Understanding the learning dynamics of neural networks is one of the key issues for the improvement of optimization algorithms as well as for the theoretical comprehension of why deep neural nets work so well today. In this paper, we introduce a random matrix-based framework to analyze the learning dynamics of a single…

2018-05-30abs ↗pdf ↗

GAMI-Net improves neural network interpretability while maintaining accuracy.

problem Lack of interpretability in neural network models.
method GAMI-Net is a disentangled feedforward network with multiple additive subnetworks designed for capturing main effects and pairwise interactions, considering sparsity, heredity, and marginal clarity.
result GAMI-Net achieves superior interpretability and competitive prediction accuracy compared to explainable boosting machine and other models.

In this paper, we develop an alternating direction method of multipliers (ADMM) for deep neural networks training with sigmoid-type activation functions (called \textit{sigmoid-ADMM pair}), mainly motivated by the gradient-free nature of ADMM in avoiding the saturation of sigmoid-type activations and the advantages of …

2019-02-06abs ↗pdf ↗

NANSDE-Net models time series with memory using neural ARMA-type noise.

problem Modeling time series with long- or short-memory characteristics.
method Developed NANSDE-Net, a generative model that incorporates Neural Network-kernel ARMA-type noise.
result NANSDE-Net matches or outperforms existing models in reproducing long- and short-memory features of data.

Two methods using low-discrepancy points improve data compression for neural networks.

problem Efficiently compress large datasets for neural network training.
method Two methods based on low-discrepancy points: digital nets with averaging and clustering.
result Second method outperforms supercompress in compression error and neural network accuracy.

Deep neural networks have proved to be a very effective way to perform classification tasks. They excel when the input data is high dimensional, the relationship between the input and the output is complicated, and the number of labeled training examples is large. But it is hard to explain why a learned network makes a…

2017-11-27abs ↗pdf ↗

Neural nets optimize dynamic hedging strategies with transaction costs.

problem Optimal hedging strategy in presence of transaction costs and discrete time.
method Convolutional neural network trained to infer optimal hedging frequencies.
result Dynamic multiscale hedging strategy reduces risk and maximizes profit.

Careful tuning of the learning rate, or even schedules thereof, can be crucial to effective neural net training. There has been much recent interest in gradient-based meta-optimization, where one tunes hyperparameters, or even learns an optimizer, in order to minimize the expected loss when the training procedure is un…

2018-03-06abs ↗pdf ↗