\relax 
\providecommand\hyper@newdestlabel[2]{}
\providecommand\HyperFirstAtBeginDocument{\AtBeginDocument}
\HyperFirstAtBeginDocument{\ifx\hyper@anchor\@undefined
\global\let\oldcontentsline\contentsline
\gdef\contentsline#1#2#3#4{\oldcontentsline{#1}{#2}{#3}}
\global\let\oldnewlabel\newlabel
\gdef\newlabel#1#2{\newlabelxx{#1}#2}
\gdef\newlabelxx#1#2#3#4#5#6{\oldnewlabel{#1}{{#2}{#3}}}
\AtEndDocument{\ifx\hyper@anchor\@undefined
\let\contentsline\oldcontentsline
\let\newlabel\oldnewlabel
\fi}
\fi}
\global\let\hyper@last\relax 
\gdef\HyperFirstAtBeginDocument#1{#1}
\providecommand\HyField@AuxAddToFields[1]{}
\providecommand\HyField@AuxAddToCoFields[2]{}
\providecommand\babel@aux[2]{}
\@nameuse{bbl@beforestart}
\bibstyle{plainnat}
\citation{macqueen1967some}
\citation{bishop:2006:PRML}
\citation{ester1996density,szekely2005hierarchical,frey2007clustering,zhao2008g}
\citation{xie2016unsupervised,yang2016joint,jiang2017variational,caron2018deep}
\citation{krizhevsky2012imagenet}
\citation{KingmaW13}
\citation{li2018learning}
\citation{antoniak1974mixtures}
\citation{ferguson1973bayesian}
\citation{DinhKB14,kingma2018glow}
\citation{bishop:2006:PRML}
\providecommand \oddpage@label [2]{}
\babel@aux{american}{}
\@writefile{toc}{\contentsline {section}{\numberline {1}Introduction}{1}{section.1}\protected@file@percent }
\citation{macqueen1967some}
\citation{bishop:2006:PRML}
\citation{zhao2008g,li2021tk}
\citation{yang2016joint,caron2018deep}
\citation{xie2016unsupervised}
\citation{jiang2017variational}
\citation{antoniak1974mixtures}
\citation{teh2006hierarchical}
\citation{chen2016maximum}
\citation{echraibi2020variational}
\citation{ehsan2017infinite}
\citation{NalisnickS17}
\citation{DinhKB14,kingma2018glow}
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces Demonstration of the clustering and representation learning process on two synthetic datasets. The leftmost figures are the ground truth clustering results. The middle figures show the latent representation learned by DDPM during the training. The rightmost figures show the final clustering results, with the circles denoting 2 standard deviations of the Gaussian distributions. We can see that DDPM is able to learn better representation during clustering. Particularly in the second example, the raw data representation is challenging for many centroid-based clustering methods, and the benefit of the new representation learned by DDPM is quite evident. Also note that the number of clusters is unknown in advance.\relax }}{2}{figure.caption.1}\protected@file@percent }
\providecommand*\caption@xref[2]{\@setref\relax\@undefined{#1}}
\newlabel{fig:synthetic}{{1}{2}{Demonstration of the clustering and representation learning process on two synthetic datasets. The leftmost figures are the ground truth clustering results. The middle figures show the latent representation learned by DDPM during the training. The rightmost figures show the final clustering results, with the circles denoting 2 standard deviations of the Gaussian distributions. We can see that DDPM is able to learn better representation during clustering. Particularly in the second example, the raw data representation is challenging for many centroid-based clustering methods, and the benefit of the new representation learned by DDPM is quite evident. Also note that the number of clusters is unknown in advance.\relax }{figure.caption.1}{}}
\@writefile{toc}{\contentsline {section}{\numberline {2}Related work}{2}{section.2}\protected@file@percent }
\citation{vincent2010stacked,xie2016unsupervised}
\citation{DinhKB14}
\citation{DinhKB14}
\citation{antoniak1974mixtures,neal2000markov,li2019tutorial}
\citation{ferguson1973bayesian}
\@writefile{toc}{\contentsline {section}{\numberline {3}Methodology}{3}{section.3}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{\numberline {3.1}Overview}{3}{subsection.3.1}\protected@file@percent }
\newlabel{eq:llh}{{1}{3}{Overview}{equation.3.1}{}}
\newlabel{eq:obj}{{2}{3}{Overview}{equation.3.2}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.2}Model Specification}{3}{subsection.3.2}\protected@file@percent }
\newlabel{eq:llh-jacob}{{3}{3}{Model Specification}{equation.3.3}{}}
\citation{bishop:2006:PRML}
\citation{gorur2010dirichlet,chen2016maximum,li2019tutorial}
\citation{dempster1977maximum}
\citation{bishop:2006:PRML}
\newlabel{eq:dpm1}{{4}{4}{Model Specification}{equation.3.4}{}}
\newlabel{eq:dpm2}{{5}{4}{Model Specification}{equation.3.5}{}}
\newlabel{eq:dpm3}{{6}{4}{Model Specification}{equation.3.6}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.3}Unified Parameter Estimation}{4}{subsection.3.3}\protected@file@percent }
\@writefile{toc}{\contentsline {subsubsection}{\numberline {3.3.1}The Overall MC-EM Framework}{4}{subsubsection.3.3.1}\protected@file@percent }
\newlabel{eq:estep}{{10}{4}{The Overall MC-EM Framework}{equation.3.10}{}}
\newlabel{eq:mstep}{{11}{4}{The Overall MC-EM Framework}{equation.3.11}{}}
\newlabel{eq:mc-em}{{13}{4}{The Overall MC-EM Framework}{equation.3.13}{}}
\newlabel{eq:sgd}{{15}{4}{The Overall MC-EM Framework}{equation.3.15}{}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {3.3.2}The Complete Data Likelihood}{4}{subsubsection.3.3.2}\protected@file@percent }
\citation{NEURIPS2019_9015}
\citation{bishop:2006:PRML}
\citation{murphy2007conjugate}
\@writefile{loa}{\contentsline {algorithm}{\numberline {1}{\ignorespaces DDPM$(\mathbf  {X}, h_e(\cdot ), \boldsymbol  {\Phi }, \lambda _s)$\relax }}{5}{algorithm.1}\protected@file@percent }
\newlabel{alg:main}{{1}{5}{DDPM$(\mX , h_e(\cdot ), \mPhi , \lambda _s)$\relax }{algorithm.1}{}}
\newlabel{eq:grad}{{16}{5}{The Complete Data Likelihood}{equation.3.16}{}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {3.3.3}Gibbs Sampling}{5}{subsubsection.3.3.3}\protected@file@percent }
\newlabel{eq:cond-para}{{17}{5}{Gibbs Sampling}{equation.3.17}{}}
\newlabel{eq:cond-c-old}{{18}{5}{Gibbs Sampling}{equation.3.18}{}}
\newlabel{eq:cond-c-new}{{19}{5}{Gibbs Sampling}{equation.3.19}{}}
\citation{lecun1998gradient}
\citation{stisen2015smart}
\citation{coates2011analysis}
\citation{lewis2004rcv1}
\citation{jiang2017variational}
\citation{steinley2004properties}
\citation{rosenberg2007v}
\citation{hubert1985comparing}
\@writefile{lot}{\contentsline {table}{\numberline {1}{\ignorespaces Hyperparameters of the prior distribution. \relax }}{6}{table.caption.2}\protected@file@percent }
\newlabel{table:parameter}{{1}{6}{Hyperparameters of the prior distribution. \relax }{table.caption.2}{}}
\@writefile{toc}{\contentsline {section}{\numberline {4}Experiments}{6}{section.4}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{\numberline {4.1}Synthetic datasets}{6}{subsection.4.1}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{\numberline {4.2}Real-world datasets}{6}{subsection.4.2}\protected@file@percent }
\@writefile{toc}{\contentsline {subsubsection}{\numberline {4.2.1}Datasets and settings}{6}{subsubsection.4.2.1}\protected@file@percent }
\@writefile{lot}{\contentsline {table}{\numberline {2}{\ignorespaces Performance comparison on real-world datasets. \relax }}{6}{table.caption.3}\protected@file@percent }
\newlabel{table:compare_result}{{2}{6}{Performance comparison on real-world datasets. \relax }{table.caption.3}{}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {4.2.2}Numerical Results}{6}{subsubsection.4.2.2}\protected@file@percent }
\citation{zhao2008g}
\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces The performance of clustering using the raw autoencoder features (ae repr) and DDPM's learned features (flow repr). (a) DDPM significantly outperforms DPM by learning better representation. (b) By using the learned features in the standard $k$-means, all metrics in almost all the datasets are improved, and the improvement in the MNIST dataset is particularly significant. This demonstrates DDPM's ability to learn better and transferable representation.\relax }}{7}{figure.caption.4}\protected@file@percent }
\newlabel{fig:flow_advance}{{2}{7}{The performance of clustering using the raw autoencoder features (ae repr) and DDPM's learned features (flow repr). (a) DDPM significantly outperforms DPM by learning better representation. (b) By using the learned features in the standard $k$-means, all metrics in almost all the datasets are improved, and the improvement in the MNIST dataset is particularly significant. This demonstrates DDPM's ability to learn better and transferable representation.\relax }{figure.caption.4}{}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {4.2.3}Representation quality}{7}{subsubsection.4.2.3}\protected@file@percent }
\citation{blei2006variational}
\citation{teh2006hierarchical}
\@writefile{lof}{\contentsline {figure}{\numberline {3}{\ignorespaces The representation learning process of DDPM on MNIST. The clearest example is the cluster of number 1, which becomes denser and more concentrated as the training process progresses. Its shape gradually changes from a crescent to a circle, making it easier to distinguish from other clusters.\relax }}{8}{figure.caption.5}\protected@file@percent }
\newlabel{fig:xxn}{{3}{8}{The representation learning process of DDPM on MNIST. The clearest example is the cluster of number 1, which becomes denser and more concentrated as the training process progresses. Its shape gradually changes from a crescent to a circle, making it easier to distinguish from other clusters.\relax }{figure.caption.5}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {4}{\ignorespaces The generated handwritten digits in the MNIST dataset.\relax }}{8}{figure.caption.6}\protected@file@percent }
\newlabel{fig:mnist_ddpm_gen}{{4}{8}{The generated handwritten digits in the MNIST dataset.\relax }{figure.caption.6}{}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {4.2.4}DDPM as a generative model}{8}{subsubsection.4.2.4}\protected@file@percent }
\@writefile{toc}{\contentsline {subsubsection}{\numberline {4.2.5}Impact of the autoencoder}{8}{subsubsection.4.2.5}\protected@file@percent }
\@writefile{toc}{\contentsline {section}{\numberline {5}Conclusion}{8}{section.5}\protected@file@percent }
\bibdata{li_223.bib}
\bibcite{antoniak1974mixtures}{{1}{1974}{{Antoniak}}{{}}}
\bibcite{bishop:2006:PRML}{{2}{2006}{{Bishop}}{{}}}
\bibcite{blei2006variational}{{3}{2006}{{Blei and Jordan}}{{}}}
\bibcite{caron2018deep}{{4}{2018}{{Caron et~al.}}{{Caron, Bojanowski, Joulin, and Douze}}}
\bibcite{chen2016maximum}{{5}{2016}{{Chen et~al.}}{{Chen, Zhang, and Xiong}}}
\bibcite{coates2011analysis}{{6}{2011}{{Coates et~al.}}{{Coates, Ng, and Lee}}}
\bibcite{dempster1977maximum}{{7}{1977}{{Dempster et~al.}}{{Dempster, Laird, and Rubin}}}
\bibcite{DinhKB14}{{8}{2015}{{Dinh et~al.}}{{Dinh, Krueger, and Bengio}}}
\bibcite{echraibi2020variational}{{9}{2020}{{Echraibi et~al.}}{{Echraibi, Flocon-Cholet, Gosselin, and Vaton}}}
\bibcite{ehsan2017infinite}{{10}{2017}{{Ehsan~Abbasnejad et~al.}}{{Ehsan~Abbasnejad, Dick, and van~den Hengel}}}
\bibcite{ester1996density}{{11}{1996}{{Ester et~al.}}{{Ester, Kriegel, Sander, Xu, et~al.}}}
\bibcite{ferguson1973bayesian}{{12}{1973}{{Ferguson}}{{}}}
\bibcite{frey2007clustering}{{13}{2007}{{Frey and Dueck}}{{}}}
\bibcite{gorur2010dirichlet}{{14}{2010}{{G{\"o}r{\"u}r and Rasmussen}}{{}}}
\bibcite{hubert1985comparing}{{15}{1985}{{Hubert and Arabie}}{{}}}
\bibcite{jiang2017variational}{{16}{2017}{{Jiang et~al.}}{{Jiang, Zheng, Tan, Tang, and Zhou}}}
\@writefile{lot}{\contentsline {table}{\numberline {3}{\ignorespaces Impact of the autoencoder trained with different number of iterations.\relax }}{9}{table.caption.7}\protected@file@percent }
\bibcite{kingma2018glow}{{17}{2018}{{Kingma and Dhariwal}}{{}}}
\bibcite{KingmaW13}{{18}{2014}{{Kingma and Welling}}{{}}}
\bibcite{krizhevsky2012imagenet}{{19}{2012}{{Krizhevsky et~al.}}{{Krizhevsky, Sutskever, and Hinton}}}
\bibcite{lecun1998gradient}{{20}{1998}{{LeCun et~al.}}{{LeCun, Bottou, Bengio, and Haffner}}}
\bibcite{lewis2004rcv1}{{21}{2004}{{Lewis et~al.}}{{Lewis, Yang, Russell-Rose, and Li}}}
\bibcite{li2018learning}{{22}{2018}{{Li et~al.}}{{Li, Chen, Poon, and Zhang}}}
\bibcite{li2021tk}{{23}{2021}{{Li et~al.}}{{Li, Zhang, Tang, Huang, Jiang, and Xia}}}
\bibcite{li2019tutorial}{{24}{2019}{{Li et~al.}}{{Li, Schofield, and G{\"o}nen}}}
\bibcite{macqueen1967some}{{25}{1967}{{MacQueen}}{{}}}
\bibcite{murphy2007conjugate}{{26}{2007}{{Murphy}}{{}}}
\bibcite{NalisnickS17}{{27}{2017}{{Nalisnick and Smyth}}{{}}}
\bibcite{neal2000markov}{{28}{2000}{{Neal}}{{}}}
\bibcite{NEURIPS2019_9015}{{29}{2019}{{Paszke et~al.}}{{Paszke, Gross, Massa, Lerer, Bradbury, Chanan, Killeen, Lin, Gimelshein, Antiga, Desmaison, Kopf, Yang, DeVito, Raison, Tejani, Chilamkurthy, Steiner, Fang, Bai, and Chintala}}}
\bibcite{rosenberg2007v}{{30}{2007}{{Rosenberg and Hirschberg}}{{}}}
\bibcite{steinley2004properties}{{31}{2004}{{Steinley}}{{}}}
\bibcite{stisen2015smart}{{32}{2015}{{Stisen et~al.}}{{Stisen, Blunck, Bhattacharya, Prentow, Kj{\ae }rgaard, Dey, Sonne, and Jensen}}}
\bibcite{szekely2005hierarchical}{{33}{2005}{{Szekely et~al.}}{{Szekely, Rizzo, et~al.}}}
\bibcite{teh2006hierarchical}{{34}{2006}{{Teh et~al.}}{{Teh, Jordan, Beal, and Blei}}}
\bibcite{vincent2010stacked}{{35}{2010}{{Vincent et~al.}}{{Vincent, Larochelle, Lajoie, Bengio, Manzagol, and Bottou}}}
\bibcite{xie2016unsupervised}{{36}{2016}{{Xie et~al.}}{{Xie, Girshick, and Farhadi}}}
\bibcite{yang2016joint}{{37}{2016}{{Yang et~al.}}{{Yang, Parikh, and Batra}}}
\bibcite{zhao2008g}{{38}{2008}{{Zhao et~al.}}{{Zhao, Guo, Xu, and Ban}}}
\newlabel{LastPage}{{}{10}{}{page.10}{}}
\xdef\lastpage@lastpage{10}
\xdef\lastpage@lastpageHy{10}
\gdef \@abspage@last{10}
