{"id":"https://openalex.org/W2040649920","doi":"https://doi.org/10.1145/1835804.1835952","title":"Learning incoherent sparse and low-rank patterns from multiple tasks","display_name":"Learning incoherent sparse and low-rank patterns from multiple tasks","publication_year":2010,"publication_date":"2010-07-25","ids":{"openalex":"https://openalex.org/W2040649920","doi":"https://doi.org/10.1145/1835804.1835952","mag":"2040649920"},"language":"en","primary_location":{"id":"doi:10.1145/1835804.1835952","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1835804.1835952","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining","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/A5100765308","display_name":"Jianhui Chen","orcid":"https://orcid.org/0000-0001-7954-3574"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jianhui Chen","raw_affiliation_strings":["Arizona State University, Tempe, AZ, USA","Arizona State University , Tempe , AZ , USA"],"affiliations":[{"raw_affiliation_string":"Arizona State University, Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]},{"raw_affiliation_string":"Arizona State University , Tempe , AZ , USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100396338","display_name":"Ji Liu","orcid":"https://orcid.org/0000-0003-2871-9888"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ji Liu","raw_affiliation_strings":["Arizona State University, Tempe, AZ, USA","Arizona State University , Tempe , AZ , USA"],"affiliations":[{"raw_affiliation_string":"Arizona State University, Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]},{"raw_affiliation_string":"Arizona State University , Tempe , AZ , USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010419481","display_name":"Jieping Ye","orcid":"https://orcid.org/0000-0001-8662-5818"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jieping Ye","raw_affiliation_strings":["Arizona State University, Tempe, AZ, USA","Arizona State University , Tempe , AZ , USA"],"affiliations":[{"raw_affiliation_string":"Arizona State University, Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]},{"raw_affiliation_string":"Arizona State University , Tempe , AZ , USA","institution_ids":["https://openalex.org/I55732556"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100765308"],"corresponding_institution_ids":["https://openalex.org/I55732556"],"apc_list":null,"apc_paid":null,"fwci":6.4371,"has_fulltext":false,"cited_by_count":77,"citation_normalized_percentile":{"value":0.97072309,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1179","last_page":"1188"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing 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/T10500","display_name":"Sparse and Compressive Sensing 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/T12015","display_name":"Photoacoustic and Ultrasonic Imaging","score":0.9922999739646912,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical 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/T11205","display_name":"Numerical methods in inverse problems","score":0.9684000015258789,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"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/proximal-gradient-methods","display_name":"Proximal Gradient Methods","score":0.7457441091537476},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5970653891563416},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.5742651224136353},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.5094185471534729},{"id":"https://openalex.org/keywords/regularization","display_name":"Regularization (linguistics)","score":0.5006899833679199},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49669772386550903},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4952358305454254},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.47297704219818115},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.46150925755500793},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4168476462364197},{"id":"https://openalex.org/keywords/trust-region","display_name":"Trust region","score":0.41226208209991455},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3714066743850708},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3701397776603699},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3268658518791199},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1999264359474182},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.10979974269866943}],"concepts":[{"id":"https://openalex.org/C10494615","wikidata":"https://www.wikidata.org/wiki/Q17086765","display_name":"Proximal Gradient Methods","level":4,"score":0.7457441091537476},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5970653891563416},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.5742651224136353},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.5094185471534729},{"id":"https://openalex.org/C2776135515","wikidata":"https://www.wikidata.org/wiki/Q17143721","display_name":"Regularization (linguistics)","level":2,"score":0.5006899833679199},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49669772386550903},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4952358305454254},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.47297704219818115},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.46150925755500793},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4168476462364197},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.41226208209991455},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3714066743850708},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3701397776603699},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3268658518791199},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1999264359474182},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.10979974269866943},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1835804.1835952","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1835804.1835952","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320312530","display_name":"Office of the Director of National Intelligence","ror":"https://ror.org/01v3fsc55"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":57,"referenced_works":["https://openalex.org/W3219084","https://openalex.org/W64096456","https://openalex.org/W282757658","https://openalex.org/W1583497301","https://openalex.org/W1939941161","https://openalex.org/W1966096622","https://openalex.org/W1967073510","https://openalex.org/W1968398095","https://openalex.org/W1986744686","https://openalex.org/W1998635907","https://openalex.org/W2029213856","https://openalex.org/W2029970906","https://openalex.org/W2030290736","https://openalex.org/W2045704273","https://openalex.org/W2065180801","https://openalex.org/W2081385752","https://openalex.org/W2097260978","https://openalex.org/W2100556411","https://openalex.org/W2115807064","https://openalex.org/W2116413942","https://openalex.org/W2119187866","https://openalex.org/W2130903752","https://openalex.org/W2131479143","https://openalex.org/W2131628350","https://openalex.org/W2132345820","https://openalex.org/W2133491790","https://openalex.org/W2135046866","https://openalex.org/W2135624048","https://openalex.org/W2136979193","https://openalex.org/W2144752499","https://openalex.org/W2145962650","https://openalex.org/W2148522164","https://openalex.org/W2151103935","https://openalex.org/W2159514083","https://openalex.org/W2162854380","https://openalex.org/W2162979438","https://openalex.org/W2163482144","https://openalex.org/W2296319761","https://openalex.org/W2435251607","https://openalex.org/W2557168633","https://openalex.org/W2798909945","https://openalex.org/W2912522929","https://openalex.org/W2913340405","https://openalex.org/W2914746235","https://openalex.org/W2949664970","https://openalex.org/W2994340921","https://openalex.org/W3009608574","https://openalex.org/W3010453621","https://openalex.org/W3011040805","https://openalex.org/W3104240813","https://openalex.org/W4206454995","https://openalex.org/W4285719527","https://openalex.org/W4300022934","https://openalex.org/W6600126799","https://openalex.org/W6602561656","https://openalex.org/W6635018136","https://openalex.org/W6635552349"],"related_works":["https://openalex.org/W2811217697","https://openalex.org/W4385644471","https://openalex.org/W4320495396","https://openalex.org/W4295266778","https://openalex.org/W2564172750","https://openalex.org/W2041341337","https://openalex.org/W2075334256","https://openalex.org/W2372778757","https://openalex.org/W2026452100","https://openalex.org/W2112655684"],"abstract_inverted_index":{"We":[0,65,97],"consider":[1],"the":[2,26,69,83,86,92,99,103,108,112,129,171,174,180,183],"problem":[3,135],"of":[4,111,118,162,173,182],"learning":[5,22,177],"incoherent":[6],"sparse":[7,27],"and":[8,28,38,91,106,145,158,179],"low-rank":[9,29,40],"patterns":[10,30],"from":[11],"multiple":[12],"tasks.":[13],"Our":[14],"approach":[15],"is":[16,45,89,95],"based":[17],"on":[18,166],"a":[19,34,39,78,122,134],"linear":[20],"multi-task":[21,176],"formulation,":[23,85],"in":[24,82],"which":[25,54],"are":[31],"induced":[32],"by":[33],"cardinality":[35],"regularization":[36],"term":[37],"constraint,":[41],"respectively.":[42],"This":[43],"formulation":[44,178],"non-convex;":[46],"we":[47,126,152],"convert":[48],"it":[49],"into":[50],"its":[51],"convex":[52,79],"surrogate,":[53],"can":[55,136],"be":[56,137],"routinely":[57],"solved":[58],"via":[59,139],"semidefinite":[60],"programming":[61],"for":[62,101],"small-size":[63],"problems.":[64],"propose":[66],"to":[67,74,132],"employ":[68],"general":[70],"projected":[71,104,113,119,155,185],"gradient":[72,105,114,120,156,186],"scheme":[73],"efficiently":[75],"solve":[76],"such":[77,133],"surrogate;":[80],"however,":[81],"optimization":[84,124,143],"objective":[87],"function":[88],"non-differentiable":[90],"feasible":[93],"domain":[94],"non-trivial.":[96],"present":[98,153],"procedures":[100],"computing":[102],"ensuring":[107],"global":[109],"convergence":[110],"scheme.":[115],"The":[116],"computation":[117],"involves":[121],"constrained":[123],"problem;":[125],"show":[127],"that":[128],"optimal":[130],"solution":[131],"obtained":[138],"solving":[140],"an":[141,146],"unconstrained":[142],"subproblem":[144],"Euclidean":[147],"projection":[148],"subproblem.":[149],"In":[150],"addition,":[151],"two":[154],"algorithms":[157],"discuss":[159],"their":[160],"rates":[161],"convergence.":[163],"Experimental":[164],"results":[165],"benchmark":[167],"data":[168],"sets":[169],"demonstrate":[170],"effectiveness":[172],"proposed":[175,184],"efficiency":[181],"algorithms.":[187]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":29},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":11}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}