Abstract

The clustering problem is solved, using probabilistic programming languages belonging to two families—languages that implement graphical models (Infer.NET) and arbitrary computable generative models (Church). A comparison is made of the features and efficiency of the implementations. It is established that the Infer.NET language has higher accuracy and throughput of the implementation, but that it required the use of an imperative component of the language, which exceeds the limits of generative models. An autoencoder—a standard element of deep-learning networks—has been implemented in the Church language, which did not require the implementation of specialized network-training methods. It is shown that there is great potential in general-purpose probabilistic languages, the implementation of which, however, requires inference methods to be developed.

© 2015 Optical Society of America

Examples of Gaussian cluster computation

Peter van Loock
J. Opt. Soc. Am. B 24(2) 340-346 (2007)

Probabilistic framework for the adaptation and comparison of image codes

Michael S. Lewicki and Bruno A. Olshausen
J. Opt. Soc. Am. A 16(7) 1587-1601 (1999)

Fast color quantization using weighted sort-means clustering

M. Emre Celebi
J. Opt. Soc. Am. A 26(11) 2434-2443 (2009)

Large-scale photonic natural language processing

Carlo M. Valensise, Ivana Grecco, Davide Pierangeli, and Claudio Conti
Photon. Res. 10(12) 2846-2853 (2022)

Sensitivity evaluation of dynamic speckle activity measurements using clustering methods

Pablo Etchepareborda, Alejandro Federico, and Guillermo H. Kaufmann
Appl. Opt. 49(19) 3753-3761 (2010)