Genetic Programming for Reward Function Search
نویسندگان
چکیده
منابع مشابه
Controlling The Genetic Programming Search
Traditional GP randomly combines subtrees by applying crossover. In this study a new approach is presented for guiding the recombination process. Our method is based on extracting the global information of the promising solutions that appear during the genetic search. The aim is to use this information to control the crossover operation afterwards. [1] proposes a method based on calculating the...
متن کاملFunction Sequence Genetic Programming
Genetic Programming(GP) can obtain a program structure to solve complex problem. This paper presents a new form of Genetic Programming, Function Sequence Genetic Programming (FSGP). We adopt function set like Genetic Programming, and define data set corresponding to its terminal set. Besides of input data and constants, data set include medium variables which are used not only as arguments of f...
متن کاملautomatic verification of authentication protocols using genetic programming
implicit and unobserved errors and vulnerabilities issues usually arise in cryptographic protocols and especially in authentication protocols. this may enable an attacker to make serious damages to the desired system, such as having the access to or changing secret documents, interfering in bank transactions, having access to users’ accounts, or may be having the control all over the syste...
15 صفحه اولNonlinear ranking function representations in genetic programming-based ranking discovery for personalized search
Ranking function is instrumental in affecting the performance of a search engine. Designing and optimizing a search engine’s ranking function remains a daunting task for computer and information scientists. Recently, genetic programming (GP), a machine learning technique based on evolutionary theory, has shown promise in tackling this very difficult problem. Ranking functions discovered by GP h...
متن کاملNumeric Mutation: Improved Search in Genetic Programming
Genetic programming is relatively poor at discovering useful numeric constants for the terminal nodes of its sexpression trees. In this paper we outline an adaptation to genetic programming, called numeric mutation. ~,Ve provide empirical evidence and analysis that demonstrate that numeric mutation makes a statistically significant increase in genetic programming’s performance for symbolic regr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Autonomous Mental Development
سال: 2010
ISSN: 1943-0604,1943-0612
DOI: 10.1109/tamd.2010.2051436