发布求助
文献互助 智能选刊 最新文献

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)最新文献

筛选
英文 中文
Algorithmic Aspects of Inverse Problems Using Generative Models 用生成模型求解反问题的算法方面
2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8636031
C. Hegde
{"title":"Algorithmic Aspects of Inverse Problems Using Generative Models","authors":"C. Hegde","doi":"10.1109/ALLERTON.2018.8636031","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8636031","url":null,"abstract":"The traditional approach of hand-crafting priors (such as sparsity) for solving inverse problems is slowly being replaced by the use of richer learned priors (such as those modeled by generative adversarial networks, or GANs). In this work, we study the algorithmic aspects of such a learning-based approach from a theoretical perspective. For certain generative network architectures, we establish a simple non-convex algorithmic approach that (a) theoretically enjoys linear convergence guarantees for certain inverse problems, and (b) empirically improves upon conventional techniques such as back-propagation. We also propose an extension of our approach that can handle model mismatch (i.e., situations where the generative network prior is not exactly applicable.) Together, our contributions serve as further building blocks towards an algorithmic theory of generative models in inverse problems.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123750197","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
Optimal Control Designs for Vector-valued Witsenhausen Counterexample Setups 向量值Witsenhausen反例设置的最优控制设计
2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635949
M. L. Treust, T. Oechtering
{"title":"Optimal Control Designs for Vector-valued Witsenhausen Counterexample Setups","authors":"M. L. Treust, T. Oechtering","doi":"10.1109/ALLERTON.2018.8635949","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8635949","url":null,"abstract":"In this work, necessary and sufficient conditions for empirical coordination of vector-valued Witsenhausen counterexample two terminal setups with non-classical information structure are derived. Vector-valued processing allows to involve coding in the design of the control strategies. Optimal characterizations are obtained for the non-causal encoding and causal decoding case as well as causal encoding and non-causal decoding case. Necessary and sufficient conditions are provided for the case with both non-causal encoding and decoding. The feasible set of target distributions can serve as optimization domain for characterizing the optimal average cost, in particular using Witsenhausen’s cost function.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132657710","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}
引用次数: 4
Generic Asymptotically Optimal Algorithms for Multi-Armed Bandits 多武装匪徒的一般渐近最优算法
2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635908
Richard Combes, Stefan Magureanu, A. Proutière
{"title":"Generic Asymptotically Optimal Algorithms for Multi-Armed Bandits","authors":"Richard Combes, Stefan Magureanu, A. Proutière","doi":"10.1109/ALLERTON.2018.8635908","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8635908","url":null,"abstract":"In this presentation, we address generic multi-armed bandit problems with stochastic rewards and known structure. Our notion of structure is generic and includes well-studied bandit structures such as linear, combinatorial, unimodal, Lipschitz, dueling etc. We propose a generic algorithm and prove its asymptotic optimality when the time horizon goes to infinity. We further propose a finite time regret analysis of our algorithm. As a byproduct of our analysis we develop several novel technical results which are useful to analyze generic bandit problems. More details can be found in the technical report https://arxiv.org/abs/1711.00400.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130348405","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
Secure Communication over Interference Channel: To Jam or Not to Jam? 干扰信道上的安全通信:干扰还是不干扰?
2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635988
Jinyuan Chen
{"title":"Secure Communication over Interference Channel: To Jam or Not to Jam?","authors":"Jinyuan Chen","doi":"10.1109/ALLERTON.2018.8635988","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8635988","url":null,"abstract":"We consider a secure communication over a two-user Gaussian interference channel, where each transmitter sends a confidential message to its legitimate receiver. For this setting, we identify a regime where the simple scheme of using Gaussian wiretap codebook at each transmitter (without cooperative jamming) and treating interference as noise at each intended receiver (in short, GWC-TIN scheme) achieves the optimal secure sum capacity to within a constant gap. For the symmetric case, this simple scheme is optimal when the interference-to-signal ratio (all link strengths in decibel scale) is no more than 2/3. However, when the ratio is more than 2/3, we show that this simple scheme is not optimal anymore and a scheme with cooperative jamming is proposed to achieve the optimal secure sum generalized degrees-of-freedom (GDoF). Specifically, for the symmetric case, we complete the optimal secure sum GDoF characterization for any interference regimes.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114629737","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}
引用次数: 14
An Achievable Rate Region for the Two-Way Channel with Common Output 具有共同输出的双向信道的可实现速率区域
2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635930
Oron Sabag, H. Permuter
{"title":"An Achievable Rate Region for the Two-Way Channel with Common Output","authors":"Oron Sabag, H. Permuter","doi":"10.1109/ALLERTON.2018.8635930","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8635930","url":null,"abstract":"In this paper, we derive a new achievable rate region for the two-way channel (TWC) with common output. The achievable rate region is based on two auxiliary directed graphs that represent the information that is used by each of the terminals. For any choice of the two auxiliary graphs, the achievable rate region is expressed with single-letter expressions. A degenerate choice of the auxiliary graphs, each with a single node, reduces the new achievable rate region to the Shannon’s inner bound. We also show that the achievable rate region outperforms the Shannon’s inner bound. This is shown with an explicit calculation of the achieved rate for the binary multiplying channel (BMC), using the inputs distribution from the Schalkwijk 82 scheme.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"16 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116678464","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}
引用次数: 10
Network Archaeology via Epidemic Processes: The Case of Growing Trees 流行过程中的网络考古:以树木生长为例
2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8636003
A. Magner, Arun Padakandla
{"title":"Network Archaeology via Epidemic Processes: The Case of Growing Trees","authors":"A. Magner, Arun Padakandla","doi":"10.1109/ALLERTON.2018.8636003","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8636003","url":null,"abstract":"We ask to what extent is the state of an epidemic process on a dynamic network informative about the network's past evolution. To answer this question, we formulate it as a hypothesis testing problem, wherein one must distinguish between two alternative timelines leading to the same graph. For the case in which both timelines are growing trees, we give sufficient conditions under which two timelines are distinguishable with high probability. We then give an example application of the general results to a natural model of randomly growing trees. The analysis of our estimators relies on information-theoretic techniques to bound the correlation between random variables.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115929813","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
Tensor-based Spectral Analysis of Cascading Failures over Multilayer Complex Systems 基于张量的多层复杂系统级联故障谱分析
2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635902
Songyang Zhang, Han Zhang, Hang Li, Shuguang Cui
{"title":"Tensor-based Spectral Analysis of Cascading Failures over Multilayer Complex Systems","authors":"Songyang Zhang, Han Zhang, Hang Li, Shuguang Cui","doi":"10.1109/ALLERTON.2018.8635902","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8635902","url":null,"abstract":"Cascading failure in multilayer complex systems draws significant attentions from both industry and academia nowadays. In this paper, we propose a scalable tensor-based framework to represent the interdependent multilayer network, and use this framework to analyze the failure propagation based on a susceptible-infectious-susceptible (SIS) epidemic model. Specifically, the transition equations and transition tensor are derived to characterize the behavior of failure propagation. We show that the spectral radius of transition tensor is a failure indicator with an explicit failure threshold to measure the system reliability. Moreover, to make the failure indicator analytically tractable and computationally efficient, we derive its upper and lower bounds, as well as its approximated expressions in special cases as functions of the adjacency tensor and epidemic parameters. Our analytical results are evaluated by simulations in a set of multilayer networks generated by random graphs, which show that our results can achieve the desired performance compared with other benchmark approximation methods.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122170259","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
Optimal Multi-Source Inference Privacy — A Generalized Lloyd-Max Algorithm 最优多源推断隐私——一种广义Lloyd-Max算法
2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635890
Ruochi Zhang, P. Venkitasubramaniam
{"title":"Optimal Multi-Source Inference Privacy — A Generalized Lloyd-Max Algorithm","authors":"Ruochi Zhang, P. Venkitasubramaniam","doi":"10.1109/ALLERTON.2018.8635890","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8635890","url":null,"abstract":"Information sanitization to protect an underlying label from being inferred through multiple data sources is investigated in this work. The problem is posed as an optimal mapping from a set of underlying distributions that reveal classes/labels for the data to a target distribution with minimum distortion. The optimal sanitization operation are transformed to convex optimization problems corresponding to the domain of the source and target distributions. In particular, when the target distribution is discrete, a parallel is drawn to a “biased” quantization method and an efficient sub-gradient method is proposed to derive the optimal transformation. The method is extended to a scenario where multiple source continuous distributions are to be mapped to an unknown target discrete distribution. A generalized version of the classical Lloyd Max iterative algorithm is proposed to derive the optimal biased quantizers that achieve perfect inference privacy. A real time system is investigated where the sanitizer does not have apriori information about the source distribution save for the class of possible source distributions. In the real time framework, an algorithm is proposed that achieves asymptotically the same distortion as if the source distribution were known apriori.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122815356","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}
引用次数: 1
Structure of Utility Optimization in Regular and Irregular Wireless Scenarios 规则和不规则无线场景下的效用优化结构
2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8636046
M. Andrews, Lisa Zhang
{"title":"Structure of Utility Optimization in Regular and Irregular Wireless Scenarios","authors":"M. Andrews, Lisa Zhang","doi":"10.1109/ALLERTON.2018.8636046","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8636046","url":null,"abstract":"Power optimization has long been known to be a non-convex problem which suggests that finding the true maximum might be a computationally difficult problem. In this paper we investigate the geometry of power selection over multiple resource blocks and try to determine the true difficulty of the problem. In particular, we focus on two questions:•Are there local maxima? i.e. can a natural gradient ascent algorithm ever converge to a suboptimal solution?•For typical scenarios, how much can be gained in comparison to a simple solution that allocates power for each basestation uniformly over the resource blocks?In answer to the first question we show that local maxima can indeed exist and we investigate the performance of gradient ascent as well as other algorithms on such an example. In answer to the second question we propose a metric that measures how many points in a scenario benefit from a higher-order reuse scheme and we show that for a random arrangement it is hard to beat a simple reuse-1 scheme.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122866736","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
Analysis of KNN Information Estimators for Smooth Distributions 光滑分布的KNN信息估计量分析
2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635874
Puning Zhao, L. Lai
{"title":"Analysis of KNN Information Estimators for Smooth Distributions","authors":"Puning Zhao, L. Lai","doi":"10.1109/ALLERTON.2018.8635874","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8635874","url":null,"abstract":"KSG mutual information estimator, which is based on the distances of each sample to its k-th nearest neighbor, is widely used to estimate mutual information between two continuous random variables. Existing work has analyzed the convergence speed of this estimator for random variables with bounded support. In practice, however, KSG estimator also performs well for a much broader class of distributions, including not only those with bounded support but also those with long tail distributions. In this paper, we analyze the convergence speed of the error of KSG estimator for smooth distributions, whose support can be both bounded and unbounded. As KSG mutual information estimator can be viewed as an adaptive combination of KL entropy estimators, in our analysis, we also provide convergence analysis of KL entropy estimator for a broad class of distributions.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122885361","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}
引用次数: 10
首页 上一页 下一页 尾页
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学术官方微信