what does regularization mean in xgboost (tree)












2












$begingroup$


In xgboost (xgbtree), gamma is the tunning parameter to control the regularization. I understand what regularization means in xgblinear and logistic regression, but in the context of tree-based methods, I'm not sure how regularization works.



Can someone explain how regularization works in xgbtree?






r regularization xgboost







share|cite|improve this question











$endgroup$

















    2












    $begingroup$


    In xgboost (xgbtree), gamma is the tunning parameter to control the regularization. I understand what regularization means in xgblinear and logistic regression, but in the context of tree-based methods, I'm not sure how regularization works.



    Can someone explain how regularization works in xgbtree?






    r regularization xgboost







    share|cite|improve this question











    $endgroup$















      2












      2








      2





      $begingroup$


      In xgboost (xgbtree), gamma is the tunning parameter to control the regularization. I understand what regularization means in xgblinear and logistic regression, but in the context of tree-based methods, I'm not sure how regularization works.



      Can someone explain how regularization works in xgbtree?






      r regularization xgboost







      share|cite|improve this question











      $endgroup$




      In xgboost (xgbtree), gamma is the tunning parameter to control the regularization. I understand what regularization means in xgblinear and logistic regression, but in the context of tree-based methods, I'm not sure how regularization works.



      Can someone explain how regularization works in xgbtree?






      r regularization xgboost




      r regularization xgboost






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited 1 hour ago









      kiamlaluno

      1034




      1034










      asked 5 hours ago









      zeslazesla

      1978




      1978






















          1 Answer
          1






          active

          oldest

          votes


















          2












          $begingroup$

          In tree-based methods regularization is usually understood as defining a minimum gain so which another split happens:




          Minimum loss reduction required to make a further partition on a leaf
          node of the tree. The larger gamma is, the more conservative the
          algorithm will be.




          Source: https://xgboost.readthedocs.io/en/latest/parameter.html



          This minimum gain can usually be set for anything between $(0,infty)$.



          Here's a somewhat good article on how to tune regularization on XGBoost.






          share|cite|improve this answer











          $endgroup$













            Your Answer





            StackExchange.ifUsing("editor", function () {
            return StackExchange.using("mathjaxEditing", function () {
            StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
            StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
            });
            });
            }, "mathjax-editing");

            StackExchange.ready(function() {
            var channelOptions = {
            tags: "".split(" "),
            id: "65"
            };
            initTagRenderer("".split(" "), "".split(" "), channelOptions);

            StackExchange.using("externalEditor", function() {
            // Have to fire editor after snippets, if snippets enabled
            if (StackExchange.settings.snippets.snippetsEnabled) {
            StackExchange.using("snippets", function() {
            createEditor();
            });
            }
            else {
            createEditor();
            }
            });

            function createEditor() {
            StackExchange.prepareEditor({
            heartbeatType: 'answer',
            autoActivateHeartbeat: false,
            convertImagesToLinks: false,
            noModals: true,
            showLowRepImageUploadWarning: true,
            reputationToPostImages: null,
            bindNavPrevention: true,
            postfix: "",
            imageUploader: {
            brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
            contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
            allowUrls: true
            },
            onDemand: true,
            discardSelector: ".discard-answer"
            ,immediatelyShowMarkdownHelp:true
            });


            }
            });














            draft saved

            draft discarded


















            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstats.stackexchange.com%2fquestions%2f392971%2fwhat-does-regularization-mean-in-xgboost-tree%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown

























            1 Answer
            1






            active

            oldest

            votes








            1 Answer
            1






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes









            2












            $begingroup$

            In tree-based methods regularization is usually understood as defining a minimum gain so which another split happens:




            Minimum loss reduction required to make a further partition on a leaf
            node of the tree. The larger gamma is, the more conservative the
            algorithm will be.




            Source: https://xgboost.readthedocs.io/en/latest/parameter.html



            This minimum gain can usually be set for anything between $(0,infty)$.



            Here's a somewhat good article on how to tune regularization on XGBoost.






            share|cite|improve this answer











            $endgroup$


















              2












              $begingroup$

              In tree-based methods regularization is usually understood as defining a minimum gain so which another split happens:




              Minimum loss reduction required to make a further partition on a leaf
              node of the tree. The larger gamma is, the more conservative the
              algorithm will be.




              Source: https://xgboost.readthedocs.io/en/latest/parameter.html



              This minimum gain can usually be set for anything between $(0,infty)$.



              Here's a somewhat good article on how to tune regularization on XGBoost.






              share|cite|improve this answer











              $endgroup$
















                2












                2








                2





                $begingroup$

                In tree-based methods regularization is usually understood as defining a minimum gain so which another split happens:




                Minimum loss reduction required to make a further partition on a leaf
                node of the tree. The larger gamma is, the more conservative the
                algorithm will be.




                Source: https://xgboost.readthedocs.io/en/latest/parameter.html



                This minimum gain can usually be set for anything between $(0,infty)$.



                Here's a somewhat good article on how to tune regularization on XGBoost.






                share|cite|improve this answer











                $endgroup$



                In tree-based methods regularization is usually understood as defining a minimum gain so which another split happens:




                Minimum loss reduction required to make a further partition on a leaf
                node of the tree. The larger gamma is, the more conservative the
                algorithm will be.




                Source: https://xgboost.readthedocs.io/en/latest/parameter.html



                This minimum gain can usually be set for anything between $(0,infty)$.



                Here's a somewhat good article on how to tune regularization on XGBoost.







                share|cite|improve this answer














                share|cite|improve this answer



                share|cite|improve this answer








                edited 4 hours ago

























                answered 4 hours ago









                Lucas FariasLucas Farias

                642421




                642421






























                    draft saved

                    draft discarded




















































                    Thanks for contributing an answer to Cross Validated!


                    • Please be sure to answer the question. Provide details and share your research!

                    But avoid …



                    • Asking for help, clarification, or responding to other answers.

                    • Making statements based on opinion; back them up with references or personal experience.


                    Use MathJax to format equations. MathJax reference.


                    To learn more, see our tips on writing great answers.




                    draft saved


                    draft discarded














                    StackExchange.ready(
                    function () {
                    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstats.stackexchange.com%2fquestions%2f392971%2fwhat-does-regularization-mean-in-xgboost-tree%23new-answer', 'question_page');
                    }
                    );

                    Post as a guest















                    Required, but never shown





















































                    Required, but never shown














                    Required, but never shown












                    Required, but never shown







                    Required, but never shown

































                    Required, but never shown














                    Required, but never shown












                    Required, but never shown







                    Required, but never shown







                    -

                    Popular posts from this blog

                    Magento 2 controller redirect on button click in phtml file

                    Image
                    0 I want to redirect customer using controller when button is clicked in one of my phtml files. So far I got, controller: public function execute(){ return $this->addToCart(); } public function addToCart(){ // some logic $this->_redirect('checkout/cart/index'); } The above is working fine (redirecting) when you access the controller via URL (www.mydomain.com/batchorder/index/addtocart). And here is my .phtml file: $("#addToCart").click(function(){ let controllerUrl = "<?php echo $block-getUrl('batchorder/index/addtocart'); ?>" $.post(controllerUrl, { "products": JSON.stringify(sideCart.SideCartProducts) }) The post request returns my logic as it should, however, it is not redirecting. Anyone can help? ...
                    Read more

                    Polycentropodidae

                    Image
                    Polycentropodidae Plectrocnemia conspersa Siyentipiko nga pagklasipika Ginhadi-an: Animalia Phylum: Arthropoda Ubosphylum: Hexapoda Klase: Insecta Orden: Trichoptera Labawbanay: Hydropsychoidea Banay: Polycentropodidae Binomial nga ngaran Polycentropodidae An Polycentropodidae [1] in uska familia han Insecta. An Polycentropodidae in nahilalakip ha familia nga Hydropsychoidea, ordo nga Trichoptera, classis nga Insecta, punoan nga Arthropoda, ngan regnum nga Animalia. [1] An familia nga Polycentropodidae in naglalakip hin 660 ka mga species, sumala ha Catalogue of Life [1] . An kladograma hini sumala ha Catalogue of Life [1] : Hydropsychoidea   Polycentropodidae  Adectophylax Antillopsyche Cernotina Cyrnellus Cyrnodes Cyrnopsis Cyrnus Eodipseudopsis Eoneureclipsis Holocentropus Kambaitipsyche Neucentropus ...
                    Read more