Repository navigation
Canonical NFAs as generators (RFSA, prime átomaton) and as shift presentations; generator-search seeds - #64
Merged
Merged
Conversation
…e generator search canonical_rfsa_hmm, maximized_prime_atomaton_hmm, atomaton_hmm: stochastic analogues of the canonical NFAs on extreme points of the causal-state belief polytopes. generative_model offers the two new ones and coupled_search starts from them. SoficShift gains canonical RFSA, prime atomaton and atomaton presentations of its factor language. Co-authored-by: Cursor <cursoragent@cursor.com>
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Summary
Generators (
sofic.generators.canonical_generators, alsoEpsilonMachine/BidirectionalEpsilonMachinemethods), for a process with a finite bidirectional ε-machine:atomaton_hmm(reverse ε-machine run forward)S-canonical_rfsa_hmmR[s+]are vertices ofconv{R[s+]}maximized_prime_atomaton_hmmQ[s-]are vertices ofconv{Q[s-]}, built in reverse time and reversed backA causal state's future morph is a mixture of the futures given the reverse states (disjoint supports), so "not a mixture of other morphs" is "a vertex of the belief hull", the convex analogue of a prime residual (Denis 2002; Esposito et al. 2002). Every other state is a mixture of the vertices, and the generator on the vertices has kernel
K[E] C. The prime-átomaton analogue is the same on the reversed process (Maarand & Tamm 2022). Both are linear programs and generally not unifilar. The identification is an analogy, documented as not from the literature. The RFSA analogue is the bidirectional-coordinates form of the experimentalcanonical_residual_hmmbeing recovered in #63; once that merges, one could delegate to the other.Generator search.
_GeneratorProblem.residual_seed()/prime_atomaton_seed()give the seeds with completed beliefs.generative_modeloffers them in the machines stage (canonical RFSA generator,maximized prime átomaton generator), andcoupled_searchstarts from them at everyk. On the binary 3-state dataset the prime-átomaton analogue compresses the reverse machine on 112 of 620 processes and is the best generator known on 14; with this PR the pipeline itself lowers the best upper bound on three:n3-t088-d41.2809 → 1.0994,n3-t088-d01.3655 → 1.3301,n3-t081-d31.4331 → 1.4282.Shifts (
sofic.shifts.canonical_presentations,SoficShiftmethods): presentations by the canonical RFSA, maximized prime átomaton and átomaton of the factor language, trimmed to essential states. An automaton for the factorial, extendable factor language with every state accepting presents the shift once trimmed.Test plan
ruff,sphinx-build -W;tyhas no new diagnosticsMade with Cursor