Symmetry-Structured Neural Completion of Islamic Geometric Patterns from Sparse Control Geometry

• URL: http://arxiv.org/abs/2607.02573v1
• Date: Tue, 30 Jun 2026 11:12:12 GMT
• Title: Symmetry-Structured Neural Completion of Islamic Geometric Patterns from Sparse Control Geometry
• Abstract summary: Islamic geometric patterns are governed by exact rotational symmetry and strict construction rules.<n>This paper treats these rules as formal geometric knowledge and embeds them in a neural completion framework.
• Score: 0.5115559623386962
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Islamic geometric patterns are governed by exact rotational symmetry and strict construction rules. This paper treats these rules as formal geometric knowledge and embeds them in a neural completion framework, rather than leaving them to be learned statistically from data. Given sparse control geometry and a target symmetry order, the system completes the pattern as a vector graph by predicting edges and refinements of bounded curves over a candidate lattice whose edges are organised into rotational orbits under the cyclic group. Symmetry is enforced either by constraining predictions within these orbits or by projecting them onto them during inference. The orbit-tied variant provides a constructive guarantee: for any input and any orbit-level selection rule, it produces exact N-fold symmetry, preserves anchor points, and keeps all refinements within prescribed bounds. These properties are verified numerically. The study focuses on rotational symmetry, and all quantitative results are obtained from procedurally generated graphs inspired by Islamic geometric design rather than from a historical corpus. On clean inputs, enforcing exact validity produces no measurable loss in fidelity. When control geometry is missing, an unstructured decoder loses fidelity and breaks symmetry; retraining on corrupted inputs recovers much of the fidelity but not exact validity. Symmetry-structured inference, by contrast, keeps violations at zero throughout. The results show that augmentation and symmetry structure address distinct failure modes: augmentation improves fidelity under corruption, while symmetry structure guarantees validity. The framework therefore provides a knowledge-constrained, guarantee-backed approach to neural completion for scalable vector ornaments whose validity depends on exact geometric structure.

Related papers

• Exact-Form Regret for Gradient Descent, Mirror Descent and Follow-the-Regularized-Leader [46.31158375592562]
  Recent work shows that first-order methods control richer action-dependent deviations.<n>We ask for a geometric characterization of the deviations with respect to which online gradient descent, mirror descent, and follow-the-regularized-leader (FTRL) achieve no regret.
  arXiv  Detail & Related papers  (2026-09-08T21:32:02Z)
• Robust 3D Alignment of Generative Reconstructions via Partial Monocular Observations [46.983222121901235]
  Generative-to-Partial Monocular Observational Alignment is a critical but under-explored challenge in computer vision.<n>We propose a training-free and interpretable geometric alignment framework that grounds generative 3D priors via a 3D similarity transformation.<n>Experiments demonstrate that our method achieves stable and accurate registration, substantially outperforming both classical geometric pipelines and state-of-the-art learning-based baselines.
  arXiv  Detail & Related papers  (2026-07-01T06:30:47Z)
• Greedy Coordinate Diffusion: Effective and Semantically Coherent Adversarial Attacks via Diffusion Guidance [48.34904668359272]
  Adrial attacks on large language models have limited practical impact despite extensive research.<n>We introduce Greedy Coordinate Diffusion (GCD), a novel framework that efficiently generates adversarial attacks against safety-aligned models.<n>GCD maintains low perplexity and high semantic adherence to the adversary's original intent.
  arXiv  Detail & Related papers  (2026-06-14T01:18:53Z)
• The Geometry of Projection Heads: Conditioning, Invariance, and Collapse [0.0]
  We develop a geometric theory of projection heads in self-supervised learning.<n>We show that linear heads perform implicit subspace whitening, while nonlinear heads adapt local metrics to satisfy the specific topological constraints of the loss.
  arXiv  Detail & Related papers  (2026-05-16T22:32:05Z)
• Aligning Network Equivariance with Data Symmetry: A Theoretical Framework and Adaptive Approach for Image Restoration [71.51826063983434]
  Image restoration is an inherently ill posed inverse problem.<n>We use non strict symmetry as a constraint to formulate the restoration inverse problem.<n>We show that the equivariance error of the optimal restoration operator is strictly bounded by the data symmetry error and the discretization mesh size.
  arXiv  Detail & Related papers  (2026-05-13T16:22:19Z)
• The Geometric Alignment Tax: Tokenization vs. Continuous Geometry in Scientific Foundation Models [0.0]
  We identify the root cause: the Geometric Alignment Tax.<n>We evaluate 14 biological foundation models with rate-distortion theory and MINE.<n>No model achieves simultaneously low distortion, high mutual information, and global coherence.
  arXiv  Detail & Related papers  (2026-04-05T15:45:49Z)
• Harnessing Data Asymmetry: Manifold Learning in the Finsler World [53.951528511476994]
  We propose a Finsler manifold learning pipeline that constructs asymmetric dissimilarities and embeds in a Finsler space.<n>This greatly broadens the applicability of existing asymmetric embedders beyond traditionally directed data to any data.<n>On controlled synthetic and large real datasets, we show that our asymmetric pipeline reveals valuable information lost in the traditional pipeline.
  arXiv  Detail & Related papers  (2026-03-12T00:16:24Z)
• The Geometry of Alignment Collapse: When Fine-Tuning Breaks Safety [40.556122962771276]
  Fine-tuning language models on benign tasks unpredictably degrade safety guardrails.<n>We prove that alignment concentrates in low-dimensional subspaces with sharp curvature.<n>We formalize this mechanism through the Alignment Instability Condition.
  arXiv  Detail & Related papers  (2026-02-17T18:39:15Z)
• Statistical-Geometric Degeneracy in UAV Search: A Physics-Aware Asymmetric Filtering Approach [23.49656058107753]
  Post-disaster survivor localization using Unmanned Aerial Vehicles (UAVs) faces a fundamental physical challenge.<n>Unlike standard Gaussian noise, signal reflection from debris introduces strictly non-negative ranging biases.<n>Existing robust estimators, typically designed with symmetric loss functions, implicitly rely on the assumption of error symmetry.<n>We propose a physically-grounded solution, the AsymmetricHuberEKF, which explicitly incorporates the non-negative physical prior of NLOS biases.
  arXiv  Detail & Related papers  (2026-02-11T08:33:56Z)
• Riemannian Zeroth-Order Gradient Estimation with Structure-Preserving Metrics for Geodesically Incomplete Manifolds [57.179679246370114]
  We construct metrics that are geodesically complete while ensuring that every stationary point under the new metric remains stationary under the original one.<n>An $$-stationary point under the constructed metric $g'$ also corresponds to an $$-stationary point under the original metric $g'$.<n>Experiments on a practical mesh optimization task demonstrate that our framework maintains stable convergence even in the absence of geodesic completeness.
  arXiv  Detail & Related papers  (2026-01-12T22:08:03Z)
• Exploring Data Geometry for Continual Learning [64.4358878435983]
  We study continual learning from a novel perspective by exploring data geometry for the non-stationary stream of data. Our method dynamically expands the geometry of the underlying space to match growing geometric structures induced by new data. Experiments show that our method achieves better performance than baseline methods designed in Euclidean space.
  arXiv  Detail & Related papers  (2023-04-08T06:35:25Z)
• Understanding Graph Neural Networks with Generalized Geometric Scattering Transforms [67.88675386638043]
  The scattering transform is a multilayered wavelet-based deep learning architecture that acts as a model of convolutional neural networks. We introduce windowed and non-windowed geometric scattering transforms for graphs based upon a very general class of asymmetric wavelets. We show that these asymmetric graph scattering transforms have many of the same theoretical guarantees as their symmetric counterparts.
  arXiv  Detail & Related papers  (2019-11-14T17:23:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.