High-performance sampling of generic determinantal point processes

@article{Poulson2020HighperformanceSO,
  title={High-performance sampling of generic determinantal point processes},
  author={Jack Poulson},
  journal={Philosophical Transactions of the Royal Society A},
  year={2020},
  volume={378}
}
  • Jack Poulson
  • Published 2020
  • Mathematics, Computer Science, Physics, Medicine
  • Philosophical Transactions of the Royal Society A
  • Determinantal point processes (DPPs) were introduced by Macchi (Macchi 1975 Adv. Appl. Probab. 7, 83–122) as a model for repulsive (fermionic) particle distributions. But their recent popularization is largely due to their usefulness for encouraging diversity in the final stage of a recommender system (Kulesza & Taskar 2012 Found. Trends Mach. Learn. 5, 123–286). The standard sampling scheme for finite DPPs is a spectral decomposition followed by an equivalent of a randomly diagonally pivoted… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 11 CITATIONS

    DPPy: DPP Sampling with Python

    Learning from DPPs via Sampling: Beyond HKPV and symmetry

    VIEW 5 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Sampling from a k-DPP without looking at all items

    VIEW 2 EXCERPTS
    CITES METHODS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 65 REFERENCES

    Determinantal Point Processes for Machine Learning

    VIEW 3 EXCERPTS

    Kronecker Determinantal Point Processes

    DPPy: Sampling Determinantal Point Processes with Python

    VIEW 1 EXCERPT