Abstract
Previous works [11,6] introduced a model of semantic communication between a “user” and a “server,” in which the user attempts to achieve a given goal for communication. They show that whenever the user can sense progress, there exist universal user strategies that can achieve the goal whenever it is possible for any other user to reliably do so. A drawback of the actual constructions is that the users are inefficient: they enumerate protocols until they discover one that is successful, leading to the potential for exponential overhead in the length of the desired protocol. Goldreich et al. [6] conjectured that this overhead could be reduced to a polynomial dependence if we restricted our attention to classes of sufficiently simple user strategies and goals. In this work, we are able to obtain such universal strategies for some reasonably general special cases by establishing an equivalence between these special cases and the usual model of mistake-bounded on-line learning [3,15]. This equivalence also allows us to see the limits of constructing universal users based on sensing and motivates the study of sensing with richer kinds of feedback. Along the way, we also establish a new lower bound for the “beliefs model” [12], which demonstrates that constructions of efficient users in that framework rely on the existence of a common “belief” under which all of the servers in a class are designed to be efficient.
This work is also presented in Chapters 4 and 8 of the first author’s thesis [10].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Angluin, D.: Queries and concept learning. Mach. Learn. 2(4), 319–342 (1988)
Auer, P., Long, P.M.: Structural results about on-line learning models with and without queries. Mach. Learn. 36(3), 147–181 (1999)
Bārzdiņš, J., Freivalds, R.: On the prediction of general recursive functions. Soviet Math. Dokl. 13, 1224–1228 (1972)
Bertsimas, D., Vempala, S.: Solving convex programs by random walks. J. ACM 51(4), 540–556 (2004)
Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. J. ACM 43(2), 225–267 (1996)
Goldreich, O., Juba, B., Sudan, M.: A theory of goal-oriented communication. Tech. Rep. TR09-075, ECCC (2009)
Grötschel, M., Lovász, L., Schrijver, A.: Geometric methods in combinatorial optimization. In: Pulleybank, W.R. (ed.) Proc. Silver Jubilee Conf. on Combinatorics. Progress in Combinatorial Optimization, pp. 167–183. Academic Press, New York (1984)
Grötschel, M., Lovász, L., Schrijver, A.: Geometric algorithms and combinatorial optimization, 2nd edn. Springer, New York (1993)
Jayanti, P., Toueg, S.: Every problem has a weakest failure detector. In: 27th PODC (2008)
Juba, B.: Universal Semantic Communication. Ph.D. thesis, MIT (2010)
Juba, B., Sudan, M.: Universal semantic communication I. In: 40th STOC (2008)
Juba, B., Sudan, M.: Efficient semantic communication via compatible beliefs. In: 2nd Innovations in Computer Science (2011)
Kearns, M., Valiant, L.: Cryptographic limitations on learning Boolean formulae and finite automata. J. ACM 41, 67–95 (1994)
Kharitonov, M.: Cryptographic hardness of distribution-specific learning. In: 25th STOC, pp. 372–381 (1993)
Littlestone, N.: Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Mach. Learn. 2(4), 285–318 (1988)
Maass, W., Turán, G.: How fast can a threshold gate learn? In: Hanson, S.J., Drastal, G.A., Rivest, R.L. (eds.) Computational Learning Theory and Natural Learning Systems: Constraints and Prospects, vol. 1, pp. 381–414. MIT Press, Cambridge (1994)
Patt-Shamir, B.: Personal communication (2010)
Vaidya, P.M.: A new algorithm for minimizing convex functions over convex sets. Mathematical Programming 73(3), 291–341 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Juba, B., Vempala, S. (2011). Semantic Communication for Simple Goals Is Equivalent to On-line Learning. In: Kivinen, J., Szepesvári, C., Ukkonen, E., Zeugmann, T. (eds) Algorithmic Learning Theory. ALT 2011. Lecture Notes in Computer Science(), vol 6925. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24412-4_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-24412-4_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24411-7
Online ISBN: 978-3-642-24412-4
eBook Packages: Computer ScienceComputer Science (R0)