Copertina

Can adversarial attacks by large language models be attributed?

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Cebrian, Manuel, Abeliuk, Andres, Telle, Jan Arne
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Artificial Intelligence Computation and Language Computers and Society Formal Languages and Automata Theory
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Automata-based constraints for language model decoding
di: Koo, Terry, et al.
Pubblicazione: (2024)

Integrating Supertag Features into Neural Discontinuous Constituent Parsing
di: Mielczarek, Lukas
Pubblicazione: (2024)

Beyond Memorization: Testing LLM Reasoning on Unseen Theory of Computation Tasks
di: Shelat, Shlok, et al.
Pubblicazione: (2026)

Monadic Context Engineering
di: Zhang, Yifan, et al.
Pubblicazione: (2025)

ToolGate: Contract-Grounded and Verified Tool Execution for LLMs
di: Liu, Yanming, et al.
Pubblicazione: (2026)

Modeling and Simulating Agent-Based City Migration Using Conway's Game of Life
di: Deng, Bruce, et al.
Pubblicazione: (2024)

Exploring Error Types in Formal Languages Among Students of Upper Secondary Education
di: Schmellenkamp, Marko, et al.
Pubblicazione: (2024)

Detecting and Explaining (In-)equivalence of Context-Free Grammars
di: Schmellenkamp, Marko, et al.
Pubblicazione: (2024)

SELP: Generating Safe and Efficient Task Plans for Robot Agents with Large Language Models
di: Wu, Yi, et al.
Pubblicazione: (2024)

Fine-Tuning Language Models Using Formal Methods Feedback
di: Yang, Yunhao, et al.
Pubblicazione: (2023)

RepV: Safety-Separable Latent Spaces for Scalable Neurosymbolic Plan Verification
di: Yang, Yunhao, et al.
Pubblicazione: (2025)

Transformers Can Represent $n$-gram Language Models
di: Svete, Anej, et al.
Pubblicazione: (2024)

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

Computability of Agentic Systems
di: Viriyasuthee, Chatavut
Pubblicazione: (2026)

SemML 2.0: Synthesizing Controllers for LTL
di: Křetínský, Jan, et al.
Pubblicazione: (2026)

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

Automata Extraction from Transformers
di: Zhang, Yihao, et al.
Pubblicazione: (2024)

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

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

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

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

Designing FSMs Specifications from Requirements with GPT 4.0
di: Timo, Omer Nguena, et al.
Pubblicazione: (2026)

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

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

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

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

Executable Ontologies: Synthesizing Event Semantics with Dataflow Architecture
di: Boldachev, Aleksandr
Pubblicazione: (2025)

Towards Autoformalization of LLM-generated Outputs for Requirement Verification
di: Gupte, Mihir, et al.
Pubblicazione: (2025)

Comparison of different Unique hard attention transformer models by the formal languages they can recognize
di: Ryvkin, Leonid
Pubblicazione: (2025)

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

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

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

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

Probabilistic Modeling of Spiking Neural Networks with Contract-Based Verification
di: Yao, Zhen, et al.
Pubblicazione: (2025)

BEAVER: An Efficient Deterministic LLM Verifier
di: Suresh, Tarun, et al.
Pubblicazione: (2025)

Stochastic Directly-Follows Process Discovery Using Grammatical Inference
di: Alkhammash, Hanan, et al.
Pubblicazione: (2023)

HERMES: Towards Efficient and Verifiable Mathematical Reasoning in LLMs
di: Ospanov, Azim, et al.
Pubblicazione: (2025)

Inference of Deterministic Finite Automata via Q-Learning
di: Hosseinkhani, Elaheh, et al.
Pubblicazione: (2025)

Mechanics of Learned Reasoning 1: TempoBench, A Benchmark for Interpretable Deconstruction of Reasoning System Performance
di: Holzer, Nikolaus, et al.
Pubblicazione: (2025)

RegexPSPACE: A Benchmark for Evaluating LLM Reasoning on PSPACE-complete Regex Problems
di: Jin, Hyundong, et al.
Pubblicazione: (2025)