default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatti Vihola
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Juha Karvanen
, Santtu Tikka, Matti Vihola:
Simulating Counterfactuals. J. Artif. Intell. Res. 80: 835-857 (2024)- [j10]Santeri Karppinen, Sumeetpal S. Singh, Matti Vihola:
Conditional Particle Filters with Bridge Backward Sampling. J. Comput. Graph. Stat. 33(2): 364-378 (2024) - 2023
- [i2]Juha Karvanen, Santtu Tikka, Matti Vihola:
Simulating counterfactuals. CoRR abs/2306.15328 (2023) - 2021
- [j9]Neil K. Chada, Jordan Franks, Ajay Jasra, Kody J. H. Law, Matti Vihola:
Unbiased Inference for Discretely Observed Hidden Markov Model Diffusions. SIAM/ASA J. Uncertain. Quantification 9(2): 763-787 (2021) - [j8]Jouni Helske, Matti Vihola:
bssm: Bayesian Inference of Non-linear and Non-Gaussian State Space Models in R. R J. 13(2): 471 (2021) - [j7]Santeri Karppinen, Matti Vihola:
Conditional particle filters with diffuse initial distributions. Stat. Comput. 31(3): 24 (2021)
2010 – 2019
- 2019
- [i1]Fredrik Lindsten, Jouni Helske, Matti Vihola:
Graphical model inference: Sequential Monte Carlo meets deterministic approximations. CoRR abs/1901.02374 (2019) - 2018
- [j6]Matti Vihola:
Unbiased Estimators and Multilevel Monte Carlo. Oper. Res. 66(2): 448-462 (2018) - [c2]Fredrik Lindsten, Jouni Helske, Matti Vihola:
Graphical model inference: Sequential Monte Carlo meets deterministic approximations. NeurIPS 2018: 8201-8211 - 2016
- [j5]Gersende Fort, Eric Moulines, Amandine Schreck, Matti Vihola:
Convergence of Markovian Stochastic Approximation with Discontinuous Dynamics. SIAM J. Control. Optim. 54(2): 866-893 (2016) - 2015
- [j4]Isambi S. Mbalawata, Simo Särkkä, Matti Vihola, Heikki Haario:
Adaptive Metropolis algorithm using variational Bayesian adaptive Kalman filter. Comput. Stat. Data Anal. 83: 101-115 (2015) - [j3]Christophe Andrieu, Gersende Fort, Matti Vihola:
Quantitative Convergence Rates for Subgeometric Markov Chains. J. Appl. Probab. 52(2): 391-404 (2015) - 2012
- [j2]Matti Vihola:
Robust adaptive Metropolis algorithm with coerced acceptance rate. Stat. Comput. 22(5): 997-1008 (2012) - 2010
- [j1]Matti Vihola:
Grapham: Graphical models with adaptive random walk Metropolis algorithms. Comput. Stat. Data Anal. 54(1): 49-54 (2010)
2000 – 2009
- 2002
- [c1]Matti Vihola, Mikko Harju, Petri Salmela, Janne Suontausta, Janne Savela:
Two dissimilarity measures for HMMS and their application in phoneme model clustering. ICASSP 2002: 933-936
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
