{"title":"Differentially Private Community Detection over Stochastic Block Models with Graph Sketching","authors":"Mohamed Seif, A. Goldsmith, H. Poor","doi":"10.1109/CISS56502.2023.10089679","DOIUrl":"https://doi.org/10.1109/CISS56502.2023.10089679","url":null,"abstract":"There has been significant recent progress in under-standing the fundamental limits of community detection when the graph is generated from a stochastic block model (SBM). In this paper, we study the community detection problem over binary symmetric SBMs while preserving the privacy of the individual connections between the vertices. We present and analyze the associated information-theoretic tradeoff for differentially private exact recovery of the underlying communities through deriving sufficient separation conditions between the intra-community and inter-community connection probabilities while taking into account the privacy budget and graph sketching as a speed-up technique to improve the computational complexity of maximum likelihood (ML) based recovery algorithms","PeriodicalId":243775,"journal":{"name":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129424690","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}
{"title":"On the determination of GRAND noise sequences by employing integer compositions","authors":"Steven N. Jones, A. Cooper","doi":"10.1109/CISS56502.2023.10089775","DOIUrl":"https://doi.org/10.1109/CISS56502.2023.10089775","url":null,"abstract":"Guessing Random Additive Noise Decoding (GRAND) has been proposed as an efficient and universal decoding technique for linear block codes [1]. A necessary element of the GRAND decoder is a set of noise sequences of length $n$ equal to the code length. The decoded codeword is taken as the first valid codeword that results from the binary addition of the noise sequences, in order of likelihood, with the received word. For a binary code of length $boldsymbol{n}$ there are $2^{n}$ such noise sequences. When $boldsymbol{n}$ is large, it will typically be intractable to add every noise sequence during decoding. Moreover, these sequences exhibit a number of error bursts $(boldsymbol{m})$ and a total number of bit flips $(boldsymbol{l})$. In [1] the authors provide expressions to determine the probability of each error burst sequence for a two-state Markov channel model. The resulting decoder is called GRAND-Markov Order (GRAND-MO). The authors of [1] describe a GRAND-MO error pattern generator for the two-state Markov channel based upon sequential transition between $(boldsymbol{m},boldsymbol{l})$ pairs, incrementing $boldsymbol{m}$ first, and then treating each value of l. In this paper we address a method of constructing the n-length noise sequences based upon integer compositions on the required $l$ bit flips as well as the $boldsymbol{n}-boldsymbol{l}$ non-errors in the sequence. This method allows one to construct noise sequences in order of probability without the need to construct less likely noise sequences. A GRAND decoder may employ a limited number of noise sequences and abandon decoding upon finding a valid code word, or upon reaching an abandonment threshold without decoding success. In this way the most likely noise sequences can be prioritized in decoding.","PeriodicalId":243775,"journal":{"name":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127554691","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}
{"title":"Searching for the Most Probable Combination of Class Labels Using Etcetera Abduction","authors":"A. Gordon, Andrew Feng","doi":"10.1109/CISS56502.2023.10089729","DOIUrl":"https://doi.org/10.1109/CISS56502.2023.10089729","url":null,"abstract":"Many machine perception tasks require a trained model to assign class labels to multiple entities in the same context, e.g., labeling multiple objects in a single photograph. In these tasks, different combinations of labels may be more likely than others, e.g., when co-occurrence biases are considered, such that the most-confident label assigned to an individual object is not always the best choice. In this paper, we propose a new method for combining evidence from multiple class probability distributions to identify the most probable combination of labels in multi-entity contexts. Our method encodes discrete class probability distributions as literals in first-order logic, and uses probability-ranked logical abduction to identify the most likely label combination, incorporating the prior and conditional probabilities of each label. We evaluate our method on two computer vision benchmarks, first for labeling common objects in photographs of everyday contexts, and second for labeling actions of athletes in sports videos. Results indicate significant gains in classifier accuracy over systems that merely select the model's most confident class label.","PeriodicalId":243775,"journal":{"name":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127581237","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}
{"title":"Multi-agent Deep Reinforcement Learning for Multi-Cell Interference Mitigation","authors":"M. Dahal, M. Vaezi","doi":"10.1109/CISS56502.2023.10089622","DOIUrl":"https://doi.org/10.1109/CISS56502.2023.10089622","url":null,"abstract":"Multi-cell interference management techniques typically require sharing channel state information (CSI) among all cells involved, making the algorithms ineffective for practical uses. To overcome this shortcoming, an interference mitigation technique that does not require explicit CSI or coordination among neighboring cells is developed in this paper. The algorithm leverages distributed deep reinforcement learning to this end and delivers a faster and more spectrally-efficient solution than state-of-the-art centralized techniques. An important aspect of our proposed solution is that it scales very well with the number of cells in the network. The effectiveness of the proposed algorithm is verified by simulation over millimeter-wave networks with two to seven cells. Interestingly, the penalty for not sharing CSI decreases as the number of cells increases. In particular, for a 7-cell network, the proposed algorithm without sharing CSI achieves 92% of the spectral efficiency obtained by sharing CSI.","PeriodicalId":243775,"journal":{"name":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123334238","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}
Daniel Deniz, E. Ros, C. Fermüller, Francisco Barranco
{"title":"When Do Neuromorphic Sensors Outperform cameras? Learning from Dynamic Features","authors":"Daniel Deniz, E. Ros, C. Fermüller, Francisco Barranco","doi":"10.1109/CISS56502.2023.10089678","DOIUrl":"https://doi.org/10.1109/CISS56502.2023.10089678","url":null,"abstract":"Visual event sensors only output data when changes in the scene happen at very high frequency. This allows for smartly compressing the scene and thus, enabling real-time operation. Despite these advantages, works in the literature have struggled to show a niche for these event-driven approaches compared to conventional sensors, especially when focusing on accuracy performance. In this work, we show a case that fully exploits event sensor advantages: for manipulation action recognition, learning events achieves superior accuracy and time performance. The recognition of manipulation actions requires extracting and learning features from the hand pose and trajectory and the interaction with the object. As shown in our work, approaches based on event sensors are the best fit for extracting these dynamic features contrarily to conventional approaches based on full frames, which mostly extract spatial features and need to reconstruct the dynamics from sequences of frames. Finally, we show how using a tracker to extract the features to be learned only around the hand, we obtain an approach that is scene- and almost object-agnostic and achieves good time performance with a very limited impact in accuracy.","PeriodicalId":243775,"journal":{"name":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114457055","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}
{"title":"FPGA Based Emulation Of B92 QKD Protocol","authors":"U. Khokhar, Madiha Khalid, M. Najam-ul-Islam","doi":"10.1109/CISS56502.2023.10089628","DOIUrl":"https://doi.org/10.1109/CISS56502.2023.10089628","url":null,"abstract":"The global race to achieve quantum supremacy has made the design and development of quantum safe cryptography protocols inevitable. In the absence of commercial quantum computers, the classical computing based quantum system emulations are being used for the design and testing of quantum algorithms. In this paper, an FPGA based emulation of quantum system is tested for algorithm design by implementing the abstraction of B92 algorithm. The results of emulations are compared with the theoretical results of B92 algorithm for the performance bench-marking.","PeriodicalId":243775,"journal":{"name":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121828227","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}
Muhammad Mu'az Imran, Gisun Jung, Young Kim, P. E. Abas, L. D. Silva, Y. Kim
{"title":"A computational method for improving the data acquisition process in the Laser Metal Deposition","authors":"Muhammad Mu'az Imran, Gisun Jung, Young Kim, P. E. Abas, L. D. Silva, Y. Kim","doi":"10.1109/CISS56502.2023.10089700","DOIUrl":"https://doi.org/10.1109/CISS56502.2023.10089700","url":null,"abstract":"Laser metal deposition (LMD) has developed rapidly in recent years. Although the technology is gaining attention, the data obtained from in-situ sensors are noisy due to the brief processing window and must be analyzed automatically to ensure the reliability of the data acquisition process. Traditionally, researchers used a simple Moving Average (MA) to diminish the peaks of the signals that may inflate the estimation for further data analysis. Spatter is one of the indicators that can describe the process stability of LMD. The generation of spatters is linked to peaks of the signals and has concept drift characteristics. Therefore, this study aims to detect and distinguish between point anomaly and concept drift in data streams in order to remove the extreme values that can mask the actual performance of the deposition process. The proposed method comprises two main components: (1) differencing method to flag the potential point outlier and (2) the density-based method to verify whether the flagged observations are outliers or not. We evaluated and compared our proposed method with the DSPOT method. The results show that our proposed method outperforms the DSPOT method based on the evaluation metrics (Recall, Precision, and F1-score) and the computation time.","PeriodicalId":243775,"journal":{"name":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","volume":"232 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123117453","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}
{"title":"Improving Particle Thompson Sampling through Regenerative Particles","authors":"Zeyu Zhou, B. Hajek","doi":"10.1109/CISS56502.2023.10089647","DOIUrl":"https://doi.org/10.1109/CISS56502.2023.10089647","url":null,"abstract":"This paper proposes regenerative particle Thompson sampling (RPTS) as an improvement of particle Thompson sampling (PTS) for solving general stochastic bandit problems. PTS approximates Thompson sampling by replacing the continuous posterior distribution with a discrete distribution supported at a set of weighted static particles. PTS is flexible but may suffer from poor performance due to the tendency of the probability mass to concentrate on a small number of particles. RPTS exploits the particle weight dynamics of PTS and uses non-static particles: it deletes a particle if its probability mass gets sufficiently small and regenerates new particles in the vicinity of the surviving particles. Empirical evidence shows uniform improvement across a set of representative bandit problems without increasing the number of particles.","PeriodicalId":243775,"journal":{"name":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123587708","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}
{"title":"Policy Poisoning in Batch Learning for Linear Quadratic Control Systems via State Manipulation","authors":"Courtney M. King, Son Tung Do, Juntao Chen","doi":"10.1109/CISS56502.2023.10089721","DOIUrl":"https://doi.org/10.1109/CISS56502.2023.10089721","url":null,"abstract":"In this work, we study policy poisoning through state manipulation, also known as sensor spoofing, and focus specifically on the case of an agent forming a control policy through batch learning in a linear-quadratic (LQ) system. In this scenario, an attacker aims to trick the learner into implementing a targeted malicious policy by manipulating the batch data before the agent begins its learning process. An attack model is crafted to carry out the poisoning strategically, with the goal of modifying the batch data as little as possible to avoid detection by the learner. We establish an optimization framework to guide the design of such policy poisoning attacks. The presence of bi-linear constraints in the optimization problem requires the design of a computationally efficient algorithm to obtain a solution. Therefore, we develop an iterative scheme based on the Alternating Direction Method of Multipliers (ADMM) which is able to return solutions that are approximately optimal. Several case studies are used to demonstrate the effectiveness of the algorithm in carrying out the sensor-based attack on the batch-learning agent in LQ control systems.","PeriodicalId":243775,"journal":{"name":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129440776","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}
{"title":"Tools and Visualizations for Exploring Classification Landscapes","authors":"William Powers, Lin Shi, L. Liebovitch","doi":"10.1109/CISS56502.2023.10089673","DOIUrl":"https://doi.org/10.1109/CISS56502.2023.10089673","url":null,"abstract":"Neural networks and deep learning systems find the correct classification of input data by locating the corresponding local minima in the hyper-dimensional, classification landscape. An increasing number of adversarial examples have now shown that these networks sometimes find an unexpected and incorrect minimum and so make an incorrect classification. To understand those results requires a better understanding of the nature of these classification landscapes. Previous studies have explored the properties of the landscape of back propagation in training these networks. In our studies here, we explore the classification landscape of already trained networks. We present some novel procedures and analytical tools to study the classification land-scape and visualizations to meaningfully represent those results. We apply these methods to study the classification landscape in classic examples, including image classification in the MNIST data set and flower classification from numerical feature values in the Iris data set.","PeriodicalId":243775,"journal":{"name":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127683307","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}