Adam D. Bull

  1. Adaptive confidence sets in L^{2}.

    Authors: Richard Nickl, Adam D. Bull
    Subjects: Statistics
    Abstract

    The problem of constructing nonparametric confidence sets that are adaptive
    in L^{2}-loss over a continuous scale of Sobolev classes is considered.
    Adaptation holds, where possible, with respect to both the radius of the
    Sobolev ball and its smoothness degree, and over maximal parameter spaces for
    which adaptation is possible. Two key regimes of parameter constellations are
    identified: one where full adaptation is possible, and one where adaptation
    requires critical regions be removed. The phase transition between these
    regimes is analysed separately.

  2. Convergence Rates of Efficient Global Optimization Algorithms.

    Authors: Adam D. Bull
    Subjects: Machine Learning
    Abstract

    Efficient global optimization is the problem of minimizing an unknown
    function f, using as few evaluations f(x) as possible. It can be considered as
    a continuum-armed bandit problem, with noiseless data and simple regret.
    Expected improvement is perhaps the most popular method for solving this
    problem; the algorithm performs well in experiments, but little is known about
    its theoretical properties. Implementing expected improvement requires a choice
    of Gaussian process prior, which determines an associated space of functions,
    its reproducing-kernel Hilbert space (RKHS).

Syndicate content