Pair-matching: link prediction with adaptive queries
From MaRDI portal
Publication:6652703
DOI10.4171/msl/46MaRDI QIDQ6652703
Matthieu Lerasle, Christophe Giraud, Yann Issartel, Luc Lehéricy
Publication date: 13 December 2024
Published in: Mathematical Statistics and Learning (Search for Journal in Brave)
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Cites Work
- Title not available (Why is that?)
- Consistency thresholds for the planted bisection model
- Minimax rates of community detection in stochastic block models
- Reconstruction and estimation in the planted partition model
- Concentration inequalities and model selection. Ecole d'Eté de Probabilités de Saint-Flour XXXIII -- 2003.
- Asymptotically efficient adaptive allocation rules
- Die Berechnung der Turnier-Ergebnisse als ein Maximumproblem der Wahrscheinlichkeitsrechnung.
- A proof of the block model threshold conjecture
- Nonbacktracking spectrum of random graphs: community detection and nonregular Ramanujan graphs
- MM algorithms for generalized Bradley-Terry models.
- Optimal adaptive policies for sequential allocation problems
- Computational barriers to estimation from low-degree polynomials
- Active ranking from pairwise comparisons and when parametric assumptions do not help
- Partial recovery bounds for clustering with the relaxed \(K\)-means
- On the likelihood that one unkrown probability exeeds another in view of the evidence of two samples.
- On the complexity of best-arm identification in multi-armed bandit models
- Statistical-computational tradeoffs in planted problems and submatrix localization with a growing number of clusters and submatrices
- Estimation from pairwise comparisons: sharp minimax bounds with topology dependence
- Extended Use of Paired Comparison Models, with Application to Chess Rankings
- Community Detection and Stochastic Block Models
- Simple, Robust and Optimal Ranking from Pairwise Comparisons
- Exponential Error Rates of SDP for Block Models: Beyond Grothendieck’s Inequality
- The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness
- CONCENTRATION OF RANDOM GRAPHS AND APPLICATION TO COMMUNITY DETECTION
- Explore First, Exploit Next: The True Shape of Regret in Bandit Problems
- Community detection thresholds and the weak Ramanujan property
- Achieving Optimal Misclassification Proportion in Stochastic Block Model
- Some aspects of the sequential design of experiments
This page was built for publication: Pair-matching: link prediction with adaptive queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652703)