On PAC-Bayesian bounds for random forests
Sign Up to like & getrecommendations! Published in 2019 at "Machine Learning"
DOI: 10.1007/s10994-019-05803-4
Abstract: Existing guarantees in terms of rigorous upper bounds on the generalization error for the original random forest algorithm, one of the most frequently used machine learning methods, are unsatisfying. We discuss and evaluate various PAC-Bayesian… read more here.
Keywords: bayesian bounds; bounds random; random forests; taking majority ... See more keywords
Spectral bounds in random graphs applied to spreading phenomena and percolation
Sign Up to like & getrecommendations! Published in 2018 at "Advances in Applied Probability"
DOI: 10.1017/apr.2018.22
Abstract: Abstract In this paper we derive nonasymptotic upper bounds for the size of reachable sets in random graphs. These bounds are subject to a phase transition phenomenon triggered by the spectral radius of the hazard… read more here.
Keywords: graphs applied; percolation; bounds random; random graphs ... See more keywords