Back to Results
First PageMeta Content
Mathematical notation / Mathematics / Entropy / Probably approximately correct learning / Applied mathematics / Analysis of algorithms / Asymptotic analysis / Big O notation


A Bound on the Label Complexity of Agnostic Active Learning Steve Hanneke [removed] Machine Learning Department, Carnegie Mellon University, Pittsburgh, PA[removed]USA
Add to Reading List

Document Date: 2008-12-01 11:24:55


Open Document

File Size: 209,11 KB

Share Result on Facebook

City

Mitter / /

Company

Oracle / John Wiley & Sons Inc. / Intelligent Control Systems / Neural Networks / /

Currency

pence / /

/

Facility

Carnegie Mellon University / /

Holiday

Commonwealth Day / /

IndustryTerm

agnostic active learning algorithm / correct agnostic algorithm / realizable learning algorithm / active learning algorithm / binary search / learning algorithm / learning applications / correct agnostic learning algorithm / /

Organization

Center for Intelligent Control Systems / Carnegie Mellon University / Pittsburgh / Association for Computing Machinery / /

Person

Nina Balcan / /

Position

author / /

ProgrammingLanguage

C / K / /

ProvinceOrState

S. K. / Pennsylvania / /

PublishedMedium

Machine Learning / /

Technology

realizable learning algorithm / learning algorithm / agnostic active learning algorithm / active learning algorithm / correct agnostic algorithm / Machine Learning / correct agnostic learning algorithm / A2 algorithm / /

SocialTag