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

18365472 · Jun 202019922001200920172026
48 results for Backward Propagation

Backward propagation rules for warped products under Ricci flow.

problem Understanding how warped product structures behave under Ricci flow.
method Establishing sufficient conditions for backward propagation of warped product structures.
result Asymptotically conical shrinkers are multiply-warped products over Einstein manifolds.

Optimal liquidation strategy with price impact and signal exploitation.

problem Maximizing revenue-risk in a market with transient and temporary price impact.
method Infinite dimensional stochastic control approach, backward stochastic differential equation, operator-valued Riccati equation.
result Explicit expression for the optimal trading strategy.

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.

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.

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 ↗

A multilayer perceptron can behave as a generative classifier by applying bidirectional learning (BL). It consists of training an undirected neural network to map input to output and vice-versa; therefore it can produce a classifier in one direction, and a generator in the opposite direction for the same data. The lear…

2018-05-21abs ↗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.

Backpropagation algorithm is indispensable for the training of feedforward neural networks. It requires propagating error gradients sequentially from the output layer all the way back to the input layer. The backward locking in backpropagation algorithm constrains us from updating network layers in parallel and fully l…

2018-04-27abs ↗pdf ↗

Neural network has attracted great attention for a long time and many researchers are devoted to improve the effectiveness of neural network training algorithms. Though stochastic gradient descent (SGD) and other explicit gradient-based methods are widely adopted, there are still many challenges such as gradient vanish…

2020-02-10abs ↗pdf ↗

The paper analyzes error propagation in dynamic programming for stochastic control and option pricing.

problem Error propagation in dynamic programming for stochastic control and option pricing.
method Formulated a general dynamic programming framework, used RKHSs for nonparametric regression, and Monte Carlo subsampling for estimating continuation value.
result Proposed a rigorous error decomposition and control mechanism for error propagation in dynamic programming.

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 ↗

Study optimal investment in large populations of competitive, heterogeneous agents.

problem Maximizing utility in a large, interacting agent system with relative performance concerns.
method Analyzes stochastic utility maximization game in finite and infinite agent settings, using graphon models and backward stochastic differential equations.
result Convergence of Nash equilibria and optimal utilities from finite to infinite agent models under specific conditions.

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.

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.

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 ↗

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 ↗

The paper explores how planning with models improves credit assignment in reinforcement learning.

problem Improving credit assignment in reinforcement learning.
method Investigates the use of forward and backward models for planning in reinforcement learning.
result Establishes the relative merits and limitations of forward and backward planning mechanisms.

A new method for deep learning imbalance or noise, ABSGD, improves efficiency and effectiveness.

problem Data imbalance or label noise in deep learning.
method A modification of momentum SGD with individual-level weights proportional to loss values.
result Guaranteed convergence to stationary points of DRO problems, capturing class diversity.

Paper analyzes stability and forgetting in score-based generative models.

problem Understanding the stability and long-time behavior of generative models.
method Quantitative bounds on sampling error using stability and forgetting properties of the Markov chain.
result Provides practical consequences of stability and contraction mechanism in sampling.

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 ↗

Recently, several studies proposed methods to utilize some classes of optimization problems in designing deep neural networks to encode constraints that conventional layers cannot capture. However, these methods are still in their infancy and require special treatments, such as analyzing the KKT condition, for deriving…

2020-02-07abs ↗pdf ↗

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 ↗

Neural network training is computationally and memory intensive. Sparse training can reduce the burden on emerging hardware platforms designed to accelerate sparse computations, but it can affect network convergence. In this work, we propose a novel CNN training algorithm Sparse Weight Activation Training (SWAT). SWAT …

2020-01-07abs ↗pdf ↗

For network architecture search (NAS), it is crucial but challenging to simultaneously guarantee both effectiveness and efficiency. Towards achieving this goal, we develop a differentiable NAS solution, where the search space includes arbitrary feed-forward network consisting of the predefined number of connections. Be…

2019-05-06abs ↗pdf ↗

Automatic differentiation---the mechanical transformation of numeric computer programs to calculate derivatives efficiently and accurately---dates to the origin of the computer age. Reverse mode automatic differentiation both antedates and generalizes the method of backwards propagation of errors used in machine learni…

2014-04-28abs ↗pdf ↗

We conduct mathematical analysis on the effect of batch normalization (BN) on gradient backpropogation in residual network training, which is believed to play a critical role in addressing the gradient vanishing/explosion problem, in this work. By analyzing the mean and variance behavior of the input and the gradient i…

2018-12-02abs ↗pdf ↗

Backpropagation-free RL method trains layers using local signals.

problem Vanishing or exploding gradients in backpropagation-based RL.
method Local pairwise distance matching for layer-wise training without backpropagation.
result Backpropagation-free method achieves competitive performance and stability.

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.