MétaCan
Menu
Back to cohort
Record W6931093132 · doi:10.5281/zenodo.16813645

TuringLang/Turing.jl: v0.40.0

2025· other· en· W6931093132 on OpenAlexaff

Bibliographic record

VenueZenodo (CERN European Organization for Nuclear Research) · 2025
Typeother
Languageen
FieldComputer Science
TopicComputability, Logic, AI Algorithms
Canadian institutionsFowler Kennedy Sport Medicine ClinicTellabs (Canada)University of British Columbia
Fundersnot available
KeywordsTuringValue (mathematics)Variable (mathematics)Relation (database)Field (mathematics)Object (grammar)

Abstract

fetched live from OpenAlex

Turing v0.40.0 Breaking changes DynamicPPL 0.37 Turing.jl v0.40 updates DynamicPPL compatibility to 0.37. The summary of the changes provided here is intended for end-users of Turing. If you are a package developer, or would otherwise like to understand these changes in-depth, please see the DynamicPPL changelog. @submodel is now completely removed; please use to_submodel. Prior and likelihood calculations are now completely separated in Turing. Previously, the log-density used to be accumulated in a single field and thus there was no clear way to separate prior and likelihood components. @addlogprob! f, where f is a float, now adds to the likelihood by default. You can instead use @addlogprob! (; logprior=x, loglikelihood=y) to control which log-density component to add to. This means that usage of PriorContext and LikelihoodContext is no longer needed, and these have now been removed. The special __context__ variable has been removed. If you still need to access the evaluation context, it is now available as __model__.context. Log-density in chains When sampling from a Turing model, the resulting MCMCChains.Chains object now contains not only the log-joint (accessible via chain[:lp]) but also the log-prior and log-likelihood (chain[:logprior] and chain[:loglikelihood] respectively). These values now correspond to the log density of the sampled variables exactly as per the model definition / user parameterisation and thus will ignore any linking (transformation to unconstrained space). For example, if the model is @model f() = x ~ LogNormal(), chain[:lp] would always contain the value of logpdf(LogNormal(), x) for each sampled value of x. Previously these values could be incorrect if linking had occurred: some samplers would return logpdf(Normal(), log(x)) i.e. the log-density with respect to the transformed distribution. Gibbs sampler When using Turing's Gibbs sampler, e.g. Gibbs(:x => MH(), :y => HMC(0.1, 20)), the conditioned variables (for example y during the MH step, or x during the HMC step) are treated as true observations. Thus the log-density associated with them is added to the likelihood. Previously these would effectively be added to the prior (in the sense that if LikelihoodContext was used they would be ignored). This is unlikely to affect users but we mention it here to be explicit. This change only affects the log probabilities as the Gibbs component samplers see them; the resulting chain will include the usual log prior, likelihood, and joint, as described above. Particle Gibbs Previously, only 'true' observations (i.e., x ~ dist where x is a model argument or conditioned upon) would trigger resampling of particles. Specifically, there were two cases where resampling would not be triggered: Calls to @addlogprob! Gibbs-conditioned variables: e.g. y in Gibbs(:x => PG(20), :y => MH()) Turing 0.40 changes this such that both of the above cause resampling. (The second case follows from the changes to the Gibbs sampler, see above.) This release also fixes a bug where, if the model ended with one of these statements, their contribution to the particle weight would be ignored, leading to incorrect results. The changes above also mean that certain models that previously worked with PG-within-Gibbs may now error. Specifically this is likely to happen when the dimension of the model is variable. For example: @model function f() x ~ Bernoulli() if x y1 ~ Normal() else y1 ~ Normal() y2 ~ Normal() end # (some likelihood term...) end sample(f(), Gibbs(:x => PG(20), (:y1, :y2) => MH()), 100) This sampler now cannot be used for this model because depending on which branch is taken, the number of observations will be different. To use PG-within-Gibbs, the number of observations that the PG component sampler sees must be constant. Thus, for example, this will still work if x, y1, and y2 are grouped together under the PG component sampler. If you absolutely require the old behaviour, we recommend using Turing.jl v0.39, but also thinking very carefully about what the expected behaviour of the model is, and checking that Turing is sampling from it correctly (note that the behaviour on v0.39 may in general be incorrect because of the fact that Gibbs-conditioned variables did not trigger resampling). We would also welcome any GitHub issues highlighting such problems. Our support for dynamic models is incomplete and is liable to undergo further changes. Other changes Sampling using Prior() should now be about twice as fast because we now avoid evaluating the model twice on every iteration. Turing.Inference.Transition now has different fields. If t isa Turing.Inference.Transition, t.stat is always a NamedTuple, not nothing (if it genuinely has no information then it's an empty NamedTuple). Furthermore, t.lp has now been split up into t.logprior and t.loglikelihood (see also 'Log-density in chains' section above).

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.006
metaresearch head score (Gemma)0.028
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesInsufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: Not applicable
GenreCandidate signal: Software · Consensus signal: Software
Teacher disagreement score0.551
Threshold uncertainty score0.641

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0060.028
Meta-epidemiology (narrow)0.0050.007
Meta-epidemiology (broad)0.0030.005
Bibliometrics0.0020.002
Science and technology studies0.0020.002
Scholarly communication0.0090.012
Open science0.0090.012
Research integrity0.0050.009
Insufficient payload (model declined to judge)0.5510.703

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.025
GPT teacher head0.238
Teacher spread0.213 · 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.

Study designNot applicable
Domainnot available
GenreSoftware

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

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same venueZenodo (CERN European Organization for Nuclear Research)Same topicComputability, Logic, AI AlgorithmsFrench-language works237,207