Sciweavers

70 search results - page 10 / 14
» Adaptive Importance Sampling Technique for Markov Chains Usi...
Sort
View
ICML
2010
IEEE
13 years 8 months ago
Particle Filtered MCMC-MLE with Connections to Contrastive Divergence
Learning undirected graphical models such as Markov random fields is an important machine learning task with applications in many domains. Since it is usually intractable to learn...
Arthur Asuncion, Qiang Liu, Alexander T. Ihler, Pa...
NIPS
2001
13 years 8 months ago
Variance Reduction Techniques for Gradient Estimates in Reinforcement Learning
Policy gradient methods for reinforcement learning avoid some of the undesirable properties of the value function approaches, such as policy degradation (Baxter and Bartlett, 2001...
Evan Greensmith, Peter L. Bartlett, Jonathan Baxte...
CLIMA
2011
12 years 7 months ago
Verifying Team Formation Protocols with Probabilistic Model Checking
Multi-agent systems are an increasingly important software paradigm and in many of its applications agents cooperate to achieve a particular goal. This requires the design of effi...
Taolue Chen, Marta Z. Kwiatkowska, David Parker, A...
ECML
2006
Springer
13 years 11 months ago
Sequence Discrimination Using Phase-Type Distributions
Abstract We propose in this paper a novel approach to the classification of discrete sequences. This approach builds a model fitting some dynamical features deduced from the learni...
Jérôme Callut, Pierre Dupont
ICCAD
1997
IEEE
121views Hardware» more  ICCAD 1997»
13 years 11 months ago
Adaptive methods for netlist partitioning
An algorithm that remains in use at the core of many partitioning systems is the Kernighan-Lin algorithm and a variant the Fidducia-Matheysses (FM) algorithm. To understand the FM...
Wray L. Buntine, Lixin Su, A. Richard Newton, Andr...