arXiv (All)
open access
Generalized Score Matching for Parameter Estimation on Convex Domains
Maximum likelihood (ML) estimation is a principled and statistically efficient approach for learning probabilistic models. However, for unnormalized models, ML estimation requires evaluating the partition function and differentiating through it, which may not always be tractable. Score matching prov
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
- Generalized Score Matching for Parameter Estimation on Convex Domains#673532
- Learning with generalized negative dependence : probabilistic models of diversity for machine learning#284701
- Training-Free Uncertainty Estimation for Embedding Models#1118355
- Toward Calibrated Mixture-of-Experts Under Distribution Shift#290563
- Improving Function Space Flow Matching with Kernel Optimal Transport#1142348
Record · ID 999047
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