Value tournament #39
Open
Value tournament #39
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
…LeelaChessZero#1470) * Disable WDL lookups when playing from DTZ restricted search position. * Address review comments.
* avoid meson > 0.56.0 breakage * fix jetson support * add cc_cuda build option to select specific target CC * remove extra whitespace Co-authored-by: borg323 <[email protected]>
Co-authored-by: borg323 <[email protected]>
…ble to make it optional. (LeelaChessZero#1490) * An alternative multigather which skips a few details in order to be able to make it optional. * Small cleanups. * Update comment based on code review. * Copy fix for search past CP terminals accross from PR1483 * Some review feedback. * Extract some repeated logic to do with task management. * Code review fix. * Code review suggestion cleanup. * Fix a bug that could cause out of order limit to be exceeded. * Some more cleanups. * Change some things from arrays to std::array * Extract a bit more duplicated task code. * Some more small cleanups. * Extract two fold repetition to its own method. * Reorder GatherMinibatch2 to make it a tiny bit simpler. * Avoid unneeded 2 naming on PickNodesToExtend. * Fix missing break statements from switch. * Code review feedback.
…#1495) Cleanu post PR1490 merge.
…aChessZero#1496) Rather than duplicating code. Cleanup post PR1490 merge.
3% increase in nps on benchmark. 100% increase in nps in #1 positions.
…o#1503) * Early exit gathering if all collisions and backend is idle. * Fix logic. * Even more aggressive. * Don't enable if threads=1. * Parameterise the behavior.
Co-authored-by: borg323 <[email protected]>
* Actively split pick tasks as early as possible. Should reduce picking latency. * Formatting.
* HashKeyedCache Has less pointer chasing than the previous version. * Fix one critical bug and one tiny bug. The first item in each run after an erase/swap_to_erased was incorrectly *always* considered to be InRange - so unless the run continued past that point, it would not be swapped in to the correct position, and nor would anything else. Thus the item could no longer be found in the cache. Luckily Evict code is overzealous and will always remove the item eventually (at a large cpu cost) to avoid cache flood, but inability to find the item in the cache normally means unpin doesn't work, so such items all go into an ever growing evict list, which progressively makes unpin slower and slower. also was missing a return path when removing a pin from evict list that wasn't the last pin. Meaning it would pointlessly search the main list, fail and then trigger the debug assert (if debug asserts were enabled in the build...) * Fix some comments. * Code review and a bug fix.
Co-authored-by: borg323 <[email protected]>
Co-authored-by: borg323 <[email protected]>
also do the softmax after unlocking the gpu
…sZero#1526) * Apply drift correction to q and d values in training data. * Increase eps based on testing. * Switch to CERR. * Update allowed_eps based on testing with a non-broken backend... Also include actual detail in the log messages.
…1897) * first attempt at onnx-rocm backend * support local onnxruntime builds * rocm needs locking
Looks for "simple" in the executable name and offers a vastly simplified user interface. Most options are hidden and the legacy time manager is made default with only Slowmover exposed as a new option.
* onnx2leela options to fix tf exported onnx models * initial support for onnx external data * autodetect fp16 onnx model * ensure outputs have the same data type as the input
* allow backends to suggest minibatch size * simple cuda heuristic
…ro#1924) * Accomodating onnx2pytorch for conv-blocks * alternate onnx layernorm implementation with explicit fp32 casting * Switch for supporting onnx2pytorch Co-authored-by: borg323 <[email protected]>
* auto setting of threads and task workers * handle cuda multi stream * handle multiplexers
Option TaskWorkers uses default value (-1) outside its range [0, 128]. Fix this by expanding the range to [-1, 128].
…--> Contempt calculation (LeelaChessZero#1941)
* Add a mode to turn lc0 into a chunk data rescorer powered by Tablebase. * Add some stats. * Add secondary rescoring using wdl to reduce back propigation of blunders a bit. * Add policy distribution adjust support to rescorer. * Track the game outcomes, and the change to the start of the game * Add DTZ based assistance for secondary rescoring. * Change move count to a moves remaining to potentially use for modulating target value. * Use DTZ for pawnless 3 piece positions as a substitue for DTM to adjust move_count to be more correct * another fix. * More fixing. * Getting things compiling again. * Make rescorer more obvious. * reorder to match struct order. * Actually update the version when converting to v4 format. * Implement the threading support. * Fix compilation issues on some compilers. * More compilation fixing. * Fix off by one. * Add support for root probe policy boosting for minimum dtz in winning positions. * Fix test compile. * Fix missing option. * Add a counter. * Log if policy boost is for a move labelled illegal. * Add a histogram for total amount of boosted policy per boosted position. * Distribute boost rather than apply to all - also log before and after dists. * Add gaviotatb code for later use in dtm_boost * Fix compile issue on linux. * Prepare logic for dtm policy boost. * Load gaviota tb if specified. * Probe gaviota to decide which 'safe' moves are most deserving of boost based on dtm. * First attempt at supporting arbitrary starting point training data for rescorer. * Fix missing brackets. * Some fixes. * Avoid crashes from walking history before start of provided game information. * Some more merge fixes. * Fix some formatting. * Only process .gz files, don't crash out on invalid files, don't create output until input has been read. * Don't keep partially valid files. * Add basic range validation for input data. * Don't create writer any earlier than needed. * Fix decoding castling moves for the new Move format. * Validate game moves for legality. * Also log illegal move if it passes probability check but fails the real check. * Fix another merge error. * Compile fix for linux. * Plies left in rescorer (#1) * Rescore move_count using Gaviota TBs * Fix lczero-common commit * Add condition for Gaviota move_count rescoring * Post merge fixup for the kings/knights change in board. * Rescore tb v5 (#2) * Make lc0 output v5 training data. * Finish merge of v5 data into rescorer tb. * Fixes for rescoring v4 data. * Revert some unneeded formatting changes. * Support FRC input_format in rescoring. * Add some very important missing break statements... * Fix merge. * Change movement decode to not rely on there being any history planes filled in. Since that will not always be the case for input type 3. * Minimum changes to make it compile again post merge. * Input format 3 support. * Fix data range checks were incorrect for format 3 and 2. * Fix up bugs with chess 960 castle moves that leave a rook or king in place. * Post merge compile fixups for renames. * Add support for hectoplies and hectoplies armageddon to validate, and fixup the merge of latest code. * More fixes for type 4 and 132. * Add input format conversion support to rescorer. * Better match for training. * Add canonical v2 format to rescorer. * Add a utility for substituting policy from higher quality data into main data. * Fix missing option and add some commented out diagnostic code. * More cleanup in comments. * Handle empty policy-substitutions dir and input dir better. * Don't keep chunks that are marked as not for training. * More fixes for handling files with placeholder chunks. * Add 'deblunderer' Completely untested... * Fix some bugs in deblunder. * simplify windows rescorer build (#4) Co-authored-by: borg323 <[email protected]> * Tweak windows build file. * Some updates for writer.h/cc for v6 * Update rescorer loop.cc for V6. * Some additional validations to do with played_idx/best_idx. * make appveyor build the rescorer (#7) Co-authored-by: borg323 <[email protected]> * subproject for gaviota tb files (#8) Co-authored-by: borg323 <[email protected]> * 'Fix' for build on windows Probably should be fixed some other way... * Fix my breakage. (#9) * Update loop.cc * Update meson.build * Use the v6 field played_q to do a more direct blunder rescoring (#5) * included the issue 1308 deblunder mechanism in loop.cc * blunder detection now acts on missed proven wins and unforced proven losses * added comment on missing activeM * removed probabilistic randomization of result rescorer and worked with v6 data instead * included moves left rescore, removed unneeded options * doubled code not needed as final positions aren't special * changed appveyor script to hopefully build rescorer.sln * reverted failed attempt at fixing appveyor * included minimal std::cout for blunders * included blunder counter, added comment to visits v6 data checking * checking for bit 3 of invariance info to make sure best_q is a proven win * Fix v5 upgrading for decisive games. * Additional safety. * Add missing brackets. * don't keep the first TB position for the deblundering pass. (#10) * included the issue 1308 deblunder mechanism in loop.cc * blunder detection now acts on missed proven wins and unforced proven losses * added comment on missing activeM * removed probabilistic randomization of result rescorer and worked with v6 data instead * included moves left rescore, removed unneeded options * doubled code not needed as final positions aren't special * changed appveyor script to hopefully build rescorer.sln * reverted failed attempt at fixing appveyor * included minimal std::cout for blunders * included blunder counter, added comment to visits v6 data checking * checking for bit 3 of invariance info to make sure best_q is a proven win * don't keep the first TB position for rescorer * change recorer logo (#11) Co-authored-by: borg323 <[email protected]> * Make the deblunder transition soft through a width parameter (#13) * included the issue 1308 deblunder mechanism in loop.cc * blunder detection now acts on missed proven wins and unforced proven losses * added comment on missing activeM * removed probabilistic randomization of result rescorer and worked with v6 data instead * included moves left rescore, removed unneeded options * doubled code not needed as final positions aren't special * changed appveyor script to hopefully build rescorer.sln * reverted failed attempt at fixing appveyor * included minimal std::cout for blunders * included blunder counter, added comment to visits v6 data checking * checking for bit 3 of invariance info to make sure best_q is a proven win * don't keep the first TB position for rescorer * added a deblunder width parameter to allow a soft transition * clang formatting * resolve merge conflict * Add nnue plain file output (#12) * GetFen() from pr834 * first version of nnue output * flag to delete fils * address review comments * support pre v6 data * fix sign * correct nnue data misunderstanding Co-authored-by: borg323 <[email protected]> * fix copy-paste error (#15) Co-authored-by: borg323 <[email protected]> * add -t flag (#16) Co-authored-by: borg323 <[email protected]> * Post merge fixes. * Missed cleanup. * Fix input format change bug that can corrupt played_idx and best_idx * Post merge fixes. * fix merge * remove unnecessary options * split out rescore loop * minimize rescorer build * merge rescorer with master * minimize syzygy diff --------- Co-authored-by: Tilps <[email protected]> Co-authored-by: Henrik Forstén <[email protected]> Co-authored-by: borg323 <[email protected]> Co-authored-by: Naphthalin <[email protected]>
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
No description provided.