Sciweavers

3643 search results - page 189 / 729
» Learning Submodular Functions
Sort
View
NIPS
1996
15 years 7 months ago
Multidimensional Triangulation and Interpolation for Reinforcement Learning
Dynamic Programming, Q-learning and other discrete Markov Decision Process solvers can be applied to continuous d-dimensional state-spaces by quantizing the state space into an arr...
Scott Davies
187
Voted
ITICSE
2004
ACM
15 years 12 months ago
SQLator: an online SQL learning workbench
SQL (Structured Query Language) is one of the essential topics in foundation databases courses in higher education. Due to its apparent simple syntax, learning to use the full pow...
Shazia Wasim Sadiq, Maria E. Orlowska, Wasim Sadiq...
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
15 years 10 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
15 years 10 months ago
Learning Monotone Decision Trees in Polynomial Time
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
Ryan O'Donnell, Rocco A. Servedio
FOCS
2008
IEEE
16 years 28 days ago
What Can We Learn Privately?
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi ...