Proceedings of the 5th conference on Innovations in theoretical computer science最新文献_第5页

The truth behind the myth of the folk theorem 民间定理神话背后的真相

Proceedings of the 5th conference on Innovations in theoretical computer science Pub Date : 2013-12-03 DOI: 10.1145/2554797.2554847

Joseph Y. Halpern, R. Pass, Lior Seeman

引用次数: 12

Decompositions of triangle-dense graphs 三角密集图的分解

Proceedings of the 5th conference on Innovations in theoretical computer science Pub Date : 2013-09-28 DOI: 10.1145/2554797.2554840

Rishi Gupta, T. Roughgarden, C. Seshadhri

引用次数: 38

Attribute-efficient evolvability of linear functions 线性函数的属性有效演化性

Proceedings of the 5th conference on Innovations in theoretical computer science Pub Date : 2013-09-16 DOI: 10.1145/2554797.2554824

E. Angelino, Varun Kanade

{"title":"Attribute-efficient evolvability of linear functions","authors":"E. Angelino, Varun Kanade","doi":"10.1145/2554797.2554824","DOIUrl":"https://doi.org/10.1145/2554797.2554824","url":null,"abstract":"In a seminal paper, Valiant (2006) introduced a computational model for evolution to address the question of complexity that can arise through Darwinian mechanisms. Valiant views evolution as a restricted form of computational learning, where the goal is to evolve a hypothesis that is close to the ideal function. Feldman (2008) showed that (correlational) statistical query learning algorithms could be framed as evolutionary mechanisms in Valiant's model. P. Valiant (2012) considered evolvability of real-valued functions and also showed that weak-optimization algorithms that use weak-evaluation oracles could be converted to evolutionary mechanisms. In this work, we focus on the complexity of representations of evolutionary mechanisms. In general, the reductions of Feldman and P. Valiant may result in intermediate representations that are arbitrarily complex polynomial-sized circuits). We argue that biological constraints often dictate that the representations have low complexity, such as constant depth and fan-in circuits. We give mechanisms for evolving sparse linear functions under a large class of smooth distributions. These evolutionary algorithms are attribute-efficient in the sense that the size of the representations and the number of generations required depend only on the sparsity of the target function and the accuracy parameter, but have no dependence on the total number of attributes.","PeriodicalId":382856,"journal":{"name":"Proceedings of the 5th conference on Innovations in theoretical computer science","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116225474","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 9

Tree codes and a conjecture on exponential sums 树码和关于指数和的一个猜想

Proceedings of the 5th conference on Innovations in theoretical computer science Pub Date : 2013-08-27 DOI: 10.1145/2554797.2554813

Cristopher Moore, L. Schulman

引用次数: 35

Locally testable codes and cayley graphs 局部可测试代码和凯利图

Proceedings of the 5th conference on Innovations in theoretical computer science Pub Date : 2013-08-23 DOI: 10.1145/2554797.2554807

Parikshit Gopalan, S. Vadhan, Yuan Zhou

引用次数: 3

Multireference alignment using semidefinite programming 使用半定规划的多参考对齐

Proceedings of the 5th conference on Innovations in theoretical computer science Pub Date : 2013-08-23 DOI: 10.1145/2554797.2554839

A. Bandeira, M. Charikar, A. Singer, Andy Zhu

{"title":"Multireference alignment using semidefinite programming","authors":"A. Bandeira, M. Charikar, A. Singer, Andy Zhu","doi":"10.1145/2554797.2554839","DOIUrl":"https://doi.org/10.1145/2554797.2554839","url":null,"abstract":"The multireference alignment problem consists of estimating a signal from multiple noisy shifted observations. Inspired by existing Unique-Games approximation algorithms, we provide a semidefinite program (SDP) based relaxation which approximates the maximum likelihood estimator (MLE) for the multireference alignment problem. Although we show this MLE problem is Unique-Games hard to approximate within any constant, we observe that our poly-time approximation algorithm for this problem appears to perform quite well in typical instances, outperforming existing methods. In an attempt to explain this behavior we provide stability guarantees for our SDP under a random noise model on the observations. This case is more challenging to analyze than traditional semi-random instances of Unique-Games: the noise model is on vertices of a graph and translates into dependent noise on the edges. Interestingly, we show that if certain positivity constraints in the relaxation are dropped, its solution becomes equivalent to performing phase correlation, a popular method used for pairwise alignment in imaging applications. Finally, we describe how symmetry reduction techniques from matrix representation theory can greatly decrease the computational cost of the SDP considered.","PeriodicalId":382856,"journal":{"name":"Proceedings of the 5th conference on Innovations in theoretical computer science","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130488135","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 97

Expanders with respect to Hadamard spaces and random graphs: extended abstract 关于Hadamard空间和随机图的展开式:扩展抽象

Proceedings of the 5th conference on Innovations in theoretical computer science Pub Date : 2013-06-23 DOI: 10.1145/2554797.2554829

M. Mendel, A. Naor

引用次数: 36

Building one-time memories from isolated qubits: (extended abstract) 从孤立的量子位构建一次性存储器:(扩展摘要)

Proceedings of the 5th conference on Innovations in theoretical computer science Pub Date : 2013-04-17 DOI: 10.1145/2554797.2554823

Yi-Kai Liu

{"title":"Building one-time memories from isolated qubits: (extended abstract)","authors":"Yi-Kai Liu","doi":"10.1145/2554797.2554823","DOIUrl":"https://doi.org/10.1145/2554797.2554823","url":null,"abstract":"One-time memories (OTM's) are simple tamper-resistant cryptographic devices, which can be used to implement one-time programs, a very general form of software protection and program obfuscation. Here we investigate the possibility of building OTM's using quantum mechanical devices. It is known that OTM's cannot exist in a fully-quantum world or in a fully-classical world. Instead, we propose a new model based on isolated qubits - qubits that can only be accessed using local operations and classical communication (LOCC). This model combines a quantum resource (single-qubit measurements) with a classical restriction (on communication between qubits), and can be implemented using current technologies, such as nitrogen vacancy centers in diamond. In this model, we construct OTM's that are information-theoretically secure against one-pass LOCC adversaries that use 2-outcome measurements. Our construction resembles Wiesner's old idea of quantum conjugate coding, implemented using random error-correcting codes; our proof of security uses entropy chaining to bound the supremum of a suitable empirical process. In addition, we conjecture that our random codes can be replaced by some class of efficiently-decodable codes, to get computationally-efficient OTM's that are secure against computationally-bounded LOCC adversaries. In addition, we construct data-hiding states, which allow an LOCC sender to encode an (n-O(1))-bit messsage into n qubits, such that at most half of the message can be extracted by a one-pass LOCC receiver, but the whole message can be extracted by a general quantum receiver.","PeriodicalId":382856,"journal":{"name":"Proceedings of the 5th conference on Innovations in theoretical computer science","volume":"239 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134314208","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 9

Faster private release of marginals on small databases 在小型数据库上更快地私有发布边际值

Proceedings of the 5th conference on Innovations in theoretical computer science Pub Date : 2013-04-12 DOI: 10.1145/2554797.2554833

Karthekeyan Chandrasekaran, J. Thaler, Jonathan Ullman, A. Wan

{"title":"Faster private release of marginals on small databases","authors":"Karthekeyan Chandrasekaran, J. Thaler, Jonathan Ullman, A. Wan","doi":"10.1145/2554797.2554833","DOIUrl":"https://doi.org/10.1145/2554797.2554833","url":null,"abstract":"We study the problem of answering k-way marginal queries on a database D ϵ ({0,1}d)n, while preserving differential privacy. The answer to a k-way marginal query is the fraction of the database's records x in {0,1}d with a given value in each of a given set of up to k columns. Marginal queries enable a rich class of statistical analyses on a dataset, and designing efficient algorithms for privately answering marginal queries has been identified as an important open problem in private data analysis. For any k, we give a differentially private online algorithm that runs in time poly (n, 2o(d)) per query and answers any sequence of poly(n) many k-way marginal queries with error at most ±0.01 on every query, provided n ≥ d0.51. To the best of our knowledge, this is the first algorithm capable of privately answering marginal queries with a non-trivial worst-case accuracy guarantee for databases containing poly(d, k) records in time exp(o(d)). Our algorithm runs the private multiplicative weights algorithm (Hardt and Rothblum, FOCS '10) on a new approximate polynomial representation of the database. We derive our representation for the database by approximating the OR function restricted to low Hamming weight inputs using low-degree polynomials with coefficients of bounded L1-norm. In doing so, we show new upper and lower bounds on the degree of such polynomials, which may be of independent approximation-theoretic interest.","PeriodicalId":382856,"journal":{"name":"Proceedings of the 5th conference on Innovations in theoretical computer science","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123793764","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 48

Limits of local algorithms over sparse random graphs 稀疏随机图上局部算法的极限

Proceedings of the 5th conference on Innovations in theoretical computer science Pub Date : 2013-04-05 DOI: 10.1145/2554797.2554831

D. Gamarnik, M. Sudan

{"title":"Limits of local algorithms over sparse random graphs","authors":"D. Gamarnik, M. Sudan","doi":"10.1145/2554797.2554831","DOIUrl":"https://doi.org/10.1145/2554797.2554831","url":null,"abstract":"Local algorithms on graphs are algorithms that run in parallel on the nodes of a graph to compute some global structural feature of the graph. Such algorithms use only local information available at nodes to determine local aspects of the global structure, while also potentially using some randomness. Research over the years has shown that such algorithms can be surprisingly powerful in terms of computing structures like large independent sets in graphs locally. These algorithms have also been implicitly considered in the work on graph limits, where a conjecture due to Hatami, Lovász and Szegedy [17] implied that local algorithms may be able to compute near-maximum independent sets in (sparse) random d-regular graphs. In this paper we refute this conjecture and show that every independent set produced by local algorithms is smaller that the largest one by a multiplicative factor of at least 1/2+1/(2√2) ≈ .853, asymptotically as d → ∞. Our result is based on an important clustering phenomena predicted first in the literature on spin glasses, and recently proved rigorously for a variety of constraint satisfaction problems on random graphs. Such properties suggest that the geometry of the solution space can be quite intricate. The specific clustering property, that we prove and apply in this paper shows that typically every two large independent sets in a random graph either have a significant intersection, or have a nearly empty intersection. As a result, large independent sets are clustered according to the proximity to each other. While the clustering property was postulated earlier as an obstruction for the success of local algorithms, such as for example, the Belief Propagation algorithm, our result is the first one where the clustering property is used to formally prove limits on local algorithms.","PeriodicalId":382856,"journal":{"name":"Proceedings of the 5th conference on Innovations in theoretical computer science","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121366893","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 141