Sciweavers

3049 search results - page 133 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
FOCS
2009
IEEE
15 years 11 months ago
Instance-Optimal Geometric Algorithms
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
Peyman Afshani, Jérémy Barbay, Timot...
NIPS
2001
15 years 6 months ago
A General Greedy Approximation Algorithm with Applications
Greedy approximation algorithms have been frequently used to obtain sparse solutions to learning problems. In this paper, we present a general greedy algorithm for solving a class...
T. Zhang
EMO
2003
Springer
109views Optimization» more  EMO 2003»
15 years 10 months ago
A Population and Interval Constraint Propagation Algorithm
We present PICPA, a new algorithm for tackling constrained continuous multi-objective problems. The algorithm combines constraint propagation techniques and evolutionary concepts. ...
Vincent Barichard, Jin-Kao Hao
JMLR
2008
159views more  JMLR 2008»
15 years 4 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin
NIPS
1996
15 years 6 months ago
Radial Basis Function Networks and Complexity Regularization in Function Learning
In this paper we apply the method of complexity regularization to derive estimation bounds for nonlinear function estimation using a single hidden layer radial basis function netwo...
Adam Krzyzak, Tamás Linder