{"id":"https://openalex.org/W1624380610","doi":"https://doi.org/10.1109/isit.2015.7282967","title":"Performance degradation of AMP for small-sized problems","display_name":"Performance degradation of AMP for small-sized problems","publication_year":2015,"publication_date":"2015-06-01","ids":{"openalex":"https://openalex.org/W1624380610","doi":"https://doi.org/10.1109/isit.2015.7282967","mag":"1624380610"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2015.7282967","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282967","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Symposium on Information Theory (ISIT)","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/A5043661912","display_name":"Kuriya Arise","orcid":null},"institutions":[{"id":"https://openalex.org/I39012071","display_name":"Kyoto College of Graduate Studies for Informatics","ror":"https://ror.org/05mzj8a56","country_code":"JP","type":"education","lineage":["https://openalex.org/I39012071"]},{"id":"https://openalex.org/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Arise Kuriya","raw_affiliation_strings":["Graduate School of Informatics, Kyoto University, Kyoto, Japan","Graduate school of Informatics, Kyoto University, 606-8501 Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Informatics, Kyoto University, Kyoto, Japan","institution_ids":["https://openalex.org/I39012071","https://openalex.org/I22299242"]},{"raw_affiliation_string":"Graduate school of Informatics, Kyoto University, 606-8501 Japan","institution_ids":["https://openalex.org/I22299242"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014391514","display_name":"Toshiyuki Tanaka","orcid":"https://orcid.org/0000-0001-5962-9119"},"institutions":[{"id":"https://openalex.org/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]},{"id":"https://openalex.org/I39012071","display_name":"Kyoto College of Graduate Studies for Informatics","ror":"https://ror.org/05mzj8a56","country_code":"JP","type":"education","lineage":["https://openalex.org/I39012071"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Toshiyuki Tanaka","raw_affiliation_strings":["Graduate School of Informatics, Kyoto University, Kyoto, Japan","Graduate school of Informatics, Kyoto University, 606-8501 Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Informatics, Kyoto University, Kyoto, Japan","institution_ids":["https://openalex.org/I39012071","https://openalex.org/I22299242"]},{"raw_affiliation_string":"Graduate school of Informatics, Kyoto University, 606-8501 Japan","institution_ids":["https://openalex.org/I22299242"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5043661912"],"corresponding_institution_ids":["https://openalex.org/I22299242","https://openalex.org/I39012071"],"apc_list":null,"apc_paid":null,"fwci":0.3328,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.63498743,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"2802","last_page":"2806"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11321","display_name":"Error Correcting Code Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"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.9975000023841858,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/belief-propagation","display_name":"Belief propagation","score":0.7255529165267944},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6237167119979858},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5784223675727844},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.5693095326423645},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.5676451921463013},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5675211548805237},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5641301274299622},{"id":"https://openalex.org/keywords/factor-graph","display_name":"Factor graph","score":0.5413306951522827},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.5270490646362305},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.49880528450012207},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.4766950309276581},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4541260302066803},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44058021903038025},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40224605798721313},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28158944845199585},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16596227884292603}],"concepts":[{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.7255529165267944},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6237167119979858},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5784223675727844},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.5693095326423645},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.5676451921463013},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5675211548805237},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5641301274299622},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.5413306951522827},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5270490646362305},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.49880528450012207},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.4766950309276581},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4541260302066803},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44058021903038025},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40224605798721313},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28158944845199585},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16596227884292603},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2015.7282967","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282967","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/1","score":0.41999998688697815,"display_name":"No poverty"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1484354944","https://openalex.org/W1984830458","https://openalex.org/W2066612702","https://openalex.org/W2082029531","https://openalex.org/W2109866575","https://openalex.org/W2128765501","https://openalex.org/W2141673775","https://openalex.org/W2154887764","https://openalex.org/W2159080219","https://openalex.org/W2963206527","https://openalex.org/W4256648168"],"related_works":["https://openalex.org/W2122977448","https://openalex.org/W2124250880","https://openalex.org/W4301665663","https://openalex.org/W2963109230","https://openalex.org/W3177262287","https://openalex.org/W2286197641","https://openalex.org/W2757022491","https://openalex.org/W2978729728","https://openalex.org/W2555468667","https://openalex.org/W2785598795"],"abstract_inverted_index":{"Pearl's":[0],"belief":[1],"propagation":[2],"(BP)":[3],"is":[4,26,67,95,101,110,125,166,180,238],"an":[5,58],"algorithm":[6,119,137,161],"to":[7,121,178,194,200],"solve":[8],"inference":[9],"problems":[10,44],"on":[11],"probability":[12],"models":[13],"defined":[14],"in":[15,29,34,43,69,82,128,162,168,182,207,229],"terms":[16],"of":[17,22,32,40,52,56,60,72,78,116,134,140,171,215,225],"graphical":[18],"models.":[19],"Computational":[20],"complexity":[21,164],"BP":[23,41,61,143,160,183,217],"per":[24],"iteration":[25],"typically":[27],"exponential":[28],"the":[30,35,50,53,70,83,92,104,107,117,135,141,158,169,172,191,195,213,216,223,226,231,235],"degrees":[31,170],"nodes":[33],"graph,":[36],"which":[37,124,201],"makes":[38],"application":[39],"impractical":[42],"represented":[45],"by":[46,131],"dense":[47],"graphs.":[48],"For":[49],"alleviation":[51],"computational":[54],"difficulty":[55],"BP,":[57],"approximation":[59,227],"dubbed":[62],"approximate":[63],"message":[64],"passing":[65],"(AMP)":[66],"proposed":[68],"area":[71],"compressed":[73],"sensing.":[74],"Since":[75],"theoretical":[76],"treatments":[77],"AMP":[79,118,136,202,219,232],"are":[80,87],"mostly":[81],"infinite-dimensional":[84],"limit,":[85],"they":[86],"not":[88,96,239],"mathematically":[89],"justifiable":[90],"when":[91,234],"system":[93,108,236],"size":[94,109,237],"large":[97,240],"enough":[98],"and":[99,138,218,221],"little":[100],"known":[102],"about":[103],"cases":[105],"where":[106],"small.":[111],"We":[112],"investigate":[113],"poor":[114],"performance":[115,133,214],"applied":[120,206],"small-sized":[122],"problems,":[123],"frequently":[126],"observed":[127],"numerical":[129],"experiments,":[130],"comparing":[132],"that":[139,165],"original":[142,159],"algorithm.":[144],"In":[145],"this":[146],"paper,":[147],"firstly,":[148],"we":[149,189,211],"show":[150],"that,":[151],"under":[152],"several":[153],"assumptions,":[154],"one":[155],"can":[156],"perform":[157],"time":[163],"polynomial":[167],"nodes,":[173],"utilizing":[174],"a":[175],"method":[176],"similar":[177],"what":[179],"employed":[181],"decoding":[184],"for":[185],"LDPC":[186],"codes.":[187],"Next,":[188],"apply":[190],"preceding":[192],"discussion":[193],"CDMA":[196],"multiuser":[197],"detection":[198],"problem,":[199],"has":[203],"been":[204],"successfully":[205],"existing":[208],"researches.":[209],"Finally,":[210],"compare":[212],"algorithms":[220],"discuss":[222],"effects":[224],"involved":[228],"deriving":[230],"algorithm,":[233],"enough.":[241]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}