Sciweavers

98
Voted
COLT
1995
Springer
15 years 11 days ago
A Comparison of New and Old Algorithms for a Mixture Estimation Problem
We investigate the problem of estimating the proportion vector which maximizes the likelihood of a given sample for a mixture of given densities. We adapt a framework developed for...
David P. Helmbold, Yoram Singer, Robert E. Schapir...
COLT
1995
Springer
15 years 11 days ago
Reductions for Learning via Queries
William I. Gasarch, Geoffrey R. Hird
COLT
1995
Springer
15 years 11 days ago
On Learning Bounded-Width Branching Programs
In this paper, we study PAC-leaming algorithms for specialized classes of deterministic finite automata (DFA). Inpartictdar, we study branchingprogrsms, and we investigate the int...
Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
69
Voted
COLT
1995
Springer
15 years 11 days ago
Learning with Unreliable Boundary Queries
We introduce a new model for learning with membership queries in which queries near the boundary of a target concept may receive incorrect or “don’t care” responses. In part...
Avrim Blum, Prasad Chalasani, Sally A. Goldman, Do...
COLT
1995
Springer
15 years 11 days ago
Online Learning via Congregational Gradient Descent
Kim L. Blackmore, Robert C. Williamson, Iven M. Y....
COLT
1995
Springer
15 years 11 days ago
Learning Internal Representations
Jonathan Baxter