atlas

Research map / Learning theory and algorithms / Prediction and decision losses

One-Pass Algorithms for MAP Inference of Nonsymmetric Determinantal Point Processes

ICML 2022 · Learning theory and algorithms › Prediction and decision losses · approach: Determinantal point process inference

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
online 2-neighbourhood local search with stash (Online-2-neighbor) vs Online-LSS and online greedyonline NDPP MAP inference · several real datasets (Figure 1)solution quality (objective value)Helped
online local search with stash (Online-LSS) vs online greedyonline NDPP MAP inference · several real datasets (Figure 1)solution quality (objective value)Helped
single-pass online algorithms vs offline greedy using k passes and full memoryonline NDPP MAP inference · several real datasets (Figure 1)solution quality (objective value)No clear effect
partition-based streaming algorithm (Streaming Partition Greedy) vs other methodsstreaming NDPP MAP inference · datasets in Section 7solution quality (objective value)Hurt
smaller alpha (more swaps allowed) in Online-LSS (ablation)Online-LSS · varied set sizes k (Appendix D)solution qualityMixed
random-order stream instead of adversarial orderOnline-LSS and Online-2-neighbor · random permutation of datasets (Appendix D.3)solution qualityNo 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