liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Capacity estimation of two-dimensional channels using Sequential Monte Carlo
Linköping University, Department of Electrical Engineering, Automatic Control. Linköping University, The Institute of Technology.
Linköping University, Department of Electrical Engineering, Automatic Control. Linköping University, The Institute of Technology.
Linköping University, Department of Electrical Engineering, Automatic Control. Linköping University, The Institute of Technology.
2014 (English)In: 2014 IEEE Information Theory Workshop, 2014, p. 431-435Conference paper, Published paper (Refereed)
Abstract [en]

We derive a new Sequential-Monte-Carlo-based algorithm to estimate the capacity of two-dimensional channel models. The focus is on computing the noiseless capacity of the 2-D (1, ∞) run-length limited constrained channel, but the underlying idea is generally applicable. The proposed algorithm is profiled against a state-of-the-art method, yielding more than an order of magnitude improvement in estimation accuracy for a given computation time.

Place, publisher, year, edition, pages
2014. p. 431-435
National Category
Control Engineering Computer Sciences Probability Theory and Statistics
Identifiers
URN: urn:nbn:se:liu:diva-112966DOI: 10.1109/ITW.2014.6970868OAI: oai:DiVA.org:liu-112966DiVA, id: diva2:775991
Conference
Information Theory Workshop
Available from: 2015-01-06 Created: 2015-01-06 Last updated: 2018-11-09
In thesis
1. Machine learning using approximate inference: Variational and sequential Monte Carlo methods
Open this publication in new window or tab >>Machine learning using approximate inference: Variational and sequential Monte Carlo methods
2018 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

Automatic decision making and pattern recognition under uncertainty are difficult tasks that are ubiquitous in our everyday life. The systems we design, and technology we develop, requires us to coherently represent and work with uncertainty in data. Probabilistic models and probabilistic inference gives us a powerful framework for solving this problem. Using this framework, while enticing, results in difficult-to-compute integrals and probabilities when conditioning on the observed data. This means we have a need for approximate inference, methods that solves the problem approximately using a systematic approach. In this thesis we develop new methods for efficient approximate inference in probabilistic models.

There are generally two approaches to approximate inference, variational methods and Monte Carlo methods. In Monte Carlo methods we use a large number of random samples to approximate the integral of interest. With variational methods, on the other hand, we turn the integration problem into that of an optimization problem. We develop algorithms of both types and bridge the gap between them.

First, we present a self-contained tutorial to the popular sequential Monte Carlo (SMC) class of methods. Next, we propose new algorithms and applications based on SMC for approximate inference in probabilistic graphical models. We derive nested sequential Monte Carlo, a new algorithm particularly well suited for inference in a large class of high-dimensional probabilistic models. Then, inspired by similar ideas we derive interacting particle Markov chain Monte Carlo to make use of parallelization to speed up approximate inference for universal probabilistic programming languages. After that, we show how we can make use of the rejection sampling process when generating gamma distributed random variables to speed up variational inference. Finally, we bridge the gap between SMC and variational methods by developing variational sequential Monte Carlo, a new flexible family of variational approximations.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2018. p. 39
Series
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1969
National Category
Control Engineering Computer Sciences Signal Processing
Identifiers
urn:nbn:se:liu:diva-152647 (URN)10.3384/diss.diva-152647 (DOI)9789176851616 (ISBN)
Public defence
2018-12-14, Ada Lovelace, Building B, Campus Valla, Linköping, 10:15 (English)
Opponent
Supervisors
Available from: 2018-11-27 Created: 2018-11-09 Last updated: 2018-12-05Bibliographically approved

Open Access in DiVA

fulltext(454 kB)160 downloads
File information
File name FULLTEXT01.pdfFile size 454 kBChecksum SHA-512
69f455973846c2ff25be2bb12495090cc93558eac1510a5c664e6d5b48869ecd3336d56d5264b5fa5e6264a394c6a897824725dd58d1a23a2509281223f640ef
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Authority records BETA

Andersson Naesseth, ChristianLindsten, FredrikSchön, Thomas

Search in DiVA

By author/editor
Andersson Naesseth, ChristianLindsten, FredrikSchön, Thomas
By organisation
Automatic ControlThe Institute of Technology
Control EngineeringComputer SciencesProbability Theory and Statistics

Search outside of DiVA

GoogleGoogle Scholar
Total: 160 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 378 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf