Sciweavers

5109 search results - page 24 / 1022
» On Learning Limiting Programs
Sort
View
SIGECOM
2009
ACM
114views ECommerce» more  SIGECOM 2009»
14 years 4 months ago
Policy teaching through reward function learning
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...
Haoqi Zhang, David C. Parkes, Yiling Chen
JMLR
2012
12 years 9 days ago
Age-Layered Expectation Maximization for Parameter Learning in Bayesian Networks
The expectation maximization (EM) algorithm is a popular algorithm for parameter estimation in models with hidden variables. However, the algorithm has several non-trivial limitat...
Avneesh Singh Saluja, Priya Krishnan Sundararajan,...
ANOR
2011
175views more  ANOR 2011»
13 years 4 months ago
Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection
A vital task facing government agencies and commercial organizations that report data is to represent the data in a meaningful way and simultaneously to protect the confidentialit...
Fred Glover, Lawrence H. Cox, Rahul Patil, James P...
CORR
2008
Springer
72views Education» more  CORR 2008»
13 years 10 months ago
Inferring Company Structure from Limited Available Information
: In this paper we present several algorithmic techniques for inferring the structure of a company when only a limited amount of information is available. We consider problems with...
Mugurel Ionut Andreica, Angela Andreica, Romulus A...
COLT
1999
Springer
14 years 2 months ago
On a Generalized Notion of Mistake Bounds
This paper proposes the use of constructive ordinals as mistake bounds in the on-line learning model. This approach elegantly generalizes the applicability of the on-line mistake ...
Sanjay Jain, Arun Sharma