{"payload":{"pageCount":2,"repositories":[{"type":"Public","name":"AdvancedVI.jl","owner":"TuringLang","isFork":false,"description":"Implementation of variational Bayes inference algorithms","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":4,"issueCount":5,"starsCount":78,"forksCount":18,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-19T20:00:57.431Z"}},{"type":"Public","name":"JuliaBUGS.jl","owner":"TuringLang","isFork":false,"description":"Implementation of domain specific language (DSL) for probabilistic graphical models","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":1,"issueCount":14,"starsCount":20,"forksCount":3,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-19T13:40:17.445Z"}},{"type":"Public","name":"docs","owner":"TuringLang","isFork":false,"description":"Documentation and tutorials for the Turing language","allTopics":["machine-learning","julia","probabilistic-programming","turing-language"],"primaryLanguage":{"name":"Shell","color":"#89e051"},"pullRequestCount":4,"issueCount":43,"starsCount":229,"forksCount":98,"license":"MIT License","participation":[2,0,0,1,8,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,1,2,24,7,3,0,2,1,6,5,0,1,0,3,0,1,1,2,2],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-19T13:37:54.524Z"}},{"type":"Public","name":"turinglang.github.io","owner":"TuringLang","isFork":false,"description":" website for Turing","allTopics":[],"primaryLanguage":{"name":"HTML","color":"#e34c26"},"pullRequestCount":0,"issueCount":5,"starsCount":6,"forksCount":16,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-19T13:19:33.686Z"}},{"type":"Public","name":"DynamicPPL.jl","owner":"TuringLang","isFork":false,"description":"Implementation of domain-specific language (DSL) for dynamic probabilistic programming ","allTopics":["probabilistic-programming","probability-theory"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":10,"issueCount":46,"starsCount":157,"forksCount":27,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-19T11:24:29.051Z"}},{"type":"Public","name":"Bijectors.jl","owner":"TuringLang","isFork":false,"description":"Implementation of normalising flows and constrained random variable transformations","allTopics":["mcmc-sampler","transforms","turing-language","bayesian-inference"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":4,"issueCount":54,"starsCount":200,"forksCount":33,"license":"MIT License","participation":[0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,3,0,0,0,2,7,1,0,2,0,4,1,3,0,0,0,2,0,0,2,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-19T00:22:26.533Z"}},{"type":"Public","name":"NormalizingFlows.jl","owner":"TuringLang","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":4,"issueCount":10,"starsCount":28,"forksCount":2,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-19T00:04:17.963Z"}},{"type":"Public","name":"AbstractPPL.jl","owner":"TuringLang","isFork":false,"description":"Common types and interfaces for probabilistic programming","allTopics":["probabilistic-programming","ppls"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":2,"issueCount":4,"starsCount":24,"forksCount":6,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-18T16:40:15.897Z"}},{"type":"Public","name":"AbstractMCMC.jl","owner":"TuringLang","isFork":false,"description":"Abstract types and interfaces for Markov chain Monte Carlo methods ","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":3,"issueCount":22,"starsCount":79,"forksCount":18,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-18T13:32:36.472Z"}},{"type":"Public","name":"AdvancedHMC.jl","owner":"TuringLang","isFork":false,"description":"Robust, modular and efficient implementation of advanced Hamiltonian Monte Carlo algorithms","allTopics":["mcmc","hmc","hamiltonian-monte-carlo","nuts"],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":7,"issueCount":48,"starsCount":228,"forksCount":39,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-18T03:36:13.629Z"}},{"type":"Public","name":"Turing.jl","owner":"TuringLang","isFork":false,"description":"Bayesian inference with probabilistic programming.","allTopics":["machine-learning","julia-language","artificial-intelligence","probabilistic-programming","bayesian-inference","mcmc","turing","probabilistic-graphical-models","hmc","hamiltonian-monte-carlo","bayesian-statistics","probabilistic-models","bayesian-neural-networks","probabilistic-inference"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":1,"issueCount":73,"starsCount":2029,"forksCount":218,"license":"MIT License","participation":[1,0,3,1,0,0,1,1,1,0,0,3,6,0,0,1,0,1,2,0,1,3,1,2,1,0,0,0,0,0,4,5,1,0,4,2,7,7,2,3,2,2,1,0,3,1,1,0,0,4,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-12T10:29:39.742Z"}},{"type":"Public","name":"AdvancedPS.jl","owner":"TuringLang","isFork":false,"description":"Implementation of advanced Sequential Monte Carlo and particle MCMC algorithms","allTopics":["particle-filter","sequential-monte-carlo","particle-mcmc"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":7,"starsCount":56,"forksCount":9,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-08T00:40:37.607Z"}},{"type":"Public","name":"MCMCTempering.jl","owner":"TuringLang","isFork":false,"description":"Implementations of parallel tempering algorithms to augment samplers with tempering capabilities","allTopics":["julia-language","probabilistic-programming","mcmc","multimodality","turing-language","mcmc-sampling"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":5,"starsCount":29,"forksCount":3,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-08T00:25:39.370Z"}},{"type":"Public","name":"TuringCallbacks.jl","owner":"TuringLang","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":2,"issueCount":6,"starsCount":13,"forksCount":8,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-08T00:22:35.536Z"}},{"type":"Public","name":"MCMCChains.jl","owner":"TuringLang","isFork":false,"description":"Types and utility functions for summarizing Markov chain Monte Carlo simulations","allTopics":["markov-chain","julia-language","mcmc"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":8,"issueCount":37,"starsCount":266,"forksCount":29,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-08T00:19:42.823Z"}},{"type":"Public","name":"SSMProblems.jl","owner":"TuringLang","isFork":false,"description":"Common abstractions for state-space models","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":1,"issueCount":5,"starsCount":2,"forksCount":2,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-08T00:19:37.956Z"}},{"type":"Public","name":"TuringBenchmarking.jl","owner":"TuringLang","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":1,"starsCount":7,"forksCount":1,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-08T00:16:06.556Z"}},{"type":"Public","name":"EllipticalSliceSampling.jl","owner":"TuringLang","isFork":false,"description":"Julia implementation of elliptical slice sampling.","allTopics":["julia-language","turing","markov-chain-monte-carlo","slice-sampling","mcmc"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":1,"starsCount":13,"forksCount":5,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-08T00:11:10.593Z"}},{"type":"Public","name":"MCMCDiagnosticTools.jl","owner":"TuringLang","isFork":false,"description":"","allTopics":["statistics","statistical-analysis","mcmc","julia"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":6,"starsCount":19,"forksCount":6,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-08T00:09:08.866Z"}},{"type":"Public","name":"NestedSamplers.jl","owner":"TuringLang","isFork":false,"description":"Implementations of single and multi-ellipsoid nested sampling","allTopics":["bayesian-inference","nested-sampling","evidence-based","nested-samplers"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":5,"issueCount":8,"starsCount":41,"forksCount":8,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-08T00:07:25.396Z"}},{"type":"Public","name":"ParetoSmooth.jl","owner":"TuringLang","isFork":false,"description":"An implementation of PSIS algorithms in Julia.","allTopics":["julia"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":4,"issueCount":14,"starsCount":19,"forksCount":12,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-08T00:04:28.418Z"}},{"type":"Public","name":"TuringGLM.jl","owner":"TuringLang","isFork":false,"description":"Bayesian Generalized Linear models using `@formula` syntax.","allTopics":["julia-language","bayesian-inference","mcmc","turing","hmc","bayesian-statistics"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":12,"starsCount":71,"forksCount":7,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-08T00:03:05.732Z"}},{"type":"Public","name":"SliceSampling.jl","owner":"TuringLang","isFork":false,"description":"Slice sampling algorithms in Julia","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":5,"forksCount":2,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-09-01T04:56:46.102Z"}},{"type":"Public","name":"DistributionsAD.jl","owner":"TuringLang","isFork":false,"description":"Automatic differentiation of Distributions using Tracker, Zygote, ForwardDiff and ReverseDiff","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":1,"issueCount":27,"starsCount":151,"forksCount":30,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-08-21T23:20:51.069Z"}},{"type":"Public","name":"AdvancedMH.jl","owner":"TuringLang","isFork":false,"description":"Robust implementation for random-walk Metropolis-Hastings algorithms","allTopics":["mcmc","metropolis-hastings","adaptive-mcmc"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":2,"issueCount":13,"starsCount":88,"forksCount":17,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-07-30T09:58:21.717Z"}},{"type":"Public","name":".github","owner":"TuringLang","isFork":false,"description":"Organization-wide GitHub Actions and other metadata","allTopics":[],"primaryLanguage":null,"pullRequestCount":0,"issueCount":1,"starsCount":0,"forksCount":3,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-07-06T16:39:38.852Z"}},{"type":"Public","name":"Libtask.jl","owner":"TuringLang","isFork":false,"description":"Tape based task copying in Turing","allTopics":["coroutines","threads","continuations"],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":3,"issueCount":1,"starsCount":17,"forksCount":9,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-03-09T00:30:30.431Z"}},{"type":"Public","name":"Turing-Workshop","owner":"TuringLang","isFork":false,"description":"Turing Workshop","allTopics":[],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":0,"issueCount":0,"starsCount":12,"forksCount":2,"license":"Creative Commons Attribution Share Alike 4.0 International","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-12-01T09:20:43.066Z"}},{"type":"Public","name":"MCMCDebugging.jl","owner":"TuringLang","isFork":false,"description":"MCMCDebugging.jl: debugging utilities for MCMC samplers","allTopics":[],"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":3,"starsCount":4,"forksCount":5,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-04-10T21:05:14.930Z"}},{"type":"Public","name":"CoupledHMC.jl","owner":"TuringLang","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":0,"issueCount":3,"starsCount":14,"forksCount":3,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-02-28T01:12:21.628Z"}}],"repositoryCount":33,"userInfo":null,"searchable":true,"definitions":[],"typeFilters":[{"id":"all","text":"All"},{"id":"public","text":"Public"},{"id":"source","text":"Sources"},{"id":"fork","text":"Forks"},{"id":"archived","text":"Archived"},{"id":"template","text":"Templates"}],"compactMode":false},"title":"TuringLang repositories"}