{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/probabilistic-programming/papers/3","list_of":"/task/probabilistic-programming","task":"Probabilistic Programming","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":3,"pages_in_order":3,"rows_per_page":100,"rows":[201,273],"of":273,"counts":{"archive_papers_tagged":273,"with_a_code_link":92,"where_syntology_ran_a_sample":19,"not_listed_spam_title":0,"listed":273,"listed_where_code_ran":19,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":15,"every_run_a_failure_of_syntologys_instrument":4,"listed_with_a_run_with_no_instrument_failure":15,"listed_every_run_a_failure_of_syntologys_instrument":4,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/probabilistic-programming","prev":"/task/probabilistic-programming/papers/2","next":null,"papers":[{"url":null,"slug":"automated-learning-with-a-probabilistic","title":"Automated learning with a probabilistic programming language: Birch","date":"2018-10-02","arxiv_id":"1810.01539","repositories_listed":0,"syntology":null},{"url":null,"slug":"inference-over-programs-that-make-predictions","title":"Inference Over Programs That Make Predictions","date":"2018-10-02","arxiv_id":"1810.01190","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-distribution-learning-for-generalized","title":"Neural Distribution Learning for generalized time-to-event prediction","date":"2018-09-27","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-fairness-aware-hybrid-recommender-system","title":"A Fairness-aware Hybrid Recommender System","date":"2018-09-13","arxiv_id":"1809.09030","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-mathematical-account-of-soft-evidence-and","title":"The Mathematics of Changing one's Mind, via Jeffrey's or via Pearl's update rule","date":"2018-07-15","arxiv_id":"1807.05609","repositories_listed":0,"syntology":null},{"url":null,"slug":"sound-abstraction-and-decomposition-of","title":"Sound Abstraction and Decomposition of Probabilistic Programs","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"discrete-continuous-mixtures-in-probabilistic","title":"Discrete-Continuous Mixtures in Probabilistic Programming: Generalized Semantics and Inference Algorithms","date":"2018-06-06","arxiv_id":"1806.02027","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-probabilistic-programming-languages-a","title":"Deep Probabilistic Programming Languages: A Qualitative Study","date":"2018-04-17","arxiv_id":"1804.06458","repositories_listed":0,"syntology":null},{"url":null,"slug":"nesting-probabilistic-programs","title":"Nesting Probabilistic Programs","date":"2018-03-16","arxiv_id":"1803.06328","repositories_listed":0,"syntology":null},{"url":null,"slug":"modelling-contextuality-by-probabilistic","title":"Modelling contextuality by probabilistic programs with hypergraph semantics","date":"2018-01-31","arxiv_id":"1802.00690","repositories_listed":0,"syntology":null},{"url":null,"slug":"probabilistic-planning-by-probabilistic","title":"Probabilistic Planning by Probabilistic Programming","date":"2018-01-25","arxiv_id":"1801.08365","repositories_listed":0,"syntology":null},{"url":null,"slug":"using-probabilistic-programs-as-proposals","title":"Using probabilistic programs as proposals","date":"2018-01-11","arxiv_id":"1801.03612","repositories_listed":0,"syntology":null},{"url":null,"slug":"improvements-to-inference-compilation-for","title":"Improvements to Inference Compilation for Probabilistic Programming in Large-Scale Scientific Simulators","date":"2017-12-21","arxiv_id":"1712.07901","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-five-improving-gesture-recognition-by","title":"High Five: Improving Gesture Recognition by Embracing Uncertainty","date":"2017-10-25","arxiv_id":"1710.09441","repositories_listed":0,"syntology":null},{"url":null,"slug":"anytime-exact-belief-propagation","title":"Anytime Exact Belief Propagation","date":"2017-07-27","arxiv_id":"1707.08704","repositories_listed":0,"syntology":null},{"url":null,"slug":"rankpl-a-qualitative-probabilistic","title":"RankPL: A Qualitative Probabilistic Programming Language","date":"2017-05-19","arxiv_id":"1705.07226","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-probabilistic-programs-using","title":"Learning Probabilistic Programs Using Backpropagation","date":"2017-05-15","arxiv_id":"1705.05396","repositories_listed":0,"syntology":null},{"url":null,"slug":"importance-sampled-stochastic-optimization","title":"Importance Sampled Stochastic Optimization for Variational Inference","date":"2017-04-19","arxiv_id":"1704.05786","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-probabilistic-programming","title":"Deep Probabilistic Programming","date":"2017-01-13","arxiv_id":"1701.03757","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-convenient-category-for-higher-order","title":"A Convenient Category for Higher-Order Probability Theory","date":"2017-01-10","arxiv_id":"1701.02547","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-message-passing-for-graphical","title":"Adversarial Message Passing For Graphical Models","date":"2016-12-15","arxiv_id":"1612.05048","repositories_listed":0,"syntology":null},{"url":null,"slug":"measuring-the-non-asymptotic-convergence-of","title":"Measuring the non-asymptotic convergence of sequential Monte Carlo samplers using probabilistic programming","date":"2016-12-07","arxiv_id":"1612.02161","repositories_listed":0,"syntology":null},{"url":null,"slug":"summary-terpret-a-probabilistic-programming","title":"Summary - TerpreT: A Probabilistic Programming Language for Program Induction","date":"2016-12-02","arxiv_id":"1612.00817","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-probabilistic-programming-approach-to","title":"A Probabilistic Programming Approach To Probabilistic Data Analysis","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"consistent-kernel-mean-estimation-for","title":"Consistent Kernel Mean Estimation for Functions of Random Variables","date":"2016-10-19","arxiv_id":"1610.05950","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantum-assisted-learning-of-hardware","title":"Quantum-Assisted Learning of Hardware-Embedded Probabilistic Graphical Models","date":"2016-09-08","arxiv_id":"1609.02542","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-energy-storage-scheduling-for","title":"Robust Energy Storage Scheduling for Imbalance Reduction of Strategically Formed Energy Balancing Groups","date":"2016-08-30","arxiv_id":"1608.08292","repositories_listed":0,"syntology":null},{"url":null,"slug":"practical-optimal-experiment-design-with","title":"Practical optimal experiment design with probabilistic programs","date":"2016-08-17","arxiv_id":"1608.05046","repositories_listed":0,"syntology":null},{"url":null,"slug":"terpret-a-probabilistic-programming-language","title":"TerpreT: A Probabilistic Programming Language for Program Induction","date":"2016-08-15","arxiv_id":"1608.04428","repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-generation-of-probabilistic","title":"Automatic Generation of Probabilistic Programming from Time Series Data","date":"2016-07-04","arxiv_id":"1607.00710","repositories_listed":0,"syntology":null},{"url":null,"slug":"swift-compiled-inference-for-probabilistic","title":"Swift: Compiled Inference for Probabilistic Programming Languages","date":"2016-06-30","arxiv_id":"1606.09242","repositories_listed":0,"syntology":null},{"url":null,"slug":"spreadsheet-probabilistic-programming","title":"Spreadsheet Probabilistic Programming","date":"2016-06-14","arxiv_id":"1606.04216","repositories_listed":0,"syntology":null},{"url":null,"slug":"structured-factored-inference-a-framework-for","title":"Structured Factored Inference: A Framework for Automated Reasoning in Probabilistic Programming Languages","date":"2016-06-10","arxiv_id":"1606.03298","repositories_listed":0,"syntology":null},{"url":null,"slug":"measuring-the-reliability-of-mcmc-inference","title":"Measuring the reliability of MCMC inference with bidirectional Monte Carlo","date":"2016-06-07","arxiv_id":"1606.02275","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-physics-of-text-ontological-realism-in","title":"The Physics of Text: Ontological Realism in Information Extraction","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"applications-of-probabilistic-programming","title":"Applications of Probabilistic Programming (Master's thesis, 2015)","date":"2016-05-31","arxiv_id":"1606.00075","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-step-from-probabilistic-programming-to","title":"A Step from Probabilistic Programming to Cognitive Architectures","date":"2016-05-04","arxiv_id":"1605.01180","repositories_listed":0,"syntology":null},{"url":null,"slug":"composing-inference-algorithms-as-program","title":"Composing inference algorithms as program transformations","date":"2016-03-06","arxiv_id":"1603.01882","repositories_listed":0,"syntology":null},{"url":null,"slug":"applying-boolean-discrete-methods-in-the","title":"A theory of contemplation","date":"2016-02-18","arxiv_id":"1602.05705","repositories_listed":0,"syntology":null},{"url":null,"slug":"bachelors-thesis-on-generative-probabilistic","title":"Bachelor's thesis on generative probabilistic programming (in Russian language, June 2014)","date":"2016-01-26","arxiv_id":"1601.07224","repositories_listed":0,"syntology":null},{"url":null,"slug":"semantics-for-probabilistic-programming","title":"Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints","date":"2016-01-19","arxiv_id":"1601.04943","repositories_listed":0,"syntology":null},{"url":null,"slug":"probabilistic-programming-with-gaussian","title":"Probabilistic Programming with Gaussian Process Memoization","date":"2015-12-17","arxiv_id":"1512.05665","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesdb-a-probabilistic-programming-system","title":"BayesDB: A probabilistic programming system for querying the probable implications of data","date":"2015-12-15","arxiv_id":"1512.05006","repositories_listed":0,"syntology":null},{"url":null,"slug":"linear-models-of-computation-and-program","title":"Linear Models of Computation and Program Learning","date":"2015-12-15","arxiv_id":"1512.04639","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-driven-sequential-monte-carlo-in","title":"Data-driven Sequential Monte Carlo in Probabilistic Programming","date":"2015-12-14","arxiv_id":"1512.04387","repositories_listed":0,"syntology":null},{"url":null,"slug":"lazy-factored-inference-for-functional","title":"Lazy Factored Inference for Functional Probabilistic Programming","date":"2015-09-11","arxiv_id":"1509.03564","repositories_listed":0,"syntology":null},{"url":null,"slug":"c3-lightweight-incrementalized-mcmc-for","title":"C3: Lightweight Incrementalized MCMC for Probabilistic Programs using Continuations and Callsite Caching","date":"2015-09-07","arxiv_id":"1509.02151","repositories_listed":0,"syntology":null},{"url":null,"slug":"relly-inferring-hypernym-relationships","title":"RELLY: Inferring Hypernym Relationships Between Relational Phrases","date":"2015-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-new-approach-to-probabilistic-programming","title":"A New Approach to Probabilistic Programming Inference","date":"2015-07-03","arxiv_id":"1507.00996","repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-variational-inference-in-stan","title":"Automatic Variational Inference in Stan","date":"2015-06-10","arxiv_id":"1506.03431","repositories_listed":0,"syntology":null},{"url":null,"slug":"picture-a-probabilistic-programming-language","title":"Picture: A Probabilistic Programming Language for Scene Perception","date":"2015-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"wolfe-an-nlp-friendly-declarative-machine","title":"WOLFE: An NLP-friendly Declarative Machine Learning Stack","date":"2015-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-inference-for-inverting-software","title":"Automatic Inference for Inverting Software Simulators via Probabilistic Programming","date":"2015-05-31","arxiv_id":"1506.00308","repositories_listed":0,"syntology":null},{"url":null,"slug":"hinge-loss-markov-random-fields-and","title":"Hinge-Loss Markov Random Fields and Probabilistic Soft Logic","date":"2015-05-17","arxiv_id":"1505.04406","repositories_listed":0,"syntology":null},{"url":null,"slug":"computing-functions-of-random-variables-via","title":"Computing Functions of Random Variables via Reproducing Kernel Hilbert Space Representations","date":"2015-01-27","arxiv_id":"1501.06794","repositories_listed":0,"syntology":null},{"url":null,"slug":"particle-gibbs-with-ancestor-sampling-for","title":"Particle Gibbs with Ancestor Sampling for Probabilistic Programs","date":"2015-01-27","arxiv_id":"1501.06769","repositories_listed":0,"syntology":null},{"url":null,"slug":"slice-sampling-for-probabilistic-programming","title":"Slice Sampling for Probabilistic Programming","date":"2015-01-20","arxiv_id":"1501.04684","repositories_listed":0,"syntology":null},{"url":null,"slug":"declarative-statistical-modeling-with-datalog","title":"Declarative Statistical Modeling with Datalog","date":"2014-12-06","arxiv_id":"1412.2221","repositories_listed":0,"syntology":null},{"url":null,"slug":"augur-data-parallel-probabilistic-modeling","title":"Augur: Data-Parallel Probabilistic Modeling","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sublinear-time-approximate-mcmc-transitions","title":"Sublinear-Time Approximate MCMC Transitions for Probabilistic Programs","date":"2014-11-06","arxiv_id":"1411.1690","repositories_listed":0,"syntology":null},{"url":null,"slug":"dependency-parsing-for-weibo-an-efficient","title":"Dependency Parsing for Weibo: An Efficient Probabilistic Logic Programming Approach","date":"2014-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"decision-making-with-complex-data-structures","title":"Decision-Making with Complex Data Structures using Probabilistic Programming","date":"2014-07-11","arxiv_id":"1407.3208","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-probabilistic-programs","title":"Learning Probabilistic Programs","date":"2014-07-09","arxiv_id":"1407.2646","repositories_listed":0,"syntology":null},{"url":null,"slug":"venture-a-higher-order-probabilistic","title":"Venture: a higher-order probabilistic programming platform with programmable inference","date":"2014-04-01","arxiv_id":"1404.0099","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-compilation-target-for-probabilistic","title":"A Compilation Target for Probabilistic Programming Languages","date":"2014-03-03","arxiv_id":"1403.0504","repositories_listed":0,"syntology":null},{"url":null,"slug":"detecting-parameter-symmetries-in","title":"Detecting Parameter Symmetries in Probabilistic Models","date":"2013-12-19","arxiv_id":"1312.5386","repositories_listed":0,"syntology":null},{"url":null,"slug":"augur-a-modeling-language-for-data-parallel","title":"Augur: a Modeling Language for Data-Parallel Probabilistic Inference","date":"2013-12-12","arxiv_id":"1312.3613","repositories_listed":0,"syntology":null},{"url":null,"slug":"approximate-bayesian-image-interpretation","title":"Approximate Bayesian Image Interpretation using Generative Probabilistic Graphics Programs","date":"2013-06-29","arxiv_id":"1307.0060","repositories_listed":0,"syntology":null},{"url":null,"slug":"declarative-modeling-and-bayesian-inference","title":"Declarative Modeling and Bayesian Inference of Dark Matter Halos","date":"2013-06-02","arxiv_id":"1306.0202","repositories_listed":0,"syntology":null},{"url":null,"slug":"automated-variational-inference-in","title":"Automated Variational Inference in Probabilistic Programming","date":"2013-01-07","arxiv_id":"1301.1299","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-dynamic-programming-algorithm-for-inference","title":"A Dynamic Programming Algorithm for Inference in Recursive Probabilistic Programs","date":"2012-06-15","arxiv_id":"1206.3555","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonstandard-interpretations-of-probabilistic","title":"Nonstandard Interpretations of Probabilistic Programs for Efficient Inference","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"factorie-probabilistic-programming-via","title":"FACTORIE: Probabilistic Programming via Imperatively Defined Factor Graphs","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"2471422df194d2845f22484d45fd4327f5b6821a18ca24551f1c7b157e776cd0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}