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

79158237316 · Jun 202019922001200920172026
48 results for error propagation

Proposes QEP to mitigate quantization error propagation in layer-wise post-training quantization.

problem Growth of quantization errors across layers degrades performance, especially in low-bit regimes.
method Quantization Error Propagation (QEP) framework that explicitly propagates and compensates for quantization errors.
result QEP-enhanced layer-wise PTQ achieves substantially higher accuracy, especially in low-bit regimes.

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 ↗

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.

This lecture presents recent advances in the theory of errors propagation. We first explain in which cases the propagation of errors may be performed with a first order differential calculus or needs a second order differential calculus. Then we point out the link between error propagation and the concept of second ord…

2007-05-03abs ↗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 paper employs the extrinsic information transfer (EXIT) method, a technique imported from the analysis of the iterative decoding of error control codes, to study the performance of belief propagation in community detection in the presence of side information. We consider both the detection of a single (hidden) com…

2019-01-08abs ↗pdf ↗

Two new algorithms improve Q* approximation in batch RL with linear error propagation.

problem Improving Q* approximation in batch reinforcement learning.
method Two novel algorithms that estimate Bellman error directly, without quadratic dependence.
result Linear-in-horizon error propagation for batch RL algorithms.

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.

A graphical model is a structured representation of locally dependent random variables. A traditional method to reason over these random variables is to perform inference using belief propagation. When provided with the true data generating process, belief propagation can infer the optimal posterior probability estimat…

2020-03-04abs ↗pdf ↗

Paper improves spectral learning of HMMs to avoid local optima and improve robustness.

problem Spectral learning of HMMs can get stuck in local optima and degrade due to unchecked error propagation.
method Developed a novel algorithm (PSHMM) and online learning variants to mitigate error propagation and nonstationarity.
result PSHMM provides more robust estimation and forecasting compared to SHMM and B-W algorithm.

The paper proposes a scalable framework for uncertainty quantification and propagation in surrogate-based Bayesian inference.

problem Uncertainty in surrogate models and its impact on inference and decision-making.
method Bayesian inference methods for surrogate models with measurement data.
result Scalable framework for uncertainty quantification and propagation in surrogate models.

This paper presents a locally decoupled network parameter learning with local propagation. Three elements are taken into account: (i) sets of nonlinear transforms that describe the representations at all nodes, (ii) a local objective at each node related to the corresponding local representation goal, and (iii) a local…

2018-05-20abs ↗pdf ↗

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.

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.

Improved PoC for MFLD reduces approximation error and provides model ensemble guarantees.

problem Quantifying optimization complexity in mean-field Langevin dynamics.
method Refined defective log-Sobolev inequality for neural network training.
result Improved PoC result with reduced approximation error and theoretical model ensemble guarantees.

WAEs offer a statistical understanding of density estimation and error bounds.

problem Concurrent density estimation with neural network-induced transformations.
method Statistical analysis of WAEs focusing on upper bounds and error propagation.
result Established deterministic upper bounds on WAE errors and explored their resilience.

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 ↗

Loss-calibrated EP improves Bayesian decision-making by focusing on utility-sensitive posterior approximations.

problem Bayesian decision-making under asymmetric utility functions.
method Loss-calibrated expectation propagation (Loss-EP) that tilts the posterior towards higher utility decisions.
result Loss-EP can capture useful information for decision-making under asymmetric penalties.

Paper uses AI to predict stock market volatility with neural networks and genetic algorithms.

problem Traditional methods for predicting stock market volatility have high errors.
method Back-propagation neural network and genetic algorithm integrated model.
result The model predicts future volatility with low errors and high accuracy.

The belief propagation (BP) algorithm is widely applied to perform approximate inference on arbitrary graphical models, in part due to its excellent empirical properties and performance. However, little is known theoretically about when this algorithm will perform well. Using recent analysis of convergence and stabilit…

2012-06-20abs ↗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 ↗

FSD-CAP improves graph feature imputation under high missing rates.

problem Challenges in imputing missing node features in graphs, especially under high missing rates.
method Two-stage framework: subgraph expansion, fractional diffusion, class-aware propagation.
result Significantly improved imputation quality compared to existing methods, achieving high accuracy on benchmark datasets.

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 ↗

Paper proposes a new method for more accurate group testing of infected patients.

problem Identifying infected patients efficiently with reduced tests and corrected errors.
method Adaptive design of pools based on Bayesian posterior prediction using belief propagation algorithm.
result The proposed method results in more accurate identification of infected patients.

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.

We develop new techniques in the theory of convex surfaces to prove complete classification results for tight contact structures on lens spaces, solid tori, and T^2 X I. Erratum: In this note we seek to remedy errors which appeared in version 2 and were propagated in subsequent papers.

1999-10-24abs ↗pdf ↗

Recent breakthroughs in defenses against adversarial examples, like adversarial training, make the neural networks robust against various classes of attackers (e.g., first-order gradient-based attacks). However, it is an open question whether the adversarially trained networks are truly robust under unknown attacks. In…

2019-06-05abs ↗pdf ↗

Unified neural network framework for context-aware Gaussian overbounds in uncertainty propagation.

problem Uncertainty quantification in safety-critical settings requires conservative bounds, but existing methods often fail to compose and are overly conservative.
method Proposes a learning framework that trains neural networks to produce context-aware Gaussian overbounds with provable conservatism.
result The method yields tighter bounds while maintaining conservatism on the enforced grid and in experiments.

Modeling wildfire aerosols using satellite data to predict solar radiation reduction.

problem Accurately estimate and predict AOD propagation from wildfires using multi-source satellite data.
method Physics-informed statistical modeling integrating multi-source satellite data with an advection-diffusion equation.
result The proposed approach accurately predicts AOD propagation and demonstrates model interpretability.

SGMs are robust to practical errors via uncertainty quantification.

problem Robustness of SGMs to practical implementation errors.
method Wasserstein uncertainty propagation (WUP) theorem and Bernstein estimates.
result SGMs are provably robust to multiple sources of error.

Approximate message passing algorithm enjoyed considerable attention in the last decade. In this paper we introduce a variant of the AMP algorithm that takes into account glassy nature of the system under consideration. We coin this algorithm as the approximate survey propagation (ASP) and derive it for a class of low-…

2018-07-03abs ↗pdf ↗

Improved particle approximation for mean-field neural networks.

problem Particle approximation error for mean-field neural networks.
method Improved particle approximation error by leveraging the problem structure in risk minimization.
result Established an LSI-constant-free particle approximation error concerning the objective gap.