Jialu Bao

Jialu Bao

Auto-generated profile, based on publicly available information

Jialu Bao

Cornell University, Ithaca, USA

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 August 2022
Verified
Book Chapter
Open access
PDF file
JBJialu Bao
Jialu Bao
NTNitesh Trivedi
Nitesh Trivedi
DPDrashti Pathak
Drashti Pathak
JHJustin Hsu
Justin Hsu
SRSubhajit Roy
Subhajit Roy
Morgan and McIver’s weakest pre-expectation framework is one of the most well-established methods for deductive verification of probabilistic programs. Roughly, the idea is to generalize binary state assertions to real-valued expectations, which can measure expected values of probabilistic program quantities. While loop-free programs can be analyzed by mechanically transforming expectations, verifying loops usually requires finding an invariant expectation, a difficult task.We propose a new view of invariant expectation synthesis as a regression problem: given an input state, predict the average value of the post-expectation in the output distribution. Guided by this perspective, we develop the first data-driven invariant synthesis method for probabilistic programs. Unlike prior work on probabilistic invariant inference, our approach can learn piecewise continuous invariants without relying on template expectations. We also develop a data-driven approach to learn sub-invariants from data, which can be used to upper- or lower-bound expected values. We implement our approaches and demonstrate their effectiveness on a variety of benchmarks from the probabilistic programming literature.

7 January 2025 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
JBJialu Bao
Jialu Bao
EDEmanuele D'OSualdo
Emanuele D'OSualdo
AFAzadeh Farzan
Azadeh Farzan
We present BlueBell , a program logic for reasoning about probabilistic programs where unary and relational styles of reasoning come together to create new reasoning tools. Unary-style reasoning is very expressive and is powered by foundational mechanisms to reason about probabilistic behavior like independence and conditioning . The relational style of reasoning, on the other hand, naturally shines when the properties of interest compare the behavior of similar programs (e.g. when proving differential privacy) managing to avoid having to characterize the output distributions of the individual programs. So far, the two styles of reasoning have largely remained separate in the many program logics designed for the deductive verification of probabilistic programs. In BlueBell , we unify these styles of reasoning through the introduction of a new modality called “joint conditioning” that can encode and illuminate the rich interaction between conditional independence and relational liftings ; the two powerhouses from the two styles of reasoning.

3 December 2024 in Formal Methods in System Design
Verified
Journal Article
Closed access
PDF file
JBJialu Bao
Jialu Bao
NTNitesh Trivedi
Nitesh Trivedi
DPDrashti Pathak
Drashti Pathak
JHJustin Hsu
Justin Hsu
SRSubhajit Roy
Subhajit Roy

1 August 2023
Verified
Conference Paper
Open access
PDF file
JBJialu Bao
Jialu Bao
NTNitesh Trivedi
Nitesh Trivedi
DPDrashti Pathak
Drashti Pathak
JHJustin Hsu
Justin Hsu
SRSubhajit Roy
Subhajit Roy
The weakest pre-expectation framework from Morgan and McIver for deductive verification of probabilistic programs generalizes binary state assertions to real-valued expectations to measure expected values of expressions over probabilistic program variables. While loop-free programs can be analyzed by mechanically transforming expectations, verifying programs with loops requires finding an invariant expectation. We view invariant expectation synthesis as a regression problem: given an input state, predict the average value of the post-expectation in the output distribution. With this perspective, we develop the first data-driven invariant synthesis method for probabilistic programs. Unlike prior work on probabilistic invariant inference, our approach learns piecewise continuous invariants without relying on template expectations. We also develop a data-driven approach to learn sub-invariants from data, which can be used to upper- or lower-bound expected values. We implement our approaches and demonstrate their effectiveness on a variety of benchmarks from the probabilistic programming literature.

9 January 2025 in ACM Transactions on Knowledge Discovery From Data
Verified
Journal Article
Open access
KHKun He
Kun He
XXXiaodong Xin
Xiaodong Xin
JBJialu Bao
Jialu Bao
MWMeng Wang
Meng Wang
BSBart Selman
Bart Selman
JHJohn E. Hopcroft
John E. Hopcroft
Much of the complexity of social, biological, and engineering systems arises from the complicated interactions among the entities in the corresponding networks. A number of network analysis tools have been successfully used to discover latent structures termed communities in such networks. However, some communities with relatively weak structures can be difficult to uncover because they are obscured by other stronger connections. To cope with this situation, our previous work proposes an algorithm called HICODE to detect and amplify the dominant and hidden community structures. In this work, we conduct a comprehensive and systematic theoretical analysis on the impact of hidden community structure and the efficacy of the HICODE algorithm, as well as provide illustrations of the detection process and results. Specifically, we define a multi-layer stochastic block model and use this model to explain why the existence of hidden structure makes the detection of dominant structure harder than equivalent random noises, which can also explain why many community detection algorithms only focusing on the dominant structure do not work well as expected. We then provide theoretical analysis that the iterative reducing methods could help to enhance the discovery of hidden structure as well as the dominant structure in the multi-layer stochastic block model for the two cases of accurate and inaccurate detection. Finally, visual simulations and experimental results are presented to show the process of HICODE algorithm and the impact of different number of layers on the detection quality.

13 June 2022 in arXiv
Verified
Preprint
Open access
PDF file
JBJialu Bao
Jialu Bao
NTNitesh Trivedi
Nitesh Trivedi
DPDrashti Pathak
Drashti Pathak
JHJustin Hsu
Justin Hsu
SRSubhajit Roy
Subhajit Roy
Morgan and McIver's weakest pre-expectation framework is one of the most well-established methods for deductive verification of probabilistic programs. Roughly, the idea is to generalize binary state assertions to real-valued expectations, which can measure expected values of probabilistic program quantities. While loop-free programs can be analyzed by mechanically transforming expectations, verifying loops usually requires finding an invariant expectation, a difficult task. We propose a new view of invariant expectation synthesis as a regression problem: given an input state, predict the average value of the post-expectation in the output distribution. Guided by this perspective, we develop the first data-driven invariant synthesis method for probabilistic programs. Unlike prior work on probabilistic invariant inference, our approach can learn piecewise continuous invariants without relying on template expectations, and also works with black-box access to the program. We also develop a data-driven approach to learn sub-invariants from data, which can be used to upper- or lower-bound expected values. We implement our approaches and demonstrate their effectiveness on a variety of benchmarks from the probabilistic programming literature.