Difference between revisions of "Eric B. Baum"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| (3 intermediate revisions by the same user not shown) | |||
| Line 18: | Line 18: | ||
* [[Eric B. Baum]] ('''1992'''). ''On Optimal Game Tree Propagation for Imperfect Players''. [[AAAI|AAAI-92]], [http://www.aaai.org/Papers/AAAI/1992/AAAI92-078.pdf pdf] | * [[Eric B. Baum]] ('''1992'''). ''On Optimal Game Tree Propagation for Imperfect Players''. [[AAAI|AAAI-92]], [http://www.aaai.org/Papers/AAAI/1992/AAAI92-078.pdf pdf] | ||
* [[Eric B. Baum]], [https://en.wikipedia.org/wiki/Dan_Boneh Dan Boneh], [[Charles Garrett]] ('''1995'''). ''[http://dl.acm.org/citation.cfm?id=225326 On Genetic Algorithms]''. [http://dblp.uni-trier.de/db/conf/colt/colt1995.html#BaumBG95 COLT 1995] | * [[Eric B. Baum]], [https://en.wikipedia.org/wiki/Dan_Boneh Dan Boneh], [[Charles Garrett]] ('''1995'''). ''[http://dl.acm.org/citation.cfm?id=225326 On Genetic Algorithms]''. [http://dblp.uni-trier.de/db/conf/colt/colt1995.html#BaumBG95 COLT 1995] | ||
| − | * [[Eric B. Baum]], [[Warren D. Smith]] ('''1995'''). ''Best Play for Imperfect Players and Game Tree | + | * [[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]] |
| − | + | * [[Warren D. Smith]], [[Eric B. Baum]], [[Charles Garrett]], [[Rico Tudor]] ('''1995'''). ''[https://www.semanticscholar.org/paper/Best-Play-for-Imperfect-Players-and-Game-Tree-Part-Smith-Baum/3ce418d28c967ef2b79bd509127b5bba334d2b6a Best Play for Imperfect Players and Game Tree Search]''. Part 2 - Experiments | |
| − | * [[Warren D. Smith]], [[Eric B. Baum]], [[Charles Garrett]], [[Rico Tudor]] ('''1995'''). ''Best Play for Imperfect Players and Game Tree Search''. Part 2 - Experiments | ||
* [[Eric B. Baum]] ('''1996'''). ''Toward a Model of Mind as a Laissez-Faire Economy of Idiots''. [http://dblp.uni-trier.de/db/conf/icml/icml1996.html#Baum96 ICML 1996] | * [[Eric B. Baum]] ('''1996'''). ''Toward a Model of Mind as a Laissez-Faire Economy of Idiots''. [http://dblp.uni-trier.de/db/conf/icml/icml1996.html#Baum96 ICML 1996] | ||
* [[Eric B. Baum]], [[Warren D. Smith]] ('''1997'''). ''A Bayesian Approach to Relevance in Game Playing''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 97, [http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.7961 CiteSeerX] | * [[Eric B. Baum]], [[Warren D. Smith]] ('''1997'''). ''A Bayesian Approach to Relevance in Game Playing''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 97, [http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.7961 CiteSeerX] | ||
| − | * [[Eric B. Baum]], [[Warren D. Smith]] ('''1999'''). ''[http://www.mitpressjournals.org/doi/abs/10.1162/089976699300016881#.VfGWUpdpluM Propagating Distributions Up Directed Acyclic Graphs]''. [https://en.wikipedia.org/wiki/Neural_Computation_%28journal%29 Neural Computation], Vol. 11, No. 1 | + | * [[Eric B. Baum]], [[Warren D. Smith]] ('''1999'''). ''[http://www.mitpressjournals.org/doi/abs/10.1162/089976699300016881#.VfGWUpdpluM Propagating Distributions Up Directed Acyclic Graphs]''. [https://en.wikipedia.org/wiki/Neural_Computation_%28journal%29 Neural Computation], Vol. 11, No. 1 <ref>[https://groups.google.com/g/lczero/c/TLCMkkdm1hw/m/SgbGghzhBAAJ Re: Idea: use range (evalMin - evalMax) for position evaluation] by [[Álvaro Begué]], [[Computer Chess Forums|LCZero Forum]], May 28, 2021</ref> |
==2000 ...== | ==2000 ...== | ||
* [[Eric B. Baum]], [[Igor Durdanovic]] ('''2000'''). ''[http://www.mitpressjournals.org/doi/abs/10.1162/089976600300014700#.VfGbP5dpluM Evolution of Cooperative Problem Solving in an Artificial Economy]''. [https://en.wikipedia.org/wiki/Neural_Computation_%28journal%29 Neural Computation], Vol. 12, No. 12, [http://www.eecs.harvard.edu/cs286r/courses/spring06/papers/baum_nc00.pdf pdf] | * [[Eric B. Baum]], [[Igor Durdanovic]] ('''2000'''). ''[http://www.mitpressjournals.org/doi/abs/10.1162/089976600300014700#.VfGbP5dpluM Evolution of Cooperative Problem Solving in an Artificial Economy]''. [https://en.wikipedia.org/wiki/Neural_Computation_%28journal%29 Neural Computation], Vol. 12, No. 12, [http://www.eecs.harvard.edu/cs286r/courses/spring06/papers/baum_nc00.pdf pdf] | ||
| Line 36: | Line 35: | ||
=References= | =References= | ||
<references /> | <references /> | ||
| − | |||
'''[[People|Up one level]]''' | '''[[People|Up one level]]''' | ||
[[Category:Researcher|Baum]] | [[Category:Researcher|Baum]] | ||
| + | [[Category:Physicist|Baum]] | ||
Latest revision as of 22:24, 14 June 2021
Eric Baum [1]
Eric B. Baum,
an American physicist, computer scientist and artificial intelligence researcher. He earned undergraduate and graduate degrees at Harvard University and a Ph.D. in physics at Princeton University. He has held positions at the University of California, Berkeley, California Institute of Technology, Massachusetts Institute of Technology, Princeton, and the NEC Research Institute. His research interests include machine learning, neural networks, genetic algorithms and game tree search, in particular the BPIP-DFISA (Best play for imperfect players - Depth free independent staircase approximation) search control model. Currently, he is developing algorithms based on machine learning and bayesian reasoning to found a hedge fund [2]. Eric Baum is known for his materialist and evolutionist theories of intelligence and consciousness, set forth in his book What is Thought? [3].
Contents
Selected Publications
1987 ...
- Eric B. Baum, Frank Wilczek (1987). Supervised Learning of Probability Distributions by Neural Networks. NIPS 1987
- Eric B. Baum, David Haussler (1988). What Size Net Gives Valid Generalization? NIPS 1988
- Eric B. Baum (1988). On the capabilities of multilayer perceptrons. Complexity, Vol. 4, No. 3
- Eric B. Baum (1989). The Perceptron Algorithm Is Fast for Non-Malicious Distributions. NIPS 1989
- Eric B. Baum (1989). A Proposal for More Powerful Learning Algorithms. Neural Computation, Vol. 1, No. 2
1990 ...
- Eric B. Baum (1990). Polynomial Time Algorithms for Learning Neural Nets. COLT 1990
- Eric B. Baum (1992). On Optimal Game Tree Propagation for Imperfect Players. AAAI-92, pdf
- Eric B. Baum, Dan Boneh, Charles Garrett (1995). On Genetic Algorithms. COLT 1995
- 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
- Warren D. Smith, Eric B. Baum, Charles Garrett, Rico Tudor (1995). Best Play for Imperfect Players and Game Tree Search. Part 2 - Experiments
- Eric B. Baum (1996). Toward a Model of Mind as a Laissez-Faire Economy of Idiots. ICML 1996
- Eric B. Baum, Warren D. Smith (1997). A Bayesian Approach to Relevance in Game Playing. Artificial Intelligence, Vol. 97, CiteSeerX
- Eric B. Baum, Warren D. Smith (1999). Propagating Distributions Up Directed Acyclic Graphs. Neural Computation, Vol. 11, No. 1 [6]
2000 ...
- Eric B. Baum, Igor Durdanovic (2000). Evolution of Cooperative Problem Solving in an Artificial Economy. Neural Computation, Vol. 12, No. 12, pdf
- Eric B. Baum, Dan Boneh, Charles Garrett (2001). Where Genetic Algorithms Excel. Evolutionary Computation, Vol. 9, No. 1
- Eric B. Baum (2004). What is Thought? Bradford Book
