[{"_1":2,"_3":-5,"_4":-5},"loaderData",{"_5":6,"_7":8,"_9":10},"actionData","errors","root",{"_280":281},"routes/_layout",{"_11":190},"routes/entity.$type.$id",{"_11":12,"_13":14,"_15":16,"_17":18,"_19":20,"_21":22,"_23":24,"_25":26,"_27":28},"dehydratedState",{"_60":61,"_62":63},"type","person","id","person_A5073129946","section","companies","entity",{"_15":16,"_29":30,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":38,"_39":-5,"_40":41,"_42":43,"_44":45,"_46":47,"_48":-5,"_49":-5,"_50":-5,"_51":-5,"_52":-5,"_53":-5,"_54":-5,"_55":-5,"_56":-5,"_57":-5,"_58":30,"_59":-5},"canonical","https://www.hugmap.com/entity/person/person_A5073129946/companies","siteBaseUrl","https://www.hugmap.com","sectionCount",2,"jsonLd","{\"@context\":\"https://schema.org\",\"@graph\":[{\"name\":\"Alyson K. Fletcher\",\"url\":\"https://www.hugmap.com/entity/person/person_A5073129946/companies\",\"@type\":\"Person\",\"jobTitle\":null},{\"@type\":\"CollectionPage\",\"name\":\"Alyson K. Fletcher 相关公司\",\"description\":\"Alyson K. Fletcher 在 HugMap 中的相关公司，共 2 条，含结构化关联信息与详情链接。\",\"url\":\"https://www.hugmap.com/entity/person/person_A5073129946/companies\",\"inLanguage\":\"zh-CN\"},{\"@type\":\"BreadcrumbList\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"首页\",\"item\":\"https://www.hugmap.com/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"人物\",\"item\":\"https://www.hugmap.com/search?type=person\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"Alyson K. Fletcher\",\"item\":\"https://www.hugmap.com/entity/person/person_A5073129946\"},{\"@type\":\"ListItem\",\"position\":4,\"name\":\"相关公司\",\"item\":\"https://www.hugmap.com/entity/person/person_A5073129946/companies\"}]}]}","name","Alyson K. Fletcher","nameZh","aliases","description","descriptionZh","status","active","externalIds","{\"openalex\":\"A5073129946\",\"orcid\":\"0000-0002-3756-6580\"}","properties","source","openalex","createdAt","2026-05-16T17:02:03.18352123","updatedAt","2026-05-23T04:25:20.199608927","orcid","0000-0002-3756-6580","title","affiliation","researchArea","paperCount","citationCount","homepage","linkedin","twitter","github","hindex","displayName","displayDescription","mutations",[],"queries",[64],{"_65":66,"_67":68,"_69":70,"_71":72},"dehydratedAt",1785898841438,"state",{"_74":75,"_76":77,"_78":66,"_79":-5,"_80":81,"_82":81,"_83":81,"_84":-5,"_85":-5,"_86":87,"_35":88,"_89":90},"queryKey",[73,19,14,16],"queryHash","[\"portal\",\"entity\",\"person\",\"person_A5073129946\"]","portal","data",{"_19":20,"_91":92,"_93":94,"_95":96,"_18":97,"_98":99,"_100":101,"_102":103},"dataUpdateCount",1,"dataUpdatedAt","error","errorUpdateCount",0,"errorUpdatedAt","fetchFailureCount","fetchFailureReason","fetchMeta","isInvalidated",false,"success","fetchStatus","idle","entityType","Person","taxonomies",[],"papers",[144,145],[104,105],"events",[],"patents",[],"articles",[],{"_15":132,"_29":133,"_31":-5,"_32":134,"_33":-5,"_34":-5,"_35":36,"_37":-5,"_39":135,"_40":136,"_42":137,"_44":138,"_112":113,"_114":-5,"_115":-5,"_116":-5,"_118":-5,"_119":-5,"_120":-5,"_121":-5,"_122":-5,"_123":-5,"_124":-5,"_125":-5,"_58":133,"_59":-5},{"_15":106,"_29":107,"_31":-5,"_32":108,"_33":-5,"_34":-5,"_35":36,"_37":109,"_39":-5,"_40":41,"_42":110,"_44":111,"_112":113,"_114":-5,"_115":-5,"_116":117,"_118":-5,"_119":-5,"_120":-5,"_121":-5,"_122":-5,"_123":-5,"_124":-5,"_125":-5,"_58":107,"_59":-5},"company_I161318765","University of California, Los Angeles",[126,127,128,129,130,107,131],"{\"ror\":\"046rm7j60\",\"openalex\":\"I161318765\"}","2026-05-14T00:27:40.39296629","2026-08-01T04:14:26.06864957","companyType","UNIVERSITY","foundedDate","headquarters","country","US","employeeCount","fundingStage","totalFunding","valuation","website","stockSymbol","uscc","crunchbaseUrl","State Normal School at Los Angeles","UC Los Angeles","Universidad de California en Los Ángeles","University of California Southern Branch","University of California at Los Angeles","Université de Californie à Los Angeles","08ce10bb-ace7-42c0-91f0-a81af5527dc0","University of California, Berkeley",[139,140,141,142,133,143],"{\"organizationType\":\"ACADEMIC\"}","graphrag,openalex","2026-06-15T13:39:16.425391707","2026-06-15T13:39:16.425394386","UC Berkeley","Cal Berkeley","Universidad de California en Berkeley","University of California at Berkeley","Université de Californie à Berkeley",{"_15":175,"_29":176,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":177,"_39":-5,"_40":41,"_42":178,"_44":179,"_151":180,"_153":-5,"_155":181,"_48":176,"_157":182,"_159":183,"_161":184,"_163":164,"_52":185,"_166":-5,"_167":186,"_169":-5,"_171":87,"_58":176,"_59":-5},{"_15":146,"_29":147,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":148,"_39":-5,"_40":41,"_42":149,"_44":150,"_151":152,"_153":154,"_155":156,"_48":147,"_157":158,"_159":160,"_161":162,"_163":164,"_52":165,"_166":-5,"_167":168,"_169":170,"_171":87,"_58":147,"_59":-5},"paper_W1674742109","Necessary and Sufficient Conditions for Sparsity Pattern Recovery","{\"arxiv\":\"0804.1839\",\"openalex\":\"W1674742109\",\"doi\":\"10.1109/tit.2009.2032726\"}","2026-05-23T04:25:20.192994469","2026-05-23T04:25:20.192997336","doi","10.1109/tit.2009.2032726","arxivId","0804.1839","openalexId","W1674742109","abstractText"," The paper considers the problem of detecting the sparsity pattern of a $k$ -sparse vector in ${\\BBR }^{n}$ from $m$ random noisy measurements. A new necessary condition on the number of measurements for asymptotically reliable detection with maximum-likelihood (ML) estimation and Gaussian measurement matrices is derived. This necessary condition for ML detection is compared against a sufficient condition for simple maximum correlation (MC) or thresholding algorithms. The analysis shows that the gap between thresholding and ML can be described by a simple expression in terms of the total signal-to-noise ratio (SNR), with the gap growing with increasing SNR. Thresholding is also compared against the more sophisticated Lasso and orthogonal matching pursuit (OMP) methods. At high SNRs, it is shown that the gap between Lasso and OMP over thresholding is described by the range of powers of the nonzero component values of the unknown signals. Specifically, the key benefit of Lasso and OMP over thresholding is the ability of Lasso and OMP to detect signals with relatively small components. ","publishedDate","2009-11-24","publishedYear",2009,"venue","IEEE Transactions on Information Theory",225,"authors","keywords",[172,173,174],"pdfUrl","https://arxiv.org/pdf/0804.1839","topVenue","Sparse and Compressive Sensing Techniques","Digital Image Processing Techniques","Industrial Vision Systems and Defect Detection","paper_W2945463326","Vector Approximate Message Passing","{\"openalex\":\"W2945463326\",\"doi\":\"10.1109/tit.2019.2916359\"}","2026-05-16T17:02:02.469810223","2026-05-19T08:23:17.17699861","10.1109/tit.2019.2916359","W2945463326","The standard linear regression (SLR) problem is to recover a vector x ⁰ from noisy linear observations y = Ax ⁰ + w. The approximate message passing (AMP) algorithm proposed by Donoho, Maleki, and Montanari is a computationally efficient iterative approach to SLR that has a remarkable property: for large i.i.d. sub-Gaussian matrices A, its per-iteration behavior is rigorously characterized by a scalar state-evolution whose fixed points, when unique, are Bayes optimal. The AMP algorithm, however, is fragile in that even small deviations from the i.i.d. sub-Gaussian model can cause the algorithm to diverge. This paper considers a “vector AMP” (VAMP) algorithm and shows that VAMP has a rigorous scalar state-evolution that holds under a much broader class of large random matrices A: those that are right-orthogonally invariant. After performing an initial singular value decomposition (SVD) of A, the per-iteration complexity of VAMP is similar to that of AMP. In addition, the fixed points of VAMP's state evolution are consistent with the replica prediction of the minimum mean-squared error derived by Tulino, Caire, Verdú, and Shamai. Numerical experiments are used to confirm the effectiveness of VAMP and its consistency with state-evolution predictions.","2019-05-24",2019,433,[187,188,189],"Error Correcting Code Techniques","Wireless Communication Security Techniques","Quantum Computing Algorithms and Architecture",{"_60":191,"_62":192},[],[193],{"_65":194,"_67":195,"_69":196,"_71":197},1785898836106,{"_74":199,"_76":77,"_78":194,"_79":-5,"_80":81,"_82":81,"_83":81,"_84":-5,"_85":-5,"_86":87,"_35":88,"_89":90},[73,198],"[\"portal\",\"industries\"]","industries",[200,201,202,203,204,205,206,207,208,209,210,211],{"_15":273,"_29":274,"_31":-5,"_32":275,"_33":276,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":215,"_42":-5,"_44":-5,"_216":217,"_218":-5,"_219":77,"_220":221,"_222":277,"_224":81,"_225":87,"_226":81,"_227":-5,"_58":274,"_59":276},{"_15":269,"_29":270,"_31":-5,"_32":-5,"_33":271,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":215,"_42":-5,"_44":-5,"_216":217,"_218":-5,"_219":77,"_220":221,"_222":272,"_224":81,"_225":87,"_226":81,"_227":-5,"_58":270,"_59":271},{"_15":263,"_29":264,"_31":-5,"_32":265,"_33":266,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":215,"_42":-5,"_44":-5,"_216":217,"_218":-5,"_219":77,"_220":221,"_222":267,"_224":81,"_225":87,"_226":81,"_227":-5,"_58":264,"_59":266},{"_15":259,"_29":260,"_31":-5,"_32":-5,"_33":261,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":215,"_42":-5,"_44":-5,"_216":217,"_218":-5,"_219":77,"_220":221,"_222":262,"_224":81,"_225":87,"_226":81,"_227":-5,"_58":260,"_59":261},{"_15":255,"_29":256,"_31":-5,"_32":-5,"_33":257,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":215,"_42":-5,"_44":-5,"_216":217,"_218":-5,"_219":77,"_220":221,"_222":258,"_224":81,"_225":87,"_226":81,"_227":-5,"_58":256,"_59":257},{"_15":249,"_29":250,"_31":-5,"_32":251,"_33":252,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":215,"_42":-5,"_44":-5,"_216":217,"_218":-5,"_219":77,"_220":221,"_222":253,"_224":81,"_225":87,"_226":81,"_227":-5,"_58":250,"_59":252},{"_15":244,"_29":245,"_31":-5,"_32":-5,"_33":246,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":215,"_42":-5,"_44":-5,"_216":217,"_218":-5,"_219":77,"_220":221,"_222":247,"_224":81,"_225":248,"_226":81,"_227":-5,"_58":245,"_59":246},{"_15":240,"_29":241,"_31":-5,"_32":-5,"_33":242,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":215,"_42":-5,"_44":-5,"_216":217,"_218":-5,"_219":77,"_220":221,"_222":243,"_224":81,"_225":87,"_226":81,"_227":-5,"_58":241,"_59":242},{"_15":236,"_29":237,"_31":-5,"_32":-5,"_33":238,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":215,"_42":-5,"_44":-5,"_216":217,"_218":-5,"_219":77,"_220":221,"_222":239,"_224":81,"_225":87,"_226":81,"_227":-5,"_58":237,"_59":238},{"_15":232,"_29":233,"_31":-5,"_32":-5,"_33":234,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":215,"_42":-5,"_44":-5,"_216":217,"_218":-5,"_219":77,"_220":221,"_222":235,"_224":81,"_225":87,"_226":81,"_227":-5,"_58":233,"_59":234},{"_15":228,"_29":229,"_31":-5,"_32":-5,"_33":230,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":215,"_42":-5,"_44":-5,"_216":217,"_218":-5,"_219":77,"_220":221,"_222":231,"_224":81,"_225":87,"_226":81,"_227":-5,"_58":229,"_59":230},{"_15":212,"_29":213,"_31":-5,"_32":-5,"_33":214,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":215,"_42":-5,"_44":-5,"_216":217,"_218":-5,"_219":77,"_220":221,"_222":223,"_224":81,"_225":87,"_226":81,"_227":-5,"_58":213,"_59":214},"tax_ind_smartphone","智能手机","Smartphone","manual","taxonomyType","INDUSTRY","code","level","parentId","tax_ind_root","path","科技行业/智能手机","sortOrder","isLeaf","entityCount","children","tax_ind_robot","机器人","Robotics","科技行业/机器人","tax_ind_wearable","智能穿戴","Smart Wearables","科技行业/智能穿戴","tax_ind_energy","新能源与智能制造","New Energy & Smart Manufacturing","科技行业/新能源与智能制造","tax_ind_biotech","生物科技","Biotech","科技行业/生物科技","tax_ind_quantum","量子计算","Quantum Computing","科技行业/量子计算",true,"tax_ind_blockchain","区块链",[254],"Blockchain","科技行业/区块链","Web3","tax_ind_enterprise","企业软件","Enterprise Software","科技行业/企业软件","tax_ind_security","网络安全","Cybersecurity","科技行业/网络安全","tax_ind_semi","半导体",[268],"Semiconductor","科技行业/半导体","芯片","tax_ind_cloud","云计算","Cloud Computing","科技行业/云计算","tax_ind_ai","人工智能",[278,279],"Artificial Intelligence","科技行业/人工智能","AI","AI 技术","env",{"_282":24},"SITE_BASE_URL"]

Alyson K. Fletcher 人物

Alyson K. Fletcher · 相关公司