OpenRaiser/Intern-Atlas huggingface dataset:
Generating Compressed Combinatory Proof Structures -- An Approach to Automated First-Order Theorem Proving
Venue: arXiv cs.LO 2022
Year: 2022

Representing a proof tree by a combinator term that reduces to the tree lets subtle forms of duplication within the tree materialize as duplicated subterms of the combinator term. In a DAG representation of the combinator term these straightforwardly factor into shared subgraphs. To search for proofs, combinator terms can be enumerated, like clausal tableaux, interwoven with unification of formulas that are associated with nodes of the enumerated structures. To restrict the search space, the enumeration can be based on proof schemas defined as parameterized combinator terms. We introduce here this "combinator term as proof structure" approach to automated first-order proving, present an implementation and first experimental results. The approach builds on a term view of proof structures rooted in condensed detachment and the connection method. It realizes features known from the connection structure calculus, which has not been implemented so far.
Embedding digital participatory budgeting within local government: motivations, strategies and barriers faced
Venue: arXiv cs.CY 2022
Year: 2022

The challenging task of embedding innovative participatory processes and technologies within local government often falls upon local council officers. Using qualitative data collection and analysis, we investigate the ongoing work of Scottish local councils seeking to run the process of participatory budgeting (PB) within their institution, the use of digital platforms to support this and the challenges faced. In doing so this paper draws on empirical material to support the growing discussion on the dynamics or forces behind embedding. Our analysis shows that formal agreement alone does not make the process a certainty. Local council officers must work as mediators in the transitional space between representative structures and new, innovative ways of working, unsettling the entrenched power dynamics. To do so they must be well trained and well resourced, including the ability to use digital platforms effectively as part of the process. This provides the necessary, accessible, transparent and deliberative space for participation.
Identifying epidemic related Tweets using noisy learning
Venue: arXiv cs.CL 2022
Year: 2022

Supervised learning algorithms are heavily reliant on annotated datasets to train machine learning models. However, the curation of the annotated datasets is laborious and time consuming due to the manual effort involved and has become a huge bottleneck in supervised learning. In this work, we apply the theory of noisy learning to generate weak supervision signals instead of manual annotation. We curate a noisy labeled dataset using a labeling heuristic to identify epidemic related tweets. We evaluated the performance using a large epidemic corpus and our results demonstrate that models trained with noisy data in a class imbalanced and multi-classification weak supervision setting achieved performance greater than 90%.
Text Summarization with Oracle Expectation
Venue: arXiv cs.CL 2022
Year: 2022

Extractive summarization produces summaries by identifying and concatenating the most important sentences in a document. Since most summarization datasets do not come with gold labels indicating whether document sentences are summary-worthy, different labeling algorithms have been proposed to extrapolate oracle extracts for model training. In this work, we identify two flaws with the widely used greedy labeling approach: it delivers suboptimal and deterministic oracles. To alleviate both issues, we propose a simple yet effective labeling algorithm that creates soft, expectation-based sentence labels. We define a new learning objective for extractive summarization which incorporates learning signals from multiple oracle summaries and prove it is equivalent to estimating the oracle expectation for each document sentence. Without any architectural modifications, the proposed labeling scheme achieves superior performance on a variety of summarization benchmarks across domains and languages, in both supervised and zero-shot settings.
Joint Task Offloading and Resource Optimization in NOMA-based Vehicular Edge Computing: A Game-Theoretic DRL Approach
Venue: arXiv cs.NI 2022
Year: 2022

Vehicular edge computing (VEC) becomes a promising paradigm for the development of emerging intelligent transportation systems. Nevertheless, the limited resources and massive transmission demands bring great challenges on implementing vehicular applications with stringent deadline requirements. This work presents a non-orthogonal multiple access (NOMA) based architecture in VEC, where heterogeneous edge nodes are cooperated for real-time task processing. We derive a vehicle-to-infrastructure (V2I) transmission model by considering both intra-edge and inter-edge interferences and formulate a cooperative resource optimization (CRO) problem by jointly optimizing the task offloading and resource allocation, aiming at maximizing the service ratio. Further, we decompose the CRO into two subproblems, namely, task offloading and resource allocation. In particular, the task offloading subproblem is modeled as an exact potential game (EPG), and a multi-agent distributed distributional deep deterministic policy gradient (MAD4PG) is proposed to achieve the Nash equilibrium. The resource allocation subproblem is divided into two independent convex optimization problems, and an optimal solution is proposed by using a gradient-based iterative method and KKT condition. Finally, we build the simulation model based on real-world vehicle trajectories and give a comprehensive performance evaluation, which conclusively demonstrates the superiority of the proposed solutions.
Shrinking unit: a Graph Convolution-Based Unit for CNN-like 3D Point Cloud Feature Extractors
Venue: arXiv cs.CV 2022
Year: 2022

3D point clouds have attracted increasing attention in architecture, engineering, and construction due to their high-quality object representation and efficient acquisition methods. Consequently, many point cloud feature detection methods have been proposed in the literature to automate some workflows, such as their classification or part segmentation. Nevertheless, the performance of point cloud automated systems significantly lags behind their image counterparts. While part of this failure stems from the irregularity, unstructuredness, and disorder of point clouds, which makes the task of point cloud feature detection significantly more challenging than the image one, we argue that a lack of inspiration from the image domain might be the primary cause of such a gap. Indeed, given the overwhelming success of Convolutional Neural Networks (CNNs) in image feature detection, it seems reasonable to design their point cloud counterparts, but none of the proposed approaches closely resembles them. Specifically, even though many approaches generalise the convolution operation in point clouds, they fail to emulate the CNNs multiple-feature detection and pooling operations. For this reason, we propose a graph convolution-based unit, dubbed Shrinking unit, that can be stacked vertically and horizontally for the design of CNN-like 3D point cloud feature extractors. Given that self, local and global correlations between points in a point cloud convey crucial spatial geometric information, we also leverage them during the feature extraction process. We evaluate our proposal by designing a feature extractor model for the ModelNet-10 benchmark dataset and achieve 90.64% classification accuracy, demonstrating that our innovative idea is effective. Our code is available at github.com/albertotamajo/Shrinking-unit.
Performance Analysis of MIMO-HARQ Assisted V2V Communications With Keyhole Effect
Venue: arXiv cs.IT 2022
Year: 2022

Vehicle-to-vehicle (V2V) communications under dense urban environments usually experience severe keyhole fading effect especially for multi-input multi-output (MIMO) channels, which degrades the capacity and outage performance due to the rank deficiency. To avoid these, the integration of MIMO and hybrid automatic repeat request (HARQ) is proposed to assist V2V communications in this paper. By using the methods of integral transforms, the outage probabilities are derived in closed-form for different HARQ-assisted schemes, including Type I-HARQ, HARQ with chase combining (HARQ-CC), and HARQ with incremental redundancy (HARQ-IR). With the results, meaningful insights are gained by conducting the asymptotic outage analysis. Specifically, it is revealed that full time diversity order can be achieved, while full spatial diversity order is unreachable as compared to MIMO-HARQ systems without keyhole effect. Moreover, we prove that the asymptotic outage probability is a monotonically increasing and convex function of the transmission rate. More importantly, although HARQ-IR performs better than HARQ-CC owing to its higher coding complexity, this advantage becomes negligible in the large-scale array regime. Finally, the numerical results are verified by Monte-Carlo simulations along with some in-depth discussions.
Outage Analysis on Type I HARQ over Time-Correlated Rayleigh Fading Channels
Venue: arXiv cs.IT 2022
Year: 2022

This paper analyzes Type I hybrid automatic repeat request (HARQ) over time-correlated Rayleigh fading channels. Due to the presence of channel time correlation, the analysis is more challenging than the prior analysis in the literature. Outage probability is first derived as a weighted sum of joint CDF of multiple independent Gamma random variables based on an infinite series representation. A truncation method is proposed for efficient computation of the outage probability and it is proved that the truncation error decreases exponentially with the truncation order. Asymptotic outage probability is then derived in a simple form, with which the impacts of packet transmission rate, transmit power and channel time correlation could be decoupled and analyzed clearly. Based on the asymptotic outage probability, diversity order of HARQ is also analyzed. It is found that full diversity can be achieved even under time correlated fading channels and the time correlation of the channels has negative effect on the outage probability under high signal-to-noise ratio (SNR). Finally, our analytical results are validated by MonteCarlo simulations.
FONDUE: an algorithm to find the optimal dimensionality of the latent representations of variational autoencoders
Venue: arXiv cs.LG 2022
Year: 2022

When training a variational autoencoder (VAE) on a given dataset, determining the optimal number of latent variables is mostly done by grid search: a costly process in terms of computational time and carbon footprint. In this paper, we explore the intrinsic dimension estimation (IDE) of the data and latent representations learned by VAEs. We show that the discrepancies between the IDE of the mean and sampled representations of a VAE after only a few steps of training reveal the presence of passive variables in the latent space, which, in well-behaved VAEs, indicates a superfluous number of dimensions. Using this property, we propose FONDUE: an algorithm which quickly finds the number of latent dimensions after which the mean and sampled representations start to diverge (i.e., when passive variables are introduced), providing a principled method for selecting the number of latent dimensions for VAEs and autoencoders.
ComplexWoundDB: A Database for Automatic Complex Wound Tissue Categorization
Venue: arXiv cs.CV 2022
Year: 2022

Complex wounds usually face partial or total loss of skin thickness, healing by secondary intention. They can be acute or chronic, figuring infections, ischemia and tissue necrosis, and association with systemic diseases. Research institutes around the globe report countless cases, ending up in a severe public health problem, for they involve human resources (e.g., physicians and health care professionals) and negatively impact life quality. This paper presents a new database for automatically categorizing complex wounds with five categories, i.e., non-wound area, granulation, fibrinoid tissue, and dry necrosis, hematoma. The images comprise different scenarios with complex wounds caused by pressure, vascular ulcers, diabetes, burn, and complications after surgical interventions. The dataset, called ComplexWoundDB, is unique because it figures pixel-level classifications from $27$ images obtained in the wild, i.e., images are collected at the patients' homes, labeled by four health professionals. Further experiments with distinct machine learning techniques evidence the challenges in addressing the problem of computer-aided complex wound tissue categorization. The manuscript sheds light on future directions in the area, with a detailed comparison among other databased widely used in the literature.
Learning to Learn with Generative Models of Neural Network Checkpoints
Venue: arXiv cs.LG 2022
Year: 2022

We explore a data-driven approach for learning to optimize neural networks. We construct a dataset of neural network checkpoints and train a generative model on the parameters. In particular, our model is a conditional diffusion transformer that, given an initial input parameter vector and a prompted loss, error, or return, predicts the distribution over parameter updates that achieve the desired metric. At test time, it can optimize neural networks with unseen parameters for downstream tasks in just one update. We find that our approach successfully generates parameters for a wide range of loss prompts. Moreover, it can sample multimodal parameter solutions and has favorable scaling properties. We apply our method to different neural network architectures and tasks in supervised and reinforcement learning.
Intention Communication and Hypothesis Likelihood in Game-Theoretic Motion Planning
Venue: arXiv cs.RO 2022
Year: 2022

Game-theoretic motion planners are a potent solution for controlling systems of multiple highly interactive robots. Most existing game-theoretic planners unrealistically assume a priori objective function knowledge is available to all agents. To address this, we propose a fault-tolerant receding horizon game-theoretic motion planner that leverages inter-agent communication with intention hypothesis likelihood. Specifically, robots communicate their objective function incorporating their intentions. A discrete Bayesian filter is designed to infer the objectives in real-time based on the discrepancy between observed trajectories and the ones from communicated intentions. In simulation, we consider three safety-critical autonomous driving scenarios of overtaking, lane-merging and intersection crossing, to demonstrate our planner's ability to capitalize on alternative intention hypotheses to generate safe trajectories in the presence of faulty transmissions in the communication network.
Outage Performance Analysis of Full-Correlated Rayleigh MIMO Channels
Venue: arXiv cs.IT 2022
Year: 2022

The outage performance of multiple-input multiple-output (MIMO) technique has received intensive attention to meet the stringent requirement of reliable communications for 5G applications, e.g., mission-critical machine-type communication (cMTC). To account for spatial correlation effects at both transmit and receive sides, the full-correlated Rayleigh MIMO fading channels are modeled according to Kronecker correlation structure in this paper. The outage probability is expressed as a weighted sum of the generalized Fox's H functions. The simple analytical result empowers asymptotic outage analysis at high signal-to-noise ratio (SNR), which not only reveal helpful insights into understanding the behavior of fading effects, but also offer useful design guideline for MIMO configurations. Particularly, the negative impact of the spatial correlation on the outage probability is revealed by using the concept of majorization, and the asymptotic outage probability is proved to be a monotonically increasing and convex function of the transmission rate. In the end, the analytical results are validated through extensive numerical experiments.
Inclusive Ethical Design for Recommender Systems
Venue: arXiv cs.IR 2022
Year: 2022

Recommender systems are becoming increasingly central as mediators of information with the potential to profoundly influence societal opinion. While approaches are being developed to ensure these systems are designed in a responsible way, adolescents in particular, represent a potentially vulnerable user group requiring explicit consideration. This is especially important given the nature of their access and use of recommender systems but also their role as providers of content. This paper proposes core principles for the ethical design of recommender systems and evaluates whether current approaches to ensuring adherence to these principles are sufficiently inclusive of the particular needs and potential vulnerabilities of adolescent users.
Improved and Generalized Algorithms for Burning a Planar Point Set
Venue: arXiv cs.CG 2022
Year: 2022

Given a set $P$ of points in the plane, a point burning process is a discrete time process to burn all the points of $P$ where fires must be initiated at the given points. Specifically, the point burning process starts with a single burnt point from $P$, and at each subsequent step, burns all the points in the plane that are within one unit distance from the currently burnt points, as well as one other unburnt point of $P$ (if exists). The point burning number of $P$ is the smallest number of steps required to burn all the points of $P$. If we allow the fire to be initiated anywhere, then the burning process is called an anywhere burning process, and the corresponding burning number is called anywhere burning number. Computing the point and anywhere burning number is known to be NP-hard. In this paper we show that both these problems admit PTAS in one dimension. We then show that in two dimensions, point burning and anywhere burning are $(1.96296+\varepsilon)$ and $(1.92188+\varepsilon)$ approximable, respectively, for every $\varepsilon>0$, which improves the previously known $(2+\varepsilon)$ factor for these problems. We also observe that a known result on set cover problem can be leveraged to obtain a 2-approximation for burning the maximum number of points in a given number of steps. We show how the results generalize if we allow the points to have different fire spreading rates. Finally, we prove that even if the burning sources are given as input, finding a point burning sequence itself is NP-hard.
An Application of a Runtime Epistemic Probabilistic Event Calculus to Decision-making in e-Health Systems
Venue: arXiv cs.AI 2022
Year: 2022

We present and discuss a runtime architecture that integrates sensorial data and classifiers with a logic-based decision-making system in the context of an e-Health system for the rehabilitation of children with neuromotor disorders. In this application, children perform a rehabilitation task in the form of games. The main aim of the system is to derive a set of parameters the child's current level of cognitive and behavioral performance (e.g., engagement, attention, task accuracy) from the available sensors and classifiers (e.g., eye trackers, motion sensors, emotion recognition techniques) and take decisions accordingly. These decisions are typically aimed at improving the child's performance by triggering appropriate re-engagement stimuli when their attention is low, by changing the game or making it more difficult when the child is losing interest in the task as it is too easy. Alongside state-of-the-art techniques for emotion recognition and head pose estimation, we use a runtime variant of a probabilistic and epistemic logic programming dialect of the Event Calculus, known as the Epistemic Probabilistic Event Calculus. In particular, the probabilistic component of this symbolic framework allows for a natural interface with the machine learning techniques. We overview the architecture and its components, and show some of its characteristics through a discussion of a running example and experiments. Under consideration for publication in Theory and Practice of Logic Programming (TPLP).
WikiDes: A Wikipedia-Based Dataset for Generating Short Descriptions from Paragraphs
Venue: arXiv cs.CL 2022
Year: 2022

As free online encyclopedias with massive volumes of content, Wikipedia and Wikidata are key to many Natural Language Processing (NLP) tasks, such as information retrieval, knowledge base building, machine translation, text classification, and text summarization. In this paper, we introduce WikiDes, a novel dataset to generate short descriptions of Wikipedia articles for the problem of text summarization. The dataset consists of over 80k English samples on 6987 topics. We set up a two-phase summarization method - description generation (Phase I) and candidate ranking (Phase II) - as a strong approach that relies on transfer and contrastive learning. For description generation, T5 and BART show their superiority compared to other small-scale pre-trained models. By applying contrastive learning with the diverse input from beam search, the metric fusion-based ranking models outperform the direct description generation models significantly up to 22 ROUGE in topic-exclusive split and topic-independent split. Furthermore, the outcome descriptions in Phase II are supported by human evaluation in over 45.33% chosen compared to 23.66% in Phase I against the gold descriptions. In the aspect of sentiment analysis, the generated descriptions cannot effectively capture all sentiment polarities from paragraphs while doing this task better from the gold descriptions. The automatic generation of new descriptions reduces the human efforts in creating them and enriches Wikidata-based knowledge graphs. Our paper shows a practical impact on Wikipedia and Wikidata since there are thousands of missing descriptions. Finally, we expect WikiDes to be a useful dataset for related works in capturing salient information from short paragraphs. The curated dataset is publicly available at: https://github.com/declare-lab/WikiDes.
Style Matters! Investigating Linguistic Style in Online Communities
Venue: arXiv cs.CL 2022
Year: 2022

Content has historically been the primary lens used to study language in online communities. This paper instead focuses on the linguistic style of communities. While we know that individuals have distinguishable styles, here we ask whether communities have distinguishable styles. Additionally, while prior work has relied on a narrow definition of style, we employ a broad definition involving 262 features to analyze the linguistic style of 9 online communities from 3 social media platforms discussing politics, television and travel. We find that communities indeed have distinct styles. Also, style is an excellent predictor of group membership (F-score 0.952 and Accuracy 96.09%). While on average it is statistically equivalent to predictions using content alone, it is more resilient to reductions in training data.