{"id":"https://openalex.org/W7108221531","doi":"https://doi.org/10.1109/lsp.2025.3639345","title":"Soft Gradient Boosting With Learnable Feature Transforms for Sequential Regression","display_name":"Soft Gradient Boosting With Learnable Feature Transforms for Sequential Regression","publication_year":2025,"publication_date":"2025-12-02","ids":{"openalex":"https://openalex.org/W7108221531","doi":"https://doi.org/10.1109/lsp.2025.3639345"},"language":null,"primary_location":{"id":"doi:10.1109/lsp.2025.3639345","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lsp.2025.3639345","pdf_url":null,"source":{"id":"https://openalex.org/S120629676","display_name":"IEEE Signal Processing Letters","issn_l":"1070-9908","issn":["1070-9908","1558-2361"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Signal Processing Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Huseyin Karaca","orcid":"https://orcid.org/0000-0002-3408-7306"},"institutions":[{"id":"https://openalex.org/I168864056","display_name":"Bilkent University","ror":"https://ror.org/02vh8a032","country_code":"TR","type":"education","lineage":["https://openalex.org/I168864056"]}],"countries":["TR"],"is_corresponding":true,"raw_author_name":"Huseyin Karaca","raw_affiliation_strings":["Department of Electrical and Electronics Engineering, Bilkent University, Ankara, T&#x00FC;rkiye"],"raw_orcid":"https://orcid.org/0000-0002-3408-7306","affiliations":[{"raw_affiliation_string":"Department of Electrical and Electronics Engineering, Bilkent University, Ankara, T&#x00FC;rkiye","institution_ids":["https://openalex.org/I168864056"]}]},{"author_position":"last","author":{"id":null,"display_name":"Suleyman Serdar Kozat","orcid":"https://orcid.org/0000-0002-6488-3848"},"institutions":[{"id":"https://openalex.org/I168864056","display_name":"Bilkent University","ror":"https://ror.org/02vh8a032","country_code":"TR","type":"education","lineage":["https://openalex.org/I168864056"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Suleyman Serdar Kozat","raw_affiliation_strings":["Department of Electrical and Electronics Engineering, Bilkent University, Ankara, T&#x00FC;rkiye"],"raw_orcid":"https://orcid.org/0000-0002-6488-3848","affiliations":[{"raw_affiliation_string":"Department of Electrical and Electronics Engineering, Bilkent University, Ankara, T&#x00FC;rkiye","institution_ids":["https://openalex.org/I168864056"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I168864056"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.57304678,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"33","issue":null,"first_page":"186","last_page":"190"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10057","display_name":"Face and Expression Recognition","score":0.12780000269412994,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10057","display_name":"Face and Expression Recognition","score":0.12780000269412994,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12676","display_name":"Machine Learning and ELM","score":0.12690000236034393,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.12620000541210175,"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/boosting","display_name":"Boosting (machine learning)","score":0.8098999857902527},{"id":"https://openalex.org/keywords/overfitting","display_name":"Overfitting","score":0.6905999779701233},{"id":"https://openalex.org/keywords/gradient-boosting","display_name":"Gradient boosting","score":0.6578999757766724},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.5956000089645386},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.4900999963283539},{"id":"https://openalex.org/keywords/decision-tree","display_name":"Decision tree","score":0.3781000077724457},{"id":"https://openalex.org/keywords/feature-extraction","display_name":"Feature extraction","score":0.3508000075817108}],"concepts":[{"id":"https://openalex.org/C46686674","wikidata":"https://www.wikidata.org/wiki/Q466303","display_name":"Boosting (machine learning)","level":2,"score":0.8098999857902527},{"id":"https://openalex.org/C22019652","wikidata":"https://www.wikidata.org/wiki/Q331309","display_name":"Overfitting","level":3,"score":0.6905999779701233},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.6672000288963318},{"id":"https://openalex.org/C70153297","wikidata":"https://www.wikidata.org/wiki/Q5591907","display_name":"Gradient boosting","level":3,"score":0.6578999757766724},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.5956000089645386},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5529999732971191},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.4900999963283539},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4056999981403351},{"id":"https://openalex.org/C84525736","wikidata":"https://www.wikidata.org/wiki/Q831366","display_name":"Decision tree","level":2,"score":0.3781000077724457},{"id":"https://openalex.org/C52622490","wikidata":"https://www.wikidata.org/wiki/Q1026626","display_name":"Feature extraction","level":2,"score":0.3508000075817108},{"id":"https://openalex.org/C202615002","wikidata":"https://www.wikidata.org/wiki/Q783507","display_name":"Differentiable function","level":2,"score":0.34310001134872437},{"id":"https://openalex.org/C83546350","wikidata":"https://www.wikidata.org/wiki/Q1139051","display_name":"Regression","level":2,"score":0.3409000039100647},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33399999141693115},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.29339998960494995},{"id":"https://openalex.org/C48921125","wikidata":"https://www.wikidata.org/wiki/Q10861030","display_name":"Linear regression","level":2,"score":0.2865000069141388},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.27959999442100525},{"id":"https://openalex.org/C83665646","wikidata":"https://www.wikidata.org/wiki/Q42139305","display_name":"Feature vector","level":2,"score":0.27900001406669617},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.260699987411499},{"id":"https://openalex.org/C2778827112","wikidata":"https://www.wikidata.org/wiki/Q22245680","display_name":"Feature engineering","level":3,"score":0.25459998846054077}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lsp.2025.3639345","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lsp.2025.3639345","pdf_url":null,"source":{"id":"https://openalex.org/S120629676","display_name":"IEEE Signal Processing Letters","issn_l":"1070-9908","issn":["1070-9908","1558-2361"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Signal Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.4985531270503998,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1678356000","https://openalex.org/W2060064529","https://openalex.org/W2064675550","https://openalex.org/W2135046866","https://openalex.org/W2146159678","https://openalex.org/W2155352808","https://openalex.org/W2295598076","https://openalex.org/W2911964244","https://openalex.org/W2956195142","https://openalex.org/W2963507686","https://openalex.org/W3154228815","https://openalex.org/W3157142269","https://openalex.org/W3204318146","https://openalex.org/W4206173445","https://openalex.org/W4293318869","https://openalex.org/W4300430800","https://openalex.org/W4395662613"],"related_works":[],"abstract_inverted_index":{"We":[0,62,91],"propose":[1],"a":[2,12,27,33,104],"soft":[3,28],"gradient":[4],"boosting":[5,19,23,87],"framework":[6],"for":[7],"sequential":[8],"regression":[9],"that":[10,70],"embeds":[11],"learnable":[13],"linear":[14,34],"feature":[15,36,84],"transform":[16,37],"within":[17],"the":[18,55,77],"procedure.":[20],"At":[21],"each":[22],"iteration,":[24],"we":[25,112],"train":[26],"decision":[29],"tree":[30],"and":[31,67,74,86,109],"learn":[32],"input":[35,58],"<inline-formula":[38],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[39],"xmlns:xlink=\"http://www.w3.org/1999/xlink\"><tex-math":[40],"notation=\"LaTeX\">$\\bf{Q}$</tex-math></inline-formula>":[41],"together.":[42],"This":[43],"approach":[44],"is":[45,102],"particularly":[46],"advantageous":[47],"in":[48],"high-dimensional,":[49],"data-scarce":[50],"scenarios,":[51],"as":[52],"it":[53],"discovers":[54],"most":[56],"relevant":[57],"representations":[59],"while":[60,88],"boosting.":[61],"demonstrate,":[63],"using":[64],"both":[65],"synthetic":[66],"real-world":[68],"datasets,":[69],"our":[71,94,114],"method":[72],"effectively":[73],"efficiently":[75],"increases":[76],"performance":[78],"by":[79],"an":[80],"end-to-end":[81],"optimization":[82],"of":[83],"selection/transform":[85],"avoiding":[89],"overfitting.":[90],"also":[92],"extend":[93],"algorithm":[95],"to":[96],"differentiable":[97],"non-linear":[98],"transforms":[99],"if":[100],"overfitting":[101],"not":[103],"problem.":[105],"To":[106],"support":[107],"reproducibility":[108],"future":[110],"work,":[111],"share":[113],"code":[115],"publicly.":[116]},"counts_by_year":[],"updated_date":"2025-12-26T23:08:49.675405","created_date":"2025-12-03T00:00:00"}