https://mschauer.github.io
http://orcid.org/0000-0003-3310-7915
[ˈmoː/r/ɪts ˈʃaʊ̯ɐ]
arxiv.org/abs/2510.19887
arxiv.org/abs/2510.19887
Come work with us. Openings in: 🔹 Generative AI 🔹 Multimodal ML 🔹 Virology 🔹 Enzyme Function
Apply by Nov 20: oeaw.ac.at/aithyra/post... #PostDoc #AI #ML #Vienna #ScienceJobs
Come work with us. Openings in: 🔹 Generative AI 🔹 Multimodal ML 🔹 Virology 🔹 Enzyme Function
Apply by Nov 20: oeaw.ac.at/aithyra/post... #PostDoc #AI #ML #Vienna #ScienceJobs
Event page & agenda: ui.ungpd.com/Events/60bfc...
1st day featuring:
@betapata.bsky.social
@janstuehmer.bsky.social
@arnauddoucet.bsky.social
@frejohk.bsky.social
Event page & agenda: ui.ungpd.com/Events/60bfc...
1st day featuring:
@betapata.bsky.social
@janstuehmer.bsky.social
@arnauddoucet.bsky.social
@frejohk.bsky.social
about causal interventions/do calculus via string diagram surgery
about causal interventions/do calculus via string diagram surgery
link.springer.com/article/10.1...
link.springer.com/article/10.1...
In other news, conditioning on the outcome reliably makes it very hard to understand how the world works.
For details: ailab.bio/join-us
Details in thread below! (1/5)
For details: ailab.bio/join-us
Parallel computations for Metropolis Markov chains with Picard maps (Grazzi, Zanella) We develop parallel algorithms for simulating zeroth-order (aka gradient-free) Metropolis Markov chains based on the Picard map. For Random Walk Metropolis Markov chains targeting log-concave distributio
Parallel computations for Metropolis Markov chains with Picard maps (Grazzi, Zanella) We develop parallel algorithms for simulating zeroth-order (aka gradient-free) Metropolis Markov chains based on the Picard map. For Random Walk Metropolis Markov chains targeting log-concave distributio
Probabilistic uncertainty about uncertainty collapses. This is the “monadic join” in probability.
Instead of a coin with random bias p ∼ π, you can flip a coin with the deterministic bias μ.
Just take μ = E[p]. #statistics
Probabilistic uncertainty about uncertainty collapses. This is the “monadic join” in probability.
Instead of a coin with random bias p ∼ π, you can flip a coin with the deterministic bias μ.
Just take μ = E[p]. #statistics