Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ ZENODOarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Review
Data sources: ZENODO
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Emergent Hybrid Computation in Gradient-Free Evolutionary Networks

Authors: Miller, Payton;

Emergent Hybrid Computation in Gradient-Free Evolutionary Networks

Abstract

This paper analyzes the representational structures that emerge in neural networks trained via evolutionary selection rather than gradient-based optimization. While standard deep learning avoids saturation due to the vanishing gradient problem, gradient-free evolution demonstrates that saturation serves as a functional mechanism for discovering hybrid digital-analog representations. We formalize this as a partitioned state space where k saturated neurons establish discrete operational modes, while n-k continuous neurons facilitate fine-grained modulation. Through systematic experimentation across 13 configurations, we empirically validate that saturation emerges when networks must selectively attend to a subset of available inputs. Our results demonstrate that evolution dynamically allocates k based on task demands, achieving k=0 for clean continuous tasks where all inputs are relevant, and k→n when selective filtering becomes necessary

Powered by OpenAIRE graph
Found an issue? Give us feedback