pwc-archive/papers-with-abstracts huggingface dataset:
Network-based Statistics Distinguish Anomic and Broca Aphasia
Authors: Xingpei Zhao, Nicholas Riccardi, Rutvik H. Desai, Dirk-Bart den Ouden, Julius Fridriksson, YuAn Wang
Date: 2023-02-07 00:00:00

Aphasia is a speech-language impairment commonly caused by damage to the left hemisphere. Due to the complexity of speech-language processing, the neural mechanisms that underpin various symptoms between different types of aphasia are still not fully understood. We used the network-based statistic method to identify distinct subnetwork(s) of connections differentiating the resting-state functional networks of the anomic and Broca groups. We identified one such subnetwork that mainly involved the brain regions in the premotor, primary motor, primary auditory, and primary sensory cortices in both hemispheres. The majority of connections in the subnetwork were weaker in the Broca group than the anomic group. The network properties of the subnetwork were examined through complex network measures, which indicated that the regions in the superior temporal gyrus and auditory cortex bilaterally exhibit intensive interaction, and primary motor, premotor and primary sensory cortices in the left hemisphere play an important role in information flow and overall communication efficiency. These findings underlied articulatory difficulties and reduced repetition performance in Broca aphasia, which are rarely observed in anomic aphasia. This research provides novel findings into the resting-state brain network differences between groups of individuals with anomic and Broca aphasia. We identified a subnetwork of, rather than isolated, connections that statistically differentiate the resting-state brain networks of the two groups, in comparison with standard lesion symptom mapping results that yield isolated connections.
How a simple chloroplast psbA gene mutation changed world agriculture
Authors: Jack Dekker
Date: 2023-02-07 00:00:00

Atrazine as a weed control tactic profoundly changed world agriculture. Long-term use revealed resistant biotypes, R, with a single base pair mutation of the chloroplast psbA gene. The R phenotype emerged from a sequential cascade of pleiotropic effects from the plastid to the whole plant. This reorganization of the R biotype revealed photosynthetic regulation at different levels of plant organization. The environment affected R plant productivity differently than in the susceptible, S, biotype. A consistent, differential, pattern of photosynthesis was observed between R and S over the diurnal light period. Photosynthetic superiority of a biotype was a function of the time of day, plant age temperature. Under highly favorable environmental conditions S often had the advantage over R. Under less favorable, stressful, conditions R can be at an advantage over S. Pleiotropic reorganization revealed a sun-air-leaf Shannon communication system, providing insights into the complex interaction of chloroplast components in photosynthetic regulation. Altered plastid thylakoid and stomatal function regulate how the R leaf utilizes the sun-air environment. Movement of sun-air messages demonstrated how sunlight and air are modified to a usable message for carbon fixation. These insights showed how agriculture changed weed populations, and how resistant weed populations changed agriculture. These changes changed herbicide resistance: introduction of herbicide resistant crops, HRC. The development of HRCs extended the evolutionary reach of R weeds. R weed biotypes were naturally selected in these introduced HRCs: an evolutionary spiral of human technology extended the phenotypic reach of R biotypes.
Temporal and probabilistic comparisons of epidemic interventions
Authors: Mariah C. Boudreau, Andrea J. Allen, Nicholas J. Roberts, Antoine Allard, Laurent Hébert-Dufresne
Date: 2023-02-07 00:00:00

Forecasting disease spread is a critical tool to help public health officials design and plan public health interventions.However, the expected future state of an epidemic is not necessarily well defined as disease spread is inherently stochastic, contact patterns within a population are heterogeneous, and behaviors change. In this work, we use time-dependent probability generating functions (PGFs) to capture these characteristics by modeling a stochastic branching process of the spread of a disease over a network of contacts in which public health interventions are introduced over time. To achieve this, we define a general transmissibility equation to account for varying transmission rates (e.g. masking), recovery rates (e.g. treatment), contact patterns (e.g. social distancing) and percentage of the population immunized (e.g. vaccination). The resulting framework allows for a temporal and probabilistic analysis of an intervention's impact on disease spread, which match continuous-time stochastic simulations that are much more computationally expensive.To aid policy making, we then define several metrics over which temporal and probabilistic intervention forecasts can be compared: Looking at the expected number of cases and the worst-case scenario over time, as well as the probability of reaching a critical level of cases and of not seeing any improvement following an intervention.Given that epidemics do not always follow their average expected trajectories and that the underlying dynamics can change over time, our work paves the way for more detailed short-term forecasts of disease spread and more informed comparison of intervention strategies.
NodeCoder: a graph-based machine learning platform to predict active sites of modeled protein structures
Authors: Nasim Abdollahi, Seyed Ali Madani Tonekaboni, Jay Huang, Bo wang, Stephen MacKinnon
Date: 2023-02-07 00:00:00

While accurate protein structure predictions are now available for nearly every observed protein sequence, predicted structures lack much of the functional context offered by experimental structure determination. We address this gap with NodeCoder, a task-independent platform that maps residue-based datasets onto 3D protein structures, embeds the resulting structural feature into a contact network, and models residue classification tasks with a Graph Convolutional Network (GCN). We demonstrate the versatility of this strategy by modeling six separate tasks, with some labels derived from other experimental structure studies (ligand, peptide, ion, and nucleic acid binding sites) and other labels derived from annotation databases (post-translational modification and transmembrane regions). Moreover, A NodeCoder model trained to identify ligand binding site residues was able to outperform P2Rank, a widely-used software developed specifically for ligand binding site detection. NodeCoder is available as an open-source python package at https://pypi.org/project/NodeCoder/.
PartitionVAE -- a human-interpretable VAE
Authors: Fareed Sheriff, Sameer Pai
Date: 2023-02-04 00:00:00
Tasks: GPU

VAEs, or variational autoencoders, are autoencoders that explicitly learn the distribution of the input image space rather than assuming no prior information about the distribution. This allows it to classify similar samples close to each other in the latent space's distribution. VAEs classically assume the latent space is normally distributed, though many distribution priors work, and they encode this assumption through a K-L divergence term in the loss function. While VAEs learn the distribution of the latent space and naturally make each dimension in the latent space as disjoint from the others as possible, they do not group together similar features -- the image space feature represented by one unit of the representation layer does not necessarily have high correlation with the feature represented by a neighboring unit of the representation layer. This makes it difficult to interpret VAEs since the representation layer is not structured in a way that is easy for humans to parse. We aim to make a more interpretable VAE by partitioning the representation layer into disjoint sets of units. Partitioning the representation layer into disjoint sets of interconnected units yields a prior that features of the input space to this new VAE, which we call a partition VAE or PVAE, are grouped together by correlation -- for example, if our image space were the space of all ping ping game images (a somewhat complex image space we use to test our architecture) then we would hope the partitions in the representation layer each learned some large feature of the image like the characteristics of the ping pong table or the characteristics and position of the players or the ball. We also add to the PVAE a cost-saving measure: subresolution. Because we do not have access to GPU training environments for long periods of time and Google Colab Pro costs money, we attempt to decrease the complexity of the PVAE by outputting an image with dimensions scaled down from the input image by a constant factor, thus forcing the model to output a smaller version of the image. We then increase the resolution to calculate loss and train by interpolating through neighboring pixels. We train a tuned PVAE on MNIST and Sports10 to test its effectiveness.
Exemplars and Counterexemplars Explanations for Image Classifiers, Targeting Skin Lesion Labeling
Authors: Carlo Metta, Riccardo Guidotti, Yuan Yin, Patrick Gallinari, Salvatore Rinzivillo
Date: 2023-01-18 00:00:00

Explainable AI consists in developing mechanisms allowing for an interaction between decision systems and humans by making the decisions of the formers understandable. This is particularly important in sensitive contexts like in the medical domain. We propose a use case study, for skin lesion diagnosis, illustrating how it is possible to provide the practitioner with explanations on the decisions of a state of the art deep neural network classifier trained to characterize skin lesions from examples. Our framework consists of a trained classifier onto which an explanation module operates. The latter is able to offer the practitioner exemplars and counterexemplars for the classification diagnosis thus allowing the physician to interact with the automatic diagnosis system. The exemplars are generated via an adversarial autoencoder. We illustrate the behavior of the system on representative examples.
Sparse Mixture Once-for-all Adversarial Training for Efficient In-Situ Trade-Off Between Accuracy and Robustness of DNNs
Authors: Souvik Kundu, Sairam Sundaresan, Sharath Nittur Sridhar, Shunlin Lu, Han Tang, Peter A. Beerel
Date: 2022-12-27 00:00:00
Tasks: All, image-classification, Image Classification

Existing deep neural networks (DNNs) that achieve state-of-the-art (SOTA) performance on both clean and adversarially-perturbed images rely on either activation or weight conditioned convolution operations. However, such conditional learning costs additional multiply-accumulate (MAC) or addition operations, increasing inference memory and compute costs. To that end, we present a sparse mixture once for all adversarial training (SMART), that allows a model to train once and then in-situ trade-off between accuracy and robustness, that too at a reduced compute and parameter overhead. In particular, SMART develops two expert paths, for clean and adversarial images, respectively, that are then conditionally trained via respective dedicated sets of binary sparsity masks. Extensive evaluations on multiple image classification datasets across different models show SMART to have up to 2.72x fewer non-zero parameters costing proportional reduction in compute overhead, while yielding SOTA accuracy-robustness trade-off. Additionally, we present insightful observations in designing sparse masks to successfully condition on both clean and perturbed images.
Gestalt-Guided Image Understanding for Few-Shot Learning
Authors: Kun Song, Yuchen Wu, Jiansheng Chen, Tianyu Hu, Huimin Ma
Date: 2023-02-08 00:00:00
Tasks: Few-Shot Learning

Due to the scarcity of available data, deep learning does not perform well on few-shot learning tasks. However, human can quickly learn the feature of a new category from very few samples. Nevertheless, previous work has rarely considered how to mimic human cognitive behavior and apply it to few-shot learning. This paper introduces Gestalt psychology to few-shot learning and proposes Gestalt-Guided Image Understanding, a plug-and-play method called GGIU. Referring to the principle of totality and the law of closure in Gestalt psychology, we design Totality-Guided Image Understanding and Closure-Guided Image Understanding to extract image features. After that, a feature estimation module is used to estimate the accurate features of images. Extensive experiments demonstrate that our method can improve the performance of existing models effectively and flexibly without retraining or fine-tuning. Our code is released on https://github.com/skingorz/GGIU.
Graph Signal Sampling for Inductive One-Bit Matrix Completion: a Closed-form Solution
Authors: Chao Chen, Haoyu Geng, Gang Zeng, Zhaobing Han, Hua Chai, Xiaokang Yang, Junchi Yan
Date: 2023-02-08 00:00:00
Tasks: Form, Matrix Completion, Recommendation Systems

Inductive one-bit matrix completion is motivated by modern applications such as recommender systems, where new users would appear at test stage with the ratings consisting of only ones and no zeros. We propose a unified graph signal sampling framework which enjoys the benefits of graph signal analysis and processing. The key idea is to transform each user's ratings on the items to a function (signal) on the vertices of an item-item graph, then learn structural graph properties to recover the function from its values on certain vertices -- the problem of graph signal sampling. We propose a class of regularization functionals that takes into account discrete random label noise in the graph vertex domain, then develop the GS-IMC approach which biases the reconstruction towards functions that vary little between adjacent vertices for noise reduction. Theoretical result shows that accurate reconstructions can be achieved under mild conditions. For the online setting, we develop a Bayesian extension, i.e., BGS-IMC which considers continuous random Gaussian noise in the graph Fourier domain and builds upon a prediction-correction update algorithm to obtain the unbiased and minimum-variance reconstruction. Both GS-IMC and BGS-IMC have closed-form solutions and thus are highly scalable in large data. Experiments show that our methods achieve state-of-the-art performance on public benchmarks.
Neural Artistic Style Transfer with Conditional Adversaria
Authors: P. N. Deelaka
Date: 2023-02-08 00:00:00
Tasks: Style Transfer

A neural artistic style transformation (NST) model can modify the appearance of a simple image by adding the style of a famous image. Even though the transformed images do not look precisely like artworks by the same artist of the respective style images, the generated images are appealing. Generally, a trained NST model specialises in a style, and a single image represents that style. However, generating an image under a new style is a tedious process, which includes full model training. In this paper, we present two methods that step toward the style image independent neural style transfer model. In other words, the trained model could generate semantically accurate generated image under any content, style image input pair. Our novel contribution is a unidirectional-GAN model that ensures the Cyclic consistency by the model architecture.Furthermore, this leads to much smaller model size and an efficient training and validation phase.
Geometric Perception based Efficient Text Recognition
Authors: P. N. Deelaka, D. R. Jayakodi, D. Y. Silva
Date: 2023-02-08 00:00:00
Tasks: Scene Text Recognition

Every Scene Text Recognition (STR) task consists of text localization \& text recognition as the prominent sub-tasks. However, in real-world applications with fixed camera positions such as equipment monitor reading, image-based data entry, and printed document data extraction, the underlying data tends to be regular scene text. Hence, in these tasks, the use of generic, bulky models comes up with significant disadvantages compared to customized, efficient models in terms of model deployability, data privacy \& model reliability. Therefore, this paper introduces the underlying concepts, theory, implementation, and experiment results to develop models, which are highly specialized for the task itself, to achieve not only the SOTA performance but also to have minimal model weights, shorter inference time, and high model reliability. We introduce a novel deep learning architecture (GeoTRNet), trained to identify digits in a regular scene image, only using the geometrical features present, mimicking human perception over text recognition. The code is publicly available at https://github.com/ACRA-FL/GeoTRNet
Diagnosing and Rectifying Vision Models using Language
Authors: Yuhui Zhang, Jeff Z. HaoChen, Shih-Cheng Huang, Kuan-Chieh Wang, James Zou, Serena Yeung
Date: 2023-02-08 00:00:00
Tasks: Contrastive Learning

Recent multi-modal contrastive learning models have demonstrated the ability to learn an embedding space suitable for building strong vision classifiers, by leveraging the rich information in large-scale image-caption datasets. Our work highlights a distinct advantage of this multi-modal embedding space: the ability to diagnose vision classifiers through natural language. The traditional process of diagnosing model behaviors in deployment settings involves labor-intensive data acquisition and annotation. Our proposed method can discover high-error data slices, identify influential attributes and further rectify undesirable model behaviors, without requiring any visual data. Through a combination of theoretical explanation and empirical verification, we present conditions under which classifiers trained on embeddings from one modality can be equivalently applied to embeddings from another modality. On a range of image datasets with known error slices, we demonstrate that our method can effectively identify the error slices and influential attributes, and can further use language to rectify failure modes of the classifier.
Computational Models of Solving Raven's Progressive Matrices: A Comprehensive Introduction
Authors: Yuan Yang, Mathilee Kunda
Date: 2023-02-08 00:00:00
Tasks: Philosophy

As being widely used to measure human intelligence, Raven's Progressive Matrices (RPM) tests also pose a great challenge for AI systems. There is a long line of computational models for solving RPM, starting from 1960s, either to understand the involved cognitive processes or solely for problem-solving purposes. Due to the dramatic paradigm shifts in AI researches, especially the advent of deep learning models in the last decade, the computational studies on RPM have also changed a lot. Therefore, now is a good time to look back at this long line of research. As the title -- ``a comprehensive introduction'' -- indicates, this paper provides an all-in-one presentation of computational models for solving RPM, including the history of RPM, intelligence testing theories behind RPM, item design and automatic item generation of RPM-like tasks, a conceptual chronicle of computational models for solving RPM, which reveals the philosophy behind the technology evolution of these models, and suggestions for transferring human intelligence testing and AI testing.
SkyEye: Self-Supervised Bird's-Eye-View Semantic Mapping Using Monocular Frontal View Images
Authors: Nikhil Gosala, Kürsat Petek, Paulo L. J. Drews-Jr, Wolfram Burgard, Abhinav Valada
Date: 2023-02-08 00:00:00
Proceeding: CVPR 2023 1
Tasks: Decision Making

Bird's-Eye-View (BEV) semantic maps have become an essential component of automated driving pipelines due to the rich representation they provide for decision-making tasks. However, existing approaches for generating these maps still follow a fully supervised training paradigm and hence rely on large amounts of annotated BEV data. In this work, we address this limitation by proposing the first self-supervised approach for generating a BEV semantic map using a single monocular image from the frontal view (FV). During training, we overcome the need for BEV ground truth annotations by leveraging the more easily available FV semantic annotations of video sequences. Thus, we propose the SkyEye architecture that learns based on two modes of self-supervision, namely, implicit supervision and explicit supervision. Implicit supervision trains the model by enforcing spatial consistency of the scene over time based on FV semantic sequences, while explicit supervision exploits BEV pseudolabels generated from FV semantic annotations and self-supervised depth estimates. Extensive evaluations on the KITTI-360 dataset demonstrate that our self-supervised approach performs on par with the state-of-the-art fully supervised methods and achieves competitive results using only 1% of direct supervision in the BEV compared to fully supervised approaches. Finally, we publicly release both our code and the BEV datasets generated from the KITTI-360 and Waymo datasets.
On the Computational Complexity of Ethics: Moral Tractability for Minds and Machines
Authors: Jakob Stenseke
Date: 2023-02-08 00:00:00
Tasks: Ethics

Why should moral philosophers, moral psychologists, and machine ethicists care about computational complexity? Debates on whether artificial intelligence (AI) can or should be used to solve problems in ethical domains have mainly been driven by what AI can or cannot do in terms of human capacities. In this paper, we tackle the problem from the other end by exploring what kind of moral machines are possible based on what computational systems can or cannot do. To do so, we analyze normative ethics through the lens of computational complexity. First, we introduce computational complexity for the uninitiated reader and discuss how the complexity of ethical problems can be framed within Marr's three levels of analysis. We then study a range of ethical problems based on consequentialism, deontology, and virtue ethics, with the aim of elucidating the complexity associated with the problems themselves (e.g., due to combinatorics, uncertainty, strategic dynamics), the computational methods employed (e.g., probability, logic, learning), and the available resources (e.g., time, knowledge, learning). The results indicate that most problems the normative frameworks pose lead to tractability issues in every category analyzed. Our investigation also provides several insights about the computational nature of normative ethics, including the differences between rule- and outcome-based moral strategies, and the implementation-variance with regard to moral resources. We then discuss the consequences complexity results have for the prospect of moral machines in virtue of the trade-off between optimality and efficiency. Finally, we elucidate how computational complexity can be used to inform both philosophical and cognitive-psychological research on human morality by advancing the Moral Tractability Thesis (MTT).