2520 search results - page 11 / 504 » The complexity of approximating entropy |
CORR
2006
Springer
13 years 9 months ago
2006
Springer
In this paper, both non-mixing and mixing local minima of the entropy are analyzed from the viewpoint of blind source separation (BSS); they correspond respectively to acceptable a...
NECO
2010
13 years 8 months ago
2010
In this paper we develop a novel generalization bound for learning the kernel problem. First, we show that the generalization analysis of the kernel learning problem reduces to in...
APPROX
2006
Springer
14 years 1 months ago
2006
Springer
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
ACL
1998
13 years 11 months ago
1998
Maximum entropy framework proved to be expressive and powerful for the statistical language modelling, but it suffers from the computational expensiveness of the model building. T...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
One of the main difficulties in computing information theoretic learning (ITL) estimators is the computational complexity that grows quadratically with data. Considerable amount ...