The paper introduces Grammar‑Aligned Decoding (GAD), addressing the issue that conventional grammar‑constrained decoding (GCD) can distort a large language model’s probability distribution, yielding grammatical but low‑likelihood outputs. GAD proposes an adaptive sampling method, Approximate Expected Futures (ASAp), which uses prior samples to over‑approximate future grammaticality, ensuring outputs remain both grammatical and faithful to the model’s conditional probabilities. Experiments on code generation and structured NLP tasks demonstrate that ASAp often produces higher‑likelihood outputs than existing GCD techniques while still enforcing the required grammatical constraints.
By Kanghee Park, Jiayu Wang, Taylor Berg-Kirkpatrick, Nadia Polikarpova, Loris D'Antoni
arXiv:2607. 20286v1 Announce Type: cross Abstract: We propose a novel framework for computing rigorous bounds on the probability that a large language model (LLM) generates harmful output to a given prompt.
By Mahdi Nazeri, Anne-Kathrin Schmuck, Sadegh Soudjani, Alessandro Abate
arXiv:2607. 05995v1 Announce Type: cross Abstract: We propose a novel approach to mine patterns in spatio-temporal event data based on discovering frequent closed embedded sub-Directed Acyclic Graphs (DAGs).
By Piotr S. Maci\k{a}g
arXiv:2602. 17001v3 Announce Type: replace Abstract: Natural Language Querying for Time Series Databases (NLQ4TSDB) aims to assist non-expert users retrieve meaningful events, intervals, and summaries from massive temporal records.
By Zhao Tan, Yiji Zhao, Shiyu Wang, Chang Xu, Yuxuan Liang, Xiping Liu, Shirui Pan, Ming Jin
arXiv:2606. 11235v1 Announce Type: new Abstract: A key step in knowledge discovery is the evaluation of data mining results.
By Leonardo Pellegrina, Fabio Vandin
arXiv:2603.01243v3 Announce Type: replace
Abstract: Large language models (LLMs) are powerful tools that have found applications beyond human-machine interfaces and chatbots. Beside free-form generat...
By Ayoub Hammal, Pierre Zweigenbaum, Caio Corro
arXiv:2605. 02488v2 Announce Type: replace Abstract: Several applications demand the timely detection of critical situations, such as threats to safety and transparency, over high-velocity streams of symbolic events.
By Periklis Mantenoglou
arXiv:2609.22213v1 Announce Type: new
Abstract: Temporal Knowledge Graph Question Answering (TKGQA) requires answer inference from evidence that is both structurally valid and temporally admissible....
By Xiaokun Guo, Zhen Xu, Dongdong Huo, Yanqiu Zhang, Dongjin Yu, Yu Wang
We propose a novel framework for computing rigorous bounds on the probability that a large language model (LLM) generates harmful output to a given prompt. We study a new application of the Clopper-Pearson confidence intervals to obtain probably approximately correct (PAC) bounds for this problem.
arXiv:2607. 03188v1 Announce Type: cross Abstract: Episode mining aims to extract subsequences of events that possess certain distinctive properties and constitute facts valuable to the user.
By Maxim Ivanov, Matvei Smirnov, Alisa Strazdina, George Chernishev
arXiv:2609.01032v1 Announce Type: cross
Abstract: Automated mining of formal specifications is vital for verifying real-time systems. However, existing passive learning approaches remain restricted t...
By Hsi-Ming Ho, Shankaranarayanan Krishna, Khushraj Madnani
arXiv:2607. 14770v1 Announce Type: new Abstract: Knowledge graph question generation (KGQG) aims to generate natural-language questions from structured graph evidence.
By Xuemeng Liu, Zhengpin Li, Wanpeng Tang, Haotong Xie, Wentao Zhang