Holographic Neural PCFG for Unsupervised Parsing
arXiv:2607.08063v1 Announce Type: new Abstract: Unsupervised constituency parsing aims to accurately induce latent tree structures from raw text alone. Recent neural parameterizations of PCFGs…
Read the full articleYou might also wanna read
Ouro: Looped Language Models That Build Reasoning into Pre-Training Through Latent Space Iteration
Modern LLMs are trained to "think" primarily via explicit text generation, such as chain-of-thought (CoT), which defers reasoning to post-tr
Research on Hierarchical JSON Representations for Preserving Scientific Sentence Meaning
This paper investigates whether structured representations can preserve the meaning of scientific sentences. To test this, a lightweight LLM
Unsupervised Algorithm for Language Model Fine-Tuning Introduced
To steer pretrained language models for downstream tasks, today's post-training paradigm relies on humans to specify desired behaviors. Howe
LOGOS: A Unified Generative Foundation Model for the Natural Sciences Using Shared Scientific Grammar
In this report, we present LOGOS (Language Of Generative Objects in Science), a scientific generative language model that unifies heterogene
Transformers Can Learn to Predict Permuted Congruential Generator Sequences Through Curriculum Learning and Scaling Laws
We study the ability of Transformer models to learn sequences generated by Permuted Congruential Generators (PCGs), a widely used family of
PHOTON: Hierarchical Autoregressive Model for Efficient Language Generation
Transformers operate as horizontal token-by-token scanners; at each generation step, the model attends to an ever-growing sequence of token-

Comments
Sign in to join the conversation.
No comments yet. Be the first.