Differentially Private Learning of Markov Chains: Near-Optimal Sample Complexity for Item and User Level Privacy
Researchers give near-optimal private bounds for learning Markov chain transition matrices.
1 stories, newest first · one card per story
Researchers give near-optimal private bounds for learning Markov chain transition matrices.
Today 1.6K readers · 2.5K views · 778 reads · all time 189K views