pwc-archive/papers-with-abstracts huggingface dataset:
Shape And Structure Preserving Differential Privacy
Authors: Carlos Soto, Karthik Bharath, Matthew Reimherr, Aleksandra Slavkovic
Date: 2022-09-21 00:00:00

It is common for data structures such as images and shapes of 2D objects to be represented as points on a manifold. The utility of a mechanism to produce sanitized differentially private estimates from such data is intimately linked to how compatible it is with the underlying structure and geometry of the space. In particular, as recently shown, utility of the Laplace mechanism on a positively curved manifold, such as Kendall's 2D shape space, is significantly influences by the curvature. Focusing on the problem of sanitizing the Fr\'echet mean of a sample of points on a manifold, we exploit the characterisation of the mean as the minimizer of an objective function comprised of the sum of squared distances and develop a K-norm gradient mechanism on Riemannian manifolds that favors values that produce gradients close to the the zero of the objective function. For the case of positively curved manifolds, we describe how using the gradient of the squared distance function offers better control over sensitivity than the Laplace mechanism, and demonstrate this numerically on a dataset of shapes of corpus callosa. Further illustrations of the mechanism's utility on a sphere and the manifold of symmetric positive definite matrices are also presented.
Towards Data-driven GIM tools: Two Prototypes
Authors: Jesse David Dinneen, Sascha Donner, Helen Bubinger, Jwen Fai Low, Maja Krtalić
Date: 2022-09-26 00:00:00
Tasks: Management, Vocal Bursts Valence Prediction

Here we describe two approaches to improve group information management (GIM) and draw on the results of prior works to implement them in software prototypes. The first aids browsing and retrieving from large and unfamiliar collections like shared drives by dynamically reducing and re-organising them. The second supports the transfer and re-use of collections (e.g. to/by successors, descendants, or curators) by integrating novel sorting and annotation features. The prototypes' source code is shared online and screenshots are presented in the accompanying poster.
Legal Case Document Similarity: You Need Both Network and Text
Authors: Paheli Bhattacharya, Kripabandhu Ghosh, Arindam Pal, Saptarshi Ghosh
Date: 2022-09-26 00:00:00
Tasks: Citation Recommendation, Retrieval

Estimating the similarity between two legal case documents is an important and challenging problem, having various downstream applications such as prior-case retrieval and citation recommendation. There are two broad approaches for the task -- citation network-based and text-based. Prior citation network-based approaches consider citations only to prior-cases (also called precedents) (PCNet). This approach misses important signals inherent in Statutes (written laws of a jurisdiction). In this work, we propose Hier-SPCNet that augments PCNet with a heterogeneous network of Statutes. We incorporate domain knowledge for legal document similarity into Hier-SPCNet, thereby obtaining state-of-the-art results for network-based legal document similarity. Both textual and network similarity provide important signals for legal case similarity; but till now, only trivial attempts have been made to unify the two signals. In this work, we apply several methods for combining textual and network information for estimating legal case similarity. We perform extensive experiments over legal case documents from the Indian judiciary, where the gold standard similarity between document-pairs is judged by law experts from two reputed Law institutes in India. Our experiments establish that our proposed network-based methods significantly improve the correlation with domain experts' opinion when compared to the existing methods for network-based legal document similarity. Our best-performing combination method (that combines network-based and text-based similarity) improves the correlation with domain experts' opinion by 11.8% over the best text-based method and 20.6\% over the best network-based method. We also establish that our best-performing method can be used to recommend / retrieve citable and similar cases for a source (query) case, which are well appreciated by legal experts.
WARC-DL: Scalable Web Archive Processing for Deep Learning
Authors: Niklas Deckers, Martin Potthast
Date: 2022-09-25 00:00:00
Tasks: Deep Learning

Web archives have grown to petabytes. In addition to providing invaluable background knowledge on many social and cultural developments over the last 30 years, they also provide vast amounts of training data for machine learning. To benefit from recent developments in Deep Learning, the use of web archives requires a scalable solution for their processing that supports inference with and training of neural networks. To date, there is no publicly available library for processing web archives in this way, and some existing applications use workarounds. This paper presents WARC-DL, a deep learning-enabled pipeline for web archive processing that scales to petabytes.
Solutions to preference manipulation in recommender systems require knowledge of meta-preferences
Authors: Hal Ashton, Matija Franklin
Date: 2022-09-14 00:00:00
Tasks: Recommendation Systems

Iterative machine learning algorithms used to power recommender systems often change people's preferences by trying to learn them. Further a recommender can better predict what a user will do by making its users more predictable. Some preference changes on the part of the user are self-induced and desired whether the recommender caused them or not. This paper proposes that solutions to preference manipulation in recommender systems must take into account certain meta-preferences (preferences over another preference) in order to respect the autonomy of the user and not be manipulative.
Long Term Stock Prediction based on Financial Statements
Authors: Shujia Liu
Date: 2021-11-01 00:00:00
Proceeding: journal 2021 11
Tasks: Data Augmentation, Prediction, Stock Prediction

This paper proposes a model with LSTM and fully connected layers to predict long term stock trendings based on financial statements. Two data augmentation techniques are applied on structured data: 1) adding random noise to data fields; 2) erasing partial information from training examples. The performance of the proposed approach is demonstrated on real-world data of about 7,000 stocks listed on Nasdaq.
Feature-Rich Long-term Bitcoin Trading Assistant
Authors: Jatin Nainani, Nirman Taterh, Md Ausaf Rashid, Ankit Khivasara
Date: 2022-09-14 00:00:00
Tasks: reinforcement-learning, Reinforcement Learning, Reinforcement Learning (RL)

For a long time predicting, studying and analyzing financial indices has been of major interest for the financial community. Recently, there has been a growing interest in the Deep-Learning community to make use of reinforcement learning which has surpassed many of the previous benchmarks in a lot of fields. Our method provides a feature rich environment for the reinforcement learning agent to work on. The aim is to provide long term profits to the user so, we took into consideration the most reliable technical indicators. We have also developed a custom indicator which would provide better insights of the Bitcoin market to the user. The Bitcoin market follows the emotions and sentiments of the traders, so another element of our trading environment is the overall daily Sentiment Score of the market on Twitter. The agent is tested for a period of 685 days which also included the volatile period of Covid-19. It has been capable of providing reliable recommendations which give an average profit of about 69%. Finally, the agent is also capable of suggesting the optimal actions to the user through a website. Users on the website can also access the visualizations of the indicators to help fortify their decisions.
Assessment of cognitive characteristics in intelligent systems and predictive ability
Authors: Oleg V. Kubryak, Sergey V. Kovalchuk, Nadezhda G. Bagdasaryan
Date: 2022-09-16 00:00:00
Tasks: Common Sense Reasoning

The article proposes a universal dual-axis intelligent systems assessment scale. The scale considers the properties of intelligent systems within the environmental context, which develops over time. In contrast to the frequent consideration of the 'mind' of artificial intelligent systems on a scale from 'weak' to 'strong', we highlight the modulating influences of anticipatory ability on their 'brute force'. In addition, the complexity, the 'weight' of the cognitive task and the ability to critically assess it beforehand determine the actual set of cognitive tools, the use of which provides the best result in these conditions. In fact, the presence of 'common sense' options is what connects the ability to solve a problem with the correct use of such an ability itself. The degree of 'correctness' and 'adequacy' is determined by the combination of a suitable solution with the temporal characteristics of the event, phenomenon, object or subject under study.
Predicting students' learning styles using regression techniques
Authors: Ahmad Mousa Altamimi, Mohammad Azzeh, Mahmoud Albashayreh
Date: 2022-09-12 00:00:00
Tasks: regression

Traditional learning systems have responded quickly to the COVID pandemic and moved to online or distance learning. Online learning requires a personalization method because the interaction between learners and instructors is minimal, and learners have a specific learning method that works best for them. One of the personalization methods is detecting the learners' learning style. To detect learning styles, several works have been proposed using classification techniques. However, the current detection models become ineffective when learners have no dominant style or a mix of learning styles. Thus, the objective of this study is twofold. Firstly, constructing a prediction model based on regression analysis provides a probabilistic approach for inferring the preferred learning style. Secondly, comparing regression models and classification models for detecting learning style. To ground our conceptual model, a set of machine learning algorithms have been implemented based on a dataset collected from a sample of 72 students using visual, auditory, reading/writing, and kinesthetic (VARK's) inventory questionnaire. Results show that regression techniques are more accurate and representative for real-world scenarios than classification algorithms, where students might have multiple learning styles but with different probabilities. We believe that this research will help educational institutes to engage learning styles in the teaching process.
Model Predictive Monitoring of Dynamical Systems for Signal Temporal Logic Specifications
Authors: Xinyi Yu, Weijie Dong, Xiang Yin, ShaoYuan Li
Date: 2022-09-26 00:00:00

Online monitoring aims to evaluate or to predict, at runtime, whether or not the behaviors of a system satisfy some desired specification. It plays a key role in safety-critical cyber-physical systems. In this work, we propose a new monitoring approach, called model predictive monitoring, for specifications described by Signal Temporal Logic (STL) formulae. Specifically, we assume that the observed state traces are generated by an underlying dynamical system whose model is known but the control law is unknown. The main idea is to use the dynamic of the system to predict future states when evaluating the satisfaction of the STL formulae. To this end, effective approaches for the computation of feasible sets of STL formulae are provided. We show that, by explicitly utilizing the model information of the dynamical system, the proposed online monitoring algorithm can falsify or certify of the specification in advance compared with existing algorithms, where no model information is used. We also demonstrate the proposed monitoring algorithm by several real world case studies.
sMolBoxes: Dataflow Model for Molecular Dynamics Exploration
Authors: Pavol Ulbrich, Manuela Waldner, Katarína Furmanová, Sérgio M. Marques, David Bednář, Barbora Kozlikova, Jan Byška
Date: 2022-09-23 00:00:00
Tasks: model

We present sMolBoxes, a dataflow representation for the exploration and analysis of long molecular dynamics (MD) simulations. When MD simulations reach millions of snapshots, a frame-by-frame observation is not feasible anymore. Thus, biochemists rely to a large extent only on quantitative analysis of geometric and physico-chemical properties. However, the usage of abstract methods to study inherently spatial data hinders the exploration and poses a considerable workload. sMolBoxes link quantitative analysis of a user-defined set of properties with interactive 3D visualizations. They enable visual explanations of molecular behaviors, which lead to an efficient discovery of biochemically significant parts of the MD simulation. sMolBoxes follow a node-based model for flexible definition, combination, and immediate evaluation of properties to be investigated. Progressive analytics enable fluid switching between multiple properties, which facilitates hypothesis generation. Each sMolBox provides quick insight to an observed property or function, available in more detail in the bigBox View. The case study illustrates that even with relatively few sMolBoxes, it is possible to express complex analyses tasks, and their use in exploratory analysis is perceived as more efficient than traditional scripting-based methods.
Realistic Hair Synthesis with Generative Adversarial Networks
Authors: Muhammed Pektas, Aybars Ugur
Date: 2022-09-13 00:00:00
Tasks: Generative Adversarial Network, Image Enhancement, Style Transfer, Super-Resolution

Recent successes in generative modeling have accelerated studies on this subject and attracted the attention of researchers. One of the most important methods used to achieve this success is Generative Adversarial Networks (GANs). It has many application areas such as; virtual reality (VR), augmented reality (AR), super resolution, image enhancement. Despite the recent advances in hair synthesis and style transfer using deep learning and generative modelling, due to the complex nature of hair still contains unsolved challenges. The methods proposed in the literature to solve this problem generally focus on making high-quality hair edits on images. In this thesis, a generative adversarial network method is proposed to solve the hair synthesis problem. While developing this method, it is aimed to achieve real-time hair synthesis while achieving visual outputs that compete with the best methods in the literature. The proposed method was trained with the FFHQ dataset and then its results in hair style transfer and hair reconstruction tasks were evaluated. The results obtained in these tasks and the operating time of the method were compared with MichiGAN, one of the best methods in the literature. The comparison was made at a resolution of 128x128. As a result of the comparison, it has been shown that the proposed method achieves competitive results with MichiGAN in terms of realistic hair synthesis, and performs better in terms of operating time.
Weighted Age of Information based Scheduling for Large Population Games on Networks
Authors: Shubham Aggarwal, Muhammad Aneeq uz Zaman, Melih Bastopcu, Tamer Başar
Date: 2022-09-26 00:00:00
Tasks: Scheduling

In this paper, we consider a discrete-time multi-agent system involving $N$ cost-coupled networked rational agents solving a consensus problem and a central Base Station (BS), scheduling agent communications over a network. Due to a hard bandwidth constraint on the number of transmissions through the network, at most $R_d < N$ agents can concurrently access their state information through the network. Under standard assumptions on the information structure of the agents and the BS, we first show that the control actions of the agents are free of any dual effect, allowing for separation between estimation and control problems at each agent. Next, we propose a weighted age of information (WAoI) metric for the scheduling problem of the BS, where the weights depend on the estimation error of the agents. The BS aims to find the optimum scheduling policy that minimizes the WAoI, subject to the hard bandwidth constraint. Since this problem is NP hard, we first relax the hard constraint to a soft update rate constraint, and then compute an optimal policy for the relaxed problem by reformulating it into a Markov Decision Process (MDP). This then inspires a sub-optimal policy for the bandwidth constrained problem, which is shown to approach the optimal policy as $N \rightarrow \infty$. Next, we solve the consensus problem using the mean-field game framework wherein we first design decentralized control policies for a limiting case of the $N$-agent system (as $N \rightarrow \infty$). By explicitly constructing the mean-field system, we prove the existence and uniqueness of the mean-field equilibrium. Consequently, we show that the obtained equilibrium policies constitute an $\epsilon$-Nash equilibrium for the finite agent system. Finally, we validate the performance of both the scheduling and the control policies through numerical simulations.
Deep CLSTM for Predictive Beamforming in Integrated Sensing and Communication-enabled Vehicular Networks
Authors: Chang Liu, Xuemeng Liu, Shuangyang Li, Weijie Yuan, Derrick Wing Kwan Ng
Date: 2022-09-26 00:00:00
Tasks: Integrated sensing and communication, ISAC, Prediction

Predictive beamforming design is an essential task in realizing high-mobility integrated sensing and communication (ISAC), which highly depends on the accuracy of the channel prediction (CP), i.e., predicting the angular parameters of users. However, the performance of CP highly depends on the estimated historical channel stated information (CSI) with estimation errors, resulting in the performance degradation for most traditional CP methods. To further improve the prediction accuracy, in this paper, we focus on the ISAC in vehicle networks and propose a convolutional long-short term (CLSTM) recurrent neural network (CLRNet) to predict the angle of vehicles for the design of predictive beamforming. In the developed CLRNet, both the convolutional neural network (CNN) module and the LSTM module are adopted to exploit the spatial features and the temporal dependency from the estimated historical angles of vehicles to facilitate the angle prediction. Finally, numerical results demonstrate that the developed CLRNet-based method is robust to the estimation error and can significantly outperform the state-of-the-art benchmarks, achieving an excellent sum-rate performance for ISAC systems.
A Unified Approach for Beam-Split Mitigation in Terahertz Wideband Hybrid Beamforming
Authors: Ahmet M. Elbir
Date: 2022-09-24 00:00:00

The sixth generation networks envision the deployment of terahertz (THz) band as one of the key enabling property thanks to its abundant bandwidth. However, the ultra-wide bandwidth in THz causes beam-split phenomenon due to the use of a single analog beamformer (AB). Specifically, beam-split makes different subcarriers to observe distinct directions since the same AB is adopted for all subcarriers. Previous works mostly employ additional hardware components, e.g., time-delayer networks to mitigate beam-split by realizing virtual subcarrier-dependent ABs. This paper introduces an efficient and unified approach, called beam-split-aware (BSA) hybrid beamforming. In particular, instead of virtually generating subcarrier-dependent ABs, a single AB is used and the effect of beam-split is computed and passed into the digital beamformers, which are subcarrier-dependent while maximizing spectral efficiency. Hence, the proposed BSA approach effectively mitigates the impact of beam-split and it can be applied to any hybrid beamforming architecture. Manifold optimization and orthogonal matching pursuit techniques are considered for the evaluation of the proposed approach in multi-user scenario. Numerical simulations show that significant performance improvement can be achieved as compared to the conventional techniques.
Cooperative Tuning of Multi-Agent Optimal Control Systems
Authors: Zehui Lu, Wanxin Jin, Shaoshuai Mou, Brian D. O. Anderson
Date: 2022-09-24 00:00:00
Tasks: Distributed Optimization

This paper investigates the problem of cooperative tuning of multi-agent optimal control systems, where a network of agents (i.e. multiple coupled optimal control systems) adjusts parameters in their dynamics, objective functions, or controllers in a coordinated way to minimize the sum of their loss functions. Different from classical techniques for tuning parameters in a controller, we allow tunable parameters appearing in both the system dynamics and the objective functions of each agent. A framework is developed to allow all agents to reach a consensus on the tunable parameter, which minimizes team loss. The key idea of the proposed algorithm rests on the integration of consensus-based distributed optimization for a multi-agent system and a gradient generator capturing the optimal performance as a function of the parameter in the feedback loop tuning the parameter for each agent. Both theoretical results and simulations for a synchronous multi-agent rendezvous problem are provided to validate the proposed method for cooperative tuning of multi-agent optimal control.
Survey on Applications of Neurosymbolic Artificial Intelligence
Authors: Djallel Bouneffouf, Charu C. Aggarwal
Date: 2022-09-08 00:00:00
Tasks: Information Retrieval, Recommendation Systems, Retrieval, Survey

In recent years, the Neurosymbolic framework has attracted a lot of attention in various applications, from recommender systems and information retrieval to healthcare and finance. This success is due to its stellar performance combined with attractive properties, such as learning and reasoning. The new emerging Neurosymbolic field is currently experiencing a renaissance, as novel frameworks and algorithms motivated by various practical applications are being introduced, building on top of the classical neural and reasoning problem setting. This article aims to provide a comprehensive review of significant recent developments in real-world applications of Neurosymbolic Artificial Intelligence. Specifically, we introduce a taxonomy of common Neurosymbolic applications and summarize the state-of-the-art for each of those domains. Furthermore, we identify important current trends and provide new perspectives pertaining to the future of this burgeoning field.
Impact of temporal resolution on convolutional recurrent networks for audio tagging and sound event detection
Authors: Wim Boes, Hugo Van hamme
Date: 2022-09-26 00:00:00
Tasks: Audio Tagging, Event Detection, Sound Event Detection, Temporal Localization

Many state-of-the-art systems for audio tagging and sound event detection employ convolutional recurrent neural architectures. Typically, they are trained in a mean teacher setting to deal with the heterogeneous annotation of the available data. In this work, we present a thorough analysis of how changing the temporal resolution of these convolutional recurrent neural networks - which can be done by simply adapting their pooling operations - impacts their performance. By using a variety of evaluation metrics, we investigate the effects of adapting this design parameter under several sound recognition scenarios involving different needs in terms of temporal localization.