Learning functions represented as multiplicity automata

DOI10.1145/337244.337257zbMath1094.68575OpenAlexW2050570613MaRDI QIDQ4406308

Eyal Kushilevitz, Amos Beimel, Nader H. Bshouty, Francesco Bergadano

Publication date: 25 June 2003

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/337244.337257

zbMATH Keywords

Angluin's exact learning modellearnability of multiplicity automata

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (25)

Learning of Structurally Unambiguous Probabilistic Grammars ⋮ Definable transductions and weighted logics for texts ⋮ Exact learning from an honest teacher that answers membership queries ⋮ On PAC learning algorithms for rich Boolean function classes ⋮ Complexity of Equivalence and Learning for Multiplicity Tree Automata ⋮ Learning Weighted Automata ⋮ Almost optimal proper learning and testing polynomials ⋮ Recognizable series on graphs and hypergraphs ⋮ Representing regular languages of infinite words using mod 2 multiplicity automata ⋮ Learning and characterizing fully-ordered lattice automata ⋮ Learning Probability Distributions Generated by Finite-State Machines ⋮ Using Multiplicity Automata to Identify Transducer Relations from Membership and Equivalence Queries ⋮ Spectral learning of weighted automata. A forward-backward perspective ⋮ \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition ⋮ Random arithmetic formulas can be reconstructed efficiently ⋮ Learning Read-Constant Polynomials of Constant Degree Modulo Composites ⋮ Learning read-constant polynomials of constant degree modulo composites ⋮ Probabilistic black-box reachability checking (extended version) ⋮ Learning expressions and programs over monoids ⋮ Linear independence, alternants, and applications ⋮ On the complexity of noncommutative polynomial factorization ⋮ Deterministic weighted automata under partial observability ⋮ Cryptographic hardness for learning intersections of halfspaces ⋮ The boundedness and zero isolation problems for weighted automata over nonnegative rationals ⋮ An Algebraic Perspective on Boolean Function Learning

This page was built for publication: Learning functions represented as multiplicity automata