Efficient importance sampling schemes for a feed-forward network

DOI10.1145/2517450MaRDI QIDQ2828124zbMATH OpenOpenAlexWikidataFDO

Authors Leila Setayeshgar, Hui Wang

Publication date 24 October 2016

Published in ACM Transactions on Modeling and Computer Simulation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2517450

zbMATH Keywords

importance samplingasymptotic optimalitysubsolution

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Learning and adaptive systems in artificial intelligence (68T05) Large deviations (60F10) Applications of stochastic analysis (to PDEs, etc.) (60H30)

Recommendations

• Efficient Bayes inference in neural networks through adaptive importance sampling
• Importance sampling for Jackson networks
• scientific article; zbMATH DE number 1881102
• Importance sampling algorithms for the propagation of probabilities in belief networks
• Importance sampling algorithms for Bayesian networks: principles and performance
• Feedforwarding Under Sampling
• Importance sampling and mean-square error in neural detector training
• Efficient importance sampling in mixture frameworks
• Performance evaluation of an importance sampling technique in a Jackson network

Cited in

(3)

• Excessive backlog probabilities of two parallel queues
• Approximation of excessive backlog probabilities of two tandem queues
• Dynamic importance sampling for queueing networks

This page was built for publication: Efficient importance sampling schemes for a feed-forward network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2828124)