Release TF-DF 1.6.0 and YDF 1.6.0

PiperOrigin-RevId: 569106996
google · Sep 28, 2023 · 5a9b6ff · 5a9b6ff
1 parent 39bebc1
commit 5a9b6ff
Show file tree

Hide file tree

Showing 4 changed files with 15 additions and 22 deletions.
diff --git a/CHANGELOG.md b/CHANGELOG.md
@@ -1,15 +1,6 @@
 # Changelog
 
-## HEAD
-
--   Add support for monotonic constraints for gradient boosted trees.
-
-## Fix
-
--   Fix Window compilation with Visual Studio 2019
--   Improved error messages for invalid training configuration
-
-## Breaking change
+## Breaking changes
 
 -   The dependency to the distributed gradient boosted trees learner is renamed
     from
@@ -22,16 +13,19 @@
 -   The training configuration must contain a label. A missing label is no
     longer interpreted as the label being the input feature "".
 
-## 1.6.0 - rc0 2023-08-22
-
 ### Feature
 
+
+-   Add support for monotonic constraints for gradient boosted trees.
 -   Improve speed of dataset reading and writing.
 
 ### Fix
 
 -   Proper error message when using distributed training on more than 2^31
     (i.e., ~2B) examples while compiling YDF with 32-bits example index.
+-   Fix Window compilation with Visual Studio 2019
+-   Improved error messages for invalid training configuration
+-   Replaced outdated dependencies
 
 ## 1.5.0 - 2023-07-03
 

diff --git a/README.md b/README.md
@@ -166,6 +166,11 @@ the following paper:
 Yggdrasil Decision Forests: A Fast and Extensible Decision Forests Library,
 Guillame-Bert et al., KDD 2023: 4068-4077. doi:10.1145/3580305.3599933
 
+## Contact
+
+You can contact the core development team at
+[[email protected]](mailto:[email protected]).
+
 ## Credits
 
 Yggdrasil Decision Forests and TensorFlow Decision Forests are developed by:

diff --git a/documentation/developer_manual.md b/documentation/developer_manual.md
@@ -4,13 +4,7 @@
 
 <!--ts-->
 
-*   [Developer Manual](#developer-manual)
-    *   [Table of Contents](#table-of-contents)
-    *   [Design principles](#design-principles)
-    *   [Where to change the code](#where-to-change-the-code)
-    *   [Integration with existing code](#integration-with-existing-code)
-    *   [How to test the code](#how-to-test-the-code)
-    *   [Models and Learners](#models-and-learners)
+<!-- Created by https://github.com/ekalinin/github-markdown-toc -->
 
 <!--te-->
 

diff --git a/documentation/rtd/hyper_parameters.md b/documentation/rtd/hyper_parameters.md
@@ -869,7 +869,7 @@ reasonable time.
 <font size="2">
 
 A CART (Classification and Regression Trees) a decision tree. The non-leaf nodes
-contains conditions (also known as splits) while the leaf nodes contains
+contains conditions (also known as splits) while the leaf nodes contain
 prediction values. The training dataset is divided in two parts. The first is
 used to grow the tree while the second is used to prune the tree.
 
@@ -1121,8 +1121,8 @@ learner hyper-parameters.
 
 -   **Type:** Real **Default:** 0.1 **Possible values:** min:0 max:1
 
--   Ratio of the training dataset used to create the validation dataset used to
-    prune the tree. If set to 0, the entire dataset is used for training, and
+-   Ratio of the training dataset used to create the validation dataset for
+    pruning the tree. If set to 0, the entire dataset is used for training, and
     the tree is not pruned.
 
 </font>