Zobrazeno 1 - 10
of 84
pro vyhledávání: '"Reyzin Lev"'
Publikováno v:
Special Matrices, Vol 5, Iss 1, Pp 139-157 (2017)
In this paper, we consider the planted partition model, in which n = ks vertices of a random graph are partitioned into k “clusters,” each of size s. Edges between vertices in the same cluster and different clusters are included with constant pro
Externí odkaz:
https://doaj.org/article/bc70ad4237834c36b8d6577e34bb1a32
In this paper we give several applications of Littlestone dimension. The first is to the model of \cite{angluin2017power}, where we extend their results for learning by equivalence queries with random counterexamples. Second, we extend that model to
Externí odkaz:
http://arxiv.org/abs/2310.04812
Reinforcement learning generalizes multi-armed bandit problems with additional difficulties of a longer planning horizon and unknown transition kernel. We explore a black-box reduction from discounted infinite-horizon tabular reinforcement learning t
Externí odkaz:
http://arxiv.org/abs/2205.09056
In this paper we investigate the problem of learning evolving concepts over a combinatorial structure. Previous work by Emamjomeh-Zadeh et al. [2020] introduced dynamics into interactive learning as a way to model non-static user preferences in clust
Externí odkaz:
http://arxiv.org/abs/2204.07071
In this note we consider the Steiner tree problem under Bilu-Linial stability. We give strong geometric structural properties that need to be satisfied by stable instances. We then make use of, and strengthen, these geometric properties to show that
Externí odkaz:
http://arxiv.org/abs/2109.13457
Algorithms for noiseless collaborative PAC learning have been analyzed and optimized in recent years with respect to sample complexity. In this paper, we study collaborative PAC learning with the goal of reducing communication cost at essentially no
Externí odkaz:
http://arxiv.org/abs/2012.10569
Autor:
Fish, Benjamin, Reyzin, Lev
In the problem of learning with label proportions, which we call LLP learning, the training data is unlabeled, and only the proportions of examples receiving each label are given. The goal is to learn a hypothesis that predicts the proportions of lab
Externí odkaz:
http://arxiv.org/abs/2004.03515
Autor:
Reyzin, Lev
We give a survey of the foundations of statistical queries and their many applications to other areas. We introduce the model, give the main definitions, and we explore the fundamental theory statistical queries and how how it connects to various not
Externí odkaz:
http://arxiv.org/abs/2004.00557
We tackle some fundamental problems in probability theory on corrupted random processes on the integer line. We analyze when a biased random walk is expected to reach its bottommost point and when intervals of integer points can be detected under a n
Externí odkaz:
http://arxiv.org/abs/2003.13561
Autor:
Janardhanan, Mano Vikash, Reyzin, Lev
In this paper, we consider the problem of reconstructing a directed graph using path queries. In this query model of learning, a graph is hidden from the learner, and the learner can access information about it with path queries. For a source and des
Externí odkaz:
http://arxiv.org/abs/2002.11541