no code implementations • 24 Nov 2021 • Nathanael Ackerman, Julian Asilis, Jieqi Di, Cameron Freer, Jean-Baptiste Tristan
We introduce definitions of computable PAC learning for binary classification over computable metric spaces.
no code implementations • 28 Oct 2015 • Diana Cai, Nathanael Ackerman, Cameron Freer
Directed graphs occur throughout statistical modeling of networks, and exchangeability is a natural assumption when the ordering of vertices does not matter.
no code implementations • 5 Dec 2014 • Diana Cai, Nathanael Ackerman, Cameron Freer
Exchangeable graphs arise via a sampling procedure from measurable functions known as graphons.