Search Results for author:
Found 2 papers, 1 papers with code
Norm-Agnostic Linear Bandits
For the latter, we do not pay any price in the regret for now knowing $S$.
Consistency of modularity clustering on random geometric graphs
We consider a large class of random geometric graphs constructed from samples $\mathcal{X}_n = \{X_1, X_2,\ldots, X_n\}$ of independent, identically distributed observations of an underlying probability measure $\nu$ on a bounded domain $D\subset \mathbb{R}^d$.
Probability Optimization and Control Statistics Theory Statistics Theory 60D05, 62G20, 05C82, 49J55, 49J45, 68R10
