Sciweavers

3049 search results - page 461 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
ICIP
1997
IEEE
16 years 5 months ago
Complexity-Regularized Image Denoising
We develop a new approach to image denoising based on complexity regularization. This technique presents a flexible alternative to the more conventional l2 , l1 , and Besov regula...
Juan Liu, Pierre Moulin
ICML
2006
IEEE
16 years 5 months ago
PAC model-free reinforcement learning
For a Markov Decision Process with finite state (size S) and action spaces (size A per state), we propose a new algorithm--Delayed Q-Learning. We prove it is PAC, achieving near o...
Alexander L. Strehl, Lihong Li, Eric Wiewiora, Joh...
ICML
2009
IEEE
15 years 11 months ago
Online learning by ellipsoid method
In this work, we extend the ellipsoid method, which was originally designed for convex optimization, for online learning. The key idea is to approximate by an ellipsoid the classi...
Liu Yang, Rong Jin, Jieping Ye
ICRA
2008
IEEE
288views Robotics» more  ICRA 2008»
15 years 10 months ago
Human tracking and segmentation supported by silhouette-based gait recognition
— Gait recognition has recently gained attention as an effective approach to identify individuals at a distance from a camera. Most existing gait recognition algorithms assume th...
Junqiu Wang, Yasushi Makihara, Yasushi Yagi
GECCO
2003
Springer
101views Optimization» more  GECCO 2003»
15 years 9 months ago
An Analysis of a Reordering Operator with Tournament Selection on a GA-Hard Problem
This paper analyzes the performance of a genetic algorithm that utilizes tournament selection, one-point crossover, and a reordering operator. A model is proposed to describe the c...
Ying-Ping Chen, David E. Goldberg