{"id":"https://openalex.org/W4415366649","doi":"https://doi.org/10.1109/isit63088.2025.11195477","title":"Secure Algorithms for Vertically Federated Multi-Task Representation Learning","display_name":"Secure Algorithms for Vertically Federated Multi-Task Representation Learning","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415366649","doi":"https://doi.org/10.1109/isit63088.2025.11195477"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195477","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195477","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 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/A5104198068","display_name":"Ankit Pratap Singh","orcid":"https://orcid.org/0009-0004-2298-3594"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ankit Pratap Singh","raw_affiliation_strings":["Iowa State University,Department of Electrical and Computer Engineering,Ames,IA,USA"],"affiliations":[{"raw_affiliation_string":"Iowa State University,Department of Electrical and Computer Engineering,Ames,IA,USA","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005043504","display_name":"Namrata Vaswani","orcid":"https://orcid.org/0000-0003-2774-0650"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Namrata Vaswani","raw_affiliation_strings":["Iowa State University,Department of Electrical and Computer Engineering,Ames,IA,USA"],"affiliations":[{"raw_affiliation_string":"Iowa State University,Department of Electrical and Computer Engineering,Ames,IA,USA","institution_ids":["https://openalex.org/I173911158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5104198068"],"corresponding_institution_ids":["https://openalex.org/I173911158"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16420406,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9962000250816345,"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"}},"topics":[{"id":"https://openalex.org/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9962000250816345,"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/T10237","display_name":"Cryptography and Data Security","score":0.9940999746322632,"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/T11689","display_name":"Adversarial Robustness in Machine Learning","score":0.9815999865531921,"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/independent-and-identically-distributed-random-variables","display_name":"Independent and identically distributed random variables","score":0.5914999842643738},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5443999767303467},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5329999923706055},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.5239999890327454},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4875999987125397},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.45899999141693115},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.44620001316070557},{"id":"https://openalex.org/keywords/subspace-topology","display_name":"Subspace topology","score":0.42239999771118164},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.40689998865127563},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4041000008583069}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6323999762535095},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6104999780654907},{"id":"https://openalex.org/C141513077","wikidata":"https://www.wikidata.org/wiki/Q378542","display_name":"Independent and identically distributed random variables","level":3,"score":0.5914999842643738},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5443999767303467},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5329999923706055},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.5239999890327454},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4875999987125397},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.45899999141693115},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.44620001316070557},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.42239999771118164},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.40689998865127563},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40529999136924744},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4041000008583069},{"id":"https://openalex.org/C116409475","wikidata":"https://www.wikidata.org/wiki/Q1385056","display_name":"External Data Representation","level":2,"score":0.398499995470047},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.3903000056743622},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.38119998574256897},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.3693000078201294},{"id":"https://openalex.org/C70061542","wikidata":"https://www.wikidata.org/wiki/Q989016","display_name":"Distributed database","level":2,"score":0.35499998927116394},{"id":"https://openalex.org/C66882249","wikidata":"https://www.wikidata.org/wiki/Q169336","display_name":"Homogeneous","level":2,"score":0.34950000047683716},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.3395000100135803},{"id":"https://openalex.org/C124851039","wikidata":"https://www.wikidata.org/wiki/Q2665459","display_name":"Compressed sensing","level":2,"score":0.33410000801086426},{"id":"https://openalex.org/C2779582901","wikidata":"https://www.wikidata.org/wiki/Q21013010","display_name":"Distributed learning","level":2,"score":0.3321000039577484},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3208000063896179},{"id":"https://openalex.org/C2780985081","wikidata":"https://www.wikidata.org/wiki/Q676502","display_name":"Data Matrix","level":5,"score":0.3199999928474426},{"id":"https://openalex.org/C2992525071","wikidata":"https://www.wikidata.org/wiki/Q50818671","display_name":"Federated learning","level":2,"score":0.3160000145435333},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3158000111579895},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30809998512268066},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.30000001192092896},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.29170000553131104},{"id":"https://openalex.org/C81184566","wikidata":"https://www.wikidata.org/wiki/Q1191895","display_name":"Conjugate gradient method","level":2,"score":0.2856999933719635},{"id":"https://openalex.org/C90199385","wikidata":"https://www.wikidata.org/wiki/Q6692777","display_name":"Low-rank approximation","level":3,"score":0.2806999981403351},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.26499998569488525},{"id":"https://openalex.org/C86037889","wikidata":"https://www.wikidata.org/wiki/Q4330127","display_name":"Learning to rank","level":3,"score":0.2621000111103058},{"id":"https://openalex.org/C92207270","wikidata":"https://www.wikidata.org/wiki/Q939253","display_name":"Matrix norm","level":3,"score":0.25040000677108765},{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.25}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195477","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195477","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","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":16,"referenced_works":["https://openalex.org/W1753414968","https://openalex.org/W2963334472","https://openalex.org/W2979956265","https://openalex.org/W3046449784","https://openalex.org/W3049084366","https://openalex.org/W3131371813","https://openalex.org/W3138597937","https://openalex.org/W3197990917","https://openalex.org/W4210432793","https://openalex.org/W4213446860","https://openalex.org/W4252654521","https://openalex.org/W4308216814","https://openalex.org/W4366148818","https://openalex.org/W4392399450","https://openalex.org/W4401692034","https://openalex.org/W4401726295"],"related_works":[],"abstract_inverted_index":{"In":[0,44],"this":[1],"work":[2],"we":[3,115],"develop":[4],"a":[5,28,80,89,100,171],"communication-efficient":[6],"Byzantine-resilient":[7],"algorithm":[8,26,134],"for":[9],"vertically":[10,47],"federated":[11,48,189],"multi-task":[12],"linear":[13],"representation":[14],"learning,":[15],"also":[16],"known":[17],"as":[18,194],"low":[19],"rank":[20,107],"column-wise":[21],"compressive":[22],"sensing":[23],"(LRCS).":[24],"Our":[25],"is":[27,56,94,105,162],"geometric":[29],"median":[30],"based":[31],"resilient":[32,173],"modification":[33],"of":[34,46,102,108,138],"the":[35,50,53,69,85,97,106,109,125,129,136,139,153,163,176],"alternating":[36],"gradient":[37],"descent":[38],"(GD)":[39],"and":[40,88,135],"minimization":[41],"(altGDmin)":[42],"algorithm.":[43],"case":[45,71],"LRCS,":[49],"data":[51,61,75,178],"at":[52,76],"different":[54,77],"nodes":[55],"not":[57],"identically":[58],"distributed":[59],"(heterogeneous":[60],"setting)":[62],"making":[63],"it":[64,151],"harder":[65],"to":[66,112,118,186],"solve":[67],"than":[68,96],"horizontal":[70],"which":[72],"involves":[73],"homogeneous":[74],"nodes.":[78],"Under":[79],"simple":[81],"heterogeneity":[82,154],"bound":[83,92],"on":[84],"model":[86],"parameters,":[87],"sample":[90],"complexity":[91],"that":[93,169],"worse":[95],"optimal":[98],"by":[99,132],"factor":[101],"r":[103],"(r":[104],"unknown":[110,141],"matrix":[111,145,166],"be":[113,184],"recovered),":[114],"are":[116],"able":[117],"show":[119],"that,":[120],"with":[121,148],"high":[122],"probability":[123],"(w.h.p.),":[124],"subspace":[126],"distance":[127],"between":[128],"estimate":[130],"provided":[131],"our":[133,157,160],"span":[137],"true":[140],"Low":[142],"Rank":[143],"(LR)":[144],"decays":[146],"exponentially":[147],"iterations":[149],"until":[150],"reaches":[152],"bound.":[155],"To":[156],"best":[158],"knowledge,":[159],"result":[161,168],"first":[164],"LR":[165,190,195],"recovery":[167,191],"provides":[170],"Byzantine":[172],"solution":[174],"in":[175],"heterogenous":[177,188],"setting.":[179],"Ideas":[180],"developed":[181],"here":[182],"should":[183],"extendable":[185],"other":[187],"problems":[192],"such":[193],"matrix.":[196]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-21T00:00:00"}