Changes

Jump to: navigation, search

Warren D. Smith

5,244 bytes added, 22:23, 14 June 2021
no edit summary
an American physicist, mathematician, general theoretical scientist, and in 2005 founder of the ''Center of Range Voting'' <ref>[https://rangevoting.org/ Center for Range Voting - front page]</ref>.
He received a double [https://en.wikipedia.org/wiki/Bachelor_of_Science B.Sc.] from [[Massachusetts Institute of Technology]] in [https://en.wikipedia.org/wiki/Physics physics] and [https://en.wikipedia.org/wiki/Mathematics mathematics], and a Ph.D. at [https://en.wikipedia.org/wiki/Princeton_University Princeton University] in the field of [https://en.wikipedia.org/wiki/Applied_mathematics applied mathematics] on [https://en.wikipedia.org/wiki/Computational_geometry computational geometry] motivated by [https://en.wikipedia.org/wiki/Mesh_generation Mesh generation],
where his advisors were under [[Mathematician#RETarjan|Robert E. Tarjan]] and [[John H. Conway]] <ref>[https://genealogy.math.ndsu.nodak.edu/id.php?id=87407 The Mathematics Genealogy Project - Warren Smith]</ref>.
He was affiliated with the [[Bell Laboratories|AT&T Bell Laboratories]], the [https://en.wikipedia.org/wiki/NEC_Corporation_of_America NEC Research Institute], [https://en.wikipedia.org/wiki/Princeton,_New_Jersey Princeton, New Jersey], where he wrote most of his papers during the 90s, and with [https://en.wikipedia.org/wiki/DIMACS DIMACS].
His research interest covers the broad range of mathematics, physics, [https://en.wikipedia.org/wiki/Information_theory information theory], [https://en.wikipedia.org/wiki/Computer_science computer science] and [https://en.wikipedia.org/wiki/Politics politics], amongst other things on [[Algorithms|algorithms]], [https://en.wikipedia.org/wiki/Coding_theory coding theory], [https://en.wikipedia.org/wiki/Cryptography cryptography], [https://en.wikipedia.org/wiki/Combinatorics combinatorics], [https://en.wikipedia.org/wiki/Computational_complexity_theory computational complexity], [[Search|game tree search]], [https://en.wikipedia.org/wiki/Game_theory game theory], computer chess, [https://en.wikipedia.org/wiki/Quantum_mechanics quantum mechanics], [https://en.wikipedia.org/wiki/Bayesian_statistics Bayesian statistics], [https://en.wikipedia.org/wiki/Range_voting range voting] and [https://en.wikipedia.org/wiki/Direct_democracy direct democracy]. With the advent of [[Deep Learning|deep learning]] [[Monte-Carlo Tree Search|MCTS]] chess engines after the [[AlphaZero]] publications, Warren D. Smith contributed to [[Leela Chess Zero]] as well as [[Stockfish]] discussions in [[Computer Chess Forums|LCZero]] and [[Computer Chess Forums|FishCooking]] forums respectively. =Test Suite for Chess Programs=In 1993, along with [[Kevin J. Lang]], Warren D. Smith published and described a test suite for chess programs of about 5500 positions, optically scanned from chess books.The suite is arranged in a number of files, each file being thematic by difficulty, tactical, positional and others <ref>[[Kevin J. Lang]], [[Warren D. Smith]] ('''1993'''). ''A Test Suite for Chess Programs''. [https://scorevoting.net/WarrenSmithPages/homepage/testpos.ps ps], [https://www.rangevoting.org/WarrenSmithPages/homepage/ChessTest2.tar.Z ChessTest2.tar.Z]</ref>.
=BPIP-DFISA=
* [[Eric B. Baum]], [[Warren D. Smith]] ('''1997'''). ''[https://www.semanticscholar.org/paper/A-Bayesian-Approach-to-Relevance-in-Game-Playing-Baum-Smith/a157ece9e259fda728485373234d119addd1fe25 A Bayesian Approach to Relevance in Game Playing]''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 97
* [[Warren D. Smith]] ('''1998'''). ''Taking the Fuzz Out of Fuzzy Logic''. [https://en.wikipedia.org/wiki/NEC_Corporation_of_America NEC Research Institute]
* [[Eric B. Baum]], [[Warren D. Smith]] ('''1999'''). ''[https://www.mitpressjournals.org/doi/abs/10.1162/089976699300016881?journalCode=neco 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 ...==
* [[Warren D. Smith]] ('''2000'''). ''[https://www.rangevoting.org/WarrenSmithPages/homepage/rangevote.sue Range Voting]''. [https://www.rangevoting.org/WarrenSmithPages/homepage/rangevote.pdf pdf]
* [[Mathematician#Brent|Richard P. Brent]], [https://dblp.uni-trier.de/pers/hd/o/Osborn:Judy=anne_H= Judy-anne H. Osborn], [[Warren D. Smith]] ('''2016'''). ''Lower bounds on maximal determinants of binary matrices via the probabilistic method''. [https://arxiv.org/abs/1402.6817 arXiv:1402.6817]
* [[Mathematician#Brent|Richard P. Brent]], [https://dblp.uni-trier.de/pers/hd/o/Osborn:Judy=anne_H= Judy-anne H. Osborn], [[Warren D. Smith]] ('''2016'''). ''Probabilistic lower bounds on maximal determinants of binary matrices''. [https://en.wikipedia.org/wiki/Australasian_Journal_of_Combinatorics Australasian Journal of Combinatorics], Vol. 66, [https://arxiv.org/abs/1501.06235 arXiv:1501.06235]
=Forum Posts===2018==* [https://groups.google.com/d/msg/lczero/dU8v637v2Ig/C1-e5JNKCgAJ Re: Low draw rate in training games/data] by [[Warren D. Smith]], [[Computer Chess Forums|LCZero Forum]], April 14, 2018* [https://groups.google.com/d/msg/lczero/EGcJSrZYLiw/netJ4S38CgAJ use multiple neural nets?] by [[Warren D. Smith]], [[Computer Chess Forums|LCZero Forum]], December 25, 2018 » [[Leela Chess Zero]]==2019==* [https://groups.google.com/d/msg/lczero/CrMiK3OR1og/mcFd0NDKDQAJ "boosting" endgames in leela training? Simple change to learning process proposed: "forked" training games] by [[Warren D. Smith]], [[Computer Chess Forums|LCZero Forum]], January 03, 2019 » [[Leela Chess Zero]]* [https://groups.google.com/d/msg/lczero/I0lTgR-fFFU/NGC3kJDzAwAJ Michael Larabel benches lc0 on various GPUs] by [[Warren D. Smith]], [[Computer Chess Forums|LCZero Forum]], January 14, 2019 » [[Leela Chess Zero#Lc0|Lc0]], [[GPU]] <ref>[https://en.wikipedia.org/wiki/Phoronix_Test_Suite Phoronix Test Suite from Wikipedia]</ref>* [https://groups.google.com/d/msg/fishcooking/LEo3GSfeoqM/M1dLkoY3BAAJ TCEC 15 superfinal] by [[Warren D. Smith]], [[Computer Chess Forums|FishCooking]], May 15, 2019 » [[TCEC Season 15#Superfinal|TCEC Season 15 Sufi]] * [https://groups.google.com/d/msg/fishcooking/Ual8DTYpH0I/Ah6hDc-ZBQAJ zugzwang suggestion] by [[Warren D. Smith]], [[Computer Chess Forums|FishCooking]], September 15, 2019* [https://groups.google.com/d/msg/fishcooking/wOfRuzTSi_8/VgjN8MmSBQAJ high dimensional optimization] by [[Warren D. Smith]], [[Computer Chess Forums|FishCooking]], December 27, 2019 <ref>[[Mathematician#YDauphin|Yann Dauphin]], [[Mathematician#RPascanu|Razvan Pascanu]], [[Mathematician#CGulcehre|Caglar Gulcehre]], [[Mathematician#KCho|Kyunghyun Cho]], [[Mathematician#SGanguli|Surya Ganguli]], [[Mathematician#YBengio|Yoshua Bengio]] ('''2014'''). ''Identifying and attacking the saddle point problem in high-dimensional non-convex optimization''. [https://arxiv.org/abs/1406.2572 arXiv:1406.2572]</ref>==2020==* [https://groups.google.com/d/msg/fishcooking/DAWWlmP2OrQ/3w_KhoaUAAAJ underpromoting is worth how many elo?] by [[Warren D. Smith]], [[Computer Chess Forums|FishCooking]], March 08, 2020 » [[Promotions]]* [https://groups.google.com/d/msg/lczero/a66u5_FEtmg/_D9GIMgeAAAJ tcec 17 superfinal] by [[Warren D. Smith]], [[Computer Chess Forums|LCZero Forum]], April 08, 2020 » [[TCEC Season 17#Superfinal|TCEC Season 17 Sufi]] * [https://groups.google.com/d/msg/lczero/xtyGkXqeeTY/0j_DeIbkBAAJ Tcec season 18] by [[Warren D. Smith]], [[Computer Chess Forums|LCZero Forum]], June 14, 2020 » [[TCEC Season 18]]* [https://groups.google.com/d/msg/fishcooking/Tc7XRkbRrSs/mqR5NjfcBQAJ Tcec season 18] by [[Warren D. Smith]], [[Computer Chess Forums|FishCooking]], June 14, 2020: [https://groups.google.com/d/msg/fishcooking/Tc7XRkbRrSs/x9tUlRK1AgAJ Re: Tcec season 18] by [[Warren D. Smith]], [[Computer Chess Forums|FishCooking]], June 28, 2020 » [[Pawn Center]], [[TCEC Season 18#Sufi63|TCEC Season 18 Sufi Game 63 10... c4]] <ref>[https://en.wikipedia.org/wiki/Andrew_Soltis Andrew Soltis] ('''1976, 1995, 2013'''). ''Pawn Structure Chess''. Tartan Books, 1995 McKay, 2013 Batsford Chess</ref>* [https://groups.google.com/d/msg/fishcooking/EBKQSrb9I08/5xasTnnSCAAJ stockfishNNUE vs others (TCEC 18 bonus)] by [[Warren D. Smith]], [[Computer Chess Forums|FishCooking]], July 14, 2020==2021==* [https://groups.google.com/g/lczero/c/gecAk5DflmE/m/lUGWpjZXBwAJ KataGo] by [[Warren D. Smith]], [[Computer Chess Forums|LCZero Forum]], March 16, 2021* [https://groups.google.com/g/lczero/c/TLCMkkdm1hw/m/F9JjnN8FBQAJ Re: Idea: use range (evalMin - evalMax) for position evaluation] by [[Warren D. Smith]], [[Computer Chess Forums|LCZero Forum]], May 29, 2021 <ref>[[Eric B. Baum]], [[Warren D. Smith]] ('''1999'''). ''[https://www.mitpressjournals.org/doi/abs/10.1162/089976699300016881?journalCode=neco Propagating Distributions Up Directed Acyclic Graphs]''. [https://en.wikipedia.org/wiki/Neural_Computation_%28journal%29 Neural Computation], Vol. 11, No. 1</ref> 
=External Links=
* [http://wdstalks.blogspot.com/ Warren D. Smith's blog]
[[Category:Researcher|Smith]]
[[Category:Mathematician|Smith]]
[[Category:Physicist|Smith]]
Retrieved from "https://www.chessprogramming.org/Special:MobileDiff/19139...25057"

Navigation menu