Zobrazeno 1 - 10
of 300
pro vyhledávání: '"A, Verzelen"'
Motivated by crowdsourcing, we consider a problem where we partially observe the correctness of the answers of $n$ experts on $d$ questions. In this paper, we assume that both the experts and the questions can be ordered, namely that the matrix $M$ c
Externí odkaz:
http://arxiv.org/abs/2408.15356
In this paper, we consider the problem of seriation of a permuted structured matrix based on noisy observations. The entries of the matrix relate to an expected quantification of interaction between two objects: the higher the value, the closer the o
Externí odkaz:
http://arxiv.org/abs/2408.10004
We investigate the Active Clustering Problem (ACP). A learner interacts with an $N$-armed stochastic bandit with $d$-dimensional subGaussian feedback. There exists a hidden partition of the arms into $K$ groups, such that arms within the same group,
Externí odkaz:
http://arxiv.org/abs/2406.11485
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
This paper introduces a novel approach for epidemic nowcasting and forecasting over networks using total variation (TV) denoising, a method inspired by classical signal processing techniques. Considering a network that models a population as a set of
Externí odkaz:
http://arxiv.org/abs/2405.00619
We investigate the existence of a fundamental computation-information gap for the problem of clustering a mixture of isotropic Gaussian in the high-dimensional regime, where the ambient dimension $p$ is larger than the number $n$ of points. The exist
Externí odkaz:
http://arxiv.org/abs/2402.18378
We consider a ranking problem where we have noisy observations from a matrix with isotonic columns whose rows have been permuted by some permutation $\pi$ *. This encompasses many models, including crowd-labeling and ranking in tournaments by pair-wi
Externí odkaz:
http://arxiv.org/abs/2310.01133
Publikováno v:
Neurips 2023
We consider the problem of best arm identification in the multi-armed bandit model, under fixed confidence. Given a confidence input $\delta$, the goal is to identify the arm with the highest mean reward with a probability of at least 1 -- $\delta$,
Externí odkaz:
http://arxiv.org/abs/2306.02630
We consider the problem of ranking n experts based on their performances on d tasks. We make a monotonicity assumption stating that for each pair of experts, one outperforms the other on all tasks. We consider the sequential setting where in each rou
Externí odkaz:
http://arxiv.org/abs/2306.02628
Motivated by crowd-sourcing applications, we consider a model where we have partial observations from a bivariate isotonic n x d matrix with an unknown permutation $\pi$ * acting on its rows. Focusing on the twin problems of recovering the permutatio
Externí odkaz:
http://arxiv.org/abs/2211.04092