Optimal Bounds for JohnsonLindenstrauss Transforms and约翰逊Lindenstrauss变换和最优边界.pptVIP

Optimal Bounds for JohnsonLindenstrauss Transforms and约翰逊Lindenstrauss变换和最优边界.ppt

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Optimal Bounds for JohnsonLindenstrauss Transforms and约翰逊Lindenstrauss变换和最优边界

Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Sub-Constant Error T.S. Jayram David Woodruff IBM Almaden Data Stream Model Have a stream of m updates to an n-dimensional vector v “add x to coordinate i” Insertion model - all updates x are positive Turnstile model - x can be positive or negative stream length and updates poly(n) Estimate statistics of v # of distinct elements F0 Lp-norm |v|p = (Σi |vi|p )1/p entropy and so on Goal: output a (1+ε)-approximation with limited memory Lots of “Optimal” Papers Lots of “optimal” results “An optimal algorithm for the distinct elements problem” [KNW] “Fast moment estimation in optimal space” [KNPW] “A near-optimal algorithm for estimating entropy of a stream” [CCM] “Optimal approximations of the frequency moments of data streams” [IW] “A near-optimal algorithm for L1-difference” [NW] “Optimal space lower bounds for all frequency moments” [W] This paper Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Sub-Constant Error What Is Optimal? F0 = # of non-zero entries in v “For a stream of indices in {1, …, n}, our algorithm computes a (1+ε)-approximation using an optimal O(ε-2 + log n) bits of space with 2/3 success probability… This probability can be amplified by independent repetition.” If we want high probability, say, 1-1/n, this increases the space by a multiplicative log n So “optimal” algorithms are only optimal for algorithms with constant success probability Can We Improve the Lower Bounds? Our Results Streaming Results Independent repetition is optimal! Estimating Lp-norm in turnstile model up to 1+ε w.p. 1-δ Ω(ε-2 log n log 1/δ) bits for any p [KNW] get O(ε-2 log n log 1/δ) for 0 · p · 2 Estimating F0 in insertion model up to 1+ε w.p. 1-δ Ω(ε-2log 1/δ + log n) bits [KNW] get O(ε-2 log 1/δ) for ε-2 log n Estimating entropy in turnstile model up to 1+ε w.p. 1-δ Ω(ε-2log n log 1/δ) bits Improves Ω(ε-2 log n) bound [KNW] Johnson-Linde

您可能关注的文档

文档评论(0)

118books + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档