{"id":{"repo_id":"bu","oai_identifier":"oai:open.bu.edu:2144/53683"},"canonical_url":"https://search.ndltd.org/etd/bu/oai:open.bu.edu:2144/53683","repository":{"repo_id":"bu","name":"Boston University","base_url":"https://open.bu.edu/oai/request"},"display":{"title":"Robust and reliable algorithms for Bayesian inference","abstract":"Scalable Bayesian inference widely relies on approximate inference algorithms such as Markov chain Monte Carlo (MCMC) and black-box variational inference (BBVI). While MCMC algorithms provide asymptotically exact samples, BBVI, which uses stochastic optimization, yields fast and flexible approximations. However, these modern approximate inference algorithms often lack (1) robust, automated procedures to ensure the reliability of stochastic optimization and (2) quantitative tools to diagnose convergence to stationarity. To address the first challenge, we propose robust and automated black-box variational inference (RABVI), a framework for improving the reliability of BBVI optimization. RABVI is based on rigorously justified automation techniques, uses only a small number of intuitive tuning parameters, and detects inaccurate estimates of the optimal variational approximation. RABVI adaptively decreases the learning rate by detecting convergence of the fixed-learning-rate iterates, then estimates the symmetrized Kullback-Leibler (KL) divergence between the current variational approximation and the optimal one. It also employs a novel optimization termination criterion that allows the user to balance desired accuracy against computational cost. To address the second challenge, we introduce sliced-Wasserstein automated stationarity detection (SWASD), a convergence diagnostic for Markov chains that measures the distributional convergence of the iterates. SWASD uses a block-based approximation to estimate the distance between the marginal distribution of recent Markov chain iterates and the stationary distribution. This approach enables users to estimate when convergence has occurred and how close the iterates are to stationarity. We validate our findings through carefully designed experiments on both synthetic and real-world models and datasets.","abstract_html":"Scalable Bayesian inference widely relies on approximate inference algorithms such as Markov chain Monte Carlo (MCMC) and black-box variational inference (BBVI). While MCMC algorithms provide asymptotically exact samples, BBVI, which uses stochastic optimization, yields fast and flexible approximations. However, these modern approximate inference algorithms often lack (1) robust, automated procedures to ensure the reliability of stochastic optimization and (2) quantitative tools to diagnose convergence to stationarity. To address the first challenge, we propose robust and automated black-box variational inference (RABVI), a framework for improving the reliability of BBVI optimization. RABVI is based on rigorously justified automation techniques, uses only a small number of intuitive tuning parameters, and detects inaccurate estimates of the optimal variational approximation. RABVI adaptively decreases the learning rate by detecting convergence of the fixed-learning-rate iterates, then estimates the symmetrized Kullback-Leibler (KL) divergence between the current variational approximation and the optimal one. It also employs a novel optimization termination criterion that allows the user to balance desired accuracy against computational cost. To address the second challenge, we introduce sliced-Wasserstein automated stationarity detection (SWASD), a convergence diagnostic for Markov chains that measures the distributional convergence of the iterates. SWASD uses a block-based approximation to estimate the distance between the marginal distribution of recent Markov chain iterates and the stationary distribution. This approach enables users to estimate when convergence has occurred and how close the iterates are to stationarity. We validate our findings through carefully designed experiments on both synthetic and real-world models and datasets.","abstract_has_math":false,"creators":["Welandawe, Manushi Kushinthara Viduneth"],"institution":"Boston University","degree_name":"Doctor of Philosophy","degree_level":"doctoral","degree_discipline":"Mathematics & Statistics","degree_department":null,"school":null,"contributors":[],"advisors":["Huggins, Jonathan H"],"committee_chairs":[],"committee_members":[],"year":2026,"date_issued":"2026","date_published":"2026","updated_at":"2026-11-18T20:30:34Z","subjects":["Statistics","black-box variational inference","convergence diagnostics","Markov chain","sliced Wasserstein distance","stochastic optimization","symmetrized Kullback–Leibler divergence"],"languages":["en_US"],"rights":["Attribution 4.0 International"],"rights_urls":["http://creativecommons.org/licenses/by/4.0/"],"identifier_entries":[],"person_identifier_entries":[{"key":"dc:identifier.orcid","label":"ORCID","values":["0000-0003-3718-6593"],"render_values":[{"text":"0000-0003-3718-6593","href":"https://orcid.org/0000-0003-3718-6593","code":true}]}]},"links":{"outbound_url":"https://hdl.handle.net/2144/53683","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"https://hdl.handle.net/2144/53683","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://open.bu.edu/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Aopen.bu.edu%3A2144%2F53683","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Huggins, Jonathan H"]},{"key":"dc:creator","label":"Author","values":["Welandawe, Manushi Kushinthara Viduneth"]},{"key":"dc:identifier.orcid","label":"ORCID","values":["0000-0003-3718-6593"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2026-10-13T18:39:30Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2026-10-13T18:39:30Z"]},{"key":"dc:date.issued","label":"Date","values":["2026"]},{"key":"dc:date.updated","label":"Dc Date Updated","values":["2026-09-09T19:15:13Z"]},{"key":"dc:type","label":"Dc Type","values":["Thesis/Dissertation"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics & Statistics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["doctoral"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctor of Philosophy"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Boston University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Statistics","black-box variational inference","convergence diagnostics","Markov chain","sliced Wasserstein distance","stochastic optimization","symmetrized Kullback–Leibler divergence"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]},{"key":"dc:rights","label":"Dc Rights","values":["Attribution 4.0 International"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://creativecommons.org/licenses/by/4.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/2144/53683"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["2026"]},{"key":"dc:description.abstract","label":"Abstract","values":["Scalable Bayesian inference widely relies on approximate inference algorithms such as Markov chain Monte Carlo (MCMC) and black-box variational inference (BBVI). While MCMC algorithms provide asymptotically exact samples, BBVI, which uses stochastic optimization, yields fast and flexible approximations. However, these modern approximate inference algorithms often lack (1) robust, automated procedures to ensure the reliability of stochastic optimization and (2) quantitative tools to diagnose convergence to stationarity. To address the first challenge, we propose robust and automated black-box variational inference (RABVI), a framework for improving the reliability of BBVI optimization. RABVI is based on rigorously justified automation techniques, uses only a small number of intuitive tuning parameters, and detects inaccurate estimates of the optimal variational approximation. RABVI adaptively decreases the learning rate by detecting convergence of the fixed-learning-rate iterates, then estimates the symmetrized Kullback-Leibler (KL) divergence between the current variational approximation and the optimal one. It also employs a novel optimization termination criterion that allows the user to balance desired accuracy against computational cost. To address the second challenge, we introduce sliced-Wasserstein automated stationarity detection (SWASD), a convergence diagnostic for Markov chains that measures the distributional convergence of the iterates. SWASD uses a block-based approximation to estimate the distance between the marginal distribution of recent Markov chain iterates and the stationary distribution. This approach enables users to estimate when convergence has occurred and how close the iterates are to stationarity. We validate our findings through carefully designed experiments on both synthetic and real-world models and datasets."]},{"key":"dc:title","label":"Title","values":["Robust and reliable algorithms for Bayesian inference"]}]}],"canonical_facts":{"dc:contributor.advisor":["Huggins, Jonathan H"],"dc:creator":["Welandawe, Manushi Kushinthara Viduneth"],"dc:date.accessioned":["2026-10-13T18:39:30Z"],"dc:date.available":["2026-10-13T18:39:30Z"],"dc:date.issued":["2026"],"dc:date.updated":["2026-09-09T19:15:13Z"],"dc:description":["2026"],"dc:description.abstract":["Scalable Bayesian inference widely relies on approximate inference algorithms such as Markov chain Monte Carlo (MCMC) and black-box variational inference (BBVI). While MCMC algorithms provide asymptotically exact samples, BBVI, which uses stochastic optimization, yields fast and flexible approximations. However, these modern approximate inference algorithms often lack (1) robust, automated procedures to ensure the reliability of stochastic optimization and (2) quantitative tools to diagnose convergence to stationarity. To address the first challenge, we propose robust and automated black-box variational inference (RABVI), a framework for improving the reliability of BBVI optimization. RABVI is based on rigorously justified automation techniques, uses only a small number of intuitive tuning parameters, and detects inaccurate estimates of the optimal variational approximation. RABVI adaptively decreases the learning rate by detecting convergence of the fixed-learning-rate iterates, then estimates the symmetrized Kullback-Leibler (KL) divergence between the current variational approximation and the optimal one. It also employs a novel optimization termination criterion that allows the user to balance desired accuracy against computational cost. To address the second challenge, we introduce sliced-Wasserstein automated stationarity detection (SWASD), a convergence diagnostic for Markov chains that measures the distributional convergence of the iterates. SWASD uses a block-based approximation to estimate the distance between the marginal distribution of recent Markov chain iterates and the stationary distribution. This approach enables users to estimate when convergence has occurred and how close the iterates are to stationarity. We validate our findings through carefully designed experiments on both synthetic and real-world models and datasets."],"dc:identifier.orcid":["0000-0003-3718-6593"],"dc:identifier.uri":["https://hdl.handle.net/2144/53683"],"dc:language.iso":["en_US"],"dc:rights":["Attribution 4.0 International"],"dc:rights.uri":["http://creativecommons.org/licenses/by/4.0/"],"dc:subject":["Statistics","black-box variational inference","convergence diagnostics","Markov chain","sliced Wasserstein distance","stochastic optimization","symmetrized Kullback–Leibler divergence"],"dc:title":["Robust and reliable algorithms for Bayesian inference"],"dc:type":["Thesis/Dissertation"],"thesis:degree_discipline":["Mathematics & Statistics"],"thesis:degree_level":["doctoral"],"thesis:degree_name":["Doctor of Philosophy"],"thesis:institution_name":["Boston University"]},"updated_at":"2026-11-18T20:30:34Z"}