Sciweavers

2623 search results - page 168 / 525
» Universal Learning Theory
Sort
View
134
Voted
CORR
2010
Springer
92views Education» more  CORR 2010»
15 years 4 months ago
Hardness Results for Agnostically Learning Low-Degree Polynomial Threshold Functions
Hardness results for maximum agreement problems have close connections to hardness results for proper learning in computational learning theory. In this paper we prove two hardnes...
Ilias Diakonikolas, Ryan O'Donnell, Rocco A. Serve...
LATA
2009
Springer
15 years 11 months ago
Hypothesis Spaces for Learning
In this paper we survey some results in inductive inference showing how learnability of a class of languages may depend on hypothesis space chosen. We also discuss results which co...
Sanjay Jain
129
Voted
NIPS
2001
15 years 6 months ago
Rates of Convergence of Performance Gradient Estimates Using Function Approximation and Bias in Reinforcement Learning
We address two open theoretical questions in Policy Gradient Reinforcement Learning. The first concerns the efficacy of using function approximation to represent the state action ...
Gregory Z. Grudic, Lyle H. Ungar
AI
2007
Springer
15 years 4 months ago
If multi-agent learning is the answer, what is the question?
The area of learning in multi-agent systems is today one of the most fertile grounds for interaction between game theory and artificial intelligence. We focus on the foundational...
Yoav Shoham, Rob Powers, Trond Grenager
120
Voted
BRAIN
2009
Springer
15 years 11 months ago
Data Explosion, Data Nature and Dataology
The essence of computer applications is to store things in the real world into computer systems in the form of data, i.e., it is a process of producing data. Some data are the reco...
Yangyong Zhu, Ning Zhong, Yun Xiong