TY - JOUR
T1 - On learning and testing dynamic environments
AU - Goldreich, Oded
AU - Ron, Dana
N1 - Publisher Copyright:
© 2017 ACM.
PY - 2017/6
Y1 - 2017/6
N2 - We initiate a study of learning and testing dynamic environments, focusing on environments that evolve according to a fixed local rule. The (proper) learning task consists of obtaining the initial configuration of the environment, whereas for nonproper learning it suffices to predict its future values. The testing task consists of checking whether the environment has indeed evolved from some initial configuration according to the known evolution rule. We focus on the temporal aspect of these computational problems, which is reflected in two requirements: (1) it is not possible to "go back to the past" and make a query concerning the environment at time t after having made a query concerning time t′ > t, and (2) only a small portion of the environment is inspected in each time unit. We present several general results, extensive studies of two special cases, and a host of open problems. The general results illustrate the significance of the temporal aspect of the current model (i.e., the difference between the current model and the standard model) as well as the preservation of some relations that hold in the standard model. The two special cases that we study are linear rules of evolution and rules of evolution that represent simple movement of objects. Specifically, we show that evolution according to any linear rule can be tested within a total number of queries that is sublinear in the size of the environment, and that evolution according to a simple one-dimensional movement rule can be tested within a total number of queries that is independent of the size of the environment.
AB - We initiate a study of learning and testing dynamic environments, focusing on environments that evolve according to a fixed local rule. The (proper) learning task consists of obtaining the initial configuration of the environment, whereas for nonproper learning it suffices to predict its future values. The testing task consists of checking whether the environment has indeed evolved from some initial configuration according to the known evolution rule. We focus on the temporal aspect of these computational problems, which is reflected in two requirements: (1) it is not possible to "go back to the past" and make a query concerning the environment at time t after having made a query concerning time t′ > t, and (2) only a small portion of the environment is inspected in each time unit. We present several general results, extensive studies of two special cases, and a host of open problems. The general results illustrate the significance of the temporal aspect of the current model (i.e., the difference between the current model and the standard model) as well as the preservation of some relations that hold in the standard model. The two special cases that we study are linear rules of evolution and rules of evolution that represent simple movement of objects. Specifically, we show that evolution according to any linear rule can be tested within a total number of queries that is sublinear in the size of the environment, and that evolution according to a simple one-dimensional movement rule can be tested within a total number of queries that is independent of the size of the environment.
KW - Locally testable codes
KW - Multidimensional cellular automata
KW - Nonadaptivity
KW - One-sided versus two-sided error probability
KW - PAC learning
KW - Property testing
UR - http://www.scopus.com/inward/record.url?scp=85021052348&partnerID=8YFLogxK
U2 - 10.1145/3088509
DO - 10.1145/3088509
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:85021052348
SN - 0004-5411
VL - 64
JO - Journal of the ACM
JF - Journal of the ACM
IS - 3
M1 - 21
ER -