Optimization Approaches to Dynamic Routing of Measurements and测量和动态路由的优化方法.pptVIP

下载本文档

1
0
约1.51万字
约 68页
2017-03-08 发布于上海
举报
版权申诉

Optimization Approaches to Dynamic Routing of Measurements and测量和动态路由的优化方法.ppt

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

Optimization Approaches to Dynamic Routing of Measurements and测量和动态路由的优化方法

Example 2 Signal set consists of all perfect matchings in complete graph E.g., network inference Example 3 consists of all adjacency matrices of graphs with only a clique on square-root many nodes E.g., sparse PCA, gene expression patterns Kolar et al. (2010) Example 4 Banding estimators for covariance matrices Bickel-Levina (2007), many others assume known variable ordering Stylized problem: let M be known tridiagonal matrix Signal set Remarks In several examples, not too many extra samples required for really simple algorithms Approximation ratios vs Gaussian complexities approximation ratio might be bad, but doesn’t matter as much for statistical inference Understand Gaussian complexities of LP/SDP hierarchies in contrast to theoretical CS Conclusions Many conceptual challenges in Big Data analysis Distributed platforms and parallel algorithms critical issue of how to retain statistical correctness see also our work on divide-and-conquer algorithms for matrix completion (Mackey, Talwalkar Jordan, 2012) Algorithmic weakening for statistical inference a new area in theoretical computer science? a new area in statistics? For papers, see /~jordan * * Note that m_1 can grow significantly more slowly than n here (see discussion in paper) * * * Bag of Little Bootstraps I’ll now present a new procedure that combines the bootstrap and subsampling, and gets the best of both worlds Bag of Little Bootstraps I’ll now discuss a new procedure that combines the bootstrap and subsampling, and gets the best of both worlds It works with small subsets of the data, like subsampling, and thus is appropriate for distributed computing platforms Bag of Little Bootstraps I’ll now present a new procedure that combines the bootstrap and subsampling, and gets the best of both worlds It works with small subsets of the data, like subsampling, and thus is appropriate for distributed computing platforms But, like the bootstrap, it doesn’t require analytical rescaling