On Learning and Testing Dynamic Environments

被引:2
作者
Goldreich, Oded [1 ]
Ron, Dana [2 ]
机构
[1] Weizmann Inst Sci, Dept Comp Sci, Rehovot, Israel
[2] Tel Aviv Univ, Sch Elect Engn, Tel Aviv, Israel
基金
以色列科学基金会;
关键词
Property testing; multidimensional cellular automata; PAC learning; one-sided versus two-sided error probability; nonadaptivity; locally testable codes; COMMUNICATION COMPLEXITY; PROXIMITY; PCPS;
D O I
10.1145/3088509
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页数:90
相关论文
共 21 条
[1]   Regular languages are testable with a constant number of queries [J].
Alon, N ;
Krivelevich, M ;
Newman, I ;
Szegedy, M .
SIAM JOURNAL ON COMPUTING, 2001, 30 (06) :1842-1862
[2]  
[Anonymous], 2010, Property Testing: Current Research and Surveys
[3]   Robust PCPs of proximity, shorter PCPs, and applications to coding [J].
Ben-Sasson, Eli ;
Goldreich, Oded ;
Harsha, Prahladh ;
Sudan, Madhu ;
Vadhan, Salil .
SIAM JOURNAL ON COMPUTING, 2006, 36 (04) :889-974
[4]   PROPERTY TESTING LOWER BOUNDS VIA COMMUNICATION COMPLEXITY [J].
Blais, Eric ;
Brody, Joshua ;
Matulef, Kevin .
COMPUTATIONAL COMPLEXITY, 2012, 21 (02) :311-358
[5]   UNBIASED BITS FROM SOURCES OF WEAK RANDOMNESS AND PROBABILISTIC COMMUNICATION COMPLEXITY [J].
CHOR, B ;
GOLDREICH, O .
SIAM JOURNAL ON COMPUTING, 1988, 17 (02) :230-261
[6]  
CHOR B, 1985, IEEE S FDN COMPUTER, V26, P396
[7]   Assignment testers: Towards a combinatorial proof of the PCP theorem [J].
Dinur, Irit ;
Reingold, Omer .
SIAM JOURNAL ON COMPUTING, 2006, 36 (04) :975-1024
[8]   Property testing in bounded degree graphs [J].
Goldreich, O ;
Ron, D .
ALGORITHMICA, 2002, 32 (02) :302-343
[9]   Property testing and its connection to learning and approximation [J].
Goldreich, O ;
Goldwasser, S ;
Ron, D .
JOURNAL OF THE ACM, 1998, 45 (04) :653-750
[10]  
Goldreich O., 2013, EL C COMP COMPL ECCC