<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>1 on Diana Cai</title>
    <link>https://dicai.github.io/publication_types/1/</link>
    <description>Recent content in 1 on Diana Cai</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en-us</language>
    <lastBuildDate>Fri, 17 Oct 2025 00:00:00 +0000</lastBuildDate><atom:link href="https://dicai.github.io/publication_types/1/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Fisher meets Feynman: score-based variational inference with a product of experts</title>
      <link>https://dicai.github.io/publication/conference-paper/2025-fisher-meets-feynman/</link>
      <pubDate>Fri, 17 Oct 2025 00:00:00 +0000</pubDate>
      
      <guid>https://dicai.github.io/publication/conference-paper/2025-fisher-meets-feynman/</guid>
      <description></description>
    </item>
    
    <item>
      <title>Batch, match, and patch: low-rank approximations for score-based variational inference</title>
      <link>https://dicai.github.io/publication/conference-paper/2024-patched-bam-bbvi/</link>
      <pubDate>Fri, 10 Jan 2025 00:00:00 +0000</pubDate>
      
      <guid>https://dicai.github.io/publication/conference-paper/2024-patched-bam-bbvi/</guid>
      <description></description>
    </item>
    
    <item>
      <title>EigenVI: score-based variational inference with orthogonal function expansions</title>
      <link>https://dicai.github.io/publication/conference-paper/2024-eigenvi-score-based-variational-inference/</link>
      <pubDate>Thu, 31 Oct 2024 00:00:00 +0000</pubDate>
      
      <guid>https://dicai.github.io/publication/conference-paper/2024-eigenvi-score-based-variational-inference/</guid>
      <description></description>
    </item>
    
    <item>
      <title>Batch and match: black-box variational inference using a score-based divergence</title>
      <link>https://dicai.github.io/publication/conference-paper/2024-batch-and-match-gaussian-bbvi/</link>
      <pubDate>Mon, 22 Jul 2024 00:00:00 +0000</pubDate>
      
      <guid>https://dicai.github.io/publication/conference-paper/2024-batch-and-match-gaussian-bbvi/</guid>
      <description></description>
    </item>
    
    <item>
      <title>Multi-fidelity Monte Carlo: a pseudo-marginal approach</title>
      <link>https://dicai.github.io/publication/conference-paper/2022-multi-fidelity-mcmc/</link>
      <pubDate>Mon, 05 Dec 2022 00:00:00 +0000</pubDate>
      
      <guid>https://dicai.github.io/publication/conference-paper/2022-multi-fidelity-mcmc/</guid>
      <description>Citation @inproceedings{cai2022multi, title={Multi-fidelity Monte Carlo: a pseudo-marginal approach}, author={Diana Cai and Ryan P Adams}, booktitle={Advances in Neural Information Processing Systems 35}, year={2022} } </description>
    </item>
    
    <item>
      <title>Slice sampling reparameterization gradients</title>
      <link>https://dicai.github.io/publication/conference-paper/2021-reparameterized-gradients-slice-sampling/</link>
      <pubDate>Tue, 28 Sep 2021 00:00:00 +0000</pubDate>
      
      <guid>https://dicai.github.io/publication/conference-paper/2021-reparameterized-gradients-slice-sampling/</guid>
      <description>Preliminary version appeared in the AABI Symposium in January 2021.
Citation @inproceedings{zoltowski2021slice, title={Slice Sampling Reparameterization Gradients}, author={David M. Zoltowski and Diana Cai and Ryan P Adams}, booktitle={Advances in Neural Information Processing Systems 34}, year={2021} } </description>
    </item>
    
    <item>
      <title>Finite mixture models do not reliably learn the number of components</title>
      <link>https://dicai.github.io/publication/conference-paper/2021-finite-mixtures-unreliable/</link>
      <pubDate>Thu, 01 Jul 2021 00:00:00 +0000</pubDate>
      
      <guid>https://dicai.github.io/publication/conference-paper/2021-finite-mixtures-unreliable/</guid>
      <description>Preliminary versions appeared in NeurIPS 2019 Workshop on Machine Learning with Guarantees and also the Symposium on Advances in Approximate Bayesian Inference 2017, co-located with NeurIPS 2017.
Citation @InProceedings{pmlr-v139-cai21a, title = {Finite mixture models do not reliably learn the number of components}, author = {Cai, Diana and Campbell, Trevor and Broderick, Tamara}, booktitle = {Proceedings of the 38th International Conference on Machine Learning}, pages = {1158--1169}, year = {2021}, volume = {139}, series = {Proceedings of Machine Learning Research}, publisher = {PMLR} } </description>
    </item>
    
    <item>
      <title>Active multi-fidelity Bayesian online changepoint detection</title>
      <link>https://dicai.github.io/publication/conference-paper/2021-active-multi-fidelity-bayesian-changepoint-detection/</link>
      <pubDate>Mon, 01 Mar 2021 00:00:00 +0000</pubDate>
      
      <guid>https://dicai.github.io/publication/conference-paper/2021-active-multi-fidelity-bayesian-changepoint-detection/</guid>
      <description>Citation @article{gundersen2021active, title={Active multi-fidelity Bayesian online changepoint detection}, author={Gundersen, Gregory W and Cai, Diana and Zhou, Chuteng and Engelhardt, Barbara E and Adams, Ryan P}, journal={arXiv preprint arXiv:2103.14224}, year={2021} } </description>
    </item>
    
    <item>
      <title>A Bayesian nonparametric view on count-min sketch</title>
      <link>https://dicai.github.io/publication/conference-paper/2018-cmsketch/</link>
      <pubDate>Sat, 01 Dec 2018 00:00:00 +0000</pubDate>
      
      <guid>https://dicai.github.io/publication/conference-paper/2018-cmsketch/</guid>
      <description>Citation @inproceedings{cai2018bayesian, title={A Bayesian nonparametric view on count-min sketch}, author={Cai, Diana and Mitzenmacher, Michael and Adams, Ryan P}, booktitle={Advances in Neural Information Processing Systems 31}, pages={8782--8791}, year={2018} } </description>
    </item>
    
    <item>
      <title>Edge-exchangeable graphs and sparsity</title>
      <link>https://dicai.github.io/publication/conference-paper/2016-edgeexch/</link>
      <pubDate>Thu, 01 Dec 2016 00:00:00 +0000</pubDate>
      
      <guid>https://dicai.github.io/publication/conference-paper/2016-edgeexch/</guid>
      <description>Many popular network models rely on the assumption of (vertex) exchangeability, in which the distribution of the graph is invariant to relabelings of the vertices. However, the Aldous-Hoover theorem guarantees that these graphs are dense or empty with probability one, whereas many real-world graphs are sparse &amp;hellip;</description>
    </item>
    
  </channel>
</rss>
