Cover Image

The Sparse Tsetlin Machine: Sparse Representation with Active Literals

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Østby, Sebastian, Brambo, Tobias M., Glimsdal, Sondre
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Artificial Intelligence Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Green Tsetlin Redefining Efficiency in Tsetlin Machine Frameworks
by: Glimsdal, Sondre, et al.
Published: (2024)

Lost in Transmission: When and Why LLMs Fail to Reason Globally
by: Schnabel, Tobias, et al.
Published: (2025)

Reasoning about Reasoning: BAPO Bounds on Chain-of-Thought Token Complexity in LLMs
by: Tomlinson, Kiran, et al.
Published: (2026)

Neural Networks as Universal Finite-State Machines: A Constructive Deterministic Finite Automaton Theory
by: Dhayalkar, Sahil Rajesh
Published: (2025)

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

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

Tractable Offline Learning of Regular Decision Processes
by: Deb, Ahana, et al.
Published: (2024)

Analyzing constrained LLM through PDFA-learning
by: Carrasco, Matías, et al.
Published: (2024)

MinMax Recurrent Neural Cascades
by: Ronca, Alessandro
Published: (2026)

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

Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic
by: Raha, Ritam, et al.
Published: (2021)

Expressive Reward Synthesis with the Runtime Monitoring Language
by: Donnelly, Daniel, et al.
Published: (2025)

Probabilistic Regular Tree Priors for Scientific Symbolic Reasoning
by: Schneider, Tim, et al.
Published: (2023)

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

Extracting Robust Register Automata from Neural Networks over Data Sequences
by: Hong, Chih-Duo, et al.
Published: (2025)

Active Reward Machine Inference From Raw State Trajectories
by: Shehab, Mohamad Louai, et al.
Published: (2026)

Infinite Time Turing Machines and their Applications
by: Weerawarana, Rukmal, et al.
Published: (2025)

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

TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching
by: Meng, Yue, et al.
Published: (2025)

Compositional Automata Embeddings for Goal-Conditioned Reinforcement Learning
by: Yalcinkaya, Beyazit, et al.
Published: (2024)

Automata Extraction from Transformers
by: Zhang, Yihao, et al.
Published: (2024)

$L^*LM$: Learning Automata from Examples using Natural Language Oracles
by: Vazquez-Chanlatte, Marcell, et al.
Published: (2024)

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

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

Language Generation: Complexity Barriers and Implications for Learning
by: Arenas, Marcelo, et al.
Published: (2025)

The Lottery LLM Hypothesis, Rethinking What Abilities Should LLM Compression Preserve?
by: Tang, Zhenheng, et al.
Published: (2025)

Exploring Major Transitions in the Evolution of Biological Cognition With Artificial Neural Networks
by: Voudouris, Konstantinos, et al.
Published: (2025)

Provably Correct Automata Embeddings for Optimal Automata-Conditioned Reinforcement Learning
by: Yalcinkaya, Beyazit, et al.
Published: (2025)

InductionBench: LLMs Fail in the Simplest Complexity Class
by: Hua, Wenyue, et al.
Published: (2025)

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

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

Interpretable Early Failure Detection via Machine Learning and Trace Checking-based Monitoring
by: Brunello, Andrea, et al.
Published: (2025)

The 4/$δ$ Bound: Designing Predictable LLM-Verifier Systems for Formal Method Guarantee
by: Dantas, PIerre, et al.
Published: (2025)

Automata Learning of Preferences over Temporal Logic Formulas from Pairwise Comparisons
by: Rahmani, Hazhar, et al.
Published: (2025)

A New Era in Software Security: Towards Self-Healing Software via Large Language Models and Formal Verification
by: Tihanyi, Norbert, et al.
Published: (2023)

LLMs as Probabilistic Minimally Adequate Teachers for DFA Learning
by: Chen, Lekai, et al.
Published: (2024)

Congruence-based Learning of Probabilistic Deterministic Finite Automata
by: Carrasco, Matías, et al.
Published: (2024)

Large Language Models and the Extended Church-Turing Thesis
by: Wiedermann, Jiří, et al.
Published: (2024)

TheoremLlama: Transforming General-Purpose LLMs into Lean4 Experts
by: Wang, Ruida, et al.
Published: (2024)

Finding path and cycle counting formulae in graphs with Deep Reinforcement Learning
by: Piquenot, Jason, et al.
Published: (2024)