Some characteristics of complex networks need to be derived from global knowledge of the network topologies, which challenges the practice for studying many large-scale real-world networks. Recently, the geometric renormalization technique has provided a good approximation framework to significantly reduce the size and complexity of a network while retaining its "slow" degrees of freedom. However, due to the finite-size effect of real networks, excessive renormalization iterations will eventually cause these important "slow" degrees of freedom to be filtered out. In this paper, we systematically investigate the finite-size scaling of structural and dynamical observables in geometric renormalization flows of both synthetic and real evolutionary networks. Our results show that these observables can be well characterized by a certain scaling function. Specifically, we show that the critical exponent implied by the scaling function is independent of these observables but depends only on the structural properties of the network. To a certain extent, the results of this paper are of great significance for predicting the observable quantities of large-scale real systems and further suggest that the potential scale invariance of many real-world networks is often masked by finite-size effects.