Benjamin Yackley

Benjamin Yackley

Auto-generated profile, based on publicly available information

Benjamin Yackley

Department of Computer Science University of New Mexico 87131 Albuquerque NM

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 January 2016
Verified
Closed access
BYBenjamin Yackley
Benjamin Yackley
TLTerran Lane
Terran Lane

27 June 2012 in arXiv
Verified
Preprint
Open access
PDF file
BYBenjamin Yackley
Benjamin Yackley
TLTerran Lane
Terran Lane
As data sets grow in size, the ability of learning methods to find structure in them is increasingly hampered by the time needed to search the large spaces of possibilities and generate a score for each that takes all of the observed data into account. For instance, Bayesian networks, the model chosen in this paper, have a super-exponentially large search space for a fixed number of variables. One possible method to alleviate this problem is to use a proxy, such as a Gaussian Process regressor, in place of the true scoring function, training it on a selection of sampled networks. We prove here that the use of such a proxy is well-founded, as we can bound the smoothness of a commonly-used scoring function for Bayesian network structure learning. We show here that, compared to an identical search strategy using the network?s exact scores, our proxy-based search is able to get equivalent or better scores on a number of data sets in a fraction of the time.