arXiv (All)
open access
Incremental Column Subset Selection via Conditional Determinantal Point Processes
Column subset selection aims to seek a small set of representative columns that accurately approximates a given matrix. We study this problem from the perspective of determinantal point processes (DPPs) and their relation to several existing algorithms. To support incremental column selection, we in
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
- Can SGD Select Good Fishermen? Local Convergence under Self-Selection Biases#999649
- Some Probabilistic Interpretations Related to the Next-Generation Matrix Theory: A Review with Examples#121966
- Efficient discovery of unique column combinations on disk-resident data with limited memory#820794
- On Kernel Eigen-alignments of KRR: Reconstruction and Generalization#1036700
- M-FAC: Efficient matrix-free approximations of second-order information#308501
Record · ID 1034369
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