Sciweavers

329 search results - page 4 / 66
» Probably Approximately Correct Learning
Sort
View
FCT
2007
Springer
13 years 11 months ago
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
Gábor Erdélyi, Lane A. Hemaspaandra,...
NIPS
2007
13 years 9 months ago
The Tradeoffs of Large Scale Learning
This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for...
Léon Bottou, Olivier Bousquet
ICDAR
2009
IEEE
13 years 5 months ago
Low Cost Correction of OCR Errors Using Learning in a Multi-Engine Environment
We propose a low cost method for the correction of the output of OCR engines through the use of human labor. The method employs an error estimator neural network that learns to as...
Ahmad Abdulkader, Mathew R. Casey
COLT
1992
Springer
13 years 11 months ago
Toward Efficient Agnostic Learning
In this paper we initiatean investigationof generalizationsof the ProbablyApproximatelyCorrect (PAC) learningmodelthat attemptto significantlyweakenthe target functionassumptions.T...
Michael J. Kearns, Robert E. Schapire, Linda Selli...
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
13 years 11 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...