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

83166248331 · Jun 202019922001200920172026
48 results for Weight Initialization

This paper examines weight initialization for 1-Lipschitz networks to improve robustness against adversarial attacks.

problem Improving the robustness of deep neural networks against adversarial attacks.
method Examined weight parametrization of AOL and SLL networks, calculated weight variance bounds, and demonstrated weight decay.
result Weight initialization causes deep 1-Lipschitz networks to decay to zero, and weight variance does not affect output variance distribution.

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.

Residual Network (ResNet) is the state-of-the-art architecture that realizes successful training of really deep neural network. It is also known that good weight initialization of neural network avoids problem of vanishing/exploding gradients. In this paper, simplified models of ResNets are analyzed. We argue that good…

2017-09-09abs ↗pdf ↗

Improved LLM pre-training performance through better weight and variance control.

problem Improper weight and variance control in LLM pre-training affects downstream task performance.
method Introduced Layer Index Rescaling (LIR) and Target Variance Rescaling (TVR) techniques.
result Substantial improvements in downstream task performance (up to 4.6%) and reduced extreme activation values.

Proposes a new method to initialize neural networks by estimating global curvature of weights.

problem Improving the initialization of neural networks for better training and convergence.
method Estimates the global curvature of weights across layers using the Hessian matrix norm.
result The proposed method helps in more rigorously initializing weights, leading to better performance.

Paper extends positive energy theorem to anti-de Sitter spacetimes.

problem Proving positive energy theorem for weighted anti-de Sitter spacetimes.
method Generalized positive energy theorem for 3D anti-de Sitter initial data sets.
result Positive energy theorem proved for weighted anti-de Sitter spacetimes.

New method shows random, diverse initializations are not essential for deep neural networks.

problem The necessity of random, diverse initializations in deep neural networks.
method Constructed a deep convolutional network with identical features by initializing weights to 0, enabling signal propagation and stable gradients.
result Random, diverse initializations are not necessary for training neural networks.

Paper proposes a new strategy to improve initial performance of federated models.

problem Weight divergence in Federated Averaging (FedAvg) leads to poor initial performance in federated models.
method Local continual training with importance weights evaluated on a proxy dataset.
result The method significantly improves the initial performance of federated models with minimal extra communication costs.

Recent pruning methods at initialization fall short of random pruning's accuracy.

problem Improving neural network accuracy through pruning at initialization.
method Various pruning methods (SNIP, GraSP, SynFlow, magnitude pruning) are evaluated; per-layer pruning decisions are proposed.
result Randomly shuffling or sampling initial weights preserves or improves accuracy, suggesting challenges with pruning heuristics.

Based on the property that solving the system of linear matrix equations via the column space and the row space projections boils down to an approximation in the least squares error sense, a formulation for learning the weight matrices of the multilayer network can be derived. By exploiting into the vast number of feas…

2018-11-20abs ↗pdf ↗

Standard practice in training neural networks involves initializing the weights in an independent fashion. The results of recent work suggest that feature "diversity" at initialization plays an important role in training the network. However, other initialization schemes with reduced feature diversity have also been sh…

2019-12-11abs ↗pdf ↗

A new meta-learning framework that assigns weights to source tasks based on target samples.

problem Learning initialization for target tasks with limited labeled examples.
method A general framework that assigns weights to the loss of different source tasks, which can depend on the target samples. Provides upper bounds and develops a learning algorithm based on minimizing the error bound with respect to an empirical IPM.
result Empirically, the weighted meta-learning algorithm finds better initializations than uniformly-weighted meta-learning algorithms.

New methods train neural networks without changing weights, achieving similar or higher performance.

problem Training neural networks efficiently with randomly initialized weights.
method Switching connections on and off, flipping weights' signs, minimizing changed connections.
result Achieves similar or higher performance with less computational cost than training all weights.

This paper extends the Gaussian process interpretation of deep networks to more varied weight distributions.

problem Understanding the impact of different weight initialization schemes on deep learning dynamics.
method Extending the Gaussian process interpretation to PSEUDO-IID weight distributions, including sparse and low-rank networks.
result PSEUDO-IID initialized networks are effectively equivalent up to variance, enabling tractable posterior distributions.

The paper studies neural networks' convergence near origin and saddle points.

problem Directional convergence of neural networks near small initializations and saddle points.
method Gradient flow dynamics analysis of two-homogeneous neural networks.
result Neural networks' weights approximately converge in direction to KKT points for small initializations.

We define and make initial study of Lie groupoids equipped with a compatible homogeneity (or graded bundle) structure, such objects we will refer to as weighted Lie groupoids. One can think of weighted Lie groupoids as graded manifolds in the category of Lie groupoids. This is a very rich geometrical theory with numero…

2015-02-21abs ↗pdf ↗

A new neural network initialization method is proposed for faster and more accurate training.

problem Efficient initialization for training multi-layer feedforward neural networks.
method Initialization based on Stein's identity, using eigenvectors of cross-moment matrix.
result The SteinGLM method is faster and more accurate than other initialization methods.

Orthogonal initialization does not speed up training in ultra-wide neural networks.

problem Exploring the effect of orthogonal initialization on training speed in deep neural networks.
method Study of neural tangent kernel dynamics in FCNs and CNNs with orthogonal initialization.
result The NTK of orthogonally-initialized networks remains constant during training, suggesting no speedup in the NTK regime.

Initializing the weights and the biases is a key part of the training process of a neural network. Unlike the subsequent optimization phase, however, the initialization phase has gained only limited attention in the literature. In this paper we discuss some consequences of commonly used initialization strategies for va…

2019-03-27abs ↗pdf ↗

Deep learning relies on good initialization schemes and hyperparameter choices prior to training a neural network. Random weight initializations induce random network ensembles, which give rise to the trainability, training speed, and sometimes also generalization ability of an instance. In addition, such ensembles pro…

2018-06-17abs ↗pdf ↗

S-GAI initializes MLPs using spectral geometry from data, improving performance.

problem Lack of guidance on initial weights encoding data geometry.
method S-GAI uses SVD to estimate spectral class geometry, initializing MLPs from training data.
result S-GAI-initialized MLPs start from a more informative hidden state and achieve comparable accuracy.

Deep networks with orthogonal weights show stable fluctuations, improving generalization and training speed.

problem Fluctuations in deep networks with Gaussian weights can impair training, especially in networks with depth comparable to width.
method Analytical and numerical studies of fully-connected networks with orthogonal weight initialization and tanh activations.
result Rectangular networks with orthogonal weights have stable fluctuations independent of network depth, leading to better generalization and training speed.

Understanding how neural networks learn remains one of the central challenges in machine learning research. From random at the start of training, the weights of a neural network evolve in such a way as to be able to perform a variety of tasks, like classifying images. Here we study the emergence of structure in the wei…

2019-02-21abs ↗pdf ↗

Convolutional networks struggle to learn Game of Life, even with lottery ticket weights.

problem Training convolutional networks to predict Conway's Game of Life is challenging.
method Examined small convolutional networks trained on Game of Life, focusing on weight initializations and network sizes.
result Minimal networks require significantly more parameters to converge, and their performance is sensitive to small changes in weights.

Generative model initializes 2-layer network weights for small datasets.

problem Approximating functions with 2-layer networks using small datasets and gradient-based training.
method Initialize hidden weights with a learned proposal distribution parameterized as a deep generative model. Refine with gradient-based post-processing and regularization.
result Demonstrates effectiveness of the approach with numerical examples.

Wide neural networks become linear, but adding bottlenecks makes them bilinear or multilinear.

problem Understanding the transition of neural networks from linearity to higher-order functions.
method Analyzing the behavior of randomly initialized wide neural networks with and without bottleneck layers.
result Bottleneck layers transform the network's function from linear to bilinear or multilinear.

This work investigates the ways in which deep learning methods can benefit from random projection (RP), a classic linear dimensionality reduction method. We focus on two areas where, as we have found, employing RP techniques can improve deep models: training neural networks on high-dimensional data and initialization o…

2018-12-22abs ↗pdf ↗

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.

An interesting approach to analyzing neural networks that has received renewed attention is to examine the equivalent kernel of the neural network. This is based on the fact that a fully connected feedforward network with one hidden layer, a certain weight distribution, an activation function, and an infinite number of…

2017-11-24abs ↗pdf ↗

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.