arXiv (All)
open access
The Fenchel-Young Generalization of Bayesian Principles
Conjugate Bayes plays a key role in machine learning, ensuring computationally simple posterior updates. We generalize the variational principle behind this computation by using the Fenchel-Young (FY) inequality, which lets us define a generalized evidence lower bound beyond the KL geometry, and at
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Sieve-free ReLU Bayesian priors with near-minimax posterior contraction#1387586
- Gaussian Process Bandits with Paired Auxiliary Observations#1389683
- Min-Plus Convolution Lower Bounds via a Higher-Order BSG Theorem#1234721
- A very short proof of the subgaussian convex-order comparison theorem#1217611
- Canopy: Exploiting Piecewise Smooth Tree Priors for Multi-Fidelity Bandits#1078088
Record · ID 1423688
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive