U-Statistics for Importance-Weighted Variational Inference

We propose the use of U-statistics to reduce variance for gradient estimation in importance-weighted variational inference. The key observation is that, given a base gradient estimator that requires $m > 1$ samples and a total of $n > m$ samples to be used for estimation, lower variance is ach...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Burroni, Javier, Takatsu, Kenta, Domke, Justin, Sheldon, Daniel
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Burroni, Javier
Takatsu, Kenta
Domke, Justin
Sheldon, Daniel
description We propose the use of U-statistics to reduce variance for gradient estimation in importance-weighted variational inference. The key observation is that, given a base gradient estimator that requires $m > 1$ samples and a total of $n > m$ samples to be used for estimation, lower variance is achieved by averaging the base estimator on overlapping batches of size $m$ than disjoint batches, as currently done. We use classical U-statistic theory to analyze the variance reduction, and propose novel approximations with theoretical guarantees to ensure computational efficiency. We find empirically that U-statistic variance reduction can lead to modest to significant improvements in inference performance on a range of models, with little computational cost.
doi_str_mv 10.48550/arxiv.2302.13918
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2302_13918</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2302_13918</sourcerecordid><originalsourceid>FETCH-LOGICAL-a678-31a6f45b4d5da764b727f48e9a85cf93606c5f6651baad5f3b263bb02192ea283</originalsourceid><addsrcrecordid>eNotj7tuwjAYhb0wIOgDMJEXcPA9TjeEoI2ExMBtjH4nNrWUC3Ksqrw9FJjOcI4-nQ-hGSWp0FKSBYQ__5syTlhKeU71GH0e8T5C9EP01ZC4PiRFe-1DhK6y-Gz95SfaOjlB8I9R30GTFJ2zwT7qKRo5aAb78c4JOmzWh9U33u6-itVyi0FlGnMKyglpRC1ryJQwGcuc0DYHLSuXc0VUJZ1SkhqAWjpumOLGEEZzZoFpPkHzF_Z5vrwG30K4lf8S5VOC3wFK40Gv</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>U-Statistics for Importance-Weighted Variational Inference</title><source>arXiv.org</source><creator>Burroni, Javier ; Takatsu, Kenta ; Domke, Justin ; Sheldon, Daniel</creator><creatorcontrib>Burroni, Javier ; Takatsu, Kenta ; Domke, Justin ; Sheldon, Daniel</creatorcontrib><description>We propose the use of U-statistics to reduce variance for gradient estimation in importance-weighted variational inference. The key observation is that, given a base gradient estimator that requires $m &gt; 1$ samples and a total of $n &gt; m$ samples to be used for estimation, lower variance is achieved by averaging the base estimator on overlapping batches of size $m$ than disjoint batches, as currently done. We use classical U-statistic theory to analyze the variance reduction, and propose novel approximations with theoretical guarantees to ensure computational efficiency. We find empirically that U-statistic variance reduction can lead to modest to significant improvements in inference performance on a range of models, with little computational cost.</description><identifier>DOI: 10.48550/arxiv.2302.13918</identifier><language>eng</language><subject>Computer Science - Learning ; Statistics - Machine Learning</subject><creationdate>2023-02</creationdate><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2302.13918$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2302.13918$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Burroni, Javier</creatorcontrib><creatorcontrib>Takatsu, Kenta</creatorcontrib><creatorcontrib>Domke, Justin</creatorcontrib><creatorcontrib>Sheldon, Daniel</creatorcontrib><title>U-Statistics for Importance-Weighted Variational Inference</title><description>We propose the use of U-statistics to reduce variance for gradient estimation in importance-weighted variational inference. The key observation is that, given a base gradient estimator that requires $m &gt; 1$ samples and a total of $n &gt; m$ samples to be used for estimation, lower variance is achieved by averaging the base estimator on overlapping batches of size $m$ than disjoint batches, as currently done. We use classical U-statistic theory to analyze the variance reduction, and propose novel approximations with theoretical guarantees to ensure computational efficiency. We find empirically that U-statistic variance reduction can lead to modest to significant improvements in inference performance on a range of models, with little computational cost.</description><subject>Computer Science - Learning</subject><subject>Statistics - Machine Learning</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj7tuwjAYhb0wIOgDMJEXcPA9TjeEoI2ExMBtjH4nNrWUC3Ksqrw9FJjOcI4-nQ-hGSWp0FKSBYQ__5syTlhKeU71GH0e8T5C9EP01ZC4PiRFe-1DhK6y-Gz95SfaOjlB8I9R30GTFJ2zwT7qKRo5aAb78c4JOmzWh9U33u6-itVyi0FlGnMKyglpRC1ryJQwGcuc0DYHLSuXc0VUJZ1SkhqAWjpumOLGEEZzZoFpPkHzF_Z5vrwG30K4lf8S5VOC3wFK40Gv</recordid><startdate>20230227</startdate><enddate>20230227</enddate><creator>Burroni, Javier</creator><creator>Takatsu, Kenta</creator><creator>Domke, Justin</creator><creator>Sheldon, Daniel</creator><scope>AKY</scope><scope>EPD</scope><scope>GOX</scope></search><sort><creationdate>20230227</creationdate><title>U-Statistics for Importance-Weighted Variational Inference</title><author>Burroni, Javier ; Takatsu, Kenta ; Domke, Justin ; Sheldon, Daniel</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a678-31a6f45b4d5da764b727f48e9a85cf93606c5f6651baad5f3b263bb02192ea283</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Computer Science - Learning</topic><topic>Statistics - Machine Learning</topic><toplevel>online_resources</toplevel><creatorcontrib>Burroni, Javier</creatorcontrib><creatorcontrib>Takatsu, Kenta</creatorcontrib><creatorcontrib>Domke, Justin</creatorcontrib><creatorcontrib>Sheldon, Daniel</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Statistics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Burroni, Javier</au><au>Takatsu, Kenta</au><au>Domke, Justin</au><au>Sheldon, Daniel</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>U-Statistics for Importance-Weighted Variational Inference</atitle><date>2023-02-27</date><risdate>2023</risdate><abstract>We propose the use of U-statistics to reduce variance for gradient estimation in importance-weighted variational inference. The key observation is that, given a base gradient estimator that requires $m &gt; 1$ samples and a total of $n &gt; m$ samples to be used for estimation, lower variance is achieved by averaging the base estimator on overlapping batches of size $m$ than disjoint batches, as currently done. We use classical U-statistic theory to analyze the variance reduction, and propose novel approximations with theoretical guarantees to ensure computational efficiency. We find empirically that U-statistic variance reduction can lead to modest to significant improvements in inference performance on a range of models, with little computational cost.</abstract><doi>10.48550/arxiv.2302.13918</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2302.13918
ispartof
issn
language eng
recordid cdi_arxiv_primary_2302_13918
source arXiv.org
subjects Computer Science - Learning
Statistics - Machine Learning
title U-Statistics for Importance-Weighted Variational Inference
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T15%3A35%3A43IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=U-Statistics%20for%20Importance-Weighted%20Variational%20Inference&rft.au=Burroni,%20Javier&rft.date=2023-02-27&rft_id=info:doi/10.48550/arxiv.2302.13918&rft_dat=%3Carxiv_GOX%3E2302_13918%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true