Learning distributions from random walks

Funda Ergun, S. Ravi Kumar, Ronitt Rubinfeld

Research output: Contribution to conferencePaperpeer-review

Abstract

We introduce a new model of distributions generated by random walks on graphs. This model suggests a variety of learning problems, using the definitions and models of distribution learning defined in [6]. Our framework is general enough to model previously studied distribution learning problems, as well as to suggest new applications. We describe special cases of the general problem, and investigate their relative difficulty. We present algorithms to solve the learning problem under various conditions.

Original languageEnglish
Pages243-249
Number of pages7
DOIs
StatePublished - 1997
Externally publishedYes
EventProceedings of the 1997 10th Annual Conference on Computational Learning Theory - Nashville, TN, USA
Duration: 6 Jul 19979 Jul 1997

Conference

ConferenceProceedings of the 1997 10th Annual Conference on Computational Learning Theory
CityNashville, TN, USA
Period6/07/979/07/97

Fingerprint

Dive into the research topics of 'Learning distributions from random walks'. Together they form a unique fingerprint.

Cite this