Nicolas Vayatis

11 catalog papers. Identity-linked publications and additional name matches are distinguished below.

ORCID: 0000-0003-4308-4681

Publications

• Collaborative likelihood-ratio estimation over graphs — Journal of Machine Learning Research 2025 (name-matched, not ORCID-linked)
• Deep Out-of-Distribution Uncertainty Quantification via Weight Entropy Maximization — Journal of Machine Learning Research 2025 (name-matched, not ORCID-linked)
• Pandemic lockdown, isolation, and exit policies based on machine learning predictions — Production and Operations Management 2023
• Learning Laplacian Matrix from Graph Signals with Sparse Spectral Representation — Journal of Machine Learning Research 2021 (name-matched, not ORCID-linked)
• Link Prediction in Graphs with Autoregressive Features — Journal of Machine Learning Research 2014 (name-matched, not ORCID-linked)
• Ranking Forests — Journal of Machine Learning Research 2013 (name-matched, not ORCID-linked)
• Ranking and Empirical Minimization of U-statistics — The Annals of Statistics 2008
• Ranking the Best Instances — Journal of Machine Learning Research 2007 (name-matched, not ORCID-linked)
• Discussions of boosting papers, and rejoinders — The Annals of Statistics 2004
• On the Bayes-risk consistency of regularized boosting methods — The Annals of Statistics 2004
• On the Rate of Convergence of Regularized Boosting Classifiers — Journal of Machine Learning Research 2003 (name-matched, not ORCID-linked)