arXiv AI By Veit Elser, Manish Krishan Lal

Machine-learnable Sets

Read the original on arXiv AI →

arXiv:2606. 28947v1 Announce Type: cross Abstract: In this study we present a formal definition of large discrete sets having, informally, three properties: their elements are easily recognized, easily generated, and the latter tasks are easily learned from examples.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv Machine Learning
Aug 20

Learning Canonical Register Automata over Ordered Data Domains

The paper presents a polynomial‑time active learning procedure for deterministic register automata (DRAs) over ordered data domains, covering both dense domains like the rationals and non‑dense domains such as the integers. It unifies the learning framework for these domains using membership, equivalence, and memorability queries, and shows that minimization of DRAs over the integer domain is decidable. Additionally, the authors provide improved complexity bounds for several decision problems related to DRAs over ordered domains.

By Yong Li, Qiyi Tang, Di-De Yen
arXiv Machine Learning
Jun 16

Polynomial-Time Mistake-Bounded Language Generation

arXiv:2606. 16077v1 Announce Type: cross Abstract: In this note, we introduce a polynomial-time version of the mistake-bounded language generation (MBLG) framework due to Kleinberg, Peale, and Reingold (2026).

By H\'ector Jimenez, Alexander Kozachinskiy, Vicente Opazo
arXiv Machine Learning
Jul 15

Language Identification with Succinct Machine-Independent Traces

arXiv:2607. 12443v1 Announce Type: cross Abstract: Motivated by the power of large language models, there has been renewed interest in the Gold-Angluin model of language identification in the limit, with an eye toward variants of the model that might overcome the negative results for its original formulation.

By Moses Charikar, Jon Kleinberg, Chirag Pabbaraju