{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:34:59Z","timestamp":1787340899063,"version":"build-2736575974"},"reference-count":25,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1992,4]]},"abstract":"<jats:p>The problem of learning an integer lattice of ${\\bf Z}^k $ in an on-line fashion is considered. That is, the learning algorithm is given a sequence of k-tuples of integers and predicts for each tuple in the sequence whether it lies in a hidden target lattice of ${\\bf Z}^k $. The goal of the algorithm is to minimize the number of prediction mistakes. An efficient learning algorithm with an absolute mistake bound of $k + \\lfloor k\\log (n\\sqrt k ) \\rfloor $ is given, where n is the maximum component of any tuple seen. It is shown that this bound is approximately a $\\log \\log n$ factor larger than the lower bound on the worst case number of mistakes given by the VC dimension of lattices that are restricted to $\\{ - n, \\cdots ,0, \\cdots ,n \\}^k $.<\/jats:p>\n                  <jats:p>This algorithm is used to learn rational lattices, cosets of lattices, an on-line word problem for abelian groups, and a subclass of the commutative regular languages. Furthermore, by adapting the results of [D. Helmbold, R. Sloan, and M. K. Warmuth, Machine Learning, 5 (1990), pp. 165\u2013196], one can efficiently learn nested differences of each of the above classes (e.g., concepts of the form $c_1 - (c_2 - (c_3 - (c_4 - c_5 )))$, where each $c_i $ is the coset of a lattice).<\/jats:p>","DOI":"10.1137\/0221019","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:38:23Z","timestamp":1109227103000},"page":"240-266","source":"Crossref","is-referenced-by-count":52,"title":["Learning Integer Lattices"],"prefix":"10.1137","volume":"21","author":[{"given":"David","family":"Helmbold","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Sloan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manfred K.","family":"Warmuth","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"Naoki Abe,  Polynomial learnability of semilinear sets,  Proceedings of the Second Annual Workshop on Computational Learning Theory (Santa Cruz, CA, 1989), Morgan Kaufmann, San Mateo, CA,  1989,  25\u201340 1 076 2230747.68039","DOI":"10.1016\/B978-0-08-094829-4.50005-2"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037090"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1145\/322326.322334"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022821128753"},{"key":"R5","first-page":"1224","volume":"13","author":"Barzdin J. M.","year":"1972","journal-title":"Soviet Math. Dokl."},{"key":"R6","unstructured":"S. Boucheron,  Learnability from positive examples in the Valiant framework,  1988, unpublished manuscript"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-62035-5"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-21946-1"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0099432"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"A. Fiat, S. Moses, A. Shamir, I. Shimshoni, G. Tardos,  Planning and learning in permutation groups,  30th Annual IEEE Symposium on Foundations of Computer Science,  1989,  274\u2013279","DOI":"10.1109\/SFCS.1989.63490"},{"key":"R11","doi-asserted-by":"crossref","DOI":"10.5948\/UPO9780883859292","volume-title":"Groups and their graphs","author":"Grossman Israel","year":"1964"},{"key":"R12","volume-title":"Inequalities","author":"Hardy G. H.","year":"1952"},{"key":"R13","volume-title":"An Introduction to the Theory of Numbers","author":"Hardy G. H.","year":"1960"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022696716689"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1137\/0208040"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022869011914"},{"key":"R17","doi-asserted-by":"crossref","unstructured":"Nick Littlestone,  From on-line to batch learning,  Proceedings of the Second Annual Workshop on Computational Learning Theory (Santa Cruz, CA, 1989), Morgan Kaufmann, San Mateo, CA,  1989,  269\u2013284, July 1 076 2340752.68066","DOI":"10.1016\/B978-0-08-094829-4.50022-2"},{"key":"R18","volume-title":"Combinatorial group theory: Presentations of groups in terms of generators and relations","author":"Magnus Wilhelm","year":"1966"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(82)90040-6"},{"key":"R20","volume-title":"Machine learning","author":"Natarajan Balas K.","year":"1991"},{"key":"R21","unstructured":"L. Pitt, M. K. Warmuth,  The minimum DFA consistency problem cannot be approximated within any polynomial, Tech. Report, UIUCDCS-R-89-1499, Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL,  1989, Feb."},{"key":"R22","unstructured":"L. Pitt, M. K. Warmuth,  The minimum DFA consistency problem cannot be approximated within any polynomial, J. Assoc. Comput. Mach., to appear"},{"key":"R23","unstructured":"H. Shvaytser,  Linear manifolds are learnable from positive examples,  1988, unpublished manuscript"},{"key":"R24","doi-asserted-by":"publisher","DOI":"10.1137\/1116025"},{"key":"R25","doi-asserted-by":"publisher","DOI":"10.1137\/0211057"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0221019","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:55:16Z","timestamp":1787338516000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0221019"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["10.1137\/0221019"],"URL":"https:\/\/doi.org\/10.1137\/0221019","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}