3422 search results - page 65 / 685 » Random Subset Optimization |
ICML
2006
IEEE
16 years 3 months ago
2006
IEEE
We apply Stochastic Meta-Descent (SMD), a stochastic gradient optimization method with gain vector adaptation, to the training of Conditional Random Fields (CRFs). On several larg...
116
click to vote
ICARIS
2003
Springer
15 years 7 months ago
2003
Springer
This paper presents a real-valued negative selection algorithm with good mathematical foundation that solves some of the drawbacks of our previous approach [11]. Specifically, it ...
99
Voted
NIPS
2007
15 years 3 months ago
2007
We combine three threads of research on approximate dynamic programming: sparse random sampling of states, value function and policy approximation using local models, and using lo...
SIAMJO
2008
15 years 2 months ago
2008
We consider random approximations to deterministic optimization problems. The objective function and the constraint set can be approximated simultaneously. Relying on concentratio...
116
click to vote
DICTA
2003
15 years 3 months ago
2003
In this paper, we propose a robust method to estimate the fundamental matrix in the presence of outliers. The new method uses random minimum subsets as a search engine to find inli...