Scaling Exact Inference for Discrete Probabilistic Programs
The cost of inference is the primary barrier for wider application of probabilistic programming languages. How can we scale inference to truly huge programs?
Contribute
Recent Posts
Archives
- April 2023
- January 2023
- August 2022
- June 2022
- May 2022
- April 2022
- March 2022
- January 2022
- December 2021
- November 2021
- October 2021
- September 2021
- August 2021
- July 2021
- June 2021
- May 2021
- April 2021
- March 2021
- February 2021
- January 2021
- December 2020
- November 2020
- October 2020
- September 2020
- August 2020
- July 2020
- June 2020
- May 2020
- April 2020
- March 2020
- February 2020
- January 2020
- December 2019
- November 2019
- October 2019
- September 2019
- August 2019
- July 2019
- June 2019
Tags
AI safety
architecture
awards
carbon footprint
carbon offset
climate change
compilers
computer security
concurrency
conferences
covid-19
diversity
formal reasoning
formal verification
functional programming
fuzzing
gradual typing
hardware
history
industrial adoption
language design
machine learning
Measurements
mentoring
MIP award
neural networks
open access
optimization
parallelism
program analysis
programming
program synthesis
proof engineering
publication process
quantum computing
research
research highlights
runtimes
security
soundness
static analysis
testing
type systems
unconventional computing
virtual conferences
Categories
ACM SIGPLAN
The ACM Special Interest Group on Programming Languages (SIGPLAN) explores programming language concepts and tools, focusing on design, implementation, practice, and theory. Its members are programming language developers, educators, implementers, researchers, theoreticians, and users.
Join Us
Keep up-to-date with the latest technical developments, network with colleagues outside your workplace and get cutting-edge information, focused resources and unparalleled forums for discussions.
Join here: https://www.acm.org/special-interest-groups/sigs/sigplan