Sciweavers

92 search results - page 12 / 19
» Learning Linear Precedence Rules
Sort
View
JMLR
2007
137views more  JMLR 2007»
14 years 9 months ago
Building Blocks for Variational Bayesian Learning of Latent Variable Models
We introduce standardised building blocks designed to be used with variational Bayesian learning. The blocks include Gaussian variables, summation, multiplication, nonlinearity, a...
Tapani Raiko, Harri Valpola, Markus Harva, Juha Ka...
PKDD
2010
Springer
169views Data Mining» more  PKDD 2010»
14 years 7 months ago
Efficient and Numerically Stable Sparse Learning
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...
Sihong Xie, Wei Fan, Olivier Verscheure, Jiangtao ...
KDD
1998
ACM
120views Data Mining» more  KDD 1998»
15 years 1 months ago
Large Datasets Lead to Overly Complex Models: An Explanation and a Solution
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
Tim Oates, David Jensen
FOCS
2006
IEEE
15 years 3 months ago
Hardness of Learning Halfspaces with Noise
Learning an unknown halfspace (also called a perceptron) from labeled examples is one of the classic problems in machine learning. In the noise-free case, when a halfspace consist...
Venkatesan Guruswami, Prasad Raghavendra
NIPS
1994
14 years 10 months ago
Combining Estimators Using Non-Constant Weighting Functions
This paper discusses the linearly weighted combination of estimators in which the weighting functions are dependent on the input. We show that the weighting functions can be deriv...
Volker Tresp, Michiaki Taniguchi