惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

U
Unit 42
The Cloudflare Blog
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
Y
Y Combinator Blog
G
Google Developers Blog
Vercel News
Vercel News
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
Jina AI
Jina AI
Blog — PlanetScale
Blog — PlanetScale
H
Help Net Security
博客园 - 三生石上(FineUI控件)
MongoDB | Blog
MongoDB | Blog
S
SegmentFault 最新的问题
阮一峰的网络日志
阮一峰的网络日志
H
Hackread – Cybersecurity News, Data Breaches, AI and More
aimingoo的专栏
aimingoo的专栏
T
Tailwind CSS Blog
博客园 - 叶小钗
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
月光博客
月光博客
Microsoft Security Blog
Microsoft Security Blog
P
Proofpoint News Feed
The GitHub Blog
The GitHub Blog
云风的 BLOG
云风的 BLOG

math.ST updates on arXiv.org

What is Learnable in Valiant's Theory of the Learnable? Learning Perturbations to Extrapolate Your LLM Byzantine-Robust Distributed Sparse Learning Revisited The Sample Complexity of Multiple Change Point Identification under Bandit Feedback A proximal gradient algorithm for composite log-concave sampling Model-based Bootstrap of Controlled Markov Chains Approximation of Maximally Monotone Operators : A Graph Convergence Perspective Posterior Contraction Rates for Sparse Kolmogorov-Arnold Networks in Anisotropic Besov Spaces MIST: Reliable Streaming Decision Trees for Online Class-Incremental Learning via McDiarmid Bound A Spectral Framework for Closed-Form Relative Density Estimation Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability Higher-Order Equilibrium Tracking for EM-Compressible Online Estimation Scaling Limits of Long-Context Transformers A Note on Non-Negative $L_1$-Approximating Polynomials Susceptibilities and Patterning: A Primer on Linear Response in Bayesian Learning Linear Response Estimators for Singular Statistical Models Statistical inference with belief functions: A survey Robust stochastic first order methods in heavy-tailed noise via medoid mini-batch gradient sampling Every Feedforward Neural Network Definable in an o-Minimal Structure Has Finite Sample Complexity Adaptive auditing of AI systems with anytime-valid guarantees Locally Near Optimal Piecewise Linear Regression in High Dimensions via Difference of Max-Affine Functions Risk-Controlled Post-Processing of Decision Policies Covariate Balancing and Riesz Regression Should Be Guided by the Neyman Orthogonal Score in Debiased Machine Learning A Unified Pair-GRPO Family: From Implicit to Explicit Preference Constraints for Stable and General RL Alignment Time-Inhomogeneous Preconditioned Langevin Dynamics A Fine-Grained Understanding of Uniform Convergence for Halfspaces CITE: Anytime-Valid Statistical Inference in LLM Self-Consistency Ratio-based Loss Functions Optimal Confidence Band for Kernel Gradient Flow Estimator A renormalization-group inspired lattice-based framework for piecewise generalized linear models
Quasi-Measurable Spaces: A Convenient Foundation of Proba...
[Submitted on 14 Sep 2021 (v1), last revised 9 Aug 2026 (this ve · 2021-09-14 · via math.ST updates on arXiv.org

Mathematics > Probability

arXiv:2109.11631 (math)

[Submitted on 14 Sep 2021 (v1), last revised 9 Aug 2026 (this version, v2)]

View PDF

Abstract:We introduce the categories of quasi-measurable spaces, mild generalizations of quasi-Borel spaces that allow for general sample spaces and less restrictive random variables. Each such category is complete, cocomplete, cartesian closed and, as we show, even locally cartesian closed, a quasitopos and a Heyting category, and so models an extensional dependent type theory with a typed intuitionistic first-order logic. We put one probability monad in the foreground, the push-forward probability monad $\mathcal{P}$, and isolate the two properties of the sample space its theory needs: a Fubini property, making $\mathcal{P}$ commutative, and a product isomorphism $\Omega \times \Omega \cong \Omega$, making it strong. It is affine always. Our main interest is the category of quasi-universal spaces, where the sample space is the universal Hilbert cube $[0,1]^\mathbb{N}$ with the $\sigma$-algebra of all universally measurable subsets. That completion is what buys explicit descriptions of the induced $\sigma$-algebras, as intersections of Lebesgue-complete $\sigma$-algebras, and for countably separated spaces as the completion of any countable separating family, which quasi-Borel spaces do not admit. All push-forward probability monads collapse into one here, and on standard quasi-universal spaces the Giry monad joins them. We prove a Fubini theorem, a disintegration theorem for Markov kernels, Kolmogorov extension theorems and a conditional de Finetti theorem, and translate them into properties of the associated Markov category. Finally we formalize causal Bayesian networks over quasi-universal spaces and prove a global Markov property, translating transitional conditional independence into this setting and establishing its asymmetric separoid rules. Exponential objects then put variables and causal mechanisms on the same graphical footing, in partially generic causal Bayesian networks.

Submission history

From: Patrick Forré [view email]
[v1] Tue, 14 Sep 2021 11:24:48 UTC (83 KB)
[v2] Sun, 9 Aug 2026 12:57:49 UTC (146 KB)

Current browse context:

math.PR

Bookmark

BibSonomy Reddit

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Code, Data, Media

Code, Data and Media Associated with this Article

Demos

Demos

Related Papers

Recommenders and Search Tools

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.