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

21426283 · Jun 202019922001200920172026
48 results for end-to-end backpropagation

PETRA enables parallel training of deep models with reversible architectures.

problem Challenges in parallelizing deep model training.
method Introduces PETRA, a novel approach for parallelizing gradient computations in reversible architectures.
result Achieves competitive accuracies on CIFAR-10, ImageNet32, and ImageNet using ResNet models.

It is widely believed that the backpropagation algorithm is essential for learning good feature detectors in early layers of artificial neural networks, so that these detectors are useful for the task performed by the higher layers of that neural network. At the same time, the traditional form of backpropagation is bio…

2018-06-26abs ↗pdf ↗

NOVAS uses adaptive stochastic search for non-convex optimization in deep networks.

problem Non-convex optimization challenges in deep neural networks.
method Adaptive stochastic search for non-convex optimization.
result NOVAS outperforms existing alternatives in a structured prediction task.

Substring kernels are classical tools for representing biological sequences or text. However, when large amounts of annotated data are available, models that allow end-to-end training such as neural networks are often preferred. Links between recurrent neural networks (RNNs) and substring kernels have recently been dra…

2019-06-07abs ↗pdf ↗

LoCo learns local representations without end-to-end synchronization, improving performance on complex tasks.

problem Learning local representations without end-to-end synchronization constraints.
method Overlap local blocks to increase decoder depth and allow feedback from upper to lower layers.
result LoCo closes the performance gap between local learning and end-to-end contrastive learning.

Proposes neural dynamic mode decomposition for end-to-end modeling of nonlinear dynamics.

problem Understanding and modeling nonlinear dynamical systems.
method Trains neural networks to minimize forecast error based on spectral decomposition in the lifted space.
result Demonstrates effectiveness in eigenvalue estimation and forecast performance.

We introduce the value iteration network (VIN): a fully differentiable neural network with a `planning module' embedded within. VINs can learn to plan, and are suitable for predicting outcomes that involve planning-based reasoning, such as policies for reinforcement learning. Key to our approach is a novel differentiab…

2016-02-09abs ↗pdf ↗

DiffusionBlocks trains neural networks by breaking them into independent blocks, reducing memory usage.

problem Memory bottlenecks in end-to-end neural network training.
method Transforming transformer-based networks into independent trainable blocks via a denoising process.
result Independent block-wise training matches end-to-end training performance while reducing memory requirements.

We propose a new architecture and training methodology for generative adversarial networks. Current approaches attempt to learn the transformation from a noise sample to a generated data sample in one shot. Our proposed generator architecture, called ChainGAN\textit{ChainGAN}, uses a two-step process. It first attempts to tr…

2018-11-20abs ↗pdf ↗

SAG-VAE learns data representations and feature relations end-to-end.

problem Vanilla VAEs cannot learn relations between features.
method Inspired by Graph Neural Networks, SAG-VAE jointly infers data representations and feature relations.
result SAG-VAE generates new data via graph convolution and is robust to perturbations.

Local Hebbian learning is believed to be inferior in performance to end-to-end training using a backpropagation algorithm. We question this popular belief by designing a local algorithm that can learn convolutional filters at scale on large image datasets. These filters combined with patch normalization and very steep …

2019-08-14abs ↗pdf ↗

We introduce a new family of deep neural network models. Instead of specifying a discrete sequence of hidden layers, we parameterize the derivative of the hidden state using a neural network. The output of the network is computed using a black-box differential equation solver. These continuous-depth models have constan…

2018-06-19abs ↗pdf ↗

A new method for decision-focused learning using diffusion models.

problem Inability of deterministic point predictions to capture stochasticity in real-world environments.
method Proposes a diffusion-based DFL approach that trains a diffusion model to represent uncertain parameters and optimizes decisions through stochastic optimization.
result Empirically shows consistent outperformance over strong baselines in decision quality.

We present DiffTaichi, a new differentiable programming language tailored for building high-performance differentiable physical simulators. Based on an imperative programming language, DiffTaichi generates gradients of simulation steps using source code transformations that preserve arithmetic intensity and parallelism…

2019-10-01abs ↗pdf ↗

We propose random hinge forests, a simple, efficient, and novel variant of decision forests. Importantly, random hinge forests can be readily incorporated as a general component within arbitrary computation graphs that are optimized end-to-end with stochastic gradient descent or variants thereof. We derive random hinge…

2018-02-12abs ↗pdf ↗

We view a conic optimization problem that has a unique solution as a map from its data to its solution. If sufficient regularity conditions hold at a solution point, namely that the implicit function theorem applies to the normalized residual function of [Busseti et al., 2018], the problem solution map is differentiabl…

2019-03-13abs ↗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.

This work shows synthetic gradients can outperform backpropagation in sample efficiency.

problem The efficiency of backpropagation in training neural networks.
method Unified vectorized feedback framework for loss-based and reward-based learning, introducing synthetic gradients.
result Synthetic gradients can achieve lower gradient-estimation mean squared error than backpropagation under certain conditions.

New algorithm shows neural networks can learn without full backpropagation.

problem Stochastic gradient descent with backpropagation is non-biologically plausible.
method Random and fixed backpropagation weights in a feedback alignment algorithm.
result Error converges to zero exponentially fast in overparameterized networks.

New method constrains CNN filter frequencies to improve robustness.

problem CNN bias towards low frequency components, leading to poor performance in scenario transformations.
method Frequency domain regularization by constraining filter spectra, training valid frequency range end-to-end.
result Demonstrated effectiveness in defending adversarial perturbations, reducing generalization gap, and improving transfer learning.

Neural network learning is usually time-consuming since backpropagation needs to compute full gradients and backpropagate them across multiple layers. Despite its success of existing works in accelerating propagation through sparseness, the relevant theoretical characteristics remain under-researched and empirical stud…

2019-05-24abs ↗pdf ↗

Skip connections improve biologically-inspired learning rules.

problem Biologically-inspired learning rules often underperform compared to backpropagation.
method Introduced skip connections between intermediate layers in biologically-motivated learning rules.
result Skip connections can match the performance of backpropagation and are robust to hyper-parameters.

Pipelined Backpropagation trains large models without batches efficiently.

problem Training large models efficiently on hardware with limited batch sizes.
method Fine-grained Pipelined Backpropagation with Spike Compensation and Linear Weight Prediction.
result Fine-grained Pipelined Backpropagation with a batch size of one matches the accuracy of SGD for multiple networks.

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 ↗

End-to-end framework optimizes financial metrics using neural networks.

problem Difficult portfolio optimization in financial markets due to non-stationarity and high costs.
method Directly optimizes differentiable financial metrics via neural networks, incorporating realistic costs and rebalancing.
result Best model achieves +7.86% total return, outperforming S&P 500 by 12.38 percentage points.

Deep reinforcement learning (DeepRL) agents surpass human-level performance in many tasks. However, the direct mapping from states to actions makes it hard to interpret the rationale behind the decision-making of the agents. In contrast to previous a-posteriori methods for visualizing DeepRL policies, in this work, we …

2018-12-29abs ↗pdf ↗

Mean field theory explains gradient backpropagation in deep dropout networks.

problem Understanding gradient backpropagation in deep dropout networks.
method Applied mean field theory to dropout networks, considering realistic training conditions.
result Gradient backpropagation length is limited by depth scales, not just independence assumption.

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.