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

316192122 · Jun 202019922001200920172026
48 results for Forward Propagation

New algorithm optimizes nonlinear SDEs online with convergence guarantees.

problem Optimizing nonlinear stochastic differential equations (SDEs) is computationally challenging.
method Forward propagation algorithm that solves an SDE derived using forward differentiation.
result Convergence theorem for nonlinear dissipative SDEs with bounds on stochastic fluctuations.

We propose a feed-forward inference method applicable to belief and neural networks. In a belief network, the method estimates an approximate factorized posterior of all hidden units given the input. In neural networks the method propagates uncertainty of the input through all the layers. In neural networks with inject…

2018-03-28abs ↗pdf ↗

Innovative PGMs match neural networks, revealing precise approximations during forward propagation.

problem Lack of precise semantics and probabilistic interpretation in neural networks.
method Constructing infinite tree-structured PGMs that correspond to neural networks.
result DNNs perform precise approximations of PGM inference during forward propagation.

NoProp learns neural networks without full back-propagation or forward-propagation.

problem Learning hierarchical representations in neural networks.
method NoProp independently learns each block to denoise a noisy target using local targets and back-propagation within the block.
result NoProp is a viable learning algorithm that is easy to use and computationally efficient.

Dropout has proven to be an effective technique for regularization and preventing the co-adaptation of neurons in deep neural networks (DNN). It randomly drops units with a probability pp during the training stage of DNN. Dropout also provides a way of approximately combining exponentially many different neural networ…

2018-08-29abs ↗pdf ↗

Field theory explains optimal scaling in ResNets for signal propagation.

problem Understanding optimal scaling parameter for ResNet performance.
method Finite-size field theory for ResNets to study signal propagation and scaling.
result Analytical expressions for optimal scaling parameter, independent of other hyperparameters.

New methods for uncertainty in neural networks with leaky ReLU activations.

problem Uncertainty in feed-forward neural networks with random input perturbations.
method Analytical expressions for PDF and moments of neural network output, linearization of leaky ReLU, Gaussian copula surrogate models.
result Accurate statistical results for large input perturbations, excellent agreement with Monte Carlo simulations.

This paper extends ResNet theory to infinitely deep networks, linking them to diffusion processes.

problem Training infinitely deep ResNets with i.i.d. initializations leads to undesirable properties.
method Introduced doubly infinite ResNets with i.i.d. initializations, linking to diffusion processes.
result The dynamics of quantities of interest converge to deterministic limits in the limit of infinite depth.

Bayesian neural networks (BNNs) have developed into useful tools for probabilistic modelling due to recent advances in variational inference enabling large scale BNNs. However, BNNs remain brittle and hard to train, especially: (1) when using deep architectures consisting of many hidden layers and (2) in situations wit…

2019-10-23abs ↗pdf ↗

PFP-BNNs offer a fast, deterministic approach to Bayesian neural networks.

problem Limited uncertainty handling in traditional neural networks restricts their use in safety-critical settings.
method Probabilistic Forward Pass (PFP) approximates Stochastic Variational Inference (SVI) for efficient BNNs.
result PFP-BNNs achieve up to 4200x speedup over SVI-BNNs while maintaining similar accuracy and uncertainty.

A new method for target propagation using iterative approximations converges fast and is more biologically plausible.

problem Improving target propagation methods for neural networks.
method Iterative approximate inverses and local auto-encoders.
result The method converges exponentially fast under certain conditions.

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.

While neural networks have acted as a strong unifying force in the design of modern AI systems, the neural network architectures themselves remain highly heterogeneous due to the variety of tasks to be solved. In this chapter, we explore how to adapt the Layer-wise Relevance Propagation (LRP) technique used for explain…

2019-09-25abs ↗pdf ↗

The Resilient Propagation (Rprop) algorithm has been very popular for backpropagation training of multilayer feed-forward neural networks in various applications. The standard Rprop however encounters difficulties in the context of deep neural networks as typically happens with gradient-based learning algorithms. In th…

2015-09-15abs ↗pdf ↗

Artificial neural networks are most commonly trained with the back-propagation algorithm, where the gradient for learning is provided by back-propagating the error, layer by layer, from the output layer to the hidden layers. A recently discovered method called feedback-alignment shows that the weights used for propagat…

2016-09-06abs ↗pdf ↗

NES optimizes discrete structured VAEs effectively without gradient propagation.

problem Learning high-dimensional discrete latent spaces in generative models.
method Natural Evolution Strategies (NES) for gradient-free optimization of discrete structures.
result NES effectively optimizes discrete structured VAEs, comparable to gradient-based methods.

SGD converges with perturbed forward-backward passes, explained by geometric amplification.

problem Analyzing convergence of SGD with perturbed forward-backward passes in composite optimization.
method Characterized propagation and amplification of perturbations, derived convergence guarantees for non-convex and PL objectives.
result Perturbations cascade through the computational graph, affecting convergence order under specific conditions.

In this effort, we propose a new deep architecture utilizing residual blocks inspired by implicit discretization schemes. As opposed to the standard feed-forward networks, the outputs of the proposed implicit residual blocks are defined as the fixed points of the appropriately chosen nonlinear transformations. We show …

2019-05-24abs ↗pdf ↗

Theoretical framework for target propagation shows differences from backpropagation.

problem Understanding and improving target propagation for neural networks.
method Mathematical optimization analysis and novel reconstruction loss.
result A novel reconstruction loss improves feedback weight training and introduces architectural flexibility.

Recently, a technique called Layer-wise Relevance Propagation (LRP) was shown to deliver insightful explanations in the form of input space relevances for understanding feed-forward neural network classification decisions. In the present work, we extend the usage of LRP to recurrent neural networks. We propose a specif…

2017-06-22abs ↗pdf ↗

New algorithm for collective Gaussian hidden Markov models inference.

problem Inference of collective Gaussian hidden Markov models from aggregate data.
method Collective Gaussian forward-backward algorithm, extending Sinkhorn belief propagation.
result Convergence guarantee and applicability to single individual Kalman filter.

FP uses random projections to train networks without feedback, achieving comparable performance to backpropagation.

problem Training neural networks without feedback from downstream layers.
method Forward Projection (FP) method that uses randomised nonlinear projections and closed-form regression.
result FP achieves comparable generalisation to backpropagation methods with a single forward pass, offering significant speedup.

We present a Statistical Mechanics (SM) model of deep neural networks, connecting the energy-based and the feed forward networks (FFN) approach. We infer that FFN can be understood as performing three basic steps: encoding, representation validation and propagation. From the meanfield solution of the model, we obtain a…

2018-05-22abs ↗pdf ↗

GAIT-prop derives a biologically plausible learning rule from backpropagation.

problem Biological implausibility in traditional backpropagation for neural networks.
method GAIT-prop uses a top-down model to convert output error into plausible targets for weight updates.
result GAIT-prop and backpropagation give identical weight updates under certain conditions.

The back-propagation algorithm is widely used for learning in artificial neural networks. A challenge in machine learning is to create models that generalize to new data samples not seen in the training data. Recently, a common flaw in several machine learning algorithms was discovered: small perturbations added to the…

2015-10-14abs ↗pdf ↗

We develop deep Poisson-gamma dynamical systems (DPGDS) to model sequentially observed multivariate count data, improving previously proposed models by not only mining deep hierarchical latent structure from the data, but also capturing both first-order and long-range temporal dependencies. Using sophisticated but simp…

2018-10-26abs ↗pdf ↗

Training recurrent neural networks (RNNs) on long sequence tasks is plagued with difficulties arising from the exponential explosion or vanishing of signals as they propagate forward or backward through the network. Many techniques have been proposed to ameliorate these issues, including various algorithmic and archite…

2019-01-25abs ↗pdf ↗

New algorithm estimates past and future diffusion processes on networks.

problem Estimating past and future states of concurrent diffusion processes on networks.
method Extension of independent-cascade model, Belief-Propagation algorithm.
result Scalable and convergent algorithm for estimating diffusion processes.

Paper improves neural network robustness analysis for safety-critical systems.

problem Uncertainty in neural network outputs for safety-critical systems.
method Unified propagation and partition approaches to provide tighter bounds.
result Proposed algorithms give tighter bounds than existing methods for the same computation time.

The biological plausibility of the backpropagation algorithm has long been doubted by neuroscientists. Two major reasons are that neurons would need to send two different types of signal in the forward and backward phases, and that pairs of neurons would need to communicate through symmetric bidirectional connections. …

2018-08-14abs ↗pdf ↗