Journal of the ACM (JACM)最新文献

筛选
英文 中文
Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound 同步字符串:接近单例边界的插入和删除代码
Journal of the ACM (JACM) Pub Date : 2021-09-13 DOI: 10.1145/3468265
Bernhard Haeupler, Amirbehshad Shahrasbi
{"title":"Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound","authors":"Bernhard Haeupler, Amirbehshad Shahrasbi","doi":"10.1145/3468265","DOIUrl":"https://doi.org/10.1145/3468265","url":null,"abstract":"We introduce synchronization strings, which provide a novel way to efficiently deal with synchronization errors, i.e., insertions and deletions. Synchronization errors are strictly more general and much harder to cope with than more commonly considered Hamming-type errors, i.e., symbol substitutions and erasures. For every ε > 0, synchronization strings allow us to index a sequence with an ε-O(1)-size alphabet, such that one can efficiently transform k synchronization errors into (1 + ε)k Hamming-type errors. This powerful new technique has many applications. In this article, we focus on designing insdel codes, i.e., error correcting block codes (ECCs) for insertion-deletion channels. While ECCs for both Hamming-type errors and synchronization errors have been intensely studied, the latter has largely resisted progress. As Mitzenmacher puts it in his 2009 survey [30]: “Channels with synchronization errors...are simply not adequately understood by current theory. Given the near-complete knowledge, we have for channels with erasures and errors...our lack of understanding about channels with synchronization errors is truly remarkable.” Indeed, it took until 1999 for the first insdel codes with constant rate, constant distance, and constant alphabet size to be constructed and only since 2016 are there constructions of constant rate insdel codes for asymptotically large noise rates. Even in the asymptotically large or small noise regimes, these codes are polynomially far from the optimal rate-distance tradeoff. This makes the understanding of insdel codes up to this work equivalent to what was known for regular ECCs after Forney introduced concatenated codes in his doctoral thesis 50 years ago. A straightforward application of our synchronization strings-based indexing method gives a simple black-box construction that transforms any ECC into an equally efficient insdel code with only a small increase in the alphabet size. This instantly transfers much of the highly developed understanding for regular ECCs into the realm of insdel codes. Most notably, for the complete noise spectrum, we obtain efficient “near-MDS” insdel codes, which get arbitrarily close to the optimal rate-distance tradeoff given by the Singleton bound. In particular, for any δ ∈ (0,1) and ε > 0, we give a family of insdel codes achieving a rate of 1 - δ - ε over a constant-size alphabet that efficiently corrects a δ fraction of insertions or deletions.","PeriodicalId":17199,"journal":{"name":"Journal of the ACM (JACM)","volume":"56 1","pages":"1 - 39"},"PeriodicalIF":0.0,"publicationDate":"2021-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75462891","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}
引用次数: 6
The Reachability Problem for Two-Dimensional Vector Addition Systems with States 带状态的二维矢量加法系统的可达性问题
Journal of the ACM (JACM) Pub Date : 2021-08-12 DOI: 10.1145/3464794
Michael Blondin, Matthias Englert, A. Finkel, Stefan Göller, C. Haase, R. Lazic, P. McKenzie, Patrick Totzke
{"title":"The Reachability Problem for Two-Dimensional Vector Addition Systems with States","authors":"Michael Blondin, Matthias Englert, A. Finkel, Stefan Göller, C. Haase, R. Lazic, P. McKenzie, Patrick Totzke","doi":"10.1145/3464794","DOIUrl":"https://doi.org/10.1145/3464794","url":null,"abstract":"We prove that the reachability problem for two-dimensional vector addition systems with states is NL-complete or PSPACE-complete, depending on whether the numbers in the input are encoded in unary or binary. As a key underlying technical result, we show that, if a configuration is reachable, then there exists a witnessing path whose sequence of transitions is contained in a bounded language defined by a regular expression of pseudo-polynomially bounded length. This, in turn, enables us to prove that the lengths of minimal reachability witnesses are pseudo-polynomially bounded.","PeriodicalId":17199,"journal":{"name":"Journal of the ACM (JACM)","volume":"97 1","pages":"1 - 43"},"PeriodicalIF":0.0,"publicationDate":"2021-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74602097","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}
引用次数: 11
Invited Articles Foreword 特邀文章前言
Journal of the ACM (JACM) Pub Date : 2021-03-24 DOI: 10.1145/3456290
É. Tardos
{"title":"Invited Articles Foreword","authors":"É. Tardos","doi":"10.1145/3456290","DOIUrl":"https://doi.org/10.1145/3456290","url":null,"abstract":"The Invited Articles section of this issue consists of two articles. The article “Uniform, Integral, and Feasible Proofs for the Determinant Identities,” by Iddo Tzameret and Stephen Cook, was invited from the 32nd ACM/ IEEE Symposium on Logic in Computer Science (LICS’17). We want to thank the LICS’17 Program Committee for their help in selecting this invited article, and editor Andrew Pitts for handling the article. The second article, “Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks,” by Artur Czumaj and Peter Davies, won the best student paper award at the 36th ACM Symposium on Principles of Distributed Computing (POCD’17). We want to thank the PODC’17 Program Committee for their help in selecting this invited article, and editor Christian Scheideler for handling the article.","PeriodicalId":17199,"journal":{"name":"Journal of the ACM (JACM)","volume":"11 1","pages":"1 - 1"},"PeriodicalIF":0.0,"publicationDate":"2021-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91079741","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}
引用次数: 0
On Nonconvex Optimization for Machine Learning 机器学习中的非凸优化
Journal of the ACM (JACM) Pub Date : 2021-02-24 DOI: 10.1145/3418526
Chi Jin, Praneeth Netrapalli, Rong Ge, S. Kakade, Michael I. Jordan
{"title":"On Nonconvex Optimization for Machine Learning","authors":"Chi Jin, Praneeth Netrapalli, Rong Ge, S. Kakade, Michael I. Jordan","doi":"10.1145/3418526","DOIUrl":"https://doi.org/10.1145/3418526","url":null,"abstract":"Gradient descent (GD) and stochastic gradient descent (SGD) are the workhorses of large-scale machine learning. While classical theory focused on analyzing the performance of these methods in convex optimization problems, the most notable successes in machine learning have involved nonconvex optimization, and a gap has arisen between theory and practice. Indeed, traditional analyses of GD and SGD show that both algorithms converge to stationary points efficiently. But these analyses do not take into account the possibility of converging to saddle points. More recent theory has shown that GD and SGD can avoid saddle points, but the dependence on dimension in these analyses is polynomial. For modern machine learning, where the dimension can be in the millions, such dependence would be catastrophic. We analyze perturbed versions of GD and SGD and show that they are truly efficient—their dimension dependence is only polylogarithmic. Indeed, these algorithms converge to second-order stationary points in essentially the same time as they take to converge to classical first-order stationary points.","PeriodicalId":17199,"journal":{"name":"Journal of the ACM (JACM)","volume":"11 1","pages":"1 - 29"},"PeriodicalIF":0.0,"publicationDate":"2021-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90049589","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}
引用次数: 17
Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks 利用无线网络中的自发传输进行广播和领导人选举
Journal of the ACM (JACM) Pub Date : 2021-01-21 DOI: 10.1145/3446383
A. Czumaj, Peter Davies
{"title":"Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks","authors":"A. Czumaj, Peter Davies","doi":"10.1145/3446383","DOIUrl":"https://doi.org/10.1145/3446383","url":null,"abstract":"We study two fundamental communication primitives: broadcasting and leader election in the classical model of multi-hop radio networks with unknown topology and without collision detection mechanisms. It has been known for almost 20 years that in undirected networks with n nodes and diameter D, randomized broadcasting requires Ω(D log n/D + log2 n) rounds, assuming that uninformed nodes are not allowed to communicate (until they are informed). Only very recently, Haeupler and Wajc (PODC'2016) showed that this bound can be improved for the model with spontaneous transmissions, providing an O(D log n log log n/log D + logO(1) n)-time broadcasting algorithm. In this article, we give a new and faster algorithm that completes broadcasting in O(D log n/log D + logO(1) n) time, succeeding with high probability. This yields the first optimal O(D)-time broadcasting algorithm whenever n is polynomial in D. Furthermore, our approach can be applied to design a new leader election algorithm that matches the performance of our broadcasting algorithm. Previously, all fast randomized leader election algorithms have used broadcasting as a subroutine and their complexity has been asymptotically strictly larger than the complexity of broadcasting. In particular, the fastest previously known randomized leader election algorithm of Ghaffari and Haeupler (SODA'2013) requires O(D log n/D min {log log n, log n/D} + logO(1) n)-time, succeeding with high probability. Our new algorithm again requires O(D log n/log D + logO(1) n) time, also succeeding with high probability.","PeriodicalId":17199,"journal":{"name":"Journal of the ACM (JACM)","volume":"1 1","pages":"1 - 22"},"PeriodicalIF":0.0,"publicationDate":"2021-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75362515","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}
引用次数: 2
Invited Article Foreword 特邀文章前言
Journal of the ACM (JACM) Pub Date : 2021-01-15 DOI: 10.1145/3442687
É. Tardos
{"title":"Invited Article Foreword","authors":"É. Tardos","doi":"10.1145/3442687","DOIUrl":"https://doi.org/10.1145/3442687","url":null,"abstract":"The Invited Article section of this issue includes “The Reachability Problem for Petri Nets Is Not Elementary,” by Wojciech Czerwiński, Sławomir Lasota, Ranko Lazić, Jérôme Leroux, and Flip Mazowiecki, which won the best paper award at the 51st Annual ACM Symposium on the Theory of Computing (STOC’19). We thank the STOC’19 Program Committee for their help in selecting this invited article, and we thank editor Martin Grohe for handling this article.","PeriodicalId":17199,"journal":{"name":"Journal of the ACM (JACM)","volume":"32 1","pages":"1 - 1"},"PeriodicalIF":0.0,"publicationDate":"2021-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79222530","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}
引用次数: 0
Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time 在量子多项式时间内的环切理想格中的轻度短向量
Journal of the ACM (JACM) Pub Date : 2021-01-06 DOI: 10.1145/3431725
R. Cramer, L. Ducas, B. Wesolowski
{"title":"Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time","authors":"R. Cramer, L. Ducas, B. Wesolowski","doi":"10.1145/3431725","DOIUrl":"https://doi.org/10.1145/3431725","url":null,"abstract":"In this article, we study the geometry of units and ideals of cyclotomic rings and derive an algorithm to find a mildly short vector in any given cyclotomic ideal lattice in quantum polynomial time, under some plausible number-theoretic assumptions. More precisely, given an ideal lattice of the cyclotomic ring of conductor m, the algorithm finds an approximation of the shortest vector by a factor exp (Õ(√ m)). This result exposes an unexpected hardness gap between these structured lattices and general lattices: The best known polynomial time generic lattice algorithms can only reach an approximation factor exp (Õ(m)). Following a recent series of attacks, these results call into question the hardness of various problems over structured lattices, such as Ideal-SVP and Ring-LWE, upon which relies the security of a number of cryptographic schemes. NOTE. This article is an extended version of a conference paper [11]. The results are generalized to arbitrary cyclotomic fields. In particular, we also extend some results of Reference [10] to arbitrary cyclotomic fields. In addition, we prove the numerical stability of the method of Reference [10]. These extended results appeared in the Ph.D. dissertation of the third author [46].","PeriodicalId":17199,"journal":{"name":"Journal of the ACM (JACM)","volume":"28 1","pages":"1 - 26"},"PeriodicalIF":0.0,"publicationDate":"2021-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82129226","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}
引用次数: 12
Bernoulli Factories and Black-box Reductions in Mechanism Design 机构设计中的伯努利工厂和黑盒约简
Journal of the ACM (JACM) Pub Date : 2021-01-06 DOI: 10.1145/3440988
S. Dughmi, Jason D. Hartline, Robert D. Kleinberg, Rad Niazadeh
{"title":"Bernoulli Factories and Black-box Reductions in Mechanism Design","authors":"S. Dughmi, Jason D. Hartline, Robert D. Kleinberg, Rad Niazadeh","doi":"10.1145/3440988","DOIUrl":"https://doi.org/10.1145/3440988","url":null,"abstract":"We provide a polynomial time reduction from Bayesian incentive compatible mechanism design to Bayesian algorithm design for welfare maximization problems. Unlike prior results, our reduction achieves exact incentive compatibility for problems with multi-dimensional and continuous type spaces. The key technical barrier preventing exact incentive compatibility in prior black-box reductions is that repairing violations of incentive constraints requires understanding the distribution of the mechanism’s output, which is typically #P-hard to compute. Reductions that instead estimate the output distribution by sampling inevitably suffer from sampling error, which typically precludes exact incentive compatibility. We overcome this barrier by employing and generalizing the computational model in the literature on Bernoulli Factories. In a Bernoulli factory problem, one is given a function mapping the bias of an “input coin” to that of an “output coin,” and the challenge is to efficiently simulate the output coin given only sample access to the input coin. This is the key ingredient in designing an incentive compatible mechanism for bipartite matching, which can be used to make the approximately incentive compatible reduction of Hartline et al. [18] exactly incentive compatible.","PeriodicalId":17199,"journal":{"name":"Journal of the ACM (JACM)","volume":"4 1","pages":"1 - 30"},"PeriodicalIF":0.0,"publicationDate":"2021-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74170892","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}
引用次数: 8
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs 圆盘和单位球图上最大团的EPTAS和亚指数算法
Journal of the ACM (JACM) Pub Date : 2021-01-06 DOI: 10.1145/3433160
Marthe Bonamy, Édouard Bonnet, N. Bousquet, Pierre Charbit, P. Giannopoulos, Eun Jung Kim, Paweł Rzaͅżewski, F. Sikora, Stéphan Thomassé
{"title":"EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs","authors":"Marthe Bonamy, Édouard Bonnet, N. Bousquet, Pierre Charbit, P. Giannopoulos, Eun Jung Kim, Paweł Rzaͅżewski, F. Sikora, Stéphan Thomassé","doi":"10.1145/3433160","DOIUrl":"https://doi.org/10.1145/3433160","url":null,"abstract":"A (unit) disk graph is the intersection graph of closed (unit) disks in the plane. Almost three decades ago, an elegant polynomial-time algorithm was found for MAXIMUM CLIQUE on unit disk graphs [Clark, Colbourn, Johnson; Discrete Mathematics ’90]. Since then, it has been an intriguing open question whether or not tractability can be extended to general disk graphs. We show that the disjoint union of two odd cycles is never the complement of a disk graph nor of a unit (3-dimensional) ball graph. From that fact and existing results, we derive a simple QPTAS and a subexponential algorithm running in time 2Õ(n2/3) for MAXIMUM CLIQUE on disk and unit ball graphs. We then obtain a randomized EPTAS for computing the independence number on graphs having no disjoint union of two odd cycles as an induced subgraph, bounded VC-dimension, and linear independence number. This, in combination with our structural results, yields a randomized EPTAS for MAX CLIQUE on disk and unit ball graphs. MAX CLIQUE on unit ball graphs is equivalent to finding, given a collection of points in R3, a maximum subset of points with diameter at most some fixed value. In stark contrast, MAXIMUM CLIQUE on ball graphs and unit 4-dimensional ball graphs, as well as intersection graphs of filled ellipses (even close to unit disks) or filled triangles is unlikely to have such algorithms. Indeed, we show that, for all those problems, there is a constant ratio of approximation that cannot be attained even in time 2n1−ɛ, unless the Exponential Time Hypothesis fails.","PeriodicalId":17199,"journal":{"name":"Journal of the ACM (JACM)","volume":"37 1","pages":"1 - 38"},"PeriodicalIF":0.0,"publicationDate":"2021-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80199353","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}
引用次数: 13
Solving Linear Programs in the Current Matrix Multiplication Time 求解当前矩阵乘法时间下的线性程序
Journal of the ACM (JACM) Pub Date : 2021-01-05 DOI: 10.1145/3424305
Michael B. Cohen, Y. Lee, Zhao Song
{"title":"Solving Linear Programs in the Current Matrix Multiplication Time","authors":"Michael B. Cohen, Y. Lee, Zhao Song","doi":"10.1145/3424305","DOIUrl":"https://doi.org/10.1145/3424305","url":null,"abstract":"This article shows how to solve linear programs of the form minAx=b,x≥ 0 c⊤ x with n variables in time O*((nω+n2.5−α/2+n2+1/6) log (n/δ)), where ω is the exponent of matrix multiplication, α is the dual exponent of matrix multiplication, and δ is the relative accuracy. For the current value of ω δ 2.37 and α δ 0.31, our algorithm takes O*(nω log (n/δ)) time. When ω = 2, our algorithm takes O*(n2+1/6 log (n/δ)) time. Our algorithm utilizes several new concepts that we believe may be of independent interest: • We define a stochastic central path method. • We show how to maintain a projection matrix √ WA⊤ (AWA⊤)−1A√ W in sub-quadratic time under ell2 multiplicative changes in the diagonal matrix W.","PeriodicalId":17199,"journal":{"name":"Journal of the ACM (JACM)","volume":"1 1","pages":"1 - 39"},"PeriodicalIF":0.0,"publicationDate":"2021-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82147837","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}
引用次数: 42
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信