Symmetrical SyncMap for Imbalanced General Chunking Problems
원문 초록
Recently, SyncMap pioneered an approach to learn complex structures from sequences as well as adapt to any changes in underlying structures. This is achieved by using only nonlinear dynamical equations inspired by neuron group behaviors, i.e., without loss functions. Here we propose Symmetrical SyncMap that goes beyond the original work to show how to create dynamical equations and attractor-repeller points which are stable over the long run, even dealing with imbalanced continual general chunking problems (CGCPs). The main idea is to apply equal updates from negative and positive feedback loops by symmetrical activation. We then introduce the concept of memory window to allow for more positive updates. Our algorithm surpasses or ties other unsupervised state-of-the-art baselines in all 12 imbalanced CGCPs with various difficulties, including dynamically changing ones. To verify its performance in real-world scenarios, we conduct experiments on several well-studied structure learning problems. The proposed method surpasses substantially other methods in 3 out of 4 scenarios, suggesting that symmetrical activation plays a critical role in uncovering topological structures and even hierarchies encoded in temporal data.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
cAST: Enhancing Code Retrieval-Augmented Generation with Structural Chunking via Abstract Syntax Tree
TableRAG: A Retrieval Augmented Generation Framework for Heterogeneous Document Reasoning
Real-Time Execution of Action Chunking Flow Policies
Dynamic Chunking and Selection for Reading Comprehension of Ultra-Long Context in Large Language Models
Context is Gold to find the Gold Passage: Evaluating and Training Contextual Document Embeddings
Rethinking Chunk Size For Long-Document Retrieval: A Multi-Dataset Analysis
토론
이 논문과 연결된 포럼 글이 아직 없습니다.