Zobrazeno 1 - 10
of 391
pro vyhledávání: '"Lugosi, Gábor"'
In this note we analyze the performance of a simple root-finding algorithm in uniform attachment trees. The leaf-stripping algorithm recursively removes all leaves of the tree for a carefully chosen number of rounds. We show that, with probability $1
Externí odkaz:
http://arxiv.org/abs/2410.06481
Autor:
Lugosi, Gabor, Nualart, Eulalia
We study a continuous-time approximation of the stochastic gradient descent process for minimizing the expected loss in learning problems. The main results establish general sufficient conditions for the convergence, extending the results of Chatterj
Externí odkaz:
http://arxiv.org/abs/2409.07401
We consider the problem of structure recovery in a graphical model of a tree where some variables are latent. Specifically, we focus on the Gaussian case, which can be reformulated as a well-studied problem: recovering a semi-labeled tree from a dist
Externí odkaz:
http://arxiv.org/abs/2408.15624
Recommendation systems are pivotal in aiding users amid vast online content. Broutin, Devroye, Lugosi, and Oliveira proposed Subtractive Random Forests (\textsc{surf}), a model that emphasizes temporal user preferences. Expanding on \textsc{surf}, we
Externí odkaz:
http://arxiv.org/abs/2405.10455
In many statistical applications, the dimension is too large to handle for standard high-dimensional machine learning procedures. This is particularly true for graphical models, where the interpretation of a large graph is difficult and learning its
Externí odkaz:
http://arxiv.org/abs/2405.10412
Autor:
Lugosi, Gábor, Matabuena, Marcos
This paper introduces a novel uncertainty quantification framework for regression models where the response takes values in a separable metric space, and the predictors are in a Euclidean space. The proposed algorithms can efficiently handle large da
Externí odkaz:
http://arxiv.org/abs/2405.05110
A \emph{random temporal graph} is an Erd\H{o}s-R\'enyi random graph $G(n,p)$, together with a random ordering of its edges. A path in the graph is called \emph{increasing} if the edges on the path appear in increasing order. A set $S$ of vertices for
Externí odkaz:
http://arxiv.org/abs/2404.04462
Autor:
Berry, Louigi Addario, Briend, Simon, Devroye, Luc, Donderwinkel, Serte, Kerriou, Céline, Lugosi, Gábor
We study a random recursive tree model featuring complete redirection called the random friend tree and introduced by Saram\"aki and Kaski. Vertices are attached in a sequential manner one by one by selecting an existing target vertex and connecting
Externí odkaz:
http://arxiv.org/abs/2403.20185
This paper studies the problem of estimating the order of arrival of the vertices in a random recursive tree. Specifically, we study two fundamental models: the uniform attachment model and the linear preferential attachment model. We propose an orde
Externí odkaz:
http://arxiv.org/abs/2403.09755
Let ${\mathbf T}_n$ be a uniformly random tree with vertex set $[n]=\{1,\ldots,n\}$, let $\Delta_{{\mathbf T}_n}$ be the largest vertex degree in ${\mathbf T}_n$, and let $\lambda_1({\mathbf T}_n),\ldots,\lambda_n({\mathbf T}_n)$ be the eigenvalues o
Externí odkaz:
http://arxiv.org/abs/2403.08443