Sciweavers

12519 search results - page 313 / 2504
» Approximation Problems Categories
Sort
View
UAI
2004
15 years 8 months ago
On-line Prediction with Kernels and the Complexity Approximation Principle
The paper describes an application of Aggregating Algorithm to the problem of regression. It generalizes earlier results concerned with plain linear regression to kernel technique...
Alexander Gammerman, Yuri Kalnishkan, Vladimir Vov...
NECO
2008
146views more  NECO 2008»
15 years 6 months ago
Deep, Narrow Sigmoid Belief Networks Are Universal Approximators
In this paper we show that exponentially deep belief networks [3, 7, 4] can approximate any distribution over binary vectors to arbitrary accuracy, even when the width of each lay...
Ilya Sutskever, Geoffrey E. Hinton
IDA
2009
Springer
16 years 1 months ago
Bayesian Solutions to the Label Switching Problem
Abstract. The label switching problem, the unidentifiability of the permutation of clusters or more generally latent variables, makes interpretation of results computed with MCMC ...
Kai Puolamäki, Samuel Kaski
CDC
2008
IEEE
150views Control Systems» more  CDC 2008»
16 years 1 months ago
Subgradient methods and consensus algorithms for solving convex optimization problems
— In this paper we propose a subgradient method for solving coupled optimization problems in a distributed way given restrictions on the communication topology. The iterative pro...
Björn Johansson, Tamás Keviczky, Mikae...
CEC
2008
IEEE
16 years 1 months ago
Analysis of population-based evolutionary algorithms for the vertex cover problem
— Recently it has been proved that the (1+1)-EA produces poor worst-case approximations for the vertex cover problem. In this paper the result is extended to the (1+λ)-EA by pro...
Pietro Simone Oliveto, Jun He, Xin Yao