paper-with-me

홈 › Papers

WavePhaseNet: A DFT-Based Method for Constructing Semantic Conceptual Hierarchy Structures (SCHS)

2026-02-16 · Kiyotaka Kasubuchi, Kazuo Fukiya arxiv

This paper reformulates Transformer/Attention mechanisms in Large Language Models (LLMs) through measure theory and frequency analysis, theoretically demonstrating that hallucination is an inevitable structural limitation. The embedding space functions as a conditional expectation over a σ-algebra, and its failure to be isomorphic to the semantic truth set fundamentally causes logical consistency breakdown. WavePhaseNet Method The authors propose WavePhaseNet, which explicitly constructs a Semantic Conceptual Hierarchy Structure (SCHS) using Discrete Fourier Transform (DFT). By applying DFT along the sequence dimension, semantic information is decomposed into frequency bands: low-frequency components capture global meaning and intent, while high-frequency components represent local syntax and expression. This staged separation enables precise semantic manipulation in diagonalized space. Dimensionality Reduction GPT-4's 24,576-dimensional embedding space exhibits a 1/f spectral structure based on language self-similarity and Zipf's law. Through cumulative energy analysis, the authors derive that approximately 3,000 dimensions constitute the lower bound for "complete representation." This demonstrates that reduction from 24,576 to 3,000 dimensions preserves meaning and intent while enabling rigorous reasoning and suppressing hallucination. Cohomological Consistency Control The reduced embedding space, constructed via cohomological regularization over overlapping local windows, allows defining a graph structure and cochain complex. This quantifies inconsistencies among local inferences as coboundary-based losses. Applying harmonic projection based on Hodge theory positions cohomology as a computable regularization principle for controlling semantic consistency, extracting maximally consistent global representations.

📄 PDF Abstract BibTeX arXiv:2602.14419

Code (0)

등록된 구현이 없습니다.

Tasks

Dimensionality Reduction

Similar Papers 제목 키워드 기반

Introducer Concepts in n-Dimensional Contexts

2018-02-12 · Giacomo Kahn, Alexandre Bazin

Concept lattices are well-known conceptual structures that organise interesting patterns-the concepts-extracted from data. In some applications, such as software engineering or data mining, the size of the lattice can be…

Constructing a Hierarchical User Interest Structure based on User Profiles

2017-09-20 · Chao Zhao, Min Zhao, Yi Guan

The interests of individual internet users fall into a hierarchical structure which is useful in regards to building personalized searches and recommendations. Most studies on this subject construct the interest hierarch…

Event Ontology Expansion via LLM-Based Conceptualization

2026-06-19 · Weicheng Ren, Zixuan Li, Long Bai, Xiaolong Jin 외 arxiv

Event ontology expansion aims to discover emerging event types from data and extend them to appropriate positions in the existing event ontology.. Existing methods typically cluster contextualized trigger representations…

Hierarchical Linkage Clustering Beyond Binary Trees and Ultrametrics

2025-11-22 · Maximilien Dreveton, Matthias Grossglauser, Daichi Kuroda, Patrick Thiran arxiv

Hierarchical clustering seeks to uncover nested structures in data by constructing a tree of clusters, where deeper levels reveal finer-grained relationships. Traditional methods, including linkage approaches, face three…

BIVA: A Very Deep Hierarchy of Latent Variables for Generative Modeling

2019-02-06 · NeurIPS 2019 12 · Lars Maaløe, Marco Fraccaro, Valentin Liévin, Ole Winther

With the introduction of the variational autoencoder (VAE), probabilistic latent variable models have received renewed attention as powerful generative models. However, their performance in terms of test likelihood and q…

Anomaly DetectionAttributeImage Generation