More Data Cannot Break a Symmetry: Identifiability by Design

• URL: http://arxiv.org/abs/2608.27651v1
• Date: Thu, 27 Aug 2026 19:38:09 GMT
• Title: More Data Cannot Break a Symmetry: Identifiability by Design
• Abstract summary: Unsupervised representational alignment recovers a stimulus-by-stimulus correspondence from geometry alone.<n>The automorphism group of the stimulus geometry bounds what any such alignment can identify, before data exist.<n>We turn this known in geometry into a design-time diagnostic and intervention.
• Score: 13.778717173535577
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Unsupervised representational alignment recovers a stimulus-by-stimulus correspondence from geometry alone, but the automorphism group of the stimulus geometry bounds what any such alignment can identify, before data exist. The obvious diagnostic for this degeneracy, the cheapest non-identity relabelling, ranks two published designs in the wrong order, because dense sampling creates near-duplicates whose transposition is nearly free. We turn this known invariance (Demetci et al., 2024) into a design-time diagnostic and intervention. In colour, where candidate geometries have closed form, we show that the failure is structural: sixty-four times the restart budget leaves a symmetric design unmoved while an asymmetric set at the same N recovers every time. Discriminating representational models and recovering a correspondence are essentially uncorrelated objectives (r = -0.02 over 3,000 subsets). Choosing nine colours by this diagnostic alone, without consulting any learned representation, moves all 93 model representations away from the degenerate point and cuts catastrophic alignment failures from 75% to 2% with the models, the layers, N and the solver all held fixed. The same risk arises wherever a regular design meets its candidate geometry's isometry group, including evenly spaced orientations, tones, or motion directions, and the check costs one function call before data collection.

Related papers

• Intrinsic Structure: Spectral Identifiability for Mechanistic Interpretability [51.56484100374058]
  We prove the first identifiability theorem for a mechanistic-interpretability primitive.<n>The spectrum is an identifiable, model-intrinsic fingerprint with a stated error bar, not a legible decomposition.
  arXiv  Detail & Related papers  (2026-08-10T19:42:01Z)
• Automorphism-Induced Non-Canonicity in Top-k Explanations of Graph Neural Networks [7.541234468065092]
  A gradient-based GNN explainer given a molecule with two chemically equivalent nitro groups assigns them attribution scores that are equal to the last bit.<n>Yet the standard report, the top-k edges, names one of the two, and which one is settled by the order of an array.<n>We show this is a structural obstruction rather than an implementation slip.
  arXiv  Detail & Related papers  (2026-07-28T23:36:05Z)
• Beyond ICA: Identifiability by Symmetry Breaking [0.15229257192293197]
  We prove the identifiability of deep generative models (DGMs) with piecewise-affine (PWA) decoders and Gaussian mixture model (GMM) priors.<n>We introduce three algebraic contrast principles for symmetry breaking.<n>Results form a hierarchy: from law identifiability (LID; latent distribution up to a global affine map) through map identifiability (MID; decoder up to the same map) to posterior and pointwise identifiability.
  arXiv  Detail & Related papers  (2026-07-25T12:27:10Z)
• Symmetry-Structured Neural Completion of Islamic Geometric Patterns from Sparse Control Geometry [0.5115559623386962]
  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.
  arXiv  Detail & Related papers  (2026-06-30T11:12:12Z)
• Nonlinear Geometrizability of State-Dependent Proto-Area in Approximate Holographic Codes [0.0]
  State-dependent proto-area data produced by approximate recovery need not be compatible with a single local bulk metric.<n>We derive exact finite-resolution criteria and, near the hyperbolic disk, necessary and sufficient conditions for a regular proto-area two-jet.<n>Hamiltonian-skewed codes realize both first-order nongeometry and a calibrated response whose first obstruction appears only at quadratic order.
  arXiv  Detail & Related papers  (2026-06-21T17:16:10Z)
• 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)
• CaricHarmony: Contrastive Diffusion Paths for Identity-Preserving Caricature Synthesis [49.596677723190886]
  Sketch-based caricature synthesis suffers from a fundamental failure mode.<n>Identity and shape conditions are combined in diffusion models, causing collapse toward bland portraits or unrecognizable distortions.<n>We present CaricHarmony, the first training-free method that explicitly resolves this contamination through parallel uncontaminated diffusion paths.
  arXiv  Detail & Related papers  (2026-06-11T22:57:59Z)
• Geometric Deviation as an Unsupervised Pre-Generation Reliability Signal: Probing LLM Representations for Answerability [0.0]
  A reliable language model should be able to signal, prior to generation, when a query falls outside its knowledge.<n>We investigate whether representation geometry can provide such a pre-generation signal by measuring the deviation of hidden states from an answerable reference set.
  arXiv  Detail & Related papers  (2026-05-04T22:24:34Z)
• SpatialEvo: Self-Evolving Spatial Intelligence via Deterministic Geometric Environments [75.60795462502949]
  SpatialEvo is a self-evolving framework for 3D spatial reasoning.<n>It formalizes 16 spatial reasoning task categories under explicit geometric validation rules.<n>It converts unannotated 3D scenes into zero-noise interactive oracles, replacing model consensus with objective physical feedback.
  arXiv  Detail & Related papers  (2026-04-15T17:59:12Z)
• Beyond Inference Intervention: Identity-Decoupled Diffusion for Face Anonymization [55.29071072675132]
  Face anonymization aims to conceal identity information while preserving non-identity attributes.<n>We propose textbfIDsuperscript2Face, a training-centric anonymization framework.<n>We show that IDtextsuperscript2Face outperforms existing methods in visual quality, identity suppression, and utility preservation.
  arXiv  Detail & Related papers  (2025-10-28T09:28:12Z)
• Disentangled Representation Learning with the Gromov-Monge Gap [65.73194652234848]
  Learning disentangled representations from unlabelled data is a fundamental challenge in machine learning.<n>We introduce a novel approach to disentangled representation learning based on quadratic optimal transport.<n>We demonstrate the effectiveness of our approach for quantifying disentanglement across four standard benchmarks.
  arXiv  Detail & Related papers  (2024-07-10T16:51:32Z)
• Detecting and Identifying Selection Structure in Sequential Data [53.24493902162797]
  We argue that the selective inclusion of data points based on latent objectives is common in practical situations, such as music sequences. We show that selection structure is identifiable without any parametric assumptions or interventional experiments. We also propose a provably correct algorithm to detect and identify selection structures as well as other types of dependencies.
  arXiv  Detail & Related papers  (2024-06-29T20:56:34Z)

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.