Sciweavers

3049 search results - page 73 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
IAT
2007
IEEE
15 years 10 months ago
Noise Tolerance in Reinforcement Learning Algorithms
This paper proposes a mechanism of noise tolerance for reinforcement learning algorithms. An adaptive agent that employs reinforcement learning algorithms may receive and accumula...
Richardson Ribeiro, Alessandro L. Koerich, Fabr&ia...
NIPS
2007
15 years 5 months ago
Adaptive Embedded Subgraph Algorithms using Walk-Sum Analysis
We consider the estimation problem in Gaussian graphical models with arbitrary structure. We analyze the Embedded Trees algorithm, which solves a sequence of problems on tractable...
Venkat Chandrasekaran, Jason K. Johnson, Alan S. W...
AI
2010
Springer
15 years 4 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
CP
2005
Springer
15 years 10 months ago
Bounds-Consistent Local Search
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
Stefania Verachi, Steven David Prestwich
PKDD
2010
Springer
169views Data Mining» more  PKDD 2010»
15 years 2 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 ...