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.

169,051 papers · 148 categories

Trend · papers per month

179358537716 · Jun 202019922001200920182026
48 results for difference target propagation

Paper proposes new neural network learning algorithms inspired by predictive coding.

problem Finding biologically plausible alternatives to back-propagation of errors.
method Error-driven Local Representation Alignment (LRA-E) and Difference Target Propagation.
result Both proposed algorithms yield stable performance and strong generalization in training deeper, highly nonlinear networks.

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.

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.

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.

Uniform-in-time analysis for Stein Variational Gradient Descent across various metrics.

problem Understanding long-term behavior of finite-particle systems in relation to their mean-field limits.
method Developed uniform-in-time propagation-of-chaos results for continuous-time SVGD using cutoff strategies and finite-dimensional theories.
result Uniform-in-time propagation-of-chaos bounds in various metrics, including Langevin kernel Stein discrepancy, Wasserstein-1, and Wasserstein-2 distances.

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 2008 financial crisis revealed banking consolidation paradoxically increased systemic fragility and global financial contagion with negligible spatial decay.

problem Fundamental vulnerabilities in interconnected banking systems during the 2008 financial crisis were inadequately addressed by existing frameworks.
method Developed a unified spatial-network framework using spectral analysis of network Laplacian operators combined with spatial difference-in-differences identification.
result Banking consolidation paradoxically increased systemic fragility and global financial contagion with negligible spatial decay.

Proposes a method to propagate uncertainty in neural networks for sparse coding.

problem Uncertainty in neural networks for sparse coding.
method Representing the target vector as a spike and slab distribution at each layer, deriving gradients of normalisation constants, and using Bayesian inference.
result Designs a novel Bayesian neural network for sparse coding.

Deep networks have been successfully applied to learn transferable features for adapting models from a source domain to a different target domain. In this paper, we present joint adaptation networks (JAN), which learn a transfer network by aligning the joint distributions of multiple domain-specific layers across domai…

2016-05-21abs ↗pdf ↗

We study the propagation of bosonic strings in singular target space-times. For describing this, we assume this target space to be the quotient of a smooth manifold MM by a singular foliation F{\cal F} on it. Using the technical tool of a gauge theory, we propose a smooth functional for this scenario, such that the p…

2016-08-10abs ↗pdf ↗

Elastic co-clustering improves clustering of single-cell genomic data.

problem Improving clustering performance of single-cell genomic datasets.
method Elastic coupled co-clustering in an unsupervised transfer learning framework.
result Our algorithm significantly improves clustering performance over traditional methods.

Proposes mGBDTs for learning hierarchical representations in gradient boosting decision trees.

problem Inability of gradient boosting decision trees to learn hierarchical representations.
method Introduces multi-layered GBDT forest (mGBDTs) with explicit emphasis on hierarchical learning.
result Jointly trained mGBDTs can learn hierarchical representations effectively without backpropagation.

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.

The paper analyzes how synthetic data training degrades diffusion models, providing bounds and characterizing different drift regimes.

problem The degradation of performance in diffusion models trained on synthetic data.
method Theoretical analysis of score-based diffusion models, focusing on the accumulated divergence between generated and target distributions.
result Upper and lower bounds on the accumulated divergence, providing the first lower bound for diffusion models.

Defines a calculus for integrating Moreau envelopes in differentiable programming.

problem Lack of a mathematical framework for applying Moreau envelopes to deep networks and machine learning systems.
method Develops a compositional calculus adapted to Moreau envelopes and integrates it into differentiable programming.
result Integrates Moreau envelopes into differentiable programming, enabling new gradient back-propagation methods.

Proposes a new method to estimate individual treatment effects using unlabeled data.

problem Difficult estimation of individual treatment effects due to high costs of intervention studies.
method Combines causal inference matching and semi-supervised learning label propagation.
result Demonstrates successful mitigation of data scarcity in ITE estimation.

We discuss positivity properties of `distinguished propagators', i.e. distinguished inverses of operators that frequently occur in scattering theory and wave propagation. We relate this to the work of Duistermaat and Hörmander on distinguished parametrices (approximate inverses), which has played a major role in quantu…

2014-11-26abs ↗pdf ↗

New algorithms for deep learning mimic brain's learning but struggle with complex images.

problem Evaluating biologically inspired deep learning algorithms on complex image datasets.
method Implemented and compared various biologically inspired algorithms (TP, FA, DTP) on MNIST, CIFAR-10, and ImageNet.
result Biologically inspired algorithms perform well on MNIST but poorly on CIFAR and ImageNet, suggesting new architectures or algorithms are needed.

Accelerates DNN robustness verification with target labels.

problem Improving the robustness of deep neural networks against adversarial attacks.
method Guiding robustness verification with target labels, reducing search space and using symbolic interval propagation and linear relaxation.
result Significantly improves DNN verification speed by 36X, especially when perturbation distance is reasonable.

LNPE enhances local connections in embeddings using extended neighbor propagation.

problem Improving local connections and interactions in nonlinear dimensionality reduction.
method Inspired by GCN, LNPE extends 1-hop neighbors to n-hop neighbors in LLE.
result LNPE produces more faithful and robust embeddings with better topological and geometrical properties.

TD learning with neural networks can lead to worse solutions than Monte-Carlo methods, especially in discontinuous value functions.

problem TD learning with neural networks can propagate approximation errors, leading to worse solutions than Monte-Carlo methods.
method Investigated the issue of approximation errors in areas of sharp discontinuities of the value function being further propagated by bootstrap updates.
result Empirical and analytical evidence shows that leakage propagation occurs in TD learning with function approximation, especially in sharp discontinuities.

TD learning reduces interference, leading to better generalization.

problem Understanding and reducing interference in TD learning for better generalization.
method Analyzing the inner product of gradients as interference, comparing TD and supervised learning, and examining the dynamics of interference and bootstrapping.
result TD learning leads to low-interference, under-generalizing parameters, while supervised learning does the opposite.

Study eigenvalues and eigenvectors in neural networks, focusing on signal propagation.

problem Characterize signal eigenvalues and eigenvectors in neural networks.
method Characterizes signal eigenvalues and eigenvectors for a nonlinear spiked covariance model.
result Provides precise quantitative characterizations of signal eigenvalues and eigenvectors in neural networks.

NetBiTE predicts drug sensitivity and identifies biomarkers in cancer.

problem Predicting drug sensitivity and identifying biomarkers in cancer.
method NetBiTE combines prior knowledge and gene expression data using a biased tree ensemble approach.
result NetBiTE outperforms RF in predicting IC50 drug sensitivity for drugs targeting membrane receptor pathways.

New approach learns neural network parameters by balancing local objectives and data propagation constraints.

problem Learning neural network parameters with trade-offs between local objectives and data propagation.
method Introduces nonlinear transforms and local propagation constraints to balance learning objectives.
result Validated approach on image recognition tasks with improved learning time and network size.

The study learns neural update rules by remembering past experiences.

problem Developing efficient online learning rules for neural networks.
method Representing neurons with vectors, using meta-neural networks for updates, and training for remembering past experiences.
result The approach reveals insights into learning rules and could be used for complex tasks like episodic memory.

Domain adaptation is transfer learning which aims to generalize a learning model across training and testing data with different distributions. Most previous research tackle this problem in seeking a shared feature representation between source and target domains while reducing the mismatch of their data distributions.…

2017-04-13abs ↗pdf ↗

Proposes a framework to improve domain adaptation without labeled data.

problem Improving adaptability and preserving intrinsic data structure in unsupervised domain adaptation.
method Discriminative Manifold Propagation framework using soft labels and manifold metric alignment.
result The method achieves better transferability and discriminability compared to existing approaches.

Using back-propagation and its variants to train deep networks is often problematic for new users. Issues such as exploding gradients, vanishing gradients, and high sensitivity to weight initialization strategies often make networks difficult to train, especially when users are experimenting with new architectures. Her…

2018-03-05abs ↗pdf ↗

New algorithm for causal bandits with propagating interventions.

problem Handling causal graphs with side-information for sequential decision-making.
method Proposes a novel causal bandit algorithm that can propagate interventions throughout a causal graph.
result Achieves O(γlog(AT)/T)O(\sqrt{ γ^* \log(|\mathcal{A}|T) / T}) regret bound, where γγ^* depends on causal graph structure.

Meta-learning improves few-shot learning by propagating knowledge across related classes on a graph.

problem Few-shot learning suffers from insufficient training data.
method Developed a Gated Propagation Network (GPN) that learns to propagate messages between prototypes of different classes on a graph.
result GPN outperforms recent meta-learning methods on benchmark datasets.

One pixel can significantly alter deep neural network outputs, revealing propagation patterns and vulnerability hotspots.

problem Understanding how a single pixel modification affects deep neural networks.
method Propagation Maps and locality analysis to visualize and understand the impact of pixel modifications.
result One pixel modifications can propagate through deep networks, affecting the final output and revealing vulnerability patterns.

UVU simplifies value uncertainty quantification in RL.

problem Estimating epistemic uncertainty in value functions for reinforcement learning.
method UVU uses squared prediction errors between an online learner and a fixed, randomly initialized target network, incorporating policy-conditional value uncertainty.
result UVU achieves equal performance to large ensembles on challenging offline RL settings, with computational savings.

A key aspect of word of mouth marketing are emotions. Emotions in texts help propagating messages in conventional advertising. In word of mouth scenarios, emotions help to engage consumers and incite to propagate the message further. While the function of emotions in offline marketing in general and word of mouth marke…

2014-09-16abs ↗pdf ↗

Proposes a method to select features for subgroup datasets with systematic missing data.

problem Feature selection for datasets with subgroup structure and systematic missing data.
method Develops a heterogeneous graph neural network to propagate information between feature-subgroup-target variable connections.
result Demonstrates improved feature selection performance and scalability.