Difference between revisions of "Thomas Dybdahl Ahle"
GerdIsenberg (talk | contribs) (Created page with "'''Home * People * Thomas Dybdahl Ahle''' FILE:ThomasDybdahlAhle.jpg|border|right|thumb|link=https://github.com/thomasahle| Thomas Dybdahl Ahle <ref>[htt...") |
GerdIsenberg (talk | contribs) |
||
| (3 intermediate revisions by the same user not shown) | |||
| Line 6: | Line 6: | ||
a Danish computer scientist, software developer, and currently post doctoral researcher at Basic Algorithms Research group (BARC) <ref>[https://barc.ku.dk/ BARC – University of Copenhagen]</ref> at [https://en.wikipedia.org/wiki/University_of_Copenhagen University of Copenhagen] <ref>[https://dk.linkedin.com/in/thomasahle Thomas Dybdahl Ahle | LinkedIn]</ref>. | a Danish computer scientist, software developer, and currently post doctoral researcher at Basic Algorithms Research group (BARC) <ref>[https://barc.ku.dk/ BARC – University of Copenhagen]</ref> at [https://en.wikipedia.org/wiki/University_of_Copenhagen University of Copenhagen] <ref>[https://dk.linkedin.com/in/thomasahle Thomas Dybdahl Ahle | LinkedIn]</ref>. | ||
He holds a [https://en.wikipedia.org/wiki/Master_of_Arts#Oxford.2C_Cambridge.2C_Dublin_.28conferred.2C_not_earned.29 Master of Arts] in computer science in 2013 from [https://en.wikipedia.org/wiki/University_of_Oxford University of Oxford], | He holds a [https://en.wikipedia.org/wiki/Master_of_Arts#Oxford.2C_Cambridge.2C_Dublin_.28conferred.2C_not_earned.29 Master of Arts] in computer science in 2013 from [https://en.wikipedia.org/wiki/University_of_Oxford University of Oxford], | ||
| − | and Ph.D. in [[Algorithms|algorithms]] and [https://en.wikipedia.org/wiki/Theoretical_computer_science theoretical computer science] from | + | and a M.Sc. and Ph.D. in [[Algorithms|algorithms]] and [https://en.wikipedia.org/wiki/Theoretical_computer_science theoretical computer science] from University of Copenhagen in 2017 and 2019 respectively. |
=Computer Chess= | =Computer Chess= | ||
| Line 14: | Line 14: | ||
<ref>[https://dblp.uni-trier.de/pers/hd/a/Ahle:Thomas_D= dblp: Thomas D. Ahle]</ref> <ref>[https://scholar.google.dk/citations?user=aRiVoYgAAAAJ Thomas D. Ahle - Google Scholar Citations]</ref> <ref>[http://www.itu.dk/people/thdy/ Thomas Dybdahl Ahle]</ref> | <ref>[https://dblp.uni-trier.de/pers/hd/a/Ahle:Thomas_D= dblp: Thomas D. Ahle]</ref> <ref>[https://scholar.google.dk/citations?user=aRiVoYgAAAAJ Thomas D. Ahle - Google Scholar Citations]</ref> <ref>[http://www.itu.dk/people/thdy/ Thomas Dybdahl Ahle]</ref> | ||
* [[Thomas Dybdahl Ahle]], [[Mathematician#RPagh|Rasmus Pagh]], [[Mathematician#IRazenshteyn|Ilya Razenshteyn]], [https://dblp.uni-trier.de/pers/hd/s/Silvestri_0001:Francesco Francesco Silvestri] ('''2015'''). ''On the Complexity of Inner Product Similarity Join''. [https://arxiv.org/abs/1510.02824 arXiv:1510.02824] | * [[Thomas Dybdahl Ahle]], [[Mathematician#RPagh|Rasmus Pagh]], [[Mathematician#IRazenshteyn|Ilya Razenshteyn]], [https://dblp.uni-trier.de/pers/hd/s/Silvestri_0001:Francesco Francesco Silvestri] ('''2015'''). ''On the Complexity of Inner Product Similarity Join''. [https://arxiv.org/abs/1510.02824 arXiv:1510.02824] | ||
| − | * [[Thomas Dybdahl Ahle]], [[Mathematician#MAumueller|Martin Aumüller]], [[Mathematician#RPagh|Rasmus Pagh]] ('''2016'''). ''Parameter-free Locality Sensitive Hashing for Spherical Range Reporting''. [https://arxiv.org/abs/1605.02673 arXiv:1605.02673] | + | * [[Thomas Dybdahl Ahle]], [[Mathematician#MAumueller|Martin Aumüller]], [[Mathematician#RPagh|Rasmus Pagh]] ('''2016'''). ''Parameter-free Locality Sensitive Hashing for Spherical Range Reporting''. [https://arxiv.org/abs/1605.02673 arXiv:1605.02673] <ref>[https://en.wikipedia.org/wiki/Locality-sensitive_hashing Locality-sensitive hashing from Wikipedia]</ref> |
* [[Thomas Dybdahl Ahle]] ('''2017'''). ''Optimal Las Vegas Locality Sensitive Data Structures''. [https://arxiv.org/abs/1704.02054 arXiv:1704.02054] | * [[Thomas Dybdahl Ahle]] ('''2017'''). ''Optimal Las Vegas Locality Sensitive Data Structures''. [https://arxiv.org/abs/1704.02054 arXiv:1704.02054] | ||
| − | * [[Thomas Dybdahl Ahle]] ('''2017'''). ''Optimal Set Similarity Data-structures Without False Negatives''. Master thesis, [https://en.wikipedia.org/wiki/University_of_Copenhagen University of Copenhagen], [http://www.itu.dk/people/thdy/papers/minhash.pdf pdf] | + | * [[Thomas Dybdahl Ahle]] ('''2017'''). ''Optimal Set Similarity Data-structures Without False Negatives''. Master thesis, [https://en.wikipedia.org/wiki/University_of_Copenhagen University of Copenhagen], [http://www.itu.dk/people/thdy/papers/minhash.pdf pdf] <ref>[https://en.wikipedia.org/wiki/MinHash MinHash from Wikipedia]</ref> |
* [[Thomas Dybdahl Ahle]] ('''2019'''). ''Subsets and Supermajorities: Unifying Hashing-based Set Similarity Search''. [https://arxiv.org/abs/1904.04045 arXiv:1904.04045] | * [[Thomas Dybdahl Ahle]] ('''2019'''). ''Subsets and Supermajorities: Unifying Hashing-based Set Similarity Search''. [https://arxiv.org/abs/1904.04045 arXiv:1904.04045] | ||
* [[Thomas Dybdahl Ahle]] ('''2019'''). ''Algorithms for Sets''. Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_Copenhagen University of Copenhagen] | * [[Thomas Dybdahl Ahle]] ('''2019'''). ''Algorithms for Sets''. Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_Copenhagen University of Copenhagen] | ||
| Line 27: | Line 27: | ||
* [http://www.talkchess.com/forum/viewtopic.php?t=64972 Approximating Stockfish's Evaluation by PSQTs] by [[Thomas Dybdahl Ahle]], [[CCC]], August 23, 2017 » [[Automated Tuning#Regression|Regression]], [[Piece-Square Tables]], [[Stockfish]] | * [http://www.talkchess.com/forum/viewtopic.php?t=64972 Approximating Stockfish's Evaluation by PSQTs] by [[Thomas Dybdahl Ahle]], [[CCC]], August 23, 2017 » [[Automated Tuning#Regression|Regression]], [[Piece-Square Tables]], [[Stockfish]] | ||
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=71301&start=8 Re: A question to MCTS + NN experts] by [[Thomas Dybdahl Ahle]], [[CCC]], August 04, 2019 | * [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=71301&start=8 Re: A question to MCTS + NN experts] by [[Thomas Dybdahl Ahle]], [[CCC]], August 04, 2019 | ||
| + | * [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=71650 New Tool for Tuning with Skopt] by [[Thomas Dybdahl Ahle]], [[CCC]], August 25, 2019 » [[Automated Tuning]] <ref>[https://scikit-optimize.github.io/ skopt API documentation]</ref> | ||
=External Links= | =External Links= | ||
Revision as of 10:33, 26 August 2019
Home * People * Thomas Dybdahl Ahle
Thomas Dybdahl Ahle [1]
Thomas Dybdahl Ahle,
a Danish computer scientist, software developer, and currently post doctoral researcher at Basic Algorithms Research group (BARC) [2] at University of Copenhagen [3].
He holds a Master of Arts in computer science in 2013 from University of Oxford,
and a M.Sc. and Ph.D. in algorithms and theoretical computer science from University of Copenhagen in 2017 and 2019 respectively.
Computer Chess
Thomas Dybdahl Ahle is owner and primary developer of PyChess, a chess client and engine for the Linux desktop. He is further author of the didactic Python open source chess engines Sunfish [4] and Fastchess, the latter a one-layer neural network softmax model, combined with a Monte-Carlo Tree Search.
Selected Publications
- Thomas Dybdahl Ahle, Rasmus Pagh, Ilya Razenshteyn, Francesco Silvestri (2015). On the Complexity of Inner Product Similarity Join. arXiv:1510.02824
- Thomas Dybdahl Ahle, Martin Aumüller, Rasmus Pagh (2016). Parameter-free Locality Sensitive Hashing for Spherical Range Reporting. arXiv:1605.02673 [8]
- Thomas Dybdahl Ahle (2017). Optimal Las Vegas Locality Sensitive Data Structures. arXiv:1704.02054
- Thomas Dybdahl Ahle (2017). Optimal Set Similarity Data-structures Without False Negatives. Master thesis, University of Copenhagen, pdf [9]
- Thomas Dybdahl Ahle (2019). Subsets and Supermajorities: Unifying Hashing-based Set Similarity Search. arXiv:1904.04045
- Thomas Dybdahl Ahle (2019). Algorithms for Sets. Ph.D. thesis, University of Copenhagen
- Thomas Dybdahl Ahle, Michael Kapralov, Jakob B. T. Knudsen, Rasmus Pagh, Ameya Velingker, David P. Woodruff, Amir Zandieh (2019). Oblivious Sketching of High-Degree Polynomial Kernels. pdf
Postings
- Sunfish – A 111 line Chess Engine in Python by Thomas Dybdahl Ahle, reddit, February 16, 2014
- Negative alpha/beta windows: Are they useful? by Thomas Dybdahl Ahle, CCC, March 06, 2015
- Storing both alpha and beta scores in TT by Thomas Dybdahl Ahle, CCC, August 02, 2016 » Transposition Table
- Approximating Stockfish's Evaluation by PSQTs by Thomas Dybdahl Ahle, CCC, August 23, 2017 » Regression, Piece-Square Tables, Stockfish
- Re: A question to MCTS + NN experts by Thomas Dybdahl Ahle, CCC, August 04, 2019
- New Tool for Tuning with Skopt by Thomas Dybdahl Ahle, CCC, August 25, 2019 » Automated Tuning [10]
External Links
- Thomas Dybdahl Ahle
- Thomas Dybdahl Ahle | LinkedIn
- User Thomas Dybdahl Ahle - MathOverflow
- thomasahle (Thomas Dybdahl Ahle) · GitHub
- Thomas D. Ahle - Google Scholar Citations
- Thomas Dybdahl Ahle (@thomasahle) | Twitter
References
- ↑ thomasahle (Thomas Dybdahl Ahle) · GitHub
- ↑ BARC – University of Copenhagen
- ↑ Thomas Dybdahl Ahle | LinkedIn
- ↑ Jonni Bidwell (2016). Python: Sunfish chess engine. Linux Format, pdf
- ↑ dblp: Thomas D. Ahle
- ↑ Thomas D. Ahle - Google Scholar Citations
- ↑ Thomas Dybdahl Ahle
- ↑ Locality-sensitive hashing from Wikipedia
- ↑ MinHash from Wikipedia
- ↑ skopt API documentation
