Sciweavers

180 search results - page 29 / 36
» Improved bounds on the sample complexity of learning
Sort
View
ECCV
2006
Springer
14 years 9 months ago
Inter-modality Face Recognition
Recently, the wide deployment of practical face recognition systems gives rise to the emergence of the inter-modality face recognition problem. In this problem, the face images in ...
Dahua Lin, Xiaoou Tang
NN
2010
Springer
125views Neural Networks» more  NN 2010»
13 years 5 months ago
Parameter-exploring policy gradients
We present a model-free reinforcement learning method for partially observable Markov decision problems. Our method estimates a likelihood gradient by sampling directly in paramet...
Frank Sehnke, Christian Osendorfer, Thomas Rü...
CRYPTO
2001
Springer
111views Cryptology» more  CRYPTO 2001»
13 years 12 months ago
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
Ronald Cramer, Ivan Damgård, Serge Fehr
CVPR
2005
IEEE
14 years 9 months ago
Subspace Analysis Using Random Mixture Models
In [1], three popular subspace face recognition methods, PCA, Bayes, and LDA were analyzed under the same framework and an unified subspace analysis was proposed. However, since t...
Xiaogang Wang, Xiaoou Tang
UAI
2003
13 years 8 months ago
On Information Regularization
We formulate a principle for classification with the knowledge of the marginal distribution over the data points (unlabeled data). The principle is cast in terms of Tikhonov styl...
Adrian Corduneanu, Tommi Jaakkola