Sciweavers

509 search results - page 29 / 102
» Using Learning for Approximation in Stochastic Processes
Sort
View
110
Voted
EACL
2006
ACL Anthology
15 years 4 months ago
Online Learning of Approximate Dependency Parsing Algorithms
In this paper we extend the maximum spanning tree (MST) dependency parsing framework of McDonald et al. (2005c) to incorporate higher-order feature representations and allow depen...
Ryan T. McDonald, Fernando C. N. Pereira
114
Voted
ICIP
2010
IEEE
15 years 15 days ago
Stochastic gradient descent for robust inverse photomask synthesis in optical lithography
Optical lithography is a critical step in the semiconductor manufacturing process, and one key problem is the design of the photomask for a particular circuit pattern, given the o...
Ningning Jia, Edmund Y. Lam
HYBRID
2004
Springer
15 years 8 months ago
Stochastic Hybrid Systems: Application to Communication Networks
We propose a model for Stochastic Hybrid Systems (SHSs) where transitions between discrete modes are triggered by stochastic events much like transitions between states of a contin...
João P. Hespanha
123
Voted
ECML
2006
Springer
15 years 6 months ago
Approximate Policy Iteration for Closed-Loop Learning of Visual Tasks
Abstract. Approximate Policy Iteration (API) is a reinforcement learning paradigm that is able to solve high-dimensional, continuous control problems. We propose to exploit API for...
Sébastien Jodogne, Cyril Briquet, Justus H....
141
Voted
JMLR
2006
124views more  JMLR 2006»
15 years 2 months ago
Policy Gradient in Continuous Time
Policy search is a method for approximately solving an optimal control problem by performing a parametric optimization search in a given class of parameterized policies. In order ...
Rémi Munos