Efficient computational strategies for doubly intractable problems with applications to Bayesian social networks
Abstract Powerful ideas recently appeared in the literature are adjusted and combined to design improved samplers for doubly intractable target distributions with a focus on Bayesian exponential random graph models. Different forms of adaptive Metropolis–Hastings proposals (vertical, horizontal and...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Caimo, Alberto [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2014 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer Science+Business Media New York 2014 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Statistics and computing - Springer US, 1991, 25(2014), 1 vom: 27. Sept., Seite 113-125 |
|---|---|
| Übergeordnetes Werk: |
volume:25 ; year:2014 ; number:1 ; day:27 ; month:09 ; pages:113-125 |
| Links: |
|---|
| DOI / URN: |
10.1007/s11222-014-9516-7 |
|---|
| Katalog-ID: |
OLC2033746674 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2033746674 | ||
| 003 | DE-627 | ||
| 005 | 20230504051451.0 | ||
| 007 | tu | ||
| 008 | 200819s2014 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s11222-014-9516-7 |2 doi | |
| 035 | |a (DE-627)OLC2033746674 | ||
| 035 | |a (DE-He213)s11222-014-9516-7-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |a 620 |q VZ |
| 100 | 1 | |a Caimo, Alberto |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Efficient computational strategies for doubly intractable problems with applications to Bayesian social networks |
| 264 | 1 | |c 2014 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer Science+Business Media New York 2014 | ||
| 520 | |a Abstract Powerful ideas recently appeared in the literature are adjusted and combined to design improved samplers for doubly intractable target distributions with a focus on Bayesian exponential random graph models. Different forms of adaptive Metropolis–Hastings proposals (vertical, horizontal and rectangular) are tested and merged with the delayed rejection (DR) strategy with the aim of reducing the variance of the resulting Markov chain Monte Carlo estimators for a given computational time. The DR is modified in order to integrate it within the approximate exchange algorithm (AEA) to avoid the computation of intractable normalising constant that appears in exponential random graph models. This gives rise to the AEA + DR: a new methodology to sample doubly intractable distributions that dominates the AEA in the Peskun ordering (Peskun Biometrika 60:607–612, 1973) leading to MCMC estimators with a smaller asymptotic variance. The Bergm package for R (Caimo and Friel J. Stat. Softw. 22:518–532, 2014) has been updated to incorporate the AEA + DR thus including the possibility of adding a higher stage proposals and different forms of adaptation. | ||
| 650 | 4 | |a Adaptive Metropolis–Hastings proposal | |
| 650 | 4 | |a Delayed rejection | |
| 650 | 4 | |a Doubly-intractable target | |
| 650 | 4 | |a Intractable likelihoods | |
| 650 | 4 | |a Markov chain Monte Carlo | |
| 650 | 4 | |a Exponential random graphs | |
| 700 | 1 | |a Mira, Antonietta |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Statistics and computing |d Springer US, 1991 |g 25(2014), 1 vom: 27. Sept., Seite 113-125 |w (DE-627)131007963 |w (DE-600)1087487-2 |w (DE-576)052732894 |x 0960-3174 |7 nnns |
| 773 | 1 | 8 | |g volume:25 |g year:2014 |g number:1 |g day:27 |g month:09 |g pages:113-125 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s11222-014-9516-7 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-TEC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_2012 | ||
| 912 | |a GBV_ILN_4126 | ||
| 951 | |a AR | ||
| 952 | |d 25 |j 2014 |e 1 |b 27 |c 09 |h 113-125 | ||
| author_variant |
a c ac a m am |
|---|---|
| matchkey_str |
article:09603174:2014----::fiincmuainltaeisodulitatberbesihplcto |
| hierarchy_sort_str |
2014 |
| publishDate |
2014 |
| allfields |
10.1007/s11222-014-9516-7 doi (DE-627)OLC2033746674 (DE-He213)s11222-014-9516-7-p DE-627 ger DE-627 rakwb eng 004 620 VZ Caimo, Alberto verfasserin aut Efficient computational strategies for doubly intractable problems with applications to Bayesian social networks 2014 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2014 Abstract Powerful ideas recently appeared in the literature are adjusted and combined to design improved samplers for doubly intractable target distributions with a focus on Bayesian exponential random graph models. Different forms of adaptive Metropolis–Hastings proposals (vertical, horizontal and rectangular) are tested and merged with the delayed rejection (DR) strategy with the aim of reducing the variance of the resulting Markov chain Monte Carlo estimators for a given computational time. The DR is modified in order to integrate it within the approximate exchange algorithm (AEA) to avoid the computation of intractable normalising constant that appears in exponential random graph models. This gives rise to the AEA + DR: a new methodology to sample doubly intractable distributions that dominates the AEA in the Peskun ordering (Peskun Biometrika 60:607–612, 1973) leading to MCMC estimators with a smaller asymptotic variance. The Bergm package for R (Caimo and Friel J. Stat. Softw. 22:518–532, 2014) has been updated to incorporate the AEA + DR thus including the possibility of adding a higher stage proposals and different forms of adaptation. Adaptive Metropolis–Hastings proposal Delayed rejection Doubly-intractable target Intractable likelihoods Markov chain Monte Carlo Exponential random graphs Mira, Antonietta aut Enthalten in Statistics and computing Springer US, 1991 25(2014), 1 vom: 27. Sept., Seite 113-125 (DE-627)131007963 (DE-600)1087487-2 (DE-576)052732894 0960-3174 nnns volume:25 year:2014 number:1 day:27 month:09 pages:113-125 https://doi.org/10.1007/s11222-014-9516-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_2012 GBV_ILN_4126 AR 25 2014 1 27 09 113-125 |
| spelling |
10.1007/s11222-014-9516-7 doi (DE-627)OLC2033746674 (DE-He213)s11222-014-9516-7-p DE-627 ger DE-627 rakwb eng 004 620 VZ Caimo, Alberto verfasserin aut Efficient computational strategies for doubly intractable problems with applications to Bayesian social networks 2014 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2014 Abstract Powerful ideas recently appeared in the literature are adjusted and combined to design improved samplers for doubly intractable target distributions with a focus on Bayesian exponential random graph models. Different forms of adaptive Metropolis–Hastings proposals (vertical, horizontal and rectangular) are tested and merged with the delayed rejection (DR) strategy with the aim of reducing the variance of the resulting Markov chain Monte Carlo estimators for a given computational time. The DR is modified in order to integrate it within the approximate exchange algorithm (AEA) to avoid the computation of intractable normalising constant that appears in exponential random graph models. This gives rise to the AEA + DR: a new methodology to sample doubly intractable distributions that dominates the AEA in the Peskun ordering (Peskun Biometrika 60:607–612, 1973) leading to MCMC estimators with a smaller asymptotic variance. The Bergm package for R (Caimo and Friel J. Stat. Softw. 22:518–532, 2014) has been updated to incorporate the AEA + DR thus including the possibility of adding a higher stage proposals and different forms of adaptation. Adaptive Metropolis–Hastings proposal Delayed rejection Doubly-intractable target Intractable likelihoods Markov chain Monte Carlo Exponential random graphs Mira, Antonietta aut Enthalten in Statistics and computing Springer US, 1991 25(2014), 1 vom: 27. Sept., Seite 113-125 (DE-627)131007963 (DE-600)1087487-2 (DE-576)052732894 0960-3174 nnns volume:25 year:2014 number:1 day:27 month:09 pages:113-125 https://doi.org/10.1007/s11222-014-9516-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_2012 GBV_ILN_4126 AR 25 2014 1 27 09 113-125 |
| allfields_unstemmed |
10.1007/s11222-014-9516-7 doi (DE-627)OLC2033746674 (DE-He213)s11222-014-9516-7-p DE-627 ger DE-627 rakwb eng 004 620 VZ Caimo, Alberto verfasserin aut Efficient computational strategies for doubly intractable problems with applications to Bayesian social networks 2014 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2014 Abstract Powerful ideas recently appeared in the literature are adjusted and combined to design improved samplers for doubly intractable target distributions with a focus on Bayesian exponential random graph models. Different forms of adaptive Metropolis–Hastings proposals (vertical, horizontal and rectangular) are tested and merged with the delayed rejection (DR) strategy with the aim of reducing the variance of the resulting Markov chain Monte Carlo estimators for a given computational time. The DR is modified in order to integrate it within the approximate exchange algorithm (AEA) to avoid the computation of intractable normalising constant that appears in exponential random graph models. This gives rise to the AEA + DR: a new methodology to sample doubly intractable distributions that dominates the AEA in the Peskun ordering (Peskun Biometrika 60:607–612, 1973) leading to MCMC estimators with a smaller asymptotic variance. The Bergm package for R (Caimo and Friel J. Stat. Softw. 22:518–532, 2014) has been updated to incorporate the AEA + DR thus including the possibility of adding a higher stage proposals and different forms of adaptation. Adaptive Metropolis–Hastings proposal Delayed rejection Doubly-intractable target Intractable likelihoods Markov chain Monte Carlo Exponential random graphs Mira, Antonietta aut Enthalten in Statistics and computing Springer US, 1991 25(2014), 1 vom: 27. Sept., Seite 113-125 (DE-627)131007963 (DE-600)1087487-2 (DE-576)052732894 0960-3174 nnns volume:25 year:2014 number:1 day:27 month:09 pages:113-125 https://doi.org/10.1007/s11222-014-9516-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_2012 GBV_ILN_4126 AR 25 2014 1 27 09 113-125 |
| allfieldsGer |
10.1007/s11222-014-9516-7 doi (DE-627)OLC2033746674 (DE-He213)s11222-014-9516-7-p DE-627 ger DE-627 rakwb eng 004 620 VZ Caimo, Alberto verfasserin aut Efficient computational strategies for doubly intractable problems with applications to Bayesian social networks 2014 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2014 Abstract Powerful ideas recently appeared in the literature are adjusted and combined to design improved samplers for doubly intractable target distributions with a focus on Bayesian exponential random graph models. Different forms of adaptive Metropolis–Hastings proposals (vertical, horizontal and rectangular) are tested and merged with the delayed rejection (DR) strategy with the aim of reducing the variance of the resulting Markov chain Monte Carlo estimators for a given computational time. The DR is modified in order to integrate it within the approximate exchange algorithm (AEA) to avoid the computation of intractable normalising constant that appears in exponential random graph models. This gives rise to the AEA + DR: a new methodology to sample doubly intractable distributions that dominates the AEA in the Peskun ordering (Peskun Biometrika 60:607–612, 1973) leading to MCMC estimators with a smaller asymptotic variance. The Bergm package for R (Caimo and Friel J. Stat. Softw. 22:518–532, 2014) has been updated to incorporate the AEA + DR thus including the possibility of adding a higher stage proposals and different forms of adaptation. Adaptive Metropolis–Hastings proposal Delayed rejection Doubly-intractable target Intractable likelihoods Markov chain Monte Carlo Exponential random graphs Mira, Antonietta aut Enthalten in Statistics and computing Springer US, 1991 25(2014), 1 vom: 27. Sept., Seite 113-125 (DE-627)131007963 (DE-600)1087487-2 (DE-576)052732894 0960-3174 nnns volume:25 year:2014 number:1 day:27 month:09 pages:113-125 https://doi.org/10.1007/s11222-014-9516-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_2012 GBV_ILN_4126 AR 25 2014 1 27 09 113-125 |
| allfieldsSound |
10.1007/s11222-014-9516-7 doi (DE-627)OLC2033746674 (DE-He213)s11222-014-9516-7-p DE-627 ger DE-627 rakwb eng 004 620 VZ Caimo, Alberto verfasserin aut Efficient computational strategies for doubly intractable problems with applications to Bayesian social networks 2014 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2014 Abstract Powerful ideas recently appeared in the literature are adjusted and combined to design improved samplers for doubly intractable target distributions with a focus on Bayesian exponential random graph models. Different forms of adaptive Metropolis–Hastings proposals (vertical, horizontal and rectangular) are tested and merged with the delayed rejection (DR) strategy with the aim of reducing the variance of the resulting Markov chain Monte Carlo estimators for a given computational time. The DR is modified in order to integrate it within the approximate exchange algorithm (AEA) to avoid the computation of intractable normalising constant that appears in exponential random graph models. This gives rise to the AEA + DR: a new methodology to sample doubly intractable distributions that dominates the AEA in the Peskun ordering (Peskun Biometrika 60:607–612, 1973) leading to MCMC estimators with a smaller asymptotic variance. The Bergm package for R (Caimo and Friel J. Stat. Softw. 22:518–532, 2014) has been updated to incorporate the AEA + DR thus including the possibility of adding a higher stage proposals and different forms of adaptation. Adaptive Metropolis–Hastings proposal Delayed rejection Doubly-intractable target Intractable likelihoods Markov chain Monte Carlo Exponential random graphs Mira, Antonietta aut Enthalten in Statistics and computing Springer US, 1991 25(2014), 1 vom: 27. Sept., Seite 113-125 (DE-627)131007963 (DE-600)1087487-2 (DE-576)052732894 0960-3174 nnns volume:25 year:2014 number:1 day:27 month:09 pages:113-125 https://doi.org/10.1007/s11222-014-9516-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_2012 GBV_ILN_4126 AR 25 2014 1 27 09 113-125 |
| language |
English |
| source |
Enthalten in Statistics and computing 25(2014), 1 vom: 27. Sept., Seite 113-125 volume:25 year:2014 number:1 day:27 month:09 pages:113-125 |
| sourceStr |
Enthalten in Statistics and computing 25(2014), 1 vom: 27. Sept., Seite 113-125 volume:25 year:2014 number:1 day:27 month:09 pages:113-125 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Adaptive Metropolis–Hastings proposal Delayed rejection Doubly-intractable target Intractable likelihoods Markov chain Monte Carlo Exponential random graphs |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Statistics and computing |
| authorswithroles_txt_mv |
Caimo, Alberto @@aut@@ Mira, Antonietta @@aut@@ |
| publishDateDaySort_date |
2014-09-27T00:00:00Z |
| hierarchy_top_id |
131007963 |
| dewey-sort |
14 |
| id |
OLC2033746674 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2033746674</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504051451.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2014 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11222-014-9516-7</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2033746674</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11222-014-9516-7-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Caimo, Alberto</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Efficient computational strategies for doubly intractable problems with applications to Bayesian social networks</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2014</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media New York 2014</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Powerful ideas recently appeared in the literature are adjusted and combined to design improved samplers for doubly intractable target distributions with a focus on Bayesian exponential random graph models. Different forms of adaptive Metropolis–Hastings proposals (vertical, horizontal and rectangular) are tested and merged with the delayed rejection (DR) strategy with the aim of reducing the variance of the resulting Markov chain Monte Carlo estimators for a given computational time. The DR is modified in order to integrate it within the approximate exchange algorithm (AEA) to avoid the computation of intractable normalising constant that appears in exponential random graph models. This gives rise to the AEA + DR: a new methodology to sample doubly intractable distributions that dominates the AEA in the Peskun ordering (Peskun Biometrika 60:607–612, 1973) leading to MCMC estimators with a smaller asymptotic variance. The Bergm package for R (Caimo and Friel J. Stat. Softw. 22:518–532, 2014) has been updated to incorporate the AEA + DR thus including the possibility of adding a higher stage proposals and different forms of adaptation.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Adaptive Metropolis–Hastings proposal</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Delayed rejection</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Doubly-intractable target</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Intractable likelihoods</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Markov chain Monte Carlo</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Exponential random graphs</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Mira, Antonietta</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Statistics and computing</subfield><subfield code="d">Springer US, 1991</subfield><subfield code="g">25(2014), 1 vom: 27. Sept., Seite 113-125</subfield><subfield code="w">(DE-627)131007963</subfield><subfield code="w">(DE-600)1087487-2</subfield><subfield code="w">(DE-576)052732894</subfield><subfield code="x">0960-3174</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:25</subfield><subfield code="g">year:2014</subfield><subfield code="g">number:1</subfield><subfield code="g">day:27</subfield><subfield code="g">month:09</subfield><subfield code="g">pages:113-125</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11222-014-9516-7</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">25</subfield><subfield code="j">2014</subfield><subfield code="e">1</subfield><subfield code="b">27</subfield><subfield code="c">09</subfield><subfield code="h">113-125</subfield></datafield></record></collection>
|
| author |
Caimo, Alberto |
| spellingShingle |
Caimo, Alberto ddc 004 misc Adaptive Metropolis–Hastings proposal misc Delayed rejection misc Doubly-intractable target misc Intractable likelihoods misc Markov chain Monte Carlo misc Exponential random graphs Efficient computational strategies for doubly intractable problems with applications to Bayesian social networks |
| authorStr |
Caimo, Alberto |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)131007963 |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science 620 - Engineering & allied operations |
| delete_txt_mv |
keep |
| author_role |
aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0960-3174 |
| topic_title |
004 620 VZ Efficient computational strategies for doubly intractable problems with applications to Bayesian social networks Adaptive Metropolis–Hastings proposal Delayed rejection Doubly-intractable target Intractable likelihoods Markov chain Monte Carlo Exponential random graphs |
| topic |
ddc 004 misc Adaptive Metropolis–Hastings proposal misc Delayed rejection misc Doubly-intractable target misc Intractable likelihoods misc Markov chain Monte Carlo misc Exponential random graphs |
| topic_unstemmed |
ddc 004 misc Adaptive Metropolis–Hastings proposal misc Delayed rejection misc Doubly-intractable target misc Intractable likelihoods misc Markov chain Monte Carlo misc Exponential random graphs |
| topic_browse |
ddc 004 misc Adaptive Metropolis–Hastings proposal misc Delayed rejection misc Doubly-intractable target misc Intractable likelihoods misc Markov chain Monte Carlo misc Exponential random graphs |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Statistics and computing |
| hierarchy_parent_id |
131007963 |
| dewey-tens |
000 - Computer science, knowledge & systems 620 - Engineering |
| hierarchy_top_title |
Statistics and computing |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)131007963 (DE-600)1087487-2 (DE-576)052732894 |
| title |
Efficient computational strategies for doubly intractable problems with applications to Bayesian social networks |
| ctrlnum |
(DE-627)OLC2033746674 (DE-He213)s11222-014-9516-7-p |
| title_full |
Efficient computational strategies for doubly intractable problems with applications to Bayesian social networks |
| author_sort |
Caimo, Alberto |
| journal |
Statistics and computing |
| journalStr |
Statistics and computing |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works 600 - Technology |
| recordtype |
marc |
| publishDateSort |
2014 |
| contenttype_str_mv |
txt |
| container_start_page |
113 |
| author_browse |
Caimo, Alberto Mira, Antonietta |
| container_volume |
25 |
| class |
004 620 VZ |
| format_se |
Aufsätze |
| author-letter |
Caimo, Alberto |
| doi_str_mv |
10.1007/s11222-014-9516-7 |
| dewey-full |
004 620 |
| title_sort |
efficient computational strategies for doubly intractable problems with applications to bayesian social networks |
| title_auth |
Efficient computational strategies for doubly intractable problems with applications to Bayesian social networks |
| abstract |
Abstract Powerful ideas recently appeared in the literature are adjusted and combined to design improved samplers for doubly intractable target distributions with a focus on Bayesian exponential random graph models. Different forms of adaptive Metropolis–Hastings proposals (vertical, horizontal and rectangular) are tested and merged with the delayed rejection (DR) strategy with the aim of reducing the variance of the resulting Markov chain Monte Carlo estimators for a given computational time. The DR is modified in order to integrate it within the approximate exchange algorithm (AEA) to avoid the computation of intractable normalising constant that appears in exponential random graph models. This gives rise to the AEA + DR: a new methodology to sample doubly intractable distributions that dominates the AEA in the Peskun ordering (Peskun Biometrika 60:607–612, 1973) leading to MCMC estimators with a smaller asymptotic variance. The Bergm package for R (Caimo and Friel J. Stat. Softw. 22:518–532, 2014) has been updated to incorporate the AEA + DR thus including the possibility of adding a higher stage proposals and different forms of adaptation. © Springer Science+Business Media New York 2014 |
| abstractGer |
Abstract Powerful ideas recently appeared in the literature are adjusted and combined to design improved samplers for doubly intractable target distributions with a focus on Bayesian exponential random graph models. Different forms of adaptive Metropolis–Hastings proposals (vertical, horizontal and rectangular) are tested and merged with the delayed rejection (DR) strategy with the aim of reducing the variance of the resulting Markov chain Monte Carlo estimators for a given computational time. The DR is modified in order to integrate it within the approximate exchange algorithm (AEA) to avoid the computation of intractable normalising constant that appears in exponential random graph models. This gives rise to the AEA + DR: a new methodology to sample doubly intractable distributions that dominates the AEA in the Peskun ordering (Peskun Biometrika 60:607–612, 1973) leading to MCMC estimators with a smaller asymptotic variance. The Bergm package for R (Caimo and Friel J. Stat. Softw. 22:518–532, 2014) has been updated to incorporate the AEA + DR thus including the possibility of adding a higher stage proposals and different forms of adaptation. © Springer Science+Business Media New York 2014 |
| abstract_unstemmed |
Abstract Powerful ideas recently appeared in the literature are adjusted and combined to design improved samplers for doubly intractable target distributions with a focus on Bayesian exponential random graph models. Different forms of adaptive Metropolis–Hastings proposals (vertical, horizontal and rectangular) are tested and merged with the delayed rejection (DR) strategy with the aim of reducing the variance of the resulting Markov chain Monte Carlo estimators for a given computational time. The DR is modified in order to integrate it within the approximate exchange algorithm (AEA) to avoid the computation of intractable normalising constant that appears in exponential random graph models. This gives rise to the AEA + DR: a new methodology to sample doubly intractable distributions that dominates the AEA in the Peskun ordering (Peskun Biometrika 60:607–612, 1973) leading to MCMC estimators with a smaller asymptotic variance. The Bergm package for R (Caimo and Friel J. Stat. Softw. 22:518–532, 2014) has been updated to incorporate the AEA + DR thus including the possibility of adding a higher stage proposals and different forms of adaptation. © Springer Science+Business Media New York 2014 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_2012 GBV_ILN_4126 |
| container_issue |
1 |
| title_short |
Efficient computational strategies for doubly intractable problems with applications to Bayesian social networks |
| url |
https://doi.org/10.1007/s11222-014-9516-7 |
| remote_bool |
false |
| author2 |
Mira, Antonietta |
| author2Str |
Mira, Antonietta |
| ppnlink |
131007963 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s11222-014-9516-7 |
| up_date |
2024-07-03T18:16:52.502Z |
| _version_ |
1803582819540140032 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2033746674</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504051451.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2014 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11222-014-9516-7</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2033746674</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11222-014-9516-7-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Caimo, Alberto</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Efficient computational strategies for doubly intractable problems with applications to Bayesian social networks</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2014</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media New York 2014</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Powerful ideas recently appeared in the literature are adjusted and combined to design improved samplers for doubly intractable target distributions with a focus on Bayesian exponential random graph models. Different forms of adaptive Metropolis–Hastings proposals (vertical, horizontal and rectangular) are tested and merged with the delayed rejection (DR) strategy with the aim of reducing the variance of the resulting Markov chain Monte Carlo estimators for a given computational time. The DR is modified in order to integrate it within the approximate exchange algorithm (AEA) to avoid the computation of intractable normalising constant that appears in exponential random graph models. This gives rise to the AEA + DR: a new methodology to sample doubly intractable distributions that dominates the AEA in the Peskun ordering (Peskun Biometrika 60:607–612, 1973) leading to MCMC estimators with a smaller asymptotic variance. The Bergm package for R (Caimo and Friel J. Stat. Softw. 22:518–532, 2014) has been updated to incorporate the AEA + DR thus including the possibility of adding a higher stage proposals and different forms of adaptation.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Adaptive Metropolis–Hastings proposal</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Delayed rejection</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Doubly-intractable target</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Intractable likelihoods</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Markov chain Monte Carlo</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Exponential random graphs</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Mira, Antonietta</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Statistics and computing</subfield><subfield code="d">Springer US, 1991</subfield><subfield code="g">25(2014), 1 vom: 27. Sept., Seite 113-125</subfield><subfield code="w">(DE-627)131007963</subfield><subfield code="w">(DE-600)1087487-2</subfield><subfield code="w">(DE-576)052732894</subfield><subfield code="x">0960-3174</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:25</subfield><subfield code="g">year:2014</subfield><subfield code="g">number:1</subfield><subfield code="g">day:27</subfield><subfield code="g">month:09</subfield><subfield code="g">pages:113-125</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11222-014-9516-7</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">25</subfield><subfield code="j">2014</subfield><subfield code="e">1</subfield><subfield code="b">27</subfield><subfield code="c">09</subfield><subfield code="h">113-125</subfield></datafield></record></collection>
|
| score |
7.3983297 |