arXiv (All)
open access
Scalable Learning of Determinantal Point Processes with Kernel-Structured Interactions
Determinantal point processes (DPPs) on a finite set are probability models that exhibit repulsion where inter-item similarities are encoded by a positive definite kernel matrix. Scaling DPP learning to large datasets typically requires imposing structural constraints on the kernel matrix, such as a
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
- Singular Value Decomposition: A Geometric Rediscovery, Where Proofs Become Algorithms#1218300
- Singular Value Decomposition: A Geometric Rediscovery, Where Proofs Become Algorithms#1210306
- Incremental Column Subset Selection via Conditional Determinantal Point Processes#1034369
- From Graphical Lasso to Atomic Norms: High-Dimensional Pattern Recovery#1328297
- The Gaussian Latent Machine: Efficient Prior and Posterior Sampling for Inverse Problems#144295
Record · ID 1296836
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