MétaCan
Menu
Back to cohort
Record W4405432368 · doi:10.1145/3704894

Bluebell: An Alliance of Relational Lifting and Independence for Probabilistic Reasoning

2025· article· en· W4405432368 on OpenAlexaff
Jialu Bao, Emanuele D’Osualdo, Azadeh Farzan

Bibliographic record

VenueProceedings of the ACM on Programming Languages · 2025
Typearticle
Languageen
FieldComputer Science
TopicDistributed systems and fault tolerance
Canadian institutionsUniversity of Toronto
FundersEuropean Research CouncilEuropean CommissionNational Science Foundation
KeywordsUnary operationProbabilistic logicProbabilistic argumentationDeductive reasoningComputer scienceStatistical relational learningIndependence (probability theory)Artificial intelligenceNon-monotonic logicPsychology of reasoningReasoning systemModel-based reasoningMathematicsRelational databaseKnowledge representation and reasoningInformation retrieval

Abstract

fetched live from OpenAlex

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.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.013
metaresearch head score (Gemma)0.024
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.015
Threshold uncertainty score0.070

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0130.024
Meta-epidemiology (narrow)0.0010.002
Meta-epidemiology (broad)0.0010.004
Bibliometrics0.0030.002
Science and technology studies0.0020.008
Scholarly communication0.0060.015
Open science0.0060.014
Research integrity0.0020.010
Insufficient payload (model declined to judge)0.0150.004

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.016
GPT teacher head0.284
Teacher spread0.269 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations3
Published2025
Admission routes1
Has abstractyes

Explore more

Same venueProceedings of the ACM on Programming LanguagesSame topicDistributed systems and fault toleranceFrench-language works237,207