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

Trend · papers per month

7.7%15.4%23.1%30.7% · Jun 202019922001200920172026
48 results for feedforward training

Random projections of labels enable feedforward training of deep neural networks without feedback.

problem Biological plausibility and low-cost adaptive smart sensors constrained by backpropagation.
method Fixed random projections of targets for feedforward training of hidden layers.
result DRTP algorithm provides a tradeoff between accuracy and computational cost suitable for edge computing.

This paper examines properties of feedforward graphs to improve neural network performance.

problem The choice of computational graph can significantly impact neural network performance.
method The paper introduces two measures: fidelity and mixing time, and evaluates popular graphs using these measures.
result Popular graphs are evaluated based on fidelity and mixing time, revealing their performance implications.

A new method approximates tangent spaces to simplify neural networks.

problem Efficiency of hierarchical neural networks is hindered by their complexity and training requirements.
method Approximates tangent subspace to enable sparse representation and switch to shallow networks.
result The method improves and sometimes surpasses the performance of original networks after a few epochs.

A new faster neural network training method using backprojection.

problem Training feedforward neural networks more efficiently.
method Projection and reconstruction at each layer to force projected data and reconstructed labels to be similar.
result The proposed method is faster than backpropagation and gives insights into networks.

Recurrent Neural Networks (RNNs) are powerful models for sequential data that have the potential to learn long-term dependencies. However, they are computationally expensive to train and difficult to parallelize. Recent work has shown that normalizing intermediate representations of neural networks can significantly im…

2015-10-05abs ↗pdf ↗

New method constructs neural network architecture iteratively to optimize learning.

problem Difficulty in setting optimal random weights and biases for feedforward neural networks.
method Iteratively constructs hidden nodes, accepting only those that significantly reduce training error.
result Faster convergence and more compact network architecture with fewer significant neurons.

Parallelizes feedforward computation using nonlinear equation solving.

problem Sequential nature of feedforward computation limits parallelization.
method Frame feedforward computation as solving nonlinear equations; use Jacobi or Gauss-Seidel methods for parallel updates.
result Accelerates feedforward computation with reduced parallelizable iterations.

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.

A general Boltzmann machine with continuous visible and discrete integer valued hidden states is introduced. Under mild assumptions about the connection matrices, the probability density function of the visible units can be solved for analytically, yielding a novel parametric density function involving a ratio of Riema…

2017-12-20abs ↗pdf ↗

LCW reduces activation shift in neural networks, improving training efficiency and generalization.

problem Activation shift in neural networks leading to non-zero mean preactivation values.
method Linearly constrained weights (LCW) to reduce activation shift in fully connected and convolutional layers.
result LCW resolves the vanishing gradient problem and improves generalization of neural networks.

This paper explains why ResNets generalize better than FFNets using neural tangent kernels.

problem Understanding why deep ResNets generalize better than deep FFNets.
method Using neural tangent kernels to compare the learnability of functions induced by the kernels of ResNets and FFNets.
result The kernel of ResNets does not exhibit degeneracy as depth increases, unlike FFNets.

Develops a smooth operator framework for analyzing neural network representations.

problem Analyzing the geometry of feedforward neural network representations.
method Introduces a smooth operator-theoretic approach based on diffusion Markov operators derived from feature clouds.
result Establishes a stable operator-geometric framework for tracking training, width, and perturbation stability.

Time series anomaly detection is usually formulated as finding outlier data points relative to some usual data, which is also an important problem in industry and academia. To ensure systems working stably, internet companies, banks and other companies need to monitor time series, which is called KPI (Key Performance I…

2018-12-20abs ↗pdf ↗

We show that deep networks can be trained using Hebbian updates yielding similar performance to ordinary back-propagation on challenging image datasets. To overcome the unrealistic symmetry in connections between layers, implicit in back-propagation, the feedback weights are separate from the feedforward weights. The f…

2018-11-19abs ↗pdf ↗

Transformers can outperform feedforward and recurrent networks due to dynamic sparsity.

problem Understanding when and why Transformers outperform other neural network architectures.
method Analyzing a sequence-to-sequence data generating model with dynamic sparsity, proving sample complexity differences between feedforward, recurrent, and Transformers.
result Transformers can learn dynamic sparsity models with lower sample complexity than feedforward and recurrent networks.

It is often hypothesized that a crucial role for recurrent connections in the brain is to constrain the set of possible response patterns, thereby shaping the neural code. This implies the existence of neural codes that cannot arise solely from feedforward processing. We set out to find such codes in the context of one…

2013-10-14abs ↗pdf ↗

We present the Video Ladder Network (VLN) for efficiently generating future video frames. VLN is a neural encoder-decoder model augmented at all layers by both recurrent and feedforward lateral connections. At each layer, these connections form a lateral recurrent residual block, where the feedforward connection repres…

2016-12-06abs ↗pdf ↗

TVS-FNNs can approximate any continuous function on expanded input spaces.

problem Processing a broader range of inputs like sequences and matrices.
method Proving a universal approximation theorem for TVS-FNNs.
result TVS-FNNs can approximate any continuous function on expanded input spaces.

How can local-search methods such as stochastic gradient descent (SGD) avoid bad local minima in training multi-layer neural networks? Why can they fit random labels even given non-convex and non-smooth architectures? Most existing theory only covers networks with one hidden layer, so can we go deeper? In this paper, w…

2018-10-29abs ↗pdf ↗

Neural networks extrapolate poorly in simple tasks but succeed in complex ones.

problem Understanding neural networks' extrapolation capabilities and conditions for success.
method Analyzing ReLU MLPs and GNNs, connecting to neural tangent kernel.
result ReLU MLPs learn linear functions but not most nonlinear ones, while GNNs succeed in complex tasks due to task-specific non-linearities.

Predicts trainability of deep neural networks using reconstruction entropy.

problem Predicting the initial conditions for trainability of deep neural networks.
method Cascade of auxiliary networks to reconstruct input from activation layers, computing relative entropy.
result Predicts trainability of deep feedforward networks on various datasets with a single epoch.

Recurrent neural networks can learn complex transduction problems that require maintaining and actively exploiting a memory of their inputs. Such models traditionally consider memory and input-output functionalities indissolubly entangled. We introduce a novel recurrent architecture based on the conceptual separation b…

2018-11-08abs ↗pdf ↗

Study uses neural networks to improve option pricing accuracy.

problem Reducing variance in Monte Carlo estimators for option pricing.
method Characterizes neural networks' universal approximation property and applies it to sampling measures.
result Sampling measures generated by neural networks can approximate optimal measures arbitrarily well.

This paper proposes a novel approach to train deep neural networks by unlocking the layer-wise dependency of backpropagation training. The approach employs additional modules called local critic networks besides the main network model to be trained, which are used to obtain error gradients without complete feedforward …

2018-05-03abs ↗pdf ↗

We show that there is a simple (approximately radial) function on Rd\reals^d, expressible by a small 3-layer feedforward neural networks, which cannot be approximated by any 2-layer network, to more than a certain constant accuracy, unless its width is exponential in the dimension. The result holds for virtually all kn…

2015-12-12abs ↗pdf ↗

This paper tackles high-dimensional uncertainty quantification with semi-supervised learning.

problem High-dimensional uncertainty quantification due to the curse of dimensionality.
method Autoencoder for dimension reduction, DFN for mapping and reconstruction, GP for surrogate modeling, semi-supervised learning for accuracy.
result The framework effectively reduces uncertainty quantification and reliability analysis for high-dimensional problems.

We provide novel guaranteed approaches for training feedforward neural networks with sparse connectivity. We leverage on the techniques developed previously for learning linear networks and show that they can also be effectively adopted to learn non-linear networks. We operate on the moments involving label and the sco…

2014-12-08abs ↗pdf ↗

New findings show modern neural networks have finite sample complexity in o-minimal structures.

problem Understanding the learnability of modern neural networks in a broad context.
method Analyzing feedforward neural networks definable in o-minimal structures.
result Modern neural networks, including MLPs, CNNs, GNNs, and transformers, have finite sample complexity in the agnostic PAC setting.

FNNs can be made more interpretable with statistical methods.

problem FNNs lack interpretability and are often used as black-box models.
method Supplement FNNs with statistical inference and covariate-effect visualizations.
result FNNs can be made more like traditional statistical models.

Learning weights in a spiking neural network with hidden neurons, using local, stable and online rules, to control non-linear body dynamics is an open problem. Here, we employ a supervised scheme, Feedback-based Online Local Learning Of Weights (FOLLOW), to train a network of heterogeneous spiking neurons with hidden l…

2017-12-29abs ↗pdf ↗