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

On the Stability of Optimal Bayesian Persuasion Strategy under a Mistrust Dynamics in Routing Games 路径博弈中不信任动态下最优贝叶斯说服策略的稳定性研究

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635848

Yixian Zhu, K. Savla

{"title":"On the Stability of Optimal Bayesian Persuasion Strategy under a Mistrust Dynamics in Routing Games","authors":"Yixian Zhu, K. Savla","doi":"10.1109/ALLERTON.2018.8635848","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8635848","url":null,"abstract":"We extend the conventional framework of Algorithmic Bayesian Persuasion (ABP) for non-atomic routing games in two directions. First, we consider the setting where a fraction of agents do not participate in persuasion but induce externality on the agents which do. We formulate natural notions of Bayesian Wardrop equilibrium and incentive compatibility constraints for such a heterogeneous setting, and discuss convexity of computing optimal Bayesian persuasion strategy. Second, motivated by classical regret-based dynamics for learning correlated equilibria, we postulate a mistrust dynamics that tracks the time average of the agents’ perception of the degree to which the recommendation under persuasion strategy is not optimal, and hence also influences the extent to which the agents follow the recommendation. We establish convergence of the link flows induced by such a dynamical process to the link flows resulting from all agents following the persuasion-based recommendations. Simulation case study using data from the Los Angeles area is used to illustrate the methodological contributions.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"7 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":"128198459","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}

引用次数: 5

Reliable and Secure Multishot Network Coding using Linearized Reed-Solomon Codes 基于线性化Reed-Solomon码的可靠安全多镜头网络编码

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635644

Umberto Martínez-Peñas, F. Kschischang

{"title":"Reliable and Secure Multishot Network Coding using Linearized Reed-Solomon Codes","authors":"Umberto Martínez-Peñas, F. Kschischang","doi":"10.1109/ALLERTON.2018.8635644","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8635644","url":null,"abstract":"Multishot network coding is considered in a worst-case adversarial setting in which an omniscient adversary with unbounded computational resources may inject erroneous packets in up to t links, erase up to $rho$ packets, and wire-tap up to $mu$ links, all throughout $ell$ shots of a (random) linearly-coded network. Assuming no knowledge of the underlying linear network code (in particular, the network topology and underlying linear code may change with time), a coding scheme achieving zero-error communication and perfect secrecy is obtained based on linearized Reed-Solomon codes. The scheme achieves the maximum possible secret message size of $ell n'-2t-rho-mu$ packets, where $n'$ is the number of outgoing links at the source, for any packet length $m geq n'$ (largest possible range), with only the restriction that $ell lt q$ (size of the base field). By lifting this construction, coding schemes for non-coherent communication are obtained with information rates close to optimal for practical instances. A Welch-Berlekamp sum-rank decoding algorithm for linearized Reed-Solomon codes is provided, having quadratic complexity in the total length $n = ell n'$, and which can be adapted to handle not only errors, but also erasures, wire-tap observations and non-coherent communication.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"2018 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":"134480718","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

Embedding for Informative Missingness: Deep Learning With Incomplete Data 信息缺失的嵌入:不完整数据的深度学习

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8636008

Amirata Ghorbani, James Y. Zou

{"title":"Embedding for Informative Missingness: Deep Learning With Incomplete Data","authors":"Amirata Ghorbani, James Y. Zou","doi":"10.1109/ALLERTON.2018.8636008","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8636008","url":null,"abstract":"Deep learning is increasingly used to make pre-dictions on biomedical and social science data. A ubiquitous challenge in such applications is that the training data is often incomplete: certain attributes of samples could be missing. Moreover, there could be complex structures in the pattern of which attributes are missing-for example, whether the glucose level is measured for a participant may depend on his/her other attributes (e.g., age) as well as on the prediction target (say, diabetes status). We propose a general embedding approach to learn representations for missingness. The embedding can be a modular layer of any neural network architecture and it’s learned at the same time as the networks learn to make predictions. This approach bypasses the need to first impute the missing attributes, which is a key limitation because standard imputation methods require random missingness. Our systematic experimental evaluations demonstrate that missingness embedding significantly improves the prediction accuracy especially when the data missingness has structures, which is typical in practice. We show that the embedding is robust to changes in the missingness of test data (domain-adaptation) and discuss how the embedding reveals insights on the underlying missing mechanism.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"6 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":"130378717","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

A Novel Decision Fusion Scheme with Feedback in Neyman-Pearson Detection Systems Neyman-Pearson检测系统中一种具有反馈的决策融合方案

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635875

Guangyang Zeng, Junfeng Wu, Xiufang Shi, Zhiguo Shi

{"title":"A Novel Decision Fusion Scheme with Feedback in Neyman-Pearson Detection Systems","authors":"Guangyang Zeng, Junfeng Wu, Xiufang Shi, Zhiguo Shi","doi":"10.1109/ALLERTON.2018.8635875","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8635875","url":null,"abstract":"Information fusion brings great advantages in multi-sensor detection systems and has attracted much attention. Regarding decision level fusion, in many existing literatures, the fusion center (FC) gives a global decision via a likelihood ratio (LR) test where the LR function is compared with a constant threshold. Most of these can be viewed as one-stage decision fusion schemes because the FC does not utilize the historical information in a continuous period of time. In this paper, we propose a novel multi-stage decision fusion scheme with feedback from the view of the Neyman-Pearson (N-P) criterion. In the proposed scheme, at each stage, the FC selects one threshold from two alternative values based on the feedback of the previous stage’s global decision to perform the LR test. Then we prove the convergence of the global detection probability and the false alarm probability when the true state of the target remains unchanged. For the decision fusion of two homogeneous sensors, we derive the optimal alternative thresholds under the N-P criterion. Simulation results show that the proposed scheme can effectively improve the performance of target detection.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"23 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":"132928917","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

Trajectory Modeling and Prediction with Waypoint Information Using a Conditionally Markov Sequence 基于条件马尔可夫序列的路径点信息轨迹建模与预测

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635996

R. Rezaie, X. Li

引用次数: 21

Analyzing the Robustness of Deep Learning Against Adversarial Examples 分析深度学习对对抗性示例的鲁棒性

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8636048

Jun Zhao

引用次数: 3

Location-Aware Coordinated Beam Alignment in mmWave Communication 毫米波通信中位置感知协调波束对准

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8635826

I. Orikumhi, Jeongwan Kang, Chansik Park, Jinmo Yang, Sunwoo Kim

引用次数: 9

Prediction Query Language 预测查询语言

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8636042

D. Shah, S. Burle, V. Doshi, Ying-zong Huang, Balaji Rengarajan

引用次数: 0

Trade-offs Between Query Difficulty and Sample Complexity in Crowdsourced Data Acquisition 众包数据采集中查询难度和样本复杂度的权衡

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8636012

Hye Won Chung, J. Lee, Doyeon Kim, A. Hero

{"title":"Trade-offs Between Query Difficulty and Sample Complexity in Crowdsourced Data Acquisition","authors":"Hye Won Chung, J. Lee, Doyeon Kim, A. Hero","doi":"10.1109/ALLERTON.2018.8636012","DOIUrl":"https://doi.org/10.1109/ALLERTON.2018.8636012","url":null,"abstract":"Consider a crowdsourcing system whose task is to classify $k$ objects in a database into two groups depending on the binary attributes of the objects. Here we propose a parity response model: the worker is asked to check whether the number of objects having a given attribute in the chosen subset is even or odd. A worker either responds with a correct binary answer or declines to respond. We propose a method for designing the sequence of subsets of objects to be queried so that the attributes of the objects can be identified with high probability using few (${n}$) answers. The method is based on an analogy to the design of Fountain codes for erasure channels. We define the query difficulty $overline {d}$ as the average size of the query subsets and we define the sample complexity $n$ as the minimum number of collected answers required to attain a given recovery accuracy. We obtain fundamental tradeoffs between recovery accuracy, query difficulty, and sample complexity. In particular, the necessary and sufficient sample complexity required for recovering all $k$ attributes with high probability is $n = c_{0}max{k, (k,log, k)/overline {d}}$ and the sample complexity for recovering a fixed proportion $(1-delta )k$ of the attributes for $delta =o(1)$ is $n=c_{1} max {k, (mathrm {k}log (1/delta ))/overline {d}}$, where $c_{0},, c_{1} >0.$","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"121 43","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131912391","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}

引用次数: 3

Locally Recoverable Coded Matrix Multiplication 局部可恢复的编码矩阵乘法

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI: 10.1109/ALLERTON.2018.8636019

Haewon Jeong, Fangwei Ye, P. Grover

引用次数: 19