Abstract

In this paper, a novel information geometric-based variable selection criterion for multi-layer perceptron networks is described. It is based on projections of the Riemannian manifold defined by a multi-layer perceptron network on submanifolds defined by multi-layer perceptron networks with reduced input dimension. We show how the divergence between models can be used as a criterion for an efficient search in the space of networks with different inputs. Then, we show how the posterior probabilities of the models can be evaluated to rank the projected models. Finally, we test our algorithm on synthetic and real data, and compare its performances with other methods reported in literature.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.