Peixin Wang
where else to find them
what they talk about
where they keep going back
no series more than once — all 4 in the filters
on a stage with
all 12 in the filters
who talks about the same things
- Guanyan Li3 talks
- Hongfei Fu6 talks
- Tengshun Yang3 talks
- Zhilei Han2 talks
- Fei He5 talks
- C.-H. Luke Ong14 talks
| title | conference | date |
|---|---|---|
| Structural Abstraction and Refinement for Probabilistic Programs | OOPSLA 2025 | 2025-10-16 |
Framework treats a Probabilistic Control‑Flow Automaton as an MDP whose actions drop semantics, so the structural upper bound is the MDP’s maximum reachability… | ||
| Static Posterior Inference of Bayesian Probabilistic Programming via Polynomial Solving | PLDI 2024 | 2024-06-24 |
Derives guaranteed upper and lower bounds for normalized posteriors by reducing inference to polynomial solving over templates guided by a new fixed‑point… | ||
| Taming Reachability Analysis of DNN-Controlled Systems via Abstraction-Based Tr... | VMCAI 2024 | 2024-01-15 |
Claims a simple engineering change: insert an abstraction layer maps reals to intervals so the network treats every interval as indistinguishable, train with… | ||
| Static Posterior Inference of Bayesian Probabilistic Programming via Polynomial ... | LAFI 2024 | 2024-01-14 |
Automated method derives guaranteed upper and lower bounds on a probabilistic program’s normalized posterior by reducing NPD bounding to bounds on the… | ||
| nothing matches | ||