{"id":"https://openalex.org/W2952160671","doi":"https://doi.org/10.1109/lsp.2019.2891134","title":"A Novel Approach to Quantized Matrix Completion Using Huber Loss Measure","display_name":"A Novel Approach to Quantized Matrix Completion Using Huber Loss Measure","publication_year":2019,"publication_date":"2019-01-09","ids":{"openalex":"https://openalex.org/W2952160671","doi":"https://doi.org/10.1109/lsp.2019.2891134","mag":"2952160671"},"language":"en","primary_location":{"id":"doi:10.1109/lsp.2019.2891134","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lsp.2019.2891134","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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1810.12460","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Ashkan Esmaeili","orcid":"https://orcid.org/0000-0001-7532-1325"},"institutions":[{"id":"https://openalex.org/I133529467","display_name":"Sharif University of Technology","ror":"https://ror.org/024c2fq17","country_code":"IR","type":"education","lineage":["https://openalex.org/I133529467"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Ashkan Esmaeili","raw_affiliation_strings":["Electrical Engineering Department and Advanced Communications Research Institute, Sharif University of Technology, Tehran, Iran"],"raw_orcid":"https://orcid.org/0000-0001-7532-1325","affiliations":[{"raw_affiliation_string":"Electrical Engineering Department and Advanced Communications Research Institute, Sharif University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I133529467"]}]},{"author_position":"last","author":{"id":null,"display_name":"Farokh Marvasti","orcid":"https://orcid.org/0000-0002-4635-8986"},"institutions":[{"id":"https://openalex.org/I133529467","display_name":"Sharif University of Technology","ror":"https://ror.org/024c2fq17","country_code":"IR","type":"education","lineage":["https://openalex.org/I133529467"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Farokh Marvasti","raw_affiliation_strings":["Electrical Engineering Department and Advanced Communications Research Institute, Sharif University of Technology, Tehran, Iran"],"raw_orcid":"https://orcid.org/0000-0002-4635-8986","affiliations":[{"raw_affiliation_string":"Electrical Engineering Department and Advanced Communications Research Institute, Sharif University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I133529467"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I133529467"],"apc_list":null,"apc_paid":null,"fwci":3.6265,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.93906369,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":99},"biblio":{"volume":"26","issue":"2","first_page":"337","last_page":"341"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.5730000138282776,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.5730000138282776,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.29589998722076416,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.03420000150799751,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.553600013256073},{"id":"https://openalex.org/keywords/low-rank-approximation","display_name":"Low-rank approximation","score":0.5508999824523926},{"id":"https://openalex.org/keywords/differentiable-function","display_name":"Differentiable function","score":0.546500027179718},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5450000166893005},{"id":"https://openalex.org/keywords/matrix-completion","display_name":"Matrix completion","score":0.5246999859809875},{"id":"https://openalex.org/keywords/quantization","display_name":"Quantization (signal processing)","score":0.510699987411499},{"id":"https://openalex.org/keywords/outlier","display_name":"Outlier","score":0.4927000105381012},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.4690999984741211},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.43479999899864197}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5895000100135803},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.553600013256073},{"id":"https://openalex.org/C90199385","wikidata":"https://www.wikidata.org/wiki/Q6692777","display_name":"Low-rank approximation","level":3,"score":0.5508999824523926},{"id":"https://openalex.org/C202615002","wikidata":"https://www.wikidata.org/wiki/Q783507","display_name":"Differentiable function","level":2,"score":0.546500027179718},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5450000166893005},{"id":"https://openalex.org/C2778459887","wikidata":"https://www.wikidata.org/wiki/Q6787865","display_name":"Matrix completion","level":3,"score":0.5246999859809875},{"id":"https://openalex.org/C28855332","wikidata":"https://www.wikidata.org/wiki/Q198099","display_name":"Quantization (signal processing)","level":2,"score":0.510699987411499},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5069000124931335},{"id":"https://openalex.org/C79337645","wikidata":"https://www.wikidata.org/wiki/Q779824","display_name":"Outlier","level":2,"score":0.4927000105381012},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.4690999984741211},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.43479999899864197},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4242999851703644},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4214000105857849},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4106000065803528},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.40290001034736633},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.40059998631477356},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.3894999921321869},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3709000051021576},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.36059999465942383},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.34929999709129333},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32089999318122864},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.30640000104904175},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.28769999742507935},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.2793000042438507},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.2791000008583069},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.2660999894142151},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.26489999890327454},{"id":"https://openalex.org/C189237950","wikidata":"https://www.wikidata.org/wiki/Q2500758","display_name":"Stationary point","level":2,"score":0.2587999999523163}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/lsp.2019.2891134","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lsp.2019.2891134","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"},{"id":"pmh:oai:arXiv.org:1810.12460","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1810.12460","pdf_url":"https://arxiv.org/pdf/1810.12460","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1810.12460","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1810.12460","pdf_url":"https://arxiv.org/pdf/1810.12460","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322243","display_name":"Iran National Science Foundation","ror":"https://ror.org/03sr1ma14"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W2054141820","https://openalex.org/W2071159364","https://openalex.org/W2084603169","https://openalex.org/W2103972604","https://openalex.org/W2144730813","https://openalex.org/W2156865565","https://openalex.org/W2219888463","https://openalex.org/W2292313934","https://openalex.org/W2399072287","https://openalex.org/W2592769471","https://openalex.org/W2611328865","https://openalex.org/W2795744451","https://openalex.org/W2963186204","https://openalex.org/W2963792882","https://openalex.org/W2964200481","https://openalex.org/W3104030484","https://openalex.org/W4244769743","https://openalex.org/W6605417117","https://openalex.org/W6677837081","https://openalex.org/W6678283600","https://openalex.org/W6712661769","https://openalex.org/W6716000388","https://openalex.org/W6751479519","https://openalex.org/W6755508125"],"related_works":[],"abstract_inverted_index":{"In":[0,147],"this":[1,130],"paper,":[2],"we":[3,15,28],"introduce":[4],"a":[5,17],"novel":[6],"and":[7,61,108,116,162],"robust":[8],"approach":[9],"to":[10,46,54,67,79,101,121,166],"quantized":[11],"matrix":[12],"completion.":[13],"First,":[14],"propose":[16],"rank":[18,37,75,82,142],"minimization":[19],"problem":[20,33,92,114],"with":[21,39,93],"constraints":[22],"induced":[23],"by":[24,34],"quantization":[25,51],"bounds.":[26],"Next,":[27],"form":[29],"an":[30,89],"unconstrained":[31,90],"optimization":[32,91],"regularizing":[35],"the":[36,48,70,84,113,122,145,148,152,169,176],"function":[38,96],"Huber":[40,42],"loss.":[41,72],"loss":[43],"is":[44,59,64,77,97,132,173],"leveraged":[45],"control":[47],"violation":[49],"from":[50,103],"bounds":[52],"due":[53],"two":[55],"properties:":[56],"first,":[57],"it":[58,63],"differentiable;":[60],"second,":[62],"less":[65],"sensitive":[66],"outliers":[68],"than":[69],"quadratic":[71],"A":[73],"smooth":[74],"approximation":[76],"utilized":[78],"endorse":[80],"lower":[81],"on":[83],"genuine":[85],"data":[86],"matrix.":[87],"Thus,":[88],"differentiable":[94],"objective":[95],"obtained":[98],"allowing":[99],"us":[100],"advantage":[102],"gradient":[104],"descent":[105],"technique.":[106],"Novel":[107],"firm":[109],"theoretical":[110],"analysis":[111],"of":[112,118,129,155,168],"model":[115],"convergence":[117],"our":[119,134,156],"algorithm":[120],"global":[123],"solution":[124],"are":[125],"provided.":[126],"Another":[127],"contribution":[128],"letter":[131],"that":[133],"method":[135,158],"does":[136],"not":[137],"require":[138],"projections":[139],"or":[140],"initial":[141],"estimation,":[143],"unlike":[144],"state-of-the-art.":[146],"Numerical":[149],"Experiments":[150],"section,":[151],"noticeable":[153],"outperformance":[154],"proposed":[157],"in":[159],"learning":[160],"accuracy":[161],"computational":[163],"complexity":[164],"compared":[165],"those":[167],"state-of-the-art":[170],"literature":[171],"methods":[172],"illustrated":[174],"as":[175],"main":[177],"contribution.":[178]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":5}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2019-06-27T00:00:00"}