Reproduce “Self-Bounding Majority Vote Learning Algorithms by the Direct Minimization of a Tight PAC-Bayesian C-Bound” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Paul Viallard, Pascal Germain, Amaury Habrard, Emilie Morvant
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.