125
Voted
COLT
15 years 4 months ago
1995 Springer
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...
119
Voted
COLT
15 years 4 months ago
1995 Springer 112
click to vote
COLT
15 years 4 months ago
1995 Springer
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
111
click to vote
COLT
15 years 4 months ago
1995 Springer
The Noise Sensitivity Signature (NSS), originally introduced by Grossman and Lapedes (1993), was proposed as an alternative to cross validation for selecting network complexity. I...
107
click to vote
COLT
15 years 4 months ago
1995 Springer
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...
|