Criteria for optimizing cortical hierarchies with continuous ranges

• Main Authors: Antje Krumnack, Andrew T Reid, Egon Wanke, Gleb Bezgin, Rolf Kötter
• Format: Article
• Language: English
• Published: Frontiers Media S.A. 2010-03-01
• Series: Frontiers in Neuroinformatics
• Subjects: connectivity; hierarchy; linear programming; macaque; mixed integer programming; optimality
• Online Access: http://journal.frontiersin.org/Journal/10.3389/fninf.2010.00007/full

In a recent paper (Reid et al.; 2009, NeuroImage) we introduced a method to calculate optimal hierarchies in the visual network that utilizes continuous, rather than discrete, hierarchical levels, and permits a range of acceptable values rather than attempting to fit fixed hierarchical distances. There, to obtain a hierarchy, the sum of deviations from the constraints that define the hierarchy was minimized using linear optimization. In the short time since publication of that paper we noticed that many colleagues misinterpreted the meaning of the term optimal hierarchy. In particular, a majority of them were under the impression that there was perhaps only one optimal hierarchy, but a substantial difficulty in finding that one. However, there is not only more than one optimal hierarchy but also more than one option for defining optimality. Continuing the line of this work we look at additional options for optimizing the visual hierarchy: minimizing the number of violated constraints and minimizing the maximal size of a constraint violation using linear optimization and mixed integer programming. The implementation of both optimization criteria is explained in detail. In addition, using constraint sets based on the data from Felleman and Van Essen, optimal hierarchies for the visual network are calculated for both optimization methods.