{"id":"https://openalex.org/W7135181007","doi":"https://doi.org/10.48550/arxiv.2603.11117","title":"Learning Tree-Based Models with Gradient Descent","display_name":"Learning Tree-Based Models with Gradient Descent","publication_year":2026,"publication_date":"2026-03-11","ids":{"openalex":"https://openalex.org/W7135181007","doi":"https://doi.org/10.48550/arxiv.2603.11117"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.11117","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.11117","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.11117","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022929385","display_name":"Sascha Marton","orcid":"https://orcid.org/0000-0001-8151-9223"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Marton, Sascha","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5022929385"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12026","display_name":"Explainable Artificial Intelligence (XAI)","score":0.9858999848365784,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12026","display_name":"Explainable Artificial Intelligence (XAI)","score":0.9858999848365784,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11652","display_name":"Imbalanced Data Classification Techniques","score":0.00139999995008111,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11689","display_name":"Adversarial Robustness in Machine Learning","score":0.0013000000035390258,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/interpretability","display_name":"Interpretability","score":0.7459999918937683},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.7020999789237976},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.513700008392334},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4596000015735626},{"id":"https://openalex.org/keywords/bridging","display_name":"Bridging (networking)","score":0.4372999966144562},{"id":"https://openalex.org/keywords/stochastic-gradient-descent","display_name":"Stochastic gradient descent","score":0.41839998960494995},{"id":"https://openalex.org/keywords/decision-tree","display_name":"Decision tree","score":0.41179999709129333},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.3817000091075897}],"concepts":[{"id":"https://openalex.org/C2781067378","wikidata":"https://www.wikidata.org/wiki/Q17027399","display_name":"Interpretability","level":2,"score":0.7459999918937683},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7145000100135803},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.7020999789237976},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.660099983215332},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.6435999870300293},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.513700008392334},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4596000015735626},{"id":"https://openalex.org/C174348530","wikidata":"https://www.wikidata.org/wiki/Q188635","display_name":"Bridging (networking)","level":2,"score":0.4372999966144562},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.41839998960494995},{"id":"https://openalex.org/C84525736","wikidata":"https://www.wikidata.org/wiki/Q831366","display_name":"Decision tree","level":2,"score":0.41179999709129333},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.3817000091075897},{"id":"https://openalex.org/C155032097","wikidata":"https://www.wikidata.org/wiki/Q798503","display_name":"Backpropagation","level":3,"score":0.3734999895095825},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.36149999499320984},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.34439998865127563},{"id":"https://openalex.org/C70153297","wikidata":"https://www.wikidata.org/wiki/Q5591907","display_name":"Gradient boosting","level":3,"score":0.33899998664855957},{"id":"https://openalex.org/C148483581","wikidata":"https://www.wikidata.org/wiki/Q446488","display_name":"Feature selection","level":2,"score":0.3375999927520752},{"id":"https://openalex.org/C22367795","wikidata":"https://www.wikidata.org/wiki/Q7625208","display_name":"Structured prediction","level":2,"score":0.3370000123977661},{"id":"https://openalex.org/C136389625","wikidata":"https://www.wikidata.org/wiki/Q334384","display_name":"Supervised learning","level":3,"score":0.3154999911785126},{"id":"https://openalex.org/C115903097","wikidata":"https://www.wikidata.org/wiki/Q7094097","display_name":"Online machine learning","level":3,"score":0.30570000410079956},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.2969000041484833},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.26750001311302185},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.26510000228881836},{"id":"https://openalex.org/C108583219","wikidata":"https://www.wikidata.org/wiki/Q197536","display_name":"Deep learning","level":2,"score":0.257099986076355}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.11117","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.11117","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.11117","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.11117","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.7011627554893494,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Tree-based":[0],"models":[1,211,244],"are":[2],"widely":[3,55],"recognized":[4],"for":[5,81,103,168,179,206,212],"their":[6,31,79],"interpretability":[7],"and":[8,34,71,181,218,231,240],"have":[9],"proven":[10],"effective":[11],"in":[12,17],"various":[13,246],"application":[14],"domains,":[15,201],"particularly":[16],"high-stakes":[18],"domains.":[19,248],"However,":[20],"learning":[21,92,104,183,221],"decision":[22],"trees":[23],"(DTs)":[24],"poses":[25],"a":[26,39,86,100,116,120],"significant":[27],"challenge":[28],"due":[29],"to":[30,74,195],"combinatorial":[32],"complexity":[33],"discrete,":[35],"non-differentiable":[36],"nature.":[37],"As":[38],"result,":[40],"traditional":[41,139],"methods":[42,59,84],"such":[43],"as":[44],"CART,":[45],"which":[46,185],"rely":[47,187],"on":[48,119,188],"greedy":[49],"search":[50,69],"procedures,":[51],"remain":[52],"the":[53,68,125,134,149,227,238],"most":[54],"used":[56],"approaches.":[57,94],"These":[58,191],"make":[60],"locally":[61,153],"optimal":[62,154],"decisions":[63],"at":[64],"each":[65],"node,":[66],"constraining":[67],"space":[70],"often":[72],"leading":[73],"suboptimal":[75],"tree":[76,130,161],"structures.":[77],"Additionally,":[78],"demand":[80],"custom":[82],"training":[83,144],"precludes":[85],"seamless":[87],"integration":[88],"into":[89,174],"modern":[90],"machine":[91],"(ML)":[93],"In":[95],"this":[96],"thesis,":[97],"we":[98],"propose":[99],"novel":[101],"method":[102,235],"hard,":[105],"axis-aligned":[106],"DTs":[107,204,230],"through":[108],"gradient":[109,166,189],"descent.":[110,190],"Our":[111],"approach":[112,171],"utilizes":[113],"backpropagation":[114],"with":[115],"straight-through":[117],"operator":[118],"dense":[121],"DT":[122,140],"representation,":[123],"enabling":[124],"joint":[126],"optimization":[127],"of":[128,138,152,242],"all":[129,160],"parameters,":[131],"thereby":[132],"addressing":[133],"two":[135],"primary":[136],"limitations":[137],"algorithms.":[141],"First,":[142],"gradient-based":[143,232],"is":[145],"not":[146],"constrained":[147],"by":[148,164],"sequential":[150],"selection":[151],"splits":[155],"but,":[156],"instead,":[157],"jointly":[158],"optimizes":[159],"parameters.":[162],"Second,":[163],"leveraging":[165],"descent":[167],"optimization,":[169,233],"our":[170,234],"seamlessly":[172],"integrates":[173],"existing":[175],"ML":[176,247],"approaches":[177],"e.g.,":[178],"multimodal":[180,216],"reinforcement":[182,220],"tasks,":[184],"inherently":[186],"advancements":[192],"allow":[193],"us":[194],"achieve":[196],"state-of-the-art":[197],"results":[198],"across":[199,245],"multiple":[200],"including":[202],"interpretable":[203,219],"rees":[205],"small":[207],"tabular":[208,214],"datasets,":[209],"advanced":[210],"complex":[213],"data,":[215],"learning,":[217],"without":[222],"information":[223],"loss.":[224],"By":[225],"bridging":[226],"gap":[228],"between":[229],"significantly":[236],"enhances":[237],"performance":[239],"applicability":[241],"tree-based":[243]},"counts_by_year":[],"updated_date":"2026-03-14T06:46:50.379900","created_date":"2026-03-14T00:00:00"}