{"id":"https://openalex.org/W2014689751","doi":null,"title":"Estimators and tail bounds for dimension reduction in l \u03b1 (0 < \u03b1 \u2264 2) using stable random projections","display_name":"Estimators and tail bounds for dimension reduction in l \u03b1 (0 < \u03b1 \u2264 2) using stable random projections","publication_year":2008,"publication_date":"2008-01-20","ids":{"openalex":"https://openalex.org/W2014689751","mag":"2014689751"},"language":"en","primary_location":{"id":"mag:2014689751","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/ft_gateway.cfm?id=1347084&type=pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":[],"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/A5100435527","display_name":"Ping Li","orcid":"https://orcid.org/0000-0002-8515-7773","observed_orcids":["https://orcid.org/0000-0002-8515-7773","https://orcid.org/0000-0002-5979-8868","https://orcid.org/0000-0002-7985-8477","https://orcid.org/0000-0002-1503-0240","https://orcid.org/0000-0002-8391-6510","https://orcid.org/0000-0001-8285-8921","https://orcid.org/0000-0003-4725-4553"]},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ping Li","raw_affiliation_strings":["Cornell University (Ithaca, NY);"],"raw_orcid":"https://orcid.org/0000-0002-5979-8868","affiliations":[{"raw_affiliation_string":"Cornell University (Ithaca, NY);","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100435527"],"corresponding_institution_ids":["https://openalex.org/I205783295"],"apc_list":null,"apc_paid":null,"fwci":4.4798,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.9565463,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"10","last_page":"19"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.2838999927043915,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.2838999927043915,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.16200000047683716,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0786999985575676,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/dimensionality-reduction","display_name":"dimensionality reduction","score":0.7870000004768372},{"id":"https://openalex.org/keywords/lp-norms","display_name":"Lp norms","score":0.5109999775886536},{"id":"https://openalex.org/keywords/harmonic-mean-estimator","display_name":"harmonic mean estimator","score":1.0},{"id":"https://openalex.org/keywords/sample-complexity","display_name":"sample complexity","score":0.7630000114440918},{"id":"https://openalex.org/keywords/tail-bounds","display_name":"tail bounds","score":0.9940000176429749},{"id":"https://openalex.org/keywords/boolean-data","display_name":"Boolean data","score":0.7929999828338623},{"id":"https://openalex.org/keywords/data-streams","display_name":"data streams","score":0.5189999938011169}],"concepts":[{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.681702733039856},{"id":"https://openalex.org/C203858083","wikidata":"https://www.wikidata.org/wiki/Q188347","display_name":"Harmonic mean","level":2,"score":0.6566537618637085},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6358020901679993},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5554476976394653},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4873698353767395},{"id":"https://openalex.org/C118671147","wikidata":"https://www.wikidata.org/wiki/Q578714","display_name":"Quantile","level":2,"score":0.4438442885875702},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.35377588868141174},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.20481958985328674},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2014689751","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/ft_gateway.cfm?id=1347084&type=pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W5441433","https://openalex.org/W1482260876","https://openalex.org/W1516726196","https://openalex.org/W1551441240","https://openalex.org/W1564609383","https://openalex.org/W1577871831","https://openalex.org/W1584212476","https://openalex.org/W1589494766","https://openalex.org/W1607538671","https://openalex.org/W1608038806","https://openalex.org/W1761167196","https://openalex.org/W1998840390","https://openalex.org/W2001474264","https://openalex.org/W2012833704","https://openalex.org/W2042587503","https://openalex.org/W2044466562","https://openalex.org/W2045533739","https://openalex.org/W2049898997","https://openalex.org/W2050581894","https://openalex.org/W2060164407","https://openalex.org/W2062083887","https://openalex.org/W2078411075","https://openalex.org/W2088658556","https://openalex.org/W2122759946","https://openalex.org/W2130484710","https://openalex.org/W2132069633","https://openalex.org/W2145891395","https://openalex.org/W2147717514","https://openalex.org/W2149463264","https://openalex.org/W2152402969","https://openalex.org/W2156943642","https://openalex.org/W2157005274","https://openalex.org/W2160980005","https://openalex.org/W2296616510","https://openalex.org/W2962980142"],"related_works":["https://openalex.org/W7099240330","https://openalex.org/W2145845649","https://openalex.org/W7095286691","https://openalex.org/W2107651243","https://openalex.org/W2044466562","https://openalex.org/W7096209253","https://openalex.org/W1678581302","https://openalex.org/W2988826710","https://openalex.org/W1614668841","https://openalex.org/W7096826809"],"abstract_inverted_index":{"The":[0,81,230,338],"method":[1],"of":[2,38,102,195],"stable":[3,300],"random":[4,246,301,321],"projections":[5,247,302],"is":[6,193,241,271],"popular":[7],"in":[8,35,184,201,297,350],"data":[9,12,326],"stream":[10],"computations,":[11],"mining,":[13],"information":[14],"retrieval,":[15],"and":[16,56,121,217,232,273,342,359],"machine":[17],"learning,":[18],"for":[19,50,63,86,155,161,180,223,235,354,372],"efficiently":[20],"computing":[21],"the":[22,39,46,58,72,100,106,119,136,144,148,182,196,213,219,253,266,282,287,308,347,351,356,366,373],"l\u03b1":[23],"(0":[24],"<":[25,68,226],"\u03b1":[26,65,67,87,90,131,156,227,236,257,304],"\u2264":[27,54,228],"2)":[28],"distances":[29],"using":[30,256,303],"a":[31,95,110,165,175,187,208,293],"small":[128],"(memory)":[33],"space,":[34],"one":[36,194],"pass":[37],"data.\r\n\r\nWe":[40],"propose":[41,207],"algorithms":[42],"based":[43,98,168,211,264,285],"on":[44,99,169,212,265,286],"(1)":[45],"geometric":[47,214,288,357],"mean":[48,60,215,268,310,358,361],"estimator,":[49,61,269],"all":[51,224],"0":[52,225],"<\u03b1":[53],"2,":[55,134],"(2)":[57],"harmonic":[59,267,309,360],"only":[62,179],"(e.g.,":[66],"0.344).":[69],"Compared":[70],"with":[71,307],"previous":[73],"classical":[74],"work":[75],"[27],":[76,185],"our":[77],"main":[78,197],"contributions":[79],"include:\r\n\r\n\u2022":[80],"general":[82,130,162],"sample":[83,111,149,220,383],"complexity":[84,112,150,221],"bound":[85,151,222],"\u2260":[88,132],"1,2.\r\n\r\nFor":[89],"=":[91,157,237,305],"1,":[92,133],"[27]":[93,142],"provided":[94,143],"nice":[96],"argument":[97],"inverse":[101],"Cauchy":[103],"density":[104],"about":[105,314],"median,":[107],"leading":[108],"to":[109,126,153,252,381],"bound,":[113],"although":[114],"they":[115],"did":[116],"not":[117,186],"provide":[118,249,261,346,365],"constants":[120,349],"their":[122],"proof":[123],"restricted":[124],"e":[125],"be":[127,172,313,334],"enough.\r\n\r\nFor":[129],"however,":[135],"task":[137],"becomes":[138],"much":[139],"more":[140],"difficult.":[141],"conceptual":[176],"promise":[146],"that":[147,154],"similar":[152],"1":[158],"should":[159],"exist":[160],"\u03b1,":[163],"if":[164],"non-uniform":[166],"algorithm":[167,177,210,234,263],"t-quantile":[170],"could":[171],"implemented.":[173],"Such":[174],"was":[178],"supporting":[181],"arguments":[183],"real":[188],"implementation.":[189],"We":[190,260,290,345,363],"consider":[191],"this":[192,204,331],"problems":[198],"left":[199],"open":[200],"[27].":[202],"In":[203],"study,":[205],"we":[206,329],"practical":[209,231,343],"estimator":[216,311],"derive":[218],"2.\r\n\r\n\u2022":[229],"optimal":[233],"0+\r\n\r\nThe":[238],"l0":[239,254],"norm":[240,255],"an":[242,250,262],"important":[243],"case.":[244],"Stable":[245],"can":[248,378],"approximation":[251],"\u2192":[258],"0+.":[259],"which":[270],"simple":[272],"statistically":[274],"optimal.":[275],"Its":[276],"tail":[277,352],"bounds":[278,283,353],"are":[279,327],"sharper":[280],"than":[281],"derived":[284],"mean.":[289],"also":[291,364],"discover":[292],"(possibly":[294],"surprising)":[295],"fact:":[296],"boolean":[298,325],"data,":[299],"0+":[306],"will":[312,333],"twice":[315],"as":[316,318],"accurate":[317],"(l2)":[319],"normal":[320],"projections.":[322],"Because":[323],"high-dimensional":[324],"common,":[328],"expect":[330],"fact":[332],"practically":[335],"quite":[336],"useful.\r\n\r\n\u2022":[337],"precise":[339,348],"theoretical":[340],"analysis":[341],"implications":[344],"both":[355],"estimators.":[362,375],"variances":[367],"(either":[368],"exact":[369],"or":[370],"asymptotic)":[371],"proposed":[374],"These":[376],"results":[377],"assist":[379],"practitioners":[380],"choose":[382],"sizes":[384],"accurately.":[385]},"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-05T12:25:35.769452","created_date":"2016-06-24T00:00:00"}