Sciweavers

46 search results - page 5 / 10
» Tree-structured Approximations by Expectation Propagation
Sort
View
JMLR
2010
118views more  JMLR 2010»
13 years 4 months ago
Gaussian processes with monotonicity information
A method for using monotonicity information in multivariate Gaussian process regression and classification is proposed. Monotonicity information is introduced with virtual derivat...
Jaakko Riihimäki, Aki Vehtari
CIAC
1994
Springer
148views Algorithms» more  CIAC 1994»
14 years 1 months ago
Efficient Reorganization of Binary Search Trees
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
Micha Hofri, Hadas Shachnai
CORR
2012
Springer
170views Education» more  CORR 2012»
12 years 5 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
ICML
2008
IEEE
14 years 10 months ago
Gaussian process product models for nonparametric nonstationarity
Stationarity is often an unrealistic prior assumption for Gaussian process regression. One solution is to predefine an explicit nonstationary covariance function, but such covaria...
Ryan Prescott Adams, Oliver Stegle
PKDD
2009
Springer
184views Data Mining» more  PKDD 2009»
14 years 2 months ago
Boosting Active Learning to Optimality: A Tractable Monte-Carlo, Billiard-Based Algorithm
Abstract. This paper focuses on Active Learning with a limited number of queries; in application domains such as Numerical Engineering, the size of the training set might be limite...
Philippe Rolet, Michèle Sebag, Olivier Teyt...