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

9.7%19.5%29.2%38.9% · May 201919922001200920172026
48 results for BP neural networks

We provide a proof of backpropagation algorithm in matrix notation.

problem The lack of a full induction proof of backpropagation algorithm in matrix notation.
method We provide a full induction proof of the BP algorithm in matrix notation, situating it in the framework of matrix differential calculus.
result We prove the validity of the backpropagation algorithm in inductive form.

Modified BP attribution methods often ignore later layers' information, leading to misleading explanations.

problem Misleading explanations from modified BP methods ignoring later layers' information.
method Analysis of 9 modified BP methods including Deep Taylor Decomposition, LRP, Excitation BP, PatternAttribution, DeepLIFT, Deconv, RectGrad, Guided BP.
result Only DeepLIFT does not ignore later layers' information, providing a faithful explanation.

The paper improves DFA for CNN and RNN training to match BP accuracy.

problem Low accuracy in CNN and RNN training using DFA.
method Divide network into modules, apply DFA within, use sparse backward weight, and incorporate dilated convolution and sparse matrix multiplication.
result Achieves BP-level accuracy in CNN and RNN training.

BPNNs learn to solve combinatorial problems faster and more accurately.

problem Generalizing belief propagation for efficient problem solving.
method BPNNs are parameterized operators that operate on factor graphs, generalizing BP. BPNN-D is a learned iterative operator that provably maintains BP's properties.
result BPNN-D converges 1.7x faster on Ising models and provides tighter bounds.

Due to the extremely volatile nature of financial markets, it is commonly accepted that stock price prediction is a task full of challenge. However in order to make profits or understand the essence of equity market, numerous market participants or researchers try to forecast stock price using various statistical, econ…

2018-05-29abs ↗pdf ↗

Proposes a semi-implicit back propagation method for neural networks.

problem Challenges in training neural networks, especially gradient vanishing and small step sizes.
method Proposes a semi-implicit back propagation method using error back propagation and proximal methods.
result The proposed method leads to better performance in terms of loss decreasing and training/validation accuracy compared to SGD and ProxBP.

Adapts BP-based algorithms for deep learning, improving performance and accuracy.

problem Training deep neural networks with discrete weights and activations.
method Message-passing algorithms based on Belief Propagation, with reinforcement field.
result Comparable performance to SGD-inspired heuristics (BinaryNet) and higher accuracy in predictions.

A neural network model minimizes region-based free energy for faster inference in MRFs.

problem Efficient inference in complex Markov random fields (MRFs).
method Region-based Energy Neural Network (RENN) that directly minimizes region-based free energy.
result RENN outperforms other methods in marginal distribution estimation, partition function estimation, and MRF learning.

Bio-inspired neural networks use predictive coding for efficient weight updates.

problem Training artificial neural networks efficiently and biologically plausibly.
method Predictive Coding (PC) updates weights locally using only local information.
result PC provides theoretical advantages like automatic gradient scaling.

Recent changes to greenhouse gas emission policies are catalyzing the electric vehicle (EV) market making it readily accessible to consumers. While there are challenges that arise with dense deployment of EVs, one of the major future concerns is cyber security threat. In this paper, cyber security threats in the form o…

2018-06-07abs ↗pdf ↗

Three-layer networks learn complex hierarchical polynomials of multiple nonlinear features.

problem Understanding how neural networks learn hierarchical features of multiple nonlinear inputs.
method Examine a broad class of functions using three-layer neural networks, showing complete recovery and efficient learning.
result Three-layer neural networks trained via gradient descent can learn hierarchical polynomials of multiple nonlinear features efficiently.

Layer-wise networks have a closed-form solution and a stopping criterion.

problem Training networks one layer at a time without backpropagation.
method Proved the closed-form solution using the kernel Mean Embedding and Neural Indicator Kernel.
result Layer-wise networks have a closed-form solution and a stopping criterion.

Inspired by recent advances in deep learning, we propose a novel iterative BP-CNN architecture for channel decoding under correlated noise. This architecture concatenates a trained convolutional neural network (CNN) with a standard belief-propagation (BP) decoder. The standard BP decoder is used to estimate the coded b…

2017-07-18abs ↗pdf ↗

Improved backpropagation with consequentialism weight updates for neural networks.

problem Improving backpropagation for neural networks, especially with mini-batch training.
method Introducing consequentialism weight updates derived from NLMS for multi-layer neural networks.
result The proposed method outperforms traditional BP and mini-batch training.

In an era when the performance of a single compute device plateaus, software must be designed to scale on massively parallel systems for better runtime performance. However, in the context of training deep learning models, the popular back-propagation (BP) algorithm imposes a strong sequential dependency in the process…

2019-07-23abs ↗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.

BP, a method for sparse recovery, shows generalization error decreases with more features.

problem Understanding the generalization error of overfitting solutions in linear regression.
method Study of Basis Pursuit (BP) for sparse recovery of linear regression models.
result BP's model error decreases with more features, showing double-descent behavior.

Stochastic variance-reduced gradient (SVRG) is a classical optimization method. Although it is theoretically proved to have better convergence performance than stochastic gradient descent (SGD), the generalization performance of SVRG remains open. In this paper we investigate the effects of some training techniques, mi…

2019-08-18abs ↗pdf ↗

The backpropagation (BP) algorithm is often thought to be biologically implausible in the brain. One of the main reasons is that BP requires symmetric weight matrices in the feedforward and feedback pathways. To address this "weight transport problem" (Grossberg, 1987), two more biologically plausible algorithms, propo…

2018-11-08abs ↗pdf ↗

This paper proposes an in-depth re-thinking of neural computation that parallels apparently unrelated laws of physics, that are formulated in the variational framework of the least action principle. The theory holds for neural networks that are also based on any digraph, and the resulting computational scheme exhibits …

2019-07-11abs ↗pdf ↗

Study forecasts aortic pressure with deep learning models.

problem Forecasting noisy, non-stationary aortic pressure.
method Used deep learning models, specifically recurrent neural networks with Legendre Memory Unit, on 25 Hz time series data.
result Recurrent neural networks with Legendre Memory Unit achieved the best performance with an overall forecasting error of 1.8 mmHg.

We provide recovery guarantees for compressible signals that have been corrupted with noise and extend the framework introduced in \cite{bafna2018thwarting} to defend neural networks against 0\ell_0-norm, 2\ell_2-norm, and \ell_{\infty}-norm attacks. Our results are general as they can be applied to most unitary tr…

2019-07-15abs ↗pdf ↗

Max-product Belief Propagation (BP) is a popular message-passing algorithm for computing a Maximum-A-Posteriori (MAP) assignment over a distribution represented by a Graphical Model (GM). It has been shown that BP can solve a number of combinatorial optimization problems including minimum weight matching, shortest path…

2015-09-23abs ↗pdf ↗

Enhances inference of spreading processes using neural-network priors.

problem Estimating initial states of graph processes from partial observations.
method Bayesian framework with single-layer perceptron neural network for initial states; hybrid BP-AMP algorithm.
result Model exhibits first-order phase transitions, creating a statistical-to-computational gap.

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.

Bayesian Power Steering fine-tunes large diffusion models for domain adaptation.

problem Fine-tuning pre-trained diffusion models for tasks in a smaller probability space.
method Bayesian framework with a novel network structure (Bayesian Power Steering).
result Bayesian Power Steering achieves an FID score of 10.49 on the COCO17 dataset.

In manufacture, steel and other metals are mainly cut and shaped during the fabrication process by computer numerical control (CNC) machines. To keep high productivity and efficiency of the fabrication process, engineers need to monitor the real-time process of CNC machines, and the lifetime management of machine tools…

2018-08-16abs ↗pdf ↗