Difference between revisions of "Yan Radovilsky"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| (One intermediate revision by the same user not shown) | |||
| Line 7: | Line 7: | ||
computer scientist, computer software professional and lecturer at [https://en.wikipedia.org/wiki/Ben-Gurion_University_of_the_Negev Ben-Gurion University of the Negev]. | computer scientist, computer software professional and lecturer at [https://en.wikipedia.org/wiki/Ben-Gurion_University_of_the_Negev Ben-Gurion University of the Negev]. | ||
The main areas of his interest is [[Artificial Intelligence|AI]], [[Chess|chess]] and [[Psychology|psychology]]. | The main areas of his interest is [[Artificial Intelligence|AI]], [[Chess|chess]] and [[Psychology|psychology]]. | ||
| − | Along with [[Solomon Eyal Shimony]] <ref>[[Yan Radovilsky]], [[Solomon Eyal Shimony]] | + | Along with [[Solomon Eyal Shimony]] <ref>[[Yan Radovilsky]], [[Solomon Eyal Shimony]] ('''2004'''). ''[https://www.semanticscholar.org/paper/Generalized-model-for-rational-game-tree-search-Radovilsky-Shimony/47a32301e705acdc46856d4b29bfc4f50d5ce000 Generalized Model for Rational Game Tree Search]''. [https://dblp.uni-trier.de/db/conf/smc/smc2004-2.html SMC 2004], [https://www.cs.bgu.ac.il/~yanr/Publications/smc04.pdf pdf]</ref>, |
Yan Radovilsky proposed a generalization of the [[BPIP-DFISA]] (Best play for imperfect players - Depth free independent staircase approximation) search control model introduced by [[Eric B. Baum]] and [[Warren D. Smith]] in 1995 <ref>[[Eric B. Baum]], [[Warren D. Smith]] ('''1995'''). ''[https://www.semanticscholar.org/paper/Best-Play-for-Imperfect-Players-and-Game-Tree-part-Baum-Warren/5838432c92c8905c7066962400c55ddc8803f11a Best Play for Imperfect Players and Game Tree Search]''. Part I - theory, with pseudocode appendix by [[Charles Garrett]]</ref> | Yan Radovilsky proposed a generalization of the [[BPIP-DFISA]] (Best play for imperfect players - Depth free independent staircase approximation) search control model introduced by [[Eric B. Baum]] and [[Warren D. Smith]] in 1995 <ref>[[Eric B. Baum]], [[Warren D. Smith]] ('''1995'''). ''[https://www.semanticscholar.org/paper/Best-Play-for-Imperfect-Players-and-Game-Tree-part-Baum-Warren/5838432c92c8905c7066962400c55ddc8803f11a Best Play for Imperfect Players and Game Tree Search]''. Part I - theory, with pseudocode appendix by [[Charles Garrett]]</ref> | ||
to allow for [[Planning|planning]] steps, as well as [[Search|game tree search]] steps. | to allow for [[Planning|planning]] steps, as well as [[Search|game tree search]] steps. | ||
| Line 14: | Line 14: | ||
=Selected Publications= | =Selected Publications= | ||
<ref>[https://dblp.uni-trier.de/pers/hd/r/Radovilsky:Yan dblp: Yan Radovilsky]</ref> | <ref>[https://dblp.uni-trier.de/pers/hd/r/Radovilsky:Yan dblp: Yan Radovilsky]</ref> | ||
| − | * [[Yan Radovilsky]], [[Solomon Eyal Shimony]] ('''2004'''). ''Generalized Model for Rational Game Tree Search''. [https://dblp.uni-trier.de/db/conf/smc/smc2004-2.html SMC 2004], [https://www.cs.bgu.ac.il/~yanr/Publications/smc04.pdf pdf] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=57560&start=14 Re: Interesting ideas] by [[Karlo Balla|Karlo Bala Jr.]], [[CCC]], September 09, 2015</ref> | + | * [[Yan Radovilsky]], [[Solomon Eyal Shimony]] ('''2004'''). ''[https://www.semanticscholar.org/paper/Generalized-model-for-rational-game-tree-search-Radovilsky-Shimony/47a32301e705acdc46856d4b29bfc4f50d5ce000 Generalized Model for Rational Game Tree Search]''. [https://dblp.uni-trier.de/db/conf/smc/smc2004-2.html SMC 2004], [https://www.cs.bgu.ac.il/~yanr/Publications/smc04.pdf pdf] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=57560&start=14 Re: Interesting ideas] by [[Karlo Balla|Karlo Bala Jr.]], [[CCC]], September 09, 2015</ref> |
* [[Yan Radovilsky]], [https://dblp.uni-trier.de/pers/hd/s/Shattah:Guy Guy Shattah], [[Solomon Eyal Shimony]] ('''2006'''). ''[https://ieeexplore.ieee.org/document/4274255 Efficient Deterministic Approximation Algorithms for Non-myopic Value of Information in Graphical Models]''. [https://dblp.uni-trier.de/db/conf/smc/smc2006.html SMC 2006] | * [[Yan Radovilsky]], [https://dblp.uni-trier.de/pers/hd/s/Shattah:Guy Guy Shattah], [[Solomon Eyal Shimony]] ('''2006'''). ''[https://ieeexplore.ieee.org/document/4274255 Efficient Deterministic Approximation Algorithms for Non-myopic Value of Information in Graphical Models]''. [https://dblp.uni-trier.de/db/conf/smc/smc2006.html SMC 2006] | ||
* [[Yan Radovilsky]], [[Solomon Eyal Shimony]] ('''2008'''). ''Observation Subset Selection as Local Compilation of Performance Profiles''. [https://dblp.uni-trier.de/db/conf/uai/uai2008.html 24. UAI 2008], [https://arxiv.org/abs/1206.3283 arXiv:1206.3283] | * [[Yan Radovilsky]], [[Solomon Eyal Shimony]] ('''2008'''). ''Observation Subset Selection as Local Compilation of Performance Profiles''. [https://dblp.uni-trier.de/db/conf/uai/uai2008.html 24. UAI 2008], [https://arxiv.org/abs/1206.3283 arXiv:1206.3283] | ||
Latest revision as of 10:29, 15 May 2020
Home * People * Yan Radovilsky
Yan Radovilsky [1]
Yan Radovilsky,
an Israeli chess player [2],
computer scientist, computer software professional and lecturer at Ben-Gurion University of the Negev.
The main areas of his interest is AI, chess and psychology.
Along with Solomon Eyal Shimony [3],
Yan Radovilsky proposed a generalization of the BPIP-DFISA (Best play for imperfect players - Depth free independent staircase approximation) search control model introduced by Eric B. Baum and Warren D. Smith in 1995 [4]
to allow for planning steps, as well as game tree search steps.
A rudimentary system employing these ideas for chess was implemented with promising empirical results.
Selected Publications
- Yan Radovilsky, Solomon Eyal Shimony (2004). Generalized Model for Rational Game Tree Search. SMC 2004, pdf [6]
- Yan Radovilsky, Guy Shattah, Solomon Eyal Shimony (2006). Efficient Deterministic Approximation Algorithms for Non-myopic Value of Information in Graphical Models. SMC 2006
- Yan Radovilsky, Solomon Eyal Shimony (2008). Observation Subset Selection as Local Compilation of Performance Profiles. 24. UAI 2008, arXiv:1206.3283
External Links
References
- ↑ Yan's homepage
- ↑ Radovilsky, Yan FIDE Chess Profile
- ↑ Yan Radovilsky, Solomon Eyal Shimony (2004). Generalized Model for Rational Game Tree Search. SMC 2004, pdf
- ↑ Eric B. Baum, Warren D. Smith (1995). Best Play for Imperfect Players and Game Tree Search. Part I - theory, with pseudocode appendix by Charles Garrett
- ↑ dblp: Yan Radovilsky
- ↑ Re: Interesting ideas by Karlo Bala Jr., CCC, September 09, 2015
