Fetching the paper…
Reading the bibliography…
Contemporary global optimization algorithms are based on local measures of utility, rather than a probability measure over location and value of the optimum.
Note sûre une méthode de résolution des équations normales provenant de l’application de la méthode des moindres carrés a un système d’équations linéaires en nombre inférieure a celui des inconnues. Application de la méthode a la résolution d’un système défini d’équations linéaires. (procédé du Commandant Cholesky)
Benoit · 1924
Earlier work this paper cites.
On the theory of the Brownian motion
G.E. Uhlenbeck and L.S. Ornstein · 1930
Earlier work this paper cites.
Grundbegriffe der Wahrscheinlichkeitsrechnung
A.N. Kolmogorov · 1933
Earlier work this paper cites.
Probability, frequency and reasonable expectation
R.T. Cox · 1946
Earlier work this paper cites.
A mathematical theory of communication
C.E. Shannon · 1948
Earlier work this paper cites.
On stochastic differential equations
K. Itō · 1951
Earlier work this paper cites.
A statistical approach to some basic mine valuation and allied problems at the Witwatersrand
D.G. Krige · 1951
Earlier work this paper cites.
On information and sufficiency
S. Kullback and R.A. Leibler · 1951
Earlier work this paper cites.
Methods of conjugate gradients for solving linear systems
M.R. Hestenes and E. Stiefel · 1952
Earlier work this paper cites.
A reduction formula for normal multivariate integrals
R.L. Plackett · 1954
Earlier work this paper cites.
The prediction theory of multivariate stochastic processes
N. Wiener and P. Masani · 1957
Earlier work this paper cites.
Spatial variation
B. Matérn · 1960
Earlier work this paper cites.
A class of methods for solving nonlinear simultaneous equations
C.G. Broyden et al · 1965
Earlier work this paper cites.
A new approach to variable metric algorithms
R. Fletcher · 1970
Earlier work this paper cites.
A family of variable metric updates derived by variational means
D. Goldfarb · 1970
Earlier work this paper cites.
Conditioning of quasi-Newton methods for function minimization
D.F. Shanno · 1970
Cited alongside, same era.
The geometry of random fields
R.J. Adler · 1981
Cited alongside, same era.
An introduction to continuity, extrema, and related topics for general Gaussian processes
R.J. Adler · 1990
Cited alongside, same era.
On the convergence of interior-reflective newton methods for nonlinear minimization subject to bounds
T.F. Coleman and Y. Li · 1994
Cited alongside, same era.
An interior trust region approach for nonlinear minimization subject to bounds
T.F. Coleman and Y. Li · 1996
Cited alongside, same era.
Efficient global optimization of expensive black-box functions
D.R. Jones, M. Schonlau, and W.J. Welch · 1998
Cited alongside, same era.
Theory of genetic algorithms ii: models for genetic operators over the string-tensor representation of populations and convergence to global optima for arbitrary fitness function under scaling
L.M. Schmitt · 2004
Later among the works it cites.
Nearly tight bounds for the continuum-armed bandit problem
R. Kleinberg · 2005
Later among the works it cites.
Gaussian Processes for Machine Learning
C.E. Rasmussen and C.K.I. Williams · 2006
Later among the works it cites.
An interior algorithm for nonlinear optimization that combines line search and trust region steps
R.A. Waltz, J.L. Morales, J. Nocedal, and D. Orban · 2006
Later among the works it cites.
Practical Bayesian Optimization
D.J. Lizotte · 2008
Later among the works it cites.
Expectation propagation for exponential families
M. Seeger · 2008
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
An interior point algorithm for large-scale nonlinear programming
R.H. Byrd, M.E. Hribar, and J. Nocedal · 1999
Cited alongside, same era.
Numerical optimization
J. Nocedal and S.J. Wright · 1999
Cited alongside, same era.
A trust region method based on interior point techniques for nonlinear programming
R.H. Byrd, J.C. Gilbert, and J. Nocedal · 2000
Cited alongside, same era.
Deriving quadrature rules from Gaussian processes
T.P. Minka · 2000
Cited alongside, same era.
Completely derandomized self-adaptation in evolution strategies
N. Hansen and A. Ostermeier · 2001
Cited alongside, same era.
Expectation Propagation for approximate Bayesian inference
T.P. Minka · 2001
Cited alongside, same era.
Later among the works it cites.
Gaussian processes for global optimization
M.A. Osborne, R. Garnett, and S.J. Roberts · 2009
Later among the works it cites.
Regret bounds for Gaussian process bandit problems
S. Grünewälder, J.Y. Audibert, M. Opper, and J. Shawe-Taylor · 2010
Later among the works it cites.
Slice sampling covariance hyperparameters of latent Gaussian models
I. Murray and R.P. Adams · 2010
Later among the works it cites.
Gaussian process optimization in the bandit setting: No regret and experimental design
N. Srinivas, A. Krause, S. Kakade, and M. Seeger · 2010
Later among the works it cites.
Slice sampling with adaptive multivariate steps: The shrinking-rank method
M.B. Thompson and R.M. Neal · 2010
Later among the works it cites.
Gaussian probabilities and expectation propagation
J. Cunningham, P. Hennig, and S. Lacoste-Julien · 2011
Closest in time.
Optimal reinforcement learning for Gaussian systems
P. Hennig · 2011
Closest in time.
Information rates of nonparametric Gaussian process methods
A.W. van der Vaart and J.H. van Zanten · 2011
Closest in time.