We show that the Balanced Minimum Evolution Problem (BMEP) is a cross-entropy minimization problem. This new perspective both extends the previous interpretations of the BMEP length function described in the literature and enables the identification of an efficiently computable family of lower bounds on the value of the optimal solution to the problem.
We show that the Balanced Minimum Evolution Problem (BMEP) is a cross-entropy minimization problem. This new perspective both extends the previous interpretations of the BMEP length function described in the literature and enables the identification of an efficiently computable family of lower bounds on the value of the optimal solution to the problem. (C) 2020 Elsevier B.V. All rights reserved.
An Information Theory Perspective on the Balanced Minimum Evolution Problem
Raffaele Pesenti;
2020
Abstract
We show that the Balanced Minimum Evolution Problem (BMEP) is a cross-entropy minimization problem. This new perspective both extends the previous interpretations of the BMEP length function described in the literature and enables the identification of an efficiently computable family of lower bounds on the value of the optimal solution to the problem.
| File | Dimensione | Formato | |
|---|---|---|---|
|
ORL200212DC.pdf
non disponibili
Descrizione: post-print
Tipologia:
Documento in Post-print
Licenza:
Accesso chiuso-personale
Dimensione
133.39 kB
Formato
Adobe PDF
|
133.39 kB | Adobe PDF | Visualizza/Apri |
I documenti in ARCA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
