{"id":"https://openalex.org/W2432461368","doi":"https://doi.org/10.1109/iwcit.2016.7491623","title":"A new robust correntropy based Levenberg-Marquardt algorithm","display_name":"A new robust correntropy based Levenberg-Marquardt algorithm","publication_year":2016,"publication_date":"2016-05-01","ids":{"openalex":"https://openalex.org/W2432461368","doi":"https://doi.org/10.1109/iwcit.2016.7491623","mag":"2432461368"},"language":"en","primary_location":{"id":"doi:10.1109/iwcit.2016.7491623","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iwcit.2016.7491623","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 Iran Workshop on Communication and Information Theory (IWCIT)","raw_type":"proceedings-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":"https://openalex.org/A5060994905","display_name":"Ahmad Reza Heravi","orcid":"https://orcid.org/0000-0002-2481-5867"},"institutions":[{"id":"https://openalex.org/I86958956","display_name":"Ferdowsi University of Mashhad","ror":"https://ror.org/00g6ka752","country_code":"IR","type":"education","lineage":["https://openalex.org/I86958956"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Ahmad Reza Heravi","raw_affiliation_strings":["Electrical Engineering Department, Ferdowsi University of Mashhad, Mashhad, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering Department, Ferdowsi University of Mashhad, Mashhad, Iran","institution_ids":["https://openalex.org/I86958956"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038472266","display_name":"Ghosheh Abed Hodtani","orcid":"https://orcid.org/0000-0002-4337-1624"},"institutions":[{"id":"https://openalex.org/I86958956","display_name":"Ferdowsi University of Mashhad","ror":"https://ror.org/00g6ka752","country_code":"IR","type":"education","lineage":["https://openalex.org/I86958956"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Ghosheh Abed Hodtani","raw_affiliation_strings":["Electrical Engineering Department, Ferdowsi University of Mashhad, Mashhad, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering Department, Ferdowsi University of Mashhad, Mashhad, Iran","institution_ids":["https://openalex.org/I86958956"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I86958956"],"apc_list":null,"apc_paid":null,"fwci":1.2352,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.77896904,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"14","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11233","display_name":"Advanced Adaptive Filtering Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11233","display_name":"Advanced Adaptive Filtering Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11447","display_name":"Blind Source Separation Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11236","display_name":"Control Systems and Identification","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/levenberg\u2013marquardt-algorithm","display_name":"Levenberg\u2013Marquardt algorithm","score":0.8388553261756897},{"id":"https://openalex.org/keywords/outlier","display_name":"Outlier","score":0.7994648218154907},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.6560473442077637},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.615123987197876},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6137021780014038},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5868045091629028},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.5645615458488464},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.5418683886528015},{"id":"https://openalex.org/keywords/robust-statistics","display_name":"Robust statistics","score":0.4868575930595398},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.431867778301239},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.41158565878868103},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32454851269721985},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.2836383581161499},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26562070846557617}],"concepts":[{"id":"https://openalex.org/C87578567","wikidata":"https://www.wikidata.org/wiki/Q1426494","display_name":"Levenberg\u2013Marquardt algorithm","level":3,"score":0.8388553261756897},{"id":"https://openalex.org/C79337645","wikidata":"https://www.wikidata.org/wiki/Q779824","display_name":"Outlier","level":2,"score":0.7994648218154907},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.6560473442077637},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.615123987197876},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6137021780014038},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5868045091629028},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.5645615458488464},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.5418683886528015},{"id":"https://openalex.org/C67226441","wikidata":"https://www.wikidata.org/wiki/Q1665389","display_name":"Robust statistics","level":3,"score":0.4868575930595398},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.431867778301239},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.41158565878868103},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32454851269721985},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.2836383581161499},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26562070846557617},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iwcit.2016.7491623","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iwcit.2016.7491623","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 Iran Workshop on Communication and Information Theory (IWCIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W206162032","https://openalex.org/W1480997772","https://openalex.org/W1493775511","https://openalex.org/W1569512666","https://openalex.org/W1624804034","https://openalex.org/W1758799351","https://openalex.org/W1966468545","https://openalex.org/W1970941481","https://openalex.org/W1980907873","https://openalex.org/W1984418626","https://openalex.org/W2010315317","https://openalex.org/W2017816729","https://openalex.org/W2019034316","https://openalex.org/W2044351729","https://openalex.org/W2073198536","https://openalex.org/W2075577372","https://openalex.org/W2083513507","https://openalex.org/W2087070363","https://openalex.org/W2097488004","https://openalex.org/W2097521973","https://openalex.org/W2107154726","https://openalex.org/W2113713615","https://openalex.org/W2118020555","https://openalex.org/W2120315477","https://openalex.org/W2135160607","https://openalex.org/W2136409657","https://openalex.org/W2148665023","https://openalex.org/W2155482699","https://openalex.org/W2165898564","https://openalex.org/W2256578114","https://openalex.org/W2258843972","https://openalex.org/W2291607627","https://openalex.org/W3024853581","https://openalex.org/W4230367971","https://openalex.org/W4302564868","https://openalex.org/W6629463362","https://openalex.org/W6634326339","https://openalex.org/W6682142706","https://openalex.org/W6910551694"],"related_works":["https://openalex.org/W2207919472","https://openalex.org/W2046343964","https://openalex.org/W4287100774","https://openalex.org/W3178591032","https://openalex.org/W2026943567","https://openalex.org/W4392713763","https://openalex.org/W4390841026","https://openalex.org/W1528610309","https://openalex.org/W4379515847","https://openalex.org/W2314752190"],"abstract_inverted_index":{"Recently,":[0],"there":[1],"has":[2],"been":[3],"much":[4],"interest":[5],"in":[6,14],"information":[7,28],"theoretic":[8,29],"learning":[9,50,116],"(ITL)":[10],"criteria,":[11],"widely":[12],"used":[13],"several":[15],"applications":[16],"with":[17,22],"different":[18],"robust":[19,30,68],"algorithms.":[20],"Dealing":[21],"the":[23,27,87,92],"rate":[24,90],"convergence":[25,89],"of":[26],"approaches,":[31],"we":[32],"introduce":[33],"a":[34],"fast":[35],"novel":[36,83],"correntropy":[37,41,63,96,105],"based":[38,42,64,97],"algorithm,":[39],"as":[40,77,91],"Levenberg-Marquardt":[43],"(CLM),":[44],"and":[45,66,114],"apply":[46],"it":[47],"to":[48],"nonlinear":[49,115],"problems.":[51],"This":[52],"new":[53],"method":[54,84,98],"converges":[55],"significantly":[56],"faster":[57],"than":[58],"common":[59],"gradient":[60],"descent":[61],"maximum":[62,104],"method,":[65],"is":[67,108],"against":[69],"heavy-tailed":[70],"noise":[71],"distributions":[72],"or":[73],"outliers.":[74],"In":[75],"addition,":[76],"our":[78],"numerical":[79],"results":[80],"illustrate,":[81],"this":[82],"while":[85],"having":[86],"same":[88],"previously":[93],"presented":[94],"fastest":[95],"for":[99,111],"linear":[100,113],"models,":[101],"called":[102],"fixed-point":[103],"criteria":[106],"(FP-MCC),":[107],"also":[109],"valid":[110],"all":[112],"models.":[117]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}