AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Testing Determinantal Point Processes

Khashayar Gatmiry, Maryam Aliakbarpour, Stefanie Jegelka

NeurIPS 2020 · Learning theory and algorithms › Sample complexity · approach: Statistical-query lower bounds · 0 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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
assume (alpha, zeta)-normal DPPs with known alpha and zetaDPP tester · DPP testing, theorylog factor in sample complexityImproved
epsilon or alpha not too smallDPP tester · (alpha, zeta)-normal DPPslog factor in sample complexityImproved
use moment-based learner instead of the section learner (single robust test)DPP tester · DPP testing, theoryrunning time vs sample complexityMixed
assume constant cycle sparsityDPP tester · DPP testing lower boundsample complexityNo clear effect

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