Imagen de Portada

Continuous Diffusion Models Can Obey Formal Syntax

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kim, Jinwoo, Berg-Kirkpatrick, Taylor, D'Antoni, Loris
Formato:	Preprint
Publicado:	2026
Materias:	Machine Learning Formal Languages and Automata Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Unraveling Syntax: How Language Models Learn Context-Free Grammars
por: Schulz, Laura Ying, et al.
Publicado: (2025)

Extending AALpy with Passive Learning: A Generalized State-Merging Approach
por: von Berg, Benjamin, et al.
Publicado: (2025)

The Expressive Capacity of State Space Models: A Formal Language Perspective
por: Sarrof, Yash, et al.
Publicado: (2024)

TR2MTL: LLM based framework for Metric Temporal Logic Formalization of Traffic Rules
por: Manas, Kumar, et al.
Publicado: (2024)

From Formal Language Theory to Statistical Learning: Finite Observability of Subregular Languages
por: Hayashi, Katsuhiko, et al.
Publicado: (2025)

Warm Starting State-Space Models with Automata Learning
por: Fishell, William, et al.
Publicado: (2026)

Stochastic Alignments: Matching an Observed Trace to Stochastic Process Models
por: Li, Tian, et al.
Publicado: (2025)

Syntax Repair as Language Intersection
por: Considine, Breandan
Publicado: (2025)

Learning Formal Specifications from Membership and Preference Queries
por: Shah, Ameesh, et al.
Publicado: (2023)

Hilbert: Recursively Building Formal Proofs with Informal Reasoning
por: Varambally, Sumanth, et al.
Publicado: (2025)

What Formal Languages Can Transformers Express? A Survey
por: Strobl, Lena, et al.
Publicado: (2023)

Finite Sentence-Interface Control for Learning Bounded-Fan-Out Linear MCFGs under Fixed Monoid Typing
por: Kuriyama, Takayuki
Publicado: (2026)

Learning Deterministic Finite-State Machines from the Prefixes of a Single String is NP-Complete
por: Dumitru, Radu Cosmin, et al.
Publicado: (2026)

SMT-Based Active Learning of Weighted Automata
por: Ferreira, Tiago, et al.
Publicado: (2026)

Unsupervised Hierarchical Skill Discovery
por: Harvey, Damion, et al.
Publicado: (2026)

Solomonoff induction
por: Sterkenburg, Tom F.
Publicado: (2026)

PAC learning PDFA from data streams
por: Baumgartner, Robert, et al.
Publicado: (2026)

Deconstructing Subset Construction -- Reducing While Determinizing
por: Nicol, John, et al.
Publicado: (2025)

Learning Reward Machines from Partially Observed Policies
por: Shehab, Mohamad Louai, et al.
Publicado: (2025)

Transformers as Transducers
por: Strobl, Lena, et al.
Publicado: (2024)

A Constructive Framework for Nondeterministic Automata via Time-Shared, Depth-Unrolled Feedforward Networks
por: Dhayalkar, Sahil Rajesh
Publicado: (2025)

Active Learning of Symbolic Automata Over Rational Numbers
por: Hagedorn, Sebastian, et al.
Publicado: (2025)

Learning Weighted Finite Automata over the Max-Plus Semiring and its Termination
por: Okudono, Takamasa, et al.
Publicado: (2024)

PDFA Distillation via String Probability Queries
por: Baumgartner, Robert, et al.
Publicado: (2024)

Certifying Robustness of Graph Convolutional Networks for Node Perturbation with Polyhedra Abstract Interpretation
por: Chen, Boqi, et al.
Publicado: (2024)

A Detailed Account of Compositional Automata Learning through Alphabet Refinement
por: Henry, Leo, et al.
Publicado: (2025)

Partial Answer of How Transformers Learn Automata
por: Zhang, Tiantian
Publicado: (2025)

Robust Probabilistic Model Checking with Continuous Reward Domains
por: Ji, Xiaotong, et al.
Publicado: (2025)

Pumping-Like Results for Copyless Cost Register Automata and Polynomially Ambiguous Weighted Automata
por: Mazowiecki, Filip, et al.
Publicado: (2025)

Mind the Gap: A Formal Investigation of the Relationship Between Log and Model Complexity -- Extended Version
por: Schalk, Patrizia, et al.
Publicado: (2025)

WEX: Formal Specifications for Windows in Stream Processing
por: Hitarth, S, et al.
Publicado: (2022)

A Formal Approach for Tuning Stochastic Oscillators
por: Ballarini, Paolo, et al.
Publicado: (2024)

Closure Properties of General Grammars -- Formally Verified
por: Dvorak, Martin, et al.
Publicado: (2023)

Formal-LLM: Integrating Formal Language and Natural Language for Controllable LLM-based Agents
por: Li, Zelong, et al.
Publicado: (2024)

Formalized Run-Time Analysis of Active Learning -- Coalgebraically in Agda
por: Wißmann, Thorsten
Publicado: (2026)

A General Information Extraction Framework Based on Formal Languages
por: Schmid, Markus L.
Publicado: (2025)

Certified Symbolic Finite Transducers: Formalization and Applications to String Analysis
por: Kan, Shuanglong, et al.
Publicado: (2025)

An Algebraic View of the Expressivity of Recurrent Language Models
por: Nowak, Franz, et al.
Publicado: (2026)

FormalAlign: Automated Alignment Evaluation for Autoformalization
por: Lu, Jianqiao, et al.
Publicado: (2024)

Language Models over Canonical Byte-Pair Encodings
por: Vieira, Tim, et al.
Publicado: (2025)