The sampling-algorithm cybernetics conjecture
Statement
Consider the subcategory of spanned by finite-dimensional smooth manifolds, with morphisms generated under sequential and parallel composition by the generalized autoencoder and inference games. Sampling-algorithm cybernetics conjecture. Sampling algorithms, such as Markov chain Monte Carlo, should supply a corresponding category of open cybernetic systems of interest. The conjecture extends the paper's variational-Bayesian cybernetic realizations to other families of approximate inference methods, but the source does not state whether it has been proved or refuted.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.