References

The works cited in the tutorials, the implementation notes and the theory vault. The same bibliography, docs/src/refs.bib, is rendered as the vault's Bibliography note.

  • — (2001). Sequential Monte Carlo Methods in Practice (Springer).
  • — (2026). Catlab.jl: A framework for applied category theory in Julia. Software. Accessed October 2026.
  • — (2026). ForneyLab.jl: Generating fast and flexible message passing algorithms. Software. Accessed October 2026.
  • — (2026). Lux.jl: Explicitly parameterized neural networks in Julia. Software. Accessed October 2026.
  • — (2026). Reactant.jl: Optimize Julia functions with MLIR and XLA. Software. Accessed October 2026.
  • Absil, P.-A.; Mahony, R. and Sepulchre, R. (2008). Optimization Algorithms on Matrix Manifolds (Princeton University Press).
  • Agarwal, P.; Tipaldi, G. D.; Spinello, L.; Stachniss, C. and Burgard, W. (2013). Robust Map Optimization Using Dynamic Covariance Scaling. In: IEEE International Conference on Robotics and Automation (ICRA); pp. 62–69.
  • Anderson, S.; Barfoot, T. D.; Tong, C. H. and Särkkä, S. (2015). Batch Nonlinear Continuous-Time Trajectory Estimation as Exactly Sparse Gaussian Process Regression. Autonomous Robots 39, 221–238, arXiv:1412.0630.
  • Andrychowicz, M.; Denil, M.; Gomez, S.; Hoffman, M. W.; Pfau, D.; Schaul, T.; Shillingford, B. and de Freitas, N. (2016). Learning to Learn by Gradient Descent by Gradient Descent. In: Advances in Neural Information Processing Systems (NeurIPS), arXiv:1606.04474.
  • Ansel, J.; Yang, E.; He, H.; Gimelshein, N.; Jain, A.; Voznesensky, M.; Bao, B.; Bell, P.; Berard, D.; Burovski, E.; Chauhan, G.; Chourdia, A.; Constable, W.; Desmaison, A.; DeVito, Z.; Ellison, E.; Feng, W.; Gong, J.; Gschwind, M.; Hirsh, B.; Huang, S.; Kalambarkar, K.; Kirsch, L.; Lazos, M.; Lezcano, M.; Liang, Y.; Liang, J.; Lu, Y.; Luk, C. K.; Maher, B.; Pan, Y.; Puhrsch, C.; Reso, M.; Saroufim, M.; Siraichi, M. Y.; Suk, H.; Zhang, S.; Suo, M.; Tillet, P.; Zhao, X.; Wang, E.; Zhou, K.; Zou, R.; Wang, X.; Mathews, A.; Wen, W.; Chanan, G.; Wu, P. and Chintala, S. (2024). PyTorch 2: Faster Machine Learning Through Dynamic Python Bytecode Transformation and Graph Compilation. In: Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 2; pp. 929–947.
  • Artzner, P.; Delbaen, F.; Eber, J.-M. and Heath, D. (1999). Coherent Measures of Risk. Mathematical Finance 9, 203–228.
  • Atkey, R. (2018). Syntax and Semantics of Quantitative Type Theory. In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science; pp. 56–65.
  • Baez, J. C. and Courser, K. (2020). Structured Cospans. Theory and Applications of Categories 35, arXiv:1911.04630.
  • Bagaev, D.; Podusenko, A. and de Vries, B. (2023). RxInfer: A Julia package for reactive real-time Bayesian inference. Journal of Open Source Software 8, 5161.
  • Bagaev, D. and de Vries, B. (2023). Reactive Message Passing for Scalable Bayesian Inference. Scientific Programming 2023, 1–26.
  • Bai, S.; Kolter, J. Z. and Koltun, V. (2019). Deep Equilibrium Models. In: Advances in Neural Information Processing Systems (NeurIPS), arXiv:1909.01377. ↩1
  • Balcerak, M.; Amiranashvili, T.; Terpin, A.; Shit, S.; Bogensperger, L.; Kaltenbach, S.; Koumoutsakos, P. and Menze, B. (2025). Energy Matching: Unifying Flow Matching and Energy-Based Models for Generative Modeling. In: Advances in Neural Information Processing Systems (NeurIPS), arXiv:2504.10612.
  • Balduzzi, D.; Racanière, S.; Martens, J.; Foerster, J.; Tuyls, K. and Graepel, T. (2018). The Mechanics of n-Player Differentiable Games. In: Proceedings of the 35th International Conference on Machine Learning, Vol. 80 of Proceedings of Machine Learning Research; pp. 354–363, arXiv:1802.05642.
  • Bao, F.; Nie, S.; Xue, K.; Li, C.; Pu, S.; Wang, Y.; Yue, G.; Cao, Y.; Su, H. and Zhu, J. (2023). One Transformer Fits All Distributions in Multi-Modal Diffusion at Scale. In: International Conference on Machine Learning (ICML), arXiv:2303.06555. ↩1
  • Batatia, I.; Kovacs, D. P.; Simm, G.; Ortner, C. and Csanyi, G. (2022). MACE: Higher Order Equivariant Message Passing Neural Networks for Fast and Accurate Force Fields. In: Advances in Neural Information Processing Systems 35; pp. 11423–11436.
  • Bates, S.; Candès, E.; Lei, L.; Romano, Y. and Sesia, M. (2023). Testing for Outliers with Conformal p-values. The Annals of Statistics 51, 149–178, arXiv:2104.08279. ↩1
  • Batzner, S.; Musaelian, A.; Sun, L.; Geiger, M.; Mailoa, J. P.; Kornbluth, M.; Molinari, N.; Smidt, T. E. and Kozinsky, B. (2022). E(3)-equivariant graph neural networks for data-efficient and accurate interatomic potentials. Nature Communications 13.
  • Bell, B. M. and Cathey, F. W. (1993). The iterated Kalman filter update as a Gauss–Newton method. IEEE Transactions on Automatic Control 38, 294–297.
  • Bellemare, M. G.; Dabney, W. and Munos, R. (2017). A Distributional Perspective on Reinforcement Learning. In: International Conference on Machine Learning (ICML), arXiv:1707.06887.
  • Bezanson, J.; Chen, J.; Chung, B.; Karpinski, S.; Shah, V. B.; Vitek, J. and Zoubritzky, L. (2018). Julia: dynamism and performance reconciled by design. Proceedings of the ACM on Programming Languages 2, 1–23.
  • Bezanson, J.; Edelman, A.; Karpinski, S. and Shah, V. B. (2017). Julia: A Fresh Approach to Numerical Computing. SIAM Review 59, 65–98, arXiv:1411.1607.
  • Bigi, F.; Langer, M. and Ceriotti, M. (2025). The dark side of the forces: assessing non-conservative force models for atomistic machine learning. In: International Conference on Machine Learning (ICML), arXiv:2412.11569. ↩1
  • Bishop, C. M. (1994). Mixture Density Networks. Technical Report NCRG/94/004 (Aston University). ↩1
  • Bissiri, P. G.; Holmes, C. C. and Walker, S. G. (2016). A General Framework for Updating Belief Distributions. Journal of the Royal Statistical Society Series B: Statistical Methodology 78, 1103–1130.
  • Bistarelli, S.; Montanari, U.; Rossi, F.; Schiex, T.; Verfaillie, G. and Fargier, H. (1999). Semiring-Based CSPs and Valued CSPs: Frameworks, Properties, and Comparison. Constraints 4, 199–240.
  • Bistarelli, S.; Montanari, U. and Rossi, F. (1997). Semiring-based constraint satisfaction and optimization. Journal of the ACM 44, 201–236.
  • Blundell, C.; Cornebise, J.; Kavukcuoglu, K. and Wierstra, D. (2015). Weight Uncertainty in Neural Networks. In: International Conference on Machine Learning (ICML), arXiv:1505.05424.
  • Bonchi, F.; Sobociński, P. and Zanasi, F. (2017). Interacting Hopf algebras. Journal of Pure and Applied Algebra 221, 144–184.
  • Boyd, S.; Parikh, N.; Chu, E.; Peleato, B. and Eckstein, J. (2011). Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers. Foundations and Trends in Machine Learning 3, 1–122.
  • Bradbury, J.; Frostig, R.; Hawkins, P.; Johnson, M. J.; Leary, C.; Maclaurin, D.; Necula, G.; Paszke, A.; VanderPlas, J.; Wanderman-Milne, S. and Zhang, Q. (2018). JAX: composable transformations of Python+NumPy programs. Software.
  • Breiding, P.; Rose, K. and Timme, S. (2023). Certifying Zeros of Polynomial Systems Using Interval Arithmetic. ACM Transactions on Mathematical Software 49, 1–14, arXiv:2011.05000. ↩1
  • Breiding, P. and Timme, S. (2018). HomotopyContinuation.jl: A Package for Homotopy Continuation in Julia. In: Mathematical Software – ICMS 2018, Vol. 10931 of Lecture Notes in Computer Science (Springer); pp. 458–465. ↩1
  • Bronstein, M. M.; Bruna, J.; Cohen, T. and Veličković, P. (2021). Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges, arXiv:2104.13478. ↩1
  • Broyden, C. G. (1965). A class of methods for solving nonlinear simultaneous equations. Mathematics of Computation 19, 577–593.
  • Carr, J. C.; Beatson, R. K.; Cherrie, J. B.; Mitchell, T. J.; Fright, W. R.; McCallum, B. C. and Evans, T. R. (2001). Reconstruction and representation of 3D objects with radial basis functions. In: Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH).
  • Chen, J. (1995). Optimal Rate of Convergence for Finite Mixture Models. The Annals of Statistics 23, 221–233.
  • Chen, L.; Lu, K.; Rajeswaran, A.; Lee, K.; Grover, A.; Laskin, M.; Abbeel, P.; Srinivas, A. and Mordatch, I. (2021). Decision Transformer: Reinforcement Learning via Sequence Modeling. In: Advances in Neural Information Processing Systems (NeurIPS), arXiv:2106.01345.
  • Chen, R. T.; Rubanova, Y.; Bettencourt, J. and Duvenaud, D. (2018). Neural Ordinary Differential Equations. In: Advances in Neural Information Processing Systems (NeurIPS), arXiv:1806.07366.
  • Chen, T.; Goodfellow, I. and Shlens, J. (2016). Net2Net: Accelerating Learning via Knowledge Transfer. In: International Conference on Learning Representations (ICLR), arXiv:1511.05641.
  • Chickering, D. M. (2002). Optimal Structure Identification With Greedy Search. Journal of Machine Learning Research 3, 507–554.
  • Chojnacki, W.; Brooks, M. J.; van den Hengel, A. and Gawley, D. (2000). On the fitting of surfaces to data with covariances. IEEE Transactions on Pattern Analysis and Machine Intelligence 22, 1294–1303.
  • Chung, H.; Kim, J.; McCann, M. T.; Klasky, M. L. and Ye, J. C. (2023). Diffusion Posterior Sampling for General Noisy Inverse Problems. In: International Conference on Learning Representations (ICLR), arXiv:2209.14687.
  • Clark, K. and Jaini, P. (2023). Text-to-Image Diffusion Models are Zero-Shot Classifiers. In: Advances in Neural Information Processing Systems (NeurIPS), arXiv:2303.15233.
  • Clark, K.; Vicol, P.; Swersky, K. and Fleet, D. J. (2024). Directly Fine-Tuning Diffusion Models on Differentiable Rewards. In: International Conference on Learning Representations (ICLR), arXiv:2309.17400.
  • Cooper, R.; Dobnik, S.; Lappin, S. and Larsson, S. (2015). Probabilistic Type Theory and Natural Language Semantics. Linguistic Issues in Language Technology 10.
  • Craciun, G.; Dickenstein, A.; Shiu, A. and Sturmfels, B. (2009). Toric Dynamical Systems. Journal of Symbolic Computation 44, 1551–1565, arXiv:0708.3431.
  • Cranmer, M. (2023). Interpretable Machine Learning for Science with PySR and SymbolicRegression.jl, arXiv:2305.01582. ↩1
  • Cranmer, M.; Greydanus, S.; Hoyer, S.; Battaglia, P.; Spergel, D. and Ho, S. (2020). Lagrangian Neural Networks, arXiv:2003.04630.
  • Cranmer, M.; Sanchez-Gonzalez, A.; Battaglia, P.; Xu, R.; Cranmer, K.; Spergel, D. and Ho, S. (2020). Discovering Symbolic Models from Deep Learning with Inductive Biases. In: Advances in Neural Information Processing Systems (NeurIPS), arXiv:2006.11287. ↩1
  • Cruttwell, G. S.; Gavranović, B.; Ghani, N.; Wilson, P. and Zanasi, F. (2022). Categorical Foundations of Gradient-Based Learning. In: European Symposium on Programming (ESOP), arXiv:2103.01931.
  • Cusumano-Towner, M. F.; Saad, F. A.; Lew, A. K. and Mansinghka, V. K. (2019). Gen: A General-Purpose Probabilistic Programming System with Programmable Inference. In: ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI).
  • Darroch, J. N. and Ratcliff, D. (1972). Generalized Iterative Scaling for Log-Linear Models. The Annals of Mathematical Statistics 43, 1470–1480.
  • De Raedt, L.; Kimmig, A. and Toivonen, H. (2007). ProbLog: A Probabilistic Prolog and Its Application in Link Discovery. In: International Joint Conference on Artificial Intelligence (IJCAI).
  • Dechter, R. (1999). Bucket elimination: A unifying framework for reasoning. Artificial Intelligence 113, 41–85.
  • Del Moral, P.; Doucet, A. and Jasra, A. (2006). Sequential Monte Carlo Samplers. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 68, 411–436. ↩1
  • Dellaert, F. and Kaess, M. (2017). Factor Graphs for Robot Perception (Now Publishers). ↩1
  • Delyon, B.; Lavielle, M. and Moulines, E. (1999). Convergence of a Stochastic Approximation Version of the EM Algorithm. The Annals of Statistics 27, 94–128.
  • Diaconis, P. and Sturmfels, B. (1998). Algebraic Algorithms for Sampling from Conditional Distributions. The Annals of Statistics 26, 363–397.
  • Dong, J.; Mukadam, M.; Dellaert, F. and Boots, B. (2016). Motion Planning as Probabilistic Inference using Gaussian Processes and Factor Graphs. In: Robotics: Science and Systems XII.
  • Donsker, M. D. and Varadhan, S. R. (1975). Asymptotic evaluation of certain Markov process expectations for large time, I. Communications on Pure and Applied Mathematics 28, 1–47.
  • Drton, M.; Sturmfels, B. and Sullivant, S. (2009). Lectures on Algebraic Statistics. Vol. 39 of Oberwolfach Seminars (Birkhäuser).
  • Du, Y.; Durkan, C.; Strudel, R.; Tenenbaum, J. B.; Dieleman, S.; Fergus, R.; Sohl-Dickstein, J.; Doucet, A. and Grathwohl, W. (2023). Reduce, Reuse, Recycle: Compositional Generation with Energy-Based Diffusion Models and MCMC. In: International Conference on Machine Learning (ICML), arXiv:2302.11552. ↩1 ↩2 ↩3
  • Du, Y. and Mordatch, I. (2019). Implicit Generation and Generalization in Energy-Based Models. In: Advances in Neural Information Processing Systems (NeurIPS), arXiv:1903.08689.
  • E, W. and Yu, B. (2018). The Deep Ritz Method: A Deep Learning-Based Numerical Algorithm for Solving Variational Problems. Communications in Mathematics and Statistics 6, 1–12.
  • Edelman, A.; Arias, T. A. and Smith, S. T. (1998). The Geometry of Algorithms with Orthogonality Constraints. SIAM Journal on Matrix Analysis and Applications 20, 303–353.
  • Edelsbrunner, H.; Letscher, D. and Zomorodian, A. (2002). Topological Persistence and Simplification. Discrete & Computational Geometry 28, 511–533.
  • Efron, B. (2011). Tweedie's Formula and Selection Bias. Journal of the American Statistical Association 106, 1602–1614.
  • Elidan, G.; McGraw, I. and Koller, D. (2006). Residual Belief Propagation: Informed Scheduling for Asynchronous Message Passing. In: Proceedings of the Twenty-Second Conference on Uncertainty in Artificial Intelligence (UAI); pp. 165–173, arXiv:1206.6837.
  • Fang, Z.; Díaz, M.; Buchanan, S. and Sulam, J. (2025). Beyond Scores: Proximal Diffusion Models, arXiv:2507.08956. ↩1
  • Feldbaum, A. A. (1960). Dual control theory I–IV. Automation and Remote Control.
  • Fienberg, S. E. and Rinaldo, A. (2012). Maximum Likelihood Estimation in Log-Linear Models. The Annals of Statistics 40, 996–1023, arXiv:1104.3618.
  • Finn, C.; Abbeel, P. and Levine, S. (2017). Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks. In: International Conference on Machine Learning (ICML), arXiv:1703.03400.
  • Fong, B. (2013). Causal Theories: A Categorical Perspective on Bayesian Networks. Master's thesis, University of Oxford, arXiv:1301.6201.
  • Fong, B. (2016). The Algebra of Open and Interconnected Systems. Ph.D. Thesis, University of Oxford, arXiv:1609.05382.
  • Fong, B. and Spivak, D. I. (2019). Hypergraph Categories. Journal of Pure and Applied Algebra, arXiv:1806.08304.
  • Friedman, J.; Hastie, T. and Tibshirani, R. (2008). Sparse inverse covariance estimation with the graphical lasso. Biostatistics 9, 432–441, arXiv:0708.3517.
  • Friston, K. (2010). The free-energy principle: a unified brain theory? Nature Reviews Neuroscience 11, 127–138.
  • Friston, K.; FitzGerald, T.; Rigoli, F.; Schwartenbeck, P. and Pezzulo, G. (2017). Active Inference: A Process Theory. Neural Computation 29, 1–49.
  • Fritz, T. (2020). A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics. Advances in Mathematics 370, arXiv:1908.07021.
  • Frostig, R.; Johnson, M. J. and Leary, C. (2018). Compiling machine learning programs via high-level tracing. In: Systems for Machine Learning (SysML).
  • Föllmer, H. and Schied, A. (2016). Stochastic Finance: An Introduction in Discrete Time. 4 Edition (De Gruyter).
  • Gao, R.; Nijkamp, E.; Kingma, D. P.; Xu, Z.; Dai, A. M. and Wu, Y. N. (2019). Flow Contrastive Estimation of Energy-Based Models, arXiv:1912.00589.
  • Gao, R.; Song, Y.; Poole, B.; Wu, Y. N. and Kingma, D. P. (2020). Learning Energy-Based Models by Diffusion Recovery Likelihood, arXiv:2012.08125.
  • García-Fernández, Á. F.; Svensson, L. and Särkkä, S. (2017). Iterated Posterior Linearization Smoother. IEEE Transactions on Automatic Control 62, 2056–2063.
  • Ge, H.; Xu, K. and Ghahramani, Z. (2018). Turing: A Language for Flexible Probabilistic Inference. In: International Conference on Artificial Intelligence and Statistics (AISTATS).
  • Geiger, D.; Meek, C. and Sturmfels, B. (2006). On the Toric Algebra of Graphical Models. The Annals of Statistics 34, 1463–1492.
  • Geng, Z.; Zhang, X.-Y.; Bai, S.; Wang, Y. and Lin, Z. (2021). On Training Implicit Models. In: Advances in Neural Information Processing Systems (NeurIPS), arXiv:2111.05177.
  • Genovese, C. R.; Perone-Pacifico, M.; Verdinelli, I. and Wasserman, L. (2014). Nonparametric ridge estimation. The Annals of Statistics 42. ↩1
  • Ghahramani, Z. and Hinton, G. E. (2000). Variational Learning for Switching State-Space Models. Neural Computation 12, 831–864.
  • Ghahramani, Z. and Jordan, M. I. (1997). Factorial Hidden Markov Models. Machine Learning 29, 245–273.
  • Ghani, N.; Hedges, J.; Winschel, V. and Zahn, P. (2018). Compositional game theory. In: Logic in Computer Science (LICS), arXiv:1603.04641.
  • Giry, M. (1982). A categorical approach to probability theory. In: Lecture Notes in Mathematics; pp. 68–85.
  • Gladstone, A.; Nanduru, G.; Islam, M. M.; Han, P.; Ha, H.; Chadha, A.; Du, Y.; Ji, H.; Li, J. and Iqbal, T. (2025). Energy-Based Transformers are Scalable Learners and Thinkers, arXiv:2507.02092.
  • Golub, G. H. and Welsch, J. H. (1969). Calculation of Gauss Quadrature Rules. Mathematics of Computation 23, 221–230.
  • Graham, M. S.; Pinaya, W. H.; Tudosiu, P.-D.; Nachev, P.; Ourselin, S. and Cardoso, M. J. (2023). Denoising Diffusion Models for Out-of-Distribution Detection. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW), arXiv:2211.07740.
  • Graikos, A.; Malkin, N.; Jojic, N. and Samaras, D. (2022). Diffusion Models as Plug-and-Play Priors. In: Advances in Neural Information Processing Systems (NeurIPS), arXiv:2206.09012.
  • Grathwohl, W.; Chen, R. T.; Bettencourt, J.; Sutskever, I. and Duvenaud, D. (2019). FFJORD: Free-form Continuous Dynamics for Scalable Reversible Generative Models. In: International Conference on Learning Representations (ICLR), arXiv:1810.01367.
  • Grathwohl, W.; Wang, K.-C.; Jacobsen, J.-H.; Duvenaud, D.; Norouzi, M. and Swersky, K. (2020). Your Classifier is Secretly an Energy Based Model and You Should Treat it Like One. In: International Conference on Learning Representations (ICLR), arXiv:1912.03263.
  • Grazzi, R.; Franceschi, L.; Pontil, M. and Salzo, S. (2020). On the Iteration Complexity of Hypergradient Computation. In: International Conference on Machine Learning (ICML), arXiv:2006.16218.
  • Greydanus, S.; Dzamba, M. and Yosinski, J. (2019). Hamiltonian Neural Networks. In: Advances in Neural Information Processing Systems (NeurIPS), arXiv:1906.01563.
  • Gutmann, M. and Hyvärinen, A. (2010). Noise-Contrastive Estimation: A New Estimation Principle for Unnormalized Statistical Models. In: International Conference on Artificial Intelligence and Statistics (AISTATS), Vol. 9 of PMLR; pp. 297–304.
  • Ha, D.; Dai, A. M. and Le, Q. V. (2017). HyperNetworks. In: International Conference on Learning Representations (ICLR), arXiv:1609.09106.
  • Hairer, E.; Lubich, C. and Wanner, G. (2006). Geometric Numerical Integration: Structure-Preserving Algorithms for Ordinary Differential Equations. 2 Edition, Vol. 31 of Springer Series in Computational Mathematics (Springer Berlin, Heidelberg).
  • Han, Z.-Y.; Wang, J.; Fan, H.; Wang, L. and Zhang, P. (2018). Unsupervised Generative Modeling Using Matrix Product States. Physical Review X 8, 031012.
  • Hansen, J. and Ghrist, R. (2019). Toward a Spectral Theory of Cellular Sheaves. Journal of Applied and Computational Topology 3, 315–358.
  • Hinton, G. E. (2002). Training Products of Experts by Minimizing Contrastive Divergence. Neural Computation 14, 1771–1800. ↩1
  • Ho, J.; Jain, A. and Abbeel, P. (2020). Denoising Diffusion Probabilistic Models. In: Advances in Neural Information Processing Systems (NeurIPS), arXiv:2006.11239. ↩1 ↩2
  • Ho, J. and Salimans, T. (2022). Classifier-Free Diffusion Guidance. In: NeurIPS 2021 Workshop on Deep Generative Models and Downstream Applications, arXiv:2207.12598. ↩1
  • Hoffmann, H. (2007). Kernel PCA for novelty detection. Pattern Recognition 40, 863–874.
  • Holgate, P. (1964). Estimation for the Bivariate Poisson Distribution. Biometrika 51, 241.
  • Hornik, K. (1991). Approximation Capabilities of Multilayer Feedforward Networks. Neural Networks 4, 251–257.
  • Hyvärinen, A. (2005). Estimation of Non-Normalized Statistical Models by Score Matching. Journal of Machine Learning Research 6, 695–709.
  • Innes, M. (2018). Don't Unroll Adjoint: Differentiating SSA-Form Programs, arXiv:1810.07951.
  • Innes, M.; Saba, E.; Fischer, K.; Gandhi, D.; Rudilosso, M. C.; Joy, N. M.; Karmali, T.; Pal, A. and Shah, V. (2018). Fashionable Modelling with Flux, arXiv:1811.01457.
  • de Jong, P. (1991). The Diffuse Kalman Filter. The Annals of Statistics 19, 1073–1083.
  • Jordan, M. I. and Jacobs, R. A. (1994). Hierarchical Mixtures of Experts and the EM Algorithm. Neural Computation 6, 181–214.
  • Julier, S. J. and Uhlmann, J. K. (1997). New extension of the Kalman filter to nonlinear systems. In: Signal Processing, Sensor Fusion, and Target Recognition VI, Vol. 3068 of Proceedings of SPIE.
  • Kaess, M.; Johannsson, H.; Roberts, R.; Ila, V.; Leonard, J. J. and Dellaert, F. (2012), iSAM2: Incremental smoothing and mapping using the Bayes tree. The International Journal of Robotics Research 31, 216–235.
  • Kaheman, K.; Kutz, J. N. and Brunton, S. L. (2020). SINDy-PI: A Robust Algorithm for Parallel Implicit Sparse Identification of Nonlinear Dynamics. Proceedings of the Royal Society A, arXiv:2004.02322.
  • Kalisch, M. and Bühlmann, P. (2007). Estimating High-Dimensional Directed Acyclic Graphs with the PC-Algorithm. Journal of Machine Learning Research 8, 613–636, arXiv:math/0510436.
  • Kalman, R. E. (1960). A New Approach to Linear Filtering and Prediction Problems. Journal of Basic Engineering 82, 35–45. ↩1
  • Karwowski, J.; Nielsen, F. and Staton, S. (2026). Compositional Information Geometry of Probabilistic Programs, arXiv:2610.17886.
  • Katsumata, S.-y. (2014). Parametric effect monads and semantics of effect systems. ACM SIGPLAN Notices 49, 633–645.
  • Kingma, D. P.; Salimans, T.; Poole, B. and Ho, J. (2021). Variational Diffusion Models. In: Advances in Neural Information Processing Systems (NeurIPS), arXiv:2107.00630.
  • Knoll, D. A. and Keyes, D. E. (2004). Jacobian-free Newton–Krylov methods: a survey of approaches and applications. Journal of Computational Physics 193, 357–397.
  • Koller, D. and Friedman, N. (2009). Probabilistic Graphical Models: Principles and Techniques (MIT Press).
  • Kolter, Z.; Duvenaud, D. and Johnson, M. (2020). Deep Implicit Layers: Neural ODEs, Deep Equilibrium Models, and Beyond. NeurIPS 2020 tutorial.
  • Krichene, W.; Bayen, A. and Bartlett, P. L. (2015). Accelerated Mirror Descent in Continuous and Discrete Time. In: Advances in Neural Information Processing Systems (NeurIPS), Vol. 28.
  • Kristan, M.; Leonardis, A. and Skočaj, D. (2011). Multivariate online kernel density estimation with Gaussian kernels. Pattern Recognition 44, 2630–2642. ↩1
  • Lauritzen, S. L. (1992). Propagation of Probabilities, Means, and Variances in Mixed Graphical Association Models. Journal of the American Statistical Association 87, 1098–1108.
  • Lauritzen, S. L. (1996). Graphical Models. Oxford Statistical Science Series (Oxford University Press).
  • Lauritzen, S. L. and Wermuth, N. (1989). Graphical Models for Associations between Variables, some of which are Qualitative and some Quantitative. The Annals of Statistics 17, 31–57.
  • Lavore, E. D.; Román, M. and Sobociński, P. (2025). Partial Markov Categories, arXiv:2502.03477.
  • LeCun, Y.; Bottou, L.; Bengio, Y. and Haffner, P. (1998). Gradient-Based Learning Applied to Document Recognition. Proceedings of the IEEE 86, 2278–2324.
  • LeCun, Y.; Chopra, S.; Hadsell, R.; Ranzato, M. and Huang, F. J. (2006). A Tutorial on Energy-Based Learning. In: Predicting Structured Data (MIT Press).
  • Li, A. C.; Prabhudesai, M.; Duggal, S.; Brown, E. and Pathak, D. (2023). Your Diffusion Model is Secretly a Zero-Shot Classifier. In: IEEE/CVF International Conference on Computer Vision (ICCV), arXiv:2303.16203. ↩1
  • Li, X. L.; Holtzman, A.; Fried, D.; Liang, P.; Eisner, J.; Hashimoto, T.; Zettlemoyer, L. and Lewis, M. (2023). Contrastive Decoding: Open-ended Text Generation as Optimization. In: Annual Meeting of the Association for Computational Linguistics (ACL), arXiv:2210.15097.
  • Liu, N.; Li, S.; Du, Y.; Torralba, A. and Tenenbaum, J. B. (2022). Compositional Visual Generation with Composable Diffusion Models. In: European Conference on Computer Vision (ECCV), arXiv:2206.01714.
  • Liu, Q. and Pierce, D. A. (1994). A Note on Gauss–Hermite Quadrature. Biometrika 81, 624–629.
  • Liu, W.; Wang, X.; Owens, J. D. and Li, Y. (2020). Energy-based Out-of-distribution Detection. In: Advances in Neural Information Processing Systems (NeurIPS), arXiv:2010.03759.
  • Livni, R.; Lehavi, D.; Schein, S.; Nachlieli, H.; Shalev-Shwartz, S. and Globerson, A. (2013). Vanishing Component Analysis. In: International Conference on Machine Learning (ICML).
  • Loconte, L.; Sladek, A. M.; Mengel, S.; Trapp, M.; Solin, A.; Gillis, N. and Vergari, A. (2023). Subtractive Mixture Models via Squaring: Representation and Learning, arXiv:2310.00724.
  • Loeliger, H.-A. (2004). An Introduction to factor graphs. IEEE Signal Processing Magazine 21, 28–41.
  • Loeliger, H.-A.; Dauwels, J.; Hu, J.; Korl, S.; Ping, L. and Kschischang, F. R. (2007). The Factor Graph Approach to Model-Based Signal Processing. Proceedings of the IEEE 95, 1295–1322.
  • Lorraine, J.; Vicol, P. and Duvenaud, D. (2020). Optimizing Millions of Hyperparameters by Implicit Differentiation. In: International Conference on Artificial Intelligence and Statistics (AISTATS), arXiv:1911.02590.
  • Lou, A.; Meng, C. and Ermon, S. (2024). Discrete Diffusion Modeling by Estimating the Ratios of the Data Distribution. In: International Conference on Machine Learning (ICML), arXiv:2310.16834.
  • Lugmayr, A.; Danelljan, M.; Romero, A.; Yu, F.; Timofte, R. and Van Gool, L. (2022). RePaint: Inpainting using Denoising Diffusion Probabilistic Models. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), arXiv:2201.09865.
  • Ma, Y.; Gowda, S.; Anantharaman, R.; Laughman, C.; Shah, V. and Rackauckas, C. (2021). ModelingToolkit: A Composable Graph Transformation System for Equation-Based Modeling, arXiv:2103.05244.
  • MacKay, D. J. (1992). Bayesian Interpolation. Neural Computation 4, 415–447.
  • Macêdo, I.; Gois, J. P. and Velho, L. (2011). Hermite Radial Basis Functions Implicits. Computer Graphics Forum 30, 27–42.
  • Malioutov, D. M.; Johnson, J. K. and Willsky, A. S. (2006). Walk-Sums and Belief Propagation in Gaussian Graphical Models. Journal of Machine Learning Research 7, 2031–2064.
  • Mangan, N. M.; Brunton, S. L.; Proctor, J. L. and Kutz, J. N. (2016). Inferring biological networks by sparse identification of nonlinear dynamics. IEEE Transactions on Molecular, Biological and Multi-Scale Communications, arXiv:1605.08368.
  • Mardani, M.; Song, J.; Kautz, J. and Vahdat, A. (2024). A Variational Perspective on Solving Inverse Problems with Diffusion Models. In: International Conference on Learning Representations (ICLR), arXiv:2305.04391. ↩1
  • Martens, J. (2020). New Insights and Perspectives on the Natural Gradient Method. Journal of Machine Learning Research 21, 1–76, arXiv:1412.1193.
  • McCullagh, P. (1980). Regression Models for Ordinal Data. Journal of the Royal Statistical Society: Series B (Methodological) 42, 109–127.
  • Meng, C.; Choi, K.; Song, J. and Ermon, S. (2022). Concrete Score Matching: Generalized Score Matching for Discrete Data. In: Advances in Neural Information Processing Systems (NeurIPS), arXiv:2211.00802.
  • Minka, T. P. (2001). Expectation Propagation for approximate Bayesian inference. In: Conference on Uncertainty in Artificial Intelligence (UAI), arXiv:1301.2294.
  • Mitchell, T. J. and Beauchamp, J. J. (1988). Bayesian Variable Selection in Linear Regression. Journal of the American Statistical Association 83, 1023–1032.
  • Mobahi, H. and Fisher, J. W. (2015). On the Link between Gaussian Homotopy Continuation and Convex Envelopes. In: Energy Minimization Methods in Computer Vision and Pattern Recognition (EMMCVPR).
  • Mohamed, S. and Lakshminarayanan, B. (2016). Learning in Implicit Generative Models, arXiv:1610.03483.
  • Montoison, A. and Orban, D. (2023). Krylov.jl: A Julia basket of hand-picked Krylov methods. Journal of Open Source Software 8, 5187.
  • Moses, W. S. and Churavy, V. (2020). Instead of Rewriting Foreign Code for Machine Learning, Automatically Synthesize Fast Gradients. In: Advances in Neural Information Processing Systems (NeurIPS), arXiv:2010.01709.
  • Myers, D. J. (2020). Double Categories of Open Dynamical Systems (Extended Abstract), arXiv:2005.05956.
  • Nie, S.; Zhu, F.; You, Z.; Zhang, X.; Ou, J.; Hu, J.; Zhou, J.; Lin, Y.; Wen, J.-R. and Li, C. (2025). Large Language Diffusion Models, arXiv:2502.09992.
  • Nocedal, J. and Wright, S. J. (2006). Numerical Optimization. 2 Edition (Springer). ↩1
  • Noether, E. (1918). Invariante Variationsprobleme. Nachrichten von der Gesellschaft der Wissenschaften zu Göttingen, Mathematisch-Physikalische Klasse.
  • Olson, E. and Agarwal, P. (2012). Inference on Networks of Mixtures for Robust Robot Mapping. In: Robotics: Science and Systems (RSS).
  • Ozertem, U. and Erdogmus, D. (2011). Locally Defined Principal Curves and Surfaces. Journal of Machine Learning Research 12.
  • Pantelides, C. C. (1988). The Consistent Initialization of Differential-Algebraic Systems. SIAM Journal on Scientific and Statistical Computing 9, 213–231.
  • Paszke, A.; Gross, S.; Massa, F.; Lerer, A.; Bradbury, J.; Chanan, G.; Killeen, T.; Lin, Z.; Gimelshein, N.; Antiga, L.; Desmaison, A.; Köpf, A.; Yang, E.; DeVito, Z.; Raison, M.; Tejani, A.; Chilamkurthy, S.; Steiner, B.; Fang, L.; Bai, J. and Chintala, S. (2019). PyTorch: An Imperative Style, High-Performance Deep Learning Library. In: Advances in Neural Information Processing Systems (NeurIPS), arXiv:1912.01703.
  • Pedregosa, F. (2016). Hyperparameter Optimization with Approximate Gradient. In: International Conference on Machine Learning (ICML), arXiv:1602.02355.
  • Perez, E.; Strub, F.; de Vries, H.; Dumoulin, V. and Courville, A. (2018). FiLM: Visual Reasoning with a General Conditioning Layer. In: AAAI Conference on Artificial Intelligence, arXiv:1709.07871.
  • Perrone, P. (2024). Markov Categories and Entropy. IEEE Transactions on Information Theory 70, 1671–1692, arXiv:2212.11719.
  • Pinkus, A. (1999). Approximation Theory of the MLP Model in Neural Networks. Acta Numerica 8, 143–195.
  • Polyak, B. T. (1964). Some Methods of Speeding Up the Convergence of Iteration Methods. USSR Computational Mathematics and Mathematical Physics 4, 1–17.
  • Poole, B.; Jain, A.; Barron, J. T. and Mildenhall, B. (2023). DreamFusion: Text-to-3D using 2D Diffusion. In: International Conference on Learning Representations (ICLR), arXiv:2209.14988.
  • Poole, D. (2003). First-order probabilistic inference. In: International Joint Conference on Artificial Intelligence (IJCAI).
  • Poon, H. and Domingos, P. (2011). Sum-Product Networks: A New Deep Architecture. In: Conference on Uncertainty in Artificial Intelligence (UAI), arXiv:1202.3732.
  • Prabhudesai, M.; Goyal, A.; Pathak, D. and Fragkiadaki, K. (2023). Aligning Text-to-Image Diffusion Models with Reward Backpropagation, arXiv:2310.03739.
  • Rackauckas, C.; Innes, M.; Ma, Y.; Bettencourt, J.; White, L. and Dixit, V. (2019). DiffEqFlux.jl – A Julia Library for Neural Differential Equations, arXiv:1902.02376.
  • Rackauckas, C.; Ma, Y.; Martensen, J.; Warner, C.; Zubov, K.; Supekar, R.; Skinner, D.; Ramadhan, A. and Edelman, A. (2020). Universal Differential Equations for Scientific Machine Learning, arXiv:2001.04385 [cs.LG].
  • Raskutti, G. and Mukherjee, S. (2015). The Information Geometry of Mirror Descent. IEEE Transactions on Information Theory 61, 1451–1457, arXiv:1310.7780.
  • Ratliff, L. J.; Burden, S. A. and Sastry, S. S. (2013). Characterization and computation of local Nash equilibria in continuous games. In: 51st Annual Allerton Conference on Communication, Control, and Computing (IEEE); pp. 917–924.
  • Rauch, H. E.; Tung, F. and Striebel, C. T. (1965). Maximum likelihood estimates of linear dynamic systems. AIAA Journal 3, 1445–1450. ↩1
  • Revels, J.; Lubin, M. and Papamarkou, T. (2016). Forward-Mode Automatic Differentiation in Julia, arXiv:1607.07892.
  • Rhodes, B.; Xu, K. and Gutmann, M. U. (2020). Telescoping Density-Ratio Estimation, arXiv:2006.12204.
  • Richardson, M. and Domingos, P. (2006). Markov logic networks. Machine Learning 62, 107–136.
  • Riegler, E.; Kirkelund, G. E.; Manchon, C. N.; Badiu, M.-A. and Fleury, B. H. (2013). Merging Belief Propagation and the Mean Field Approximation: A Free Energy Approach. IEEE Transactions on Information Theory 59, 588–602.
  • Roberts, G. O. and Tweedie, R. L. (1996). Exponential Convergence of Langevin Distributions and Their Discrete Approximations. Bernoulli 2, 341–363. ↩1
  • Rockafellar, R. T. and Uryasev, S. (2000). Optimization of conditional value-at-risk. The Journal of Risk 2, 21–41.
  • Rockafellar, R. T. and Uryasev, S. (2002). Conditional value-at-risk for general loss distributions. Journal of Banking & Finance 26, 1443–1471.
  • Romano, Y.; Elad, M. and Milanfar, P. (2017). The Little Engine that Could: Regularization by Denoising (RED). SIAM Journal on Imaging Sciences 10, arXiv:1611.02862.
  • Rubin, D. B. (1981). Estimation in Parallel Randomized Experiments. Journal of Educational Statistics 6, 377–401.
  • Runnalls, A. R. (2007). Kullback-Leibler Approach to Gaussian Mixture Reduction. IEEE Transactions on Aerospace and Electronic Systems 43, 989–999.
  • Saad, Y. and Schultz, M. H. (1986). GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems. SIAM Journal on Scientific and Statistical Computing 7, 856–869.
  • Sahoo, S. S.; Arriola, M.; Schiff, Y.; Gokaslan, A.; Marroquin, E.; Chiu, J. T.; Rush, A. and Kuleshov, V. (2024). Simple and Effective Masked Diffusion Language Models. In: Advances in Neural Information Processing Systems (NeurIPS), arXiv:2406.07524.
  • Salimans, T. and Ho, J. (2021). Should EBMs model the energy or the score? In: Energy Based Models Workshop, International Conference on Learning Representations (ICLR). ↩1
  • Sato, T. and Kameya, Y. (1997). PRISM: A Language for Symbolic-Statistical Modeling. In: International Joint Conference on Artificial Intelligence (IJCAI).
  • Schlag, I.; Irie, K. and Schmidhuber, J. (2021). Linear Transformers Are Secretly Fast Weight Programmers. In: International Conference on Machine Learning (ICML), arXiv:2102.11174.
  • Schmidhuber, J. (1992). Learning to Control Fast-Weight Memories: An Alternative to Dynamic Recurrent Networks. Neural Computation 4, 131–139.
  • Schmidhuber, J. (2019). Reinforcement Learning Upside Down: Don't Predict Rewards – Just Map Them to Actions, arXiv:1912.02875.
  • Schmidt, M. and Lipson, H. (2009). Distilling Free-Form Natural Laws from Experimental Data. Science 324, 81–85.
  • Schröder, T.; Ou, Z.; Lim, J. N.; Li, Y.; Vollmer, S. J. and Duncan, A. B. (2023). Energy Discrepancies: A Score-Independent Loss for Energy-Based Models. In: Advances in Neural Information Processing Systems (NeurIPS), arXiv:2307.06431.
  • Schölkopf, B.; Platt, J. C.; Shawe-Taylor, J.; Smola, A. J. and Williamson, R. C. (2001). Estimating the Support of a High-Dimensional Distribution. Neural Computation 13, 1443–1471.
  • Singh, G.; Mémoli, F. and Carlsson, G. (2007). Topological Methods for the Analysis of High Dimensional Data Sets and 3D Object Recognition. In: Eurographics Symposium on Point-Based Graphics (The Eurographics Association); pp. 91–100.
  • Skreta, M.; Akhound-Sadegh, T.; Ohanesian, V.; Bondesan, R.; Aspuru-Guzik, A.; Doucet, A.; Brekelmans, R.; Tong, A. and Neklyudov, K. (2025). Feynman-Kac Correctors in Diffusion: Annealing, Guidance, and Product of Experts. In: International Conference on Machine Learning (ICML), arXiv:2503.02819. ↩1
  • Sohl-Dickstein, J.; Weiss, E.; Maheswaranathan, N. and Ganguli, S. (2015). Deep Unsupervised Learning using Nonequilibrium Thermodynamics. In: International Conference on Machine Learning (ICML), Vol. 37 of Proceedings of Machine Learning Research; pp. 2256–2265, arXiv:1503.03585.
  • Somogyi, Z.; Henderson, F. and Conway, T. (1996). The execution algorithm of mercury, an efficient purely declarative logic programming language. The Journal of Logic Programming 29, 17–64.
  • Song, Y.; Garg, S.; Shi, J. and Ermon, S. (2019). Sliced Score Matching: A Scalable Approach to Density and Score Estimation. In: Conference on Uncertainty in Artificial Intelligence (UAI), arXiv:1905.07088.
  • Song, Y. and Kingma, D. P. (2021). How to Train Your Energy-Based Models, arXiv:2101.03288.
  • Song, Y.; Sohl-Dickstein, J.; Kingma, D. P.; Kumar, A.; Ermon, S. and Poole, B. (2021). Score-Based Generative Modeling through Stochastic Differential Equations. In: International Conference on Learning Representations (ICLR), arXiv:2011.13456. ↩1 ↩2
  • Sorenson, H. W. and Alspach, D. L. (1971). Recursive Bayesian Estimation Using Gaussian Sums. Automatica 7, 465–479.
  • Sriperumbudur, B.; Fukumizu, K.; Gretton, A.; Hyvärinen, A. and Kumar, R. (2017). Density Estimation in Infinite Dimensional Exponential Families. Journal of Machine Learning Research 18, arXiv:1312.3516.
  • St Clere Smithe, T. (2020). Bayesian Updates Compose Optically, arXiv:2006.01631.
  • St Clere Smithe, T. and Perin, M. (2025). AutoBayes: A Compositional Framework for Generalized Variational Inference, arXiv:2503.18608.
  • Steihaug, T. (1983). The Conjugate Gradient Method and Trust Regions in Large Scale Optimization. SIAM Journal on Numerical Analysis 20, 626–637. ↩1
  • Stein, D. and Samuelson, R. (2023). A Category for unifying Gaussian Probability and Nondeterminism. In: Conference on Algebra and Coalgebra in Computer Science (CALCO), arXiv:2204.14024.
  • Stein, D. and Samuelson, R. (2025). A Categorical Treatment of Open Linear Systems. Logical Methods in Computer Science 21, arXiv:2403.03934.
  • Stein, D.; Zanasi, F.; Piedeleu, R. and Samuelson, R. (2024). Graphical Quadratic Algebra, arXiv:2403.02284.
  • Sturmfels, B. (1996). Gröbner Bases and Convex Polytopes. Vol. 8 of University Lecture Series (American Mathematical Society).
  • Sullivant, S. (2018). Algebraic Statistics. Vol. 194 of Graduate Studies in Mathematics (American Mathematical Society).
  • Sun, Y.; Ming, Y.; Zhu, X. and Li, Y. (2022). Out-of-Distribution Detection with Deep Nearest Neighbors. In: International Conference on Machine Learning (ICML), arXiv:2204.06507.
  • Sünderhauf, N. and Protzel, P. (2012). Switchable Constraints for Robust Pose Graph SLAM. In: IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS); pp. 1879–1884.
  • Särkkä, S. and García-Fernández, Á. F. (2021). Temporal Parallelization of Bayesian Smoothers. IEEE Transactions on Automatic Control 66, 299–306, arXiv:1905.13002.
  • Särkkä, S.; Solin, A. and Hartikainen, J. (2013). Spatiotemporal Learning via Infinite-Dimensional Bayesian Filtering and Smoothing: A Look at Gaussian Process Regression Through Kalman Filtering. IEEE Signal Processing Magazine 30, 51–61.
  • Tax, D. M. and Duin, R. P. (2004). Support Vector Data Description. Machine Learning 54.
  • Tierney, L. and Kadane, J. B. (1986). Accurate Approximations for Posterior Moments and Marginal Densities. Journal of the American Statistical Association 81, 82–86.
  • Tsitsiklis, J. and Van Roy, B. (1997). An analysis of temporal-difference learning with function approximation. IEEE Transactions on Automatic Control 42, 674–690.
  • Turk, G. and O'Brien, J. F. (2002). Modelling with implicit surfaces that interpolate. ACM Transactions on Graphics 21, 855–873.
  • Turner, R. E. and Sahani, M. (2011). Two problems with variational expectation maximisation for time series models. In: Bayesian Time Series Models (Cambridge University Press); pp. 104–124.
  • Ubaru, S.; Chen, J. and Saad, Y. (2017). Fast Estimation of tr(f(A)) via Stochastic Lanczos Quadrature. SIAM Journal on Matrix Analysis and Applications 38, 1075–1099.
  • Varadhan, R. and Roland, C. (2008). Simple and Globally Convergent Methods for Accelerating the Convergence of Any EM Algorithm. Scandinavian Journal of Statistics 35, 335–353.
  • Verlet, L. (1967). Computer "Experiments" on Classical Fluids. I. Thermodynamical Properties of Lennard-Jones Molecules. Physical Review 159, 98–103. ↩1 ↩2
  • Vincent, P. (2011). A Connection Between Score Matching and Denoising Autoencoders. Neural Computation 23, 1661–1674. ↩1
  • Wainwright, M. J.; Jaakkola, T. S. and Willsky, A. S. (2003). Tree-Based Reparameterization Framework for Analysis of Sum-Product and Related Algorithms. IEEE Transactions on Information Theory 49, 1120–1146.
  • Walker, H. F. and Ni, P. (2011). Anderson Acceleration for Fixed-Point Iterations. SIAM Journal on Numerical Analysis 49, 1715–1735.
  • Wan, E. A. and van der Merwe, R. (2000). The Unscented Kalman Filter for Nonlinear Estimation. In: Proceedings of the IEEE Adaptive Systems for Signal Processing, Communications, and Control Symposium; pp. 153–158.
  • Wang, R. and Du, Y. (2025). Equilibrium Matching: Generative Modeling with Implicit Energy-Based Models, arXiv:2510.02300.
  • Watanabe, S. (2009). Algebraic Geometry and Statistical Learning Theory (Cambridge University Press).
  • Watanabe, S. (2013). A Widely Applicable Bayesian Information Criterion. Journal of Machine Learning Research 14, 867–897, arXiv:1208.6338.
  • Wei, G. C. and Tanner, M. A. (1990). A Monte Carlo Implementation of the EM Algorithm and the Poor Man's Data Augmentation Algorithms. Journal of the American Statistical Association 85, 699–704.
  • Weiss, Y. and Freeman, W. T. (2001). Correctness of Belief Propagation in Gaussian Graphical Models of Arbitrary Topology. Neural Computation 13, 2173–2200.
  • Welling, M. and Teh, Y. W. (2004). Linear Response Algorithms for Approximate Inference in Graphical Models. Neural Computation 16, 197–221.
  • White, H. (1982). Maximum Likelihood Estimation of Misspecified Models. Econometrica 50, 1–25.
  • Wibisono, A.; Wilson, A. C. and Jordan, M. I. (2016). A Variational Perspective on Accelerated Methods in Optimization. Proceedings of the National Academy of Sciences 113, arXiv:1603.04245.
  • Willems, J. (2007). The Behavioral Approach to Open and Interconnected Systems. IEEE Control Systems Magazine 27, x1–x1.
  • Williams, O. and Fitzgibbon, A. (2006). Gaussian Process Implicit Surfaces. In: Gaussian Processes in Practice workshop.
  • Wu Fung, S.; Heaton, H.; Li, Q.; McKenzie, D.; Osher, S. and Yin, W. (2022). JFB: Jacobian-Free Backpropagation for Implicit Networks. In: AAAI Conference on Artificial Intelligence, arXiv:2103.12803.
  • Xu, M.; Geffner, T.; Kreis, K.; Nie, W.; Xu, Y.; Leskovec, J.; Ermon, S. and Vahdat, A. (2025). Energy-Based Diffusion Language Models for Text Generation. In: International Conference on Learning Representations (ICLR), arXiv:2410.21357.
  • Yang, H.; Antonante, P.; Tzoumas, V. and Carlone, L. (2020). Graduated Non-Convexity for Robust Spatial Perception: From Non-Minimal Solvers to Global Outlier Rejection. IEEE Robotics and Automation Letters 5, 1127–1134.
  • Yedidia, J. S.; Freeman, W. T. and Weiss, Y. (2005). Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms. IEEE Transactions on Information Theory 51, 2282–2312.
  • Zaheer, M.; Kottur, S.; Ravanbakhsh, S.; Poczos, B.; Salakhutdinov, R. and Smola, A. (2017). Deep Sets. In: Advances in Neural Information Processing Systems (NeurIPS), arXiv:1703.06114.
  • Zhang, C. (2025). Attention Is Not What You Need, arXiv:2512.19428.
  • Zhang, L.; Naitzat, G. and Lim, L.-H. (2018). Tropical Geometry of Deep Neural Networks. In: Proceedings of the 35th International Conference on Machine Learning, Vol. 80 of Proceedings of Machine Learning Research, arXiv:1805.07091.
  • Zheng, X.; Aragam, B.; Ravikumar, P. and Xing, E. P. (2018). DAGs with NO TEARS: Continuous Optimization for Structure Learning. In: Advances in Neural Information Processing Systems, Vol. 31, arXiv:1803.01422.
  • Zhu, Y.; Xie, J.; Wu, Y. and Gao, R. (2023). Learning Energy-Based Models by Cooperative Diffusion Recovery Likelihood, arXiv:2309.05153.
  • Zhu, Y.; Zhang, K.; Liang, J.; Cao, J.; Wen, B.; Timofte, R. and Van Gool, L. (2023). Denoising Diffusion Models for Plug-and-Play Image Restoration. In: IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), arXiv:2305.08995.
  • The Stacks Project Authors (2026). The Stacks Project. Definitions 26.9.1 (tag 01II), 33.16.1 and 33.16.3, Lemma 33.16.4 (tag 0B28); accessed 2026-10-27.
  • Şenöz, İ.; van de Laar, T.; Bagaev, D. and de Vries, B. (2021). Variational Message Passing and Local Constraint Manipulation in Factor Graphs. Entropy 23, 807.