The complexity of user retention

DOI10.4230/LIPICS.ITCS.2019.12MaRDI QIDQ5090384zbMATH OpenFDO

Authors Eli Ben-Sasson, Eden Saig

Publication date 18 July 2022

Full work available at URL https://doi.org/10.4230/LIPICS.ITCS.2019.12

zbMATH Keywords

information elicitationproper scoring rulesretention complexityretentive learning

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Brief announcement: Towards an abstract model of user retention dynamics
• On the learnability of discrete distributions
• A Bayesian analysis of retention functions
• On the impact of forgetting on learning machines
• scientific article; zbMATH DE number 446846

Cites work

• A theory of the learnable
• Elicitation of Personal Probabilities and Expectations
• scientific article; zbMATH DE number 2168761 (Why is no real title available?)
• MEASURES OF THE VALUE OF INFORMATION
• Proper Scores for Probability Forecasters

This page was built for publication: The complexity of user retention

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090384)