Luke Ong

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 28

Top Topics

Variational Inference

Information Flow

Top Venues

Publications

Dapeng Zhi, Peixin Wang, Si Liu, Luke Ong, Min Zhang
Unifying Qualitative and Quantitative Safety Verification of DNN-Controlled Systems. CoRR (2024)
Dominik Wagner, Basim Khajwal, Luke Ong
Diagonalisation SGD: Fast & Convergent SGD for Non-Differentiable Models via Reparameterisation and Smoothing. AISTATS (2024)
Tim Reichelt, Luke Ong, Tom Rainforth
Beyond Bayesian Model Averaging over Paths in Probabilistic Programs with Stochastic Support. AISTATS (2024)
Tim Reichelt, Luke Ong, Tom Rainforth
Rethinking Variational Inference for Probabilistic Programs with Stochastic Support. CoRR (2023)
Tim Reichelt, Luke Ong, Tom Rainforth
Beyond Bayesian Model Averaging over Paths in Probabilistic Programs with Stochastic Support. CoRR (2023)
Fabian Zaiser, Andrzej S. Murawski, Luke Ong
Exact Bayesian Inference on Discrete Models via Probability Generating Functions: A Probabilistic Programming Approach. CoRR (2023)
Peixin Wang, Hongfei Fu, Tengshun Yang, Guanyan Li, Luke Ong
Template-Based Static Posterior Inference for Bayesian Probabilistic Programming. CoRR (2023)
Carol Mak, Fabian Zaiser, Luke Ong
Nonparametric Involutive Markov Chain Monte Carlo. ICML (2022)
Guanyan Li, Andrzej S. Murawski, Luke Ong
Probabilistic Verification Beyond Context-Freeness. LICS (2022)
Carol Mak, Fabian Zaiser, Luke Ong
Nonparametric Involutive Markov Chain Monte Carlo. CoRR (2022)
Raven Beutner, Luke Ong, Fabian Zaiser
Guaranteed Bounds for Posterior Inference in Universal Probabilistic Programming. CoRR (2022)
Tim Reichelt, Luke Ong, Thomas Rainforth
Rethinking Variational Inference for Probabilistic Programs with Stochastic Support. NeurIPS (2022)
Tim Reichelt, Adam Golinski, Luke Ong, Tom Rainforth
Expectation programming: Adapting probabilistic programming systems to estimate expectations efficiently. UAI (2022)
Toby Cathcart Burn, Luke Ong, Steven J. Ramsay, Dominik Wagner
Initial Limit Datalog: a New Extensible Class of Decidable Constrained Horn Clauses. LICS (2021)
Fabian Zaiser, Luke Ong
Abstract: The Extended Theory of Trees and Algebraic (Co)datatypes. SMT (2021)
Raven Beutner, Luke Ong
On Probabilistic Termination of Functional Programs with Continuous Distributions. CoRR (2021)
Raven Beutner, Luke Ong
On probabilistic termination of functional programs with continuous distributions. PLDI (2021)
Toby Cathcart Burn, Luke Ong, Steven J. Ramsay, Dominik Wagner
Initial Limit Datalog: a New Extensible Class of Decidable Constrained Horn Clauses. CoRR (2021)
Tim Reichelt, Adam Golinski, Luke Ong, Tom Rainforth
Expectation Programming. CoRR (2021)
Carol Mak, Fabian Zaiser, Luke Ong
Nonparametric Hamiltonian Monte Carlo. ICML (2021)
Carol Mak, Fabian Zaiser, Luke Ong
Nonparametric Hamiltonian Monte Carlo. CoRR (2021)
Andrew Kenyon-Roberts, Luke Ong
Supermartingales, Ranking Functions and Probabilistic Lambda Calculus. CoRR (2021)
Carol Mak, Luke Ong
A Differential-form Pullback Programming Language for Higher-order Reverse-mode Automatic Differentiation. CoRR (2020)
Egor Ianovski, Luke Ong
Simulating cardinal preferences in Boolean games: A proof technique. Inf. Comput. 261 (2018)
Egor Ianovski, Luke Ong
The complexity of decision problems about equilibria in two-player Boolean games. Artif. Intell. 261 (2018)
Emanuele D'Osualdo, Luke Ong, Alwen Tiu
Deciding Secrecy of Security Protocols for an Unbounded Number of Sessions: The Case of Depth-Bounded Processes. CSF (2017)
Naoki Kobayashi, Luke Ong, Igor Walukiewicz
Higher-Order Model Checking (NII Shonan Meeting 2016-4). NII Shonan Meet. Rep. 2016 (2016)
Martin Mariusz Lester, Luke Ong, Max Schäfer
Information flow analysis for a dynamically typed language with staged metaprogramming. J. Comput. Secur. 24 (5) (2016)
Luke Ong
Higher-Order Model Checking: An Overview. LICS (2015)
Emanuele D'Osualdo, Luke Ong
A Type System for proving Depth Boundedness in the pi-calculus. CoRR (2015)
Egor Ianovski, Luke Ong
EGuaranteeNash for Boolean Games Is NEXP-Hard. KR (2014)
Matthew Hague, Anthony Widjaja Lin, Luke Ong
Detecting Redundant CSS Rules in HTML5 Applications: A Tree-Rewriting Approach. CoRR (2014)
Egor Ianovski, Luke Ong
EGuaranteeNash for Boolean Games is NEXP-Hard. CoRR (2013)
Luke Ong
Recursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking. LATA (2013)
Martin Lester, Luke Ong, Max Schäfer
Information Flow Analysis for a Dynamically Typed Language with Staged Metaprogramming. CSF (2013)
Emanuele D'Osualdo, Jonathan Kochems, Luke Ong
Soter: an automatic safety verifier for erlang. AGERE!@SPLASH (2012)
Naoki Kobayashi, Luke Ong, David Van Horn
Automated Techniques for Higher-Order Program Verification (NII Shonan Meeting 2011-5). NII Shonan Meet. Rep. 2011 (2011)