Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Issartel, Yann"'
We consider the statistical seriation problem, where the statistician seeks to recover a hidden ordering from a noisy observation of a permuted Robinson matrix. In this paper, we tightly characterize the minimax rate for this problem of matrix reorde
Externí odkaz:
http://arxiv.org/abs/2405.08747
We consider the problem of estimating latent positions in a one-dimensional torus from pairwise affinities. The observed affinity between a pair of items is modeled as a noisy observation of a function $f(x^*_{i},x^*_{j})$ of the latent positions $x^
Externí odkaz:
http://arxiv.org/abs/2108.03098
Autor:
Butucea, Cristina, Issartel, Yann
We study the problem of estimating non-linear functionals of discrete distributions in the context of local differential privacy. The initial data $x_1,\ldots,x_n \in [K]$ are supposed i.i.d. and distributed according to an unknown discrete distribut
Externí odkaz:
http://arxiv.org/abs/2107.03940
Autor:
Issartel, Yann
Network complexity has been studied for over half a century and has found a wide range of applications. Many methods have been developed to characterize and estimate the complexity of networks. However, there has been little research with statistical
Externí odkaz:
http://arxiv.org/abs/1909.02900
The pair-matching problem appears in many applications where one wants to discover good matches between pairs of entities or individuals. Formally, the set of individuals is represented by the nodes of a graph where the edges, unobserved at first, re
Externí odkaz:
http://arxiv.org/abs/1905.07342
Publikováno v:
Mathematical Statistics & Learning; 2024, Vol. 7 Issue 3/4, p221-295, 75p
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Issartel, Yann
Publikováno v:
Statistics [math.ST]. Faculté des sciences d'Orsay, Université Paris-Saclay, 2020. English
Statistics [math.ST]. Faculté des sciences d'Orsay, Université Paris-Saclay, 2020. English. ⟨NNT : ⟩
Statistics [math.ST]. Faculté des sciences d'Orsay, Université Paris-Saclay, 2020. English. ⟨NNT : ⟩
This thesis lies at the intersection of the theories of non-parametric statistics and statistical learning. Its goal is to provide an understanding of statistical problems in latent space random graphs. Latent space models have emerged as useful prob
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::3e56df3ddf323d51a81880012e3d5c59
https://hal.inria.fr/tel-03041741/document
https://hal.inria.fr/tel-03041741/document
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
57 pages; The pair-matching problem appears in many applications where one wants to discover good matches between pairs of individuals. Formally, the set of individuals is represented by the nodes of a graph where the edges, unobserved at first, repr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::6dd0a7cdd3a2965a59769600b83ea9ae
https://hal.archives-ouvertes.fr/hal-02159938
https://hal.archives-ouvertes.fr/hal-02159938