atlas

Research map / Learning theory and algorithms / Sample complexity

Learning Determinantal Point Processes with Moments and Cycles

ICML 2017 · Learning theory and algorithms › Sample complexity · approach: Sample complexity of ranking and selection · 8 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Increase the cycle sparsity of the kernel graphMoments and cycles · DPP kernel estimationsample complexity for sign recovery: n = O\Big( \big(\frac{C}{\alpha}\big)^{2\ell}+ \frac{\log N}{\alpha^2 \varepsilon^2} \Big)Hurt
Use the moments-and-cycles estimator rather than an unspecified alternativeDPP kernel estimation · DPP kernel estimationsample complexityHelped
Recover the sparsity pattern before recovering signsMoments and cycles on cycle-graph kernels · Random cycle-graph matricessign recovery successMixed
Use a shortest maximal cycle basis and moments for sign recoveryMoments and cycles on cycle- and clique-graph kernels · Random cycle- and clique-graph matricessign recovery conditional on graph recoveryHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy