Emergent Complexity over Symbolic Simplicity: Inductive Bias and Structural Failure in GANs

Generative Adversarial Networks (GANs) perform well on natural images but often fail in domains governed by strict geometric or symbolic constraints. This work focuses on convolutional GANs and studies how their inductive biases interact with two contrasting types of synthetic image data: fractal patterns, characterized by self-similarity and scale-invariant local structure, and Euclidean shapes, defined by simple geometric primitives and rigid global constraints. Using multiple convolutional GAN architectures (DCGAN, WGAN-GP, and SNGAN), two resolutions (64 × 64 and 128 × 128), and a suite of evaluation metrics, we compare adversarial training behavior on these datasets under tightly controlled conditions. Fractal datasets yield stable training dynamics and perceptually plausible generations, whereas Euclidean shape datasets consistently exhibit structural failure modes that persist under higher resolution, smoother shape representations, and architectural stabilization. Geometry-aware metrics reveal severe violations of global shape consistency in Euclidean outputs that are not reliably captured by standard perceptual or distributional measures such as FID, SSIM, or LPIPS. We argue that these findings reflect a fundamental inductive bias of convolutional generative models toward a locally rich, scale-repeating structure rather than globally constrained geometry. Rather than indicating that fractals are intrinsically easier to model, our results show that Euclidean geometry exposes limitations of adversarial generative learning that remain hidden under conventional evaluation. From this perspective, fractal datasets serve as informative diagnostic benchmarks for probing how adversarially trained convolutional generators handle scale-invariant structure versus globally constrained geometry, and our results highlight the need for domain-aware metrics and alternative architectural biases when applying generative models to structured or symbolic data.

Authors

Institutions

Publication Details

Journal
Fractal and Fractional
Published
2026-02-23
DOI
https://doi.org/10.3390/fractalfract10020133
Primary Topic
Generative Adversarial Networks and Image Synthesis
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Emergent Complexity over Symbolic Simplicity: Inductive Bias and Structural Failure in GANs

Maricel Agop, Lucian Dobreci, Diana Carmen Mirila, Florin Nedeff et al.
Fractal and Fractional
Generative Adversarial Networks and Image Synthesis
article

Emergent Complexity over Symbolic Simplicity: Inductive Bias and Structural Failure in GANs

Maricel Agop, Lucian Dobreci, Diana Carmen Mirila, Florin Nedeff, Oana Rusu, Valentin Nedeff, Călin Gheorghe Buzea
article en

Abstract

Generative Adversarial Networks (GANs) perform well on natural images but often fail in domains governed by strict geometric or symbolic constraints. This work focuses on convolutional GANs and studies how their inductive biases interact with two contrasting types of synthetic image data: fractal patterns, characterized by self-similarity and scale-invariant local structure, and Euclidean shapes, defined by simple geometric primitives and rigid global constraints. Using multiple convolutional GAN architectures (DCGAN, WGAN-GP, and SNGAN), two resolutions (64 × 64 and 128 × 128), and a suite of evaluation metrics, we compare adversarial training behavior on these datasets under tightly controlled conditions. Fractal datasets yield stable training dynamics and perceptually plausible generations, whereas Euclidean shape datasets consistently exhibit structural failure modes that persist under higher resolution, smoother shape representations, and architectural stabilization. Geometry-aware metrics reveal severe violations of global shape consistency in Euclidean outputs that are not reliably captured by standard perceptual or distributional measures such as FID, SSIM, or LPIPS. We argue that these findings reflect a fundamental inductive bias of convolutional generative models toward a locally rich, scale-repeating structure rather than globally constrained geometry. Rather than indicating that fractals are intrinsically easier to model, our results show that Euclidean geometry exposes limitations of adversarial generative learning that remain hidden under conventional evaluation. From this perspective, fractal datasets serve as informative diagnostic benchmarks for probing how adversarially trained convolutional generators handle scale-invariant structure versus globally constrained geometry, and our results highlight the need for domain-aware metrics and alternative architectural biases when applying generative models to structured or symbolic data.

Fractal and FractionalVol. 10(2)
Grigore T. Popa University of Medicine and Pharmacy (RO), Academia Oamenilor de Știință din România (RO), Gheorghe Asachi Technical University of Iași (RO), University of Bacău (RO), National Institute of Research and Development for Technical Physics (RO)
Openalex Percentile: Top 48%
Generative Adversarial Networks and Image Synthesis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.