pwc-archive/papers-with-abstracts huggingface dataset:
A Facial Feature Discovery Framework for Race Classification Using Deep Learning
Authors: Khalil Khan, Jehad Ali, Irfan Uddin, Sahib Khan, Byeong-hee Roh
Date: 2021-03-29 00:00:00
Tasks: Classification, General Classification, Segmentation

Race classification is a long-standing challenge in the field of face image analysis. The investigation of salient facial features is an important task to avoid processing all face parts. Face segmentation strongly benefits several face analysis tasks, including ethnicity and race classification. We propose a raceclassification algorithm using a prior face segmentation framework. A deep convolutional neural network (DCNN) was used to construct a face segmentation model. For training the DCNN, we label face images according to seven different classes, that is, nose, skin, hair, eyes, brows, back, and mouth. The DCNN model developed in the first phase was used to create segmentation results. The probabilistic classification method is used, and probability maps (PMs) are created for each semantic class. We investigated five salient facial features from among seven that help in race classification. Features are extracted from the PMs of five classes, and a new model is trained based on the DCNN. We assessed the performance of the proposed race classification method on four standard face datasets, reporting superior results compared with previous studies.
Self Calibration of Scalar and Vector Sensor Arrays
Authors: Krishnaprasad Nambur Ramamohan, Sundeep Prabhakar Chepuri, Daniel Fernandez Comesana, Geert Leus
Date: 2021-04-06 00:00:00

In this work, we consider the problem of joint calibration and direction-of-arrival (DOA) estimation using sensor arrays. This joint estimation problem is referred to as self calibration. Unlike many previous iterative approaches, we propose geometry independent convex optimization algorithms for jointly estimating the sensor gain and phase errors as well as the source DOAs. We derive these algorithms based on both the conventional element-space data model and the covariance data model. We focus on sparse and regular arrays formed using scalar sensors as well as vector sensors. The developed algorithms are obtained by transforming the underlying bilinear calibration model into a linear model, and subsequently by using standard convex relaxation techniques to estimate the unknown parameters. Prior to the algorithm discussion, we also derive identifiability conditions for the existence of a unique solution to the self calibration problem. To demonstrate the effectiveness of the developed techniques, numerical experiments and comparisons to the state-of-the-art methods are provided. Finally, the results from an experiment that was performed in an anechoic chamber using an acoustic vector sensor array are presented to demonstrate the usefulness of the proposed self calibration techniques.
Low Complexity Joint Impairment Mitigation of I/Q Modulator and PA Using Neural Networks
Authors: Yibo Wu, Ulf Gustavsson, Alexandre Graell i Amat, Henk Wymeersch
Date: 2021-04-06 00:00:00

Neural networks (NNs) for multiple hardware impairments mitigation of a realistic direct conversion transmitter are impractical due to high computational complexity. We propose two methods to reduce complexity without significant performance penalty. We first propose a novel attention residual learning NN, referred to as attention residual real-valued time-delay neural network (ARDEN), where trainable neuron-wise shortcut connections between the input and output layers allow to keep the attention always active. Furthermore, we implement a NN pruning algorithm that gradually removes connections corresponding to minimal weight magnitudes in each layer. Simulation and experimental results show that ARDEN with pruning achieves better performance for compensating frequency-dependent quadrature imbalance and power amplifier nonlinearity than other NN-based and Volterra-based models, while requiring less or similar complexity.
Newton-Type Optimal Thresholding Algorithms for Sparse Optimization Problems
Authors: Nan Meng, Yun-Bin Zhao
Date: 2021-04-06 00:00:00
Tasks: Compressive Sensing, Vocal Bursts Type Prediction

Sparse signals can be possibly reconstructed by an algorithm which merges a traditional nonlinear optimization method and a certain thresholding technique. Different from existing thresholding methods, a novel thresholding technique referred to as the optimal $k$-thresholding was recently proposed by Zhao [SIAM J Optim, 30(1), pp. 31-55, 2020]. This technique simultaneously performs the minimization of an error metric for the problem and thresholding of the iterates generated by the classic gradient method. In this paper, we propose the so-called Newton-type optimal $k$-thresholding (NTOT) algorithm which is motivated by the appreciable performance of both Newton-type methods and the optimal $k$-thresholding technique for signal recovery. The guaranteed performance (including convergence) of the proposed algorithms are shown in terms of suitable choices of the algorithmic parameters and the restricted isometry property (RIP) of the sensing matrix which has been widely used in the analysis of compressive sensing algorithms. The simulation results based on synthetic signals indicate that the proposed algorithms are stable and efficient for signal recovery.
Using Molecular Embeddings in QSAR Modeling: Does it Make a Difference?
Authors: María Virginia Sabando, Ignacio Ponzoni, Evangelos E. Milios, Axel J. Soto
Date: 2021-03-20 00:00:00
Tasks: Drug Design, Drug Discovery

With the consolidation of deep learning in drug discovery, several novel algorithms for learning molecular representations have been proposed. Despite the interest of the community in developing new methods for learning molecular embeddings and their theoretical benefits, comparing molecular embeddings with each other and with traditional representations is not straightforward, which in turn hinders the process of choosing a suitable representation for QSAR modeling. A reason behind this issue is the difficulty of conducting a fair and thorough comparison of the different existing embedding approaches, which requires numerous experiments on various datasets and training scenarios. To close this gap, we reviewed the literature on methods for molecular embeddings and reproduced three unsupervised and two supervised molecular embedding techniques recently proposed in the literature. We compared these five methods concerning their performance in QSAR scenarios using different classification and regression datasets. We also compared these representations to traditional molecular representations, namely molecular descriptors and fingerprints. As opposed to the expected outcome, our experimental setup consisting of over 25,000 trained models and statistical tests revealed that the predictive performance using molecular embeddings did not significantly surpass that of traditional representations. While supervised embeddings yielded competitive results compared to those using traditional molecular representations, unsupervised embeddings tended to perform worse than traditional representations. Our results highlight the need for conducting a careful comparison and analysis of the different embedding techniques prior to using them in drug design tasks, and motivate a discussion about the potential of molecular embeddings in computer-aided drug design.
Exact Probability Landscapes of Stochastic Phenotype Switching in Feed-Forward Loops: Phase Diagrams of Multimodality
Authors: Anna Terebus, Farid Manuchehrfar, Youfang Cao, Jie Liang
Date: 2021-04-06 00:00:00

Feed-forward loops (FFLs) are among the most ubiquitously found motifs of reaction networks in nature. However, little is known about their stochastic behavior and the variety of network phenotypes they can exhibit. In this study, we provide full characterizations of the properties of stochastic multimodality of FFLs, and how switching between different network phenotypes are controlled. We have computed the exact steady state probability landscapes of all eight types of coherent and incoherent FFLs using the finite-butter ACME algorithm, and quantified the exact topological features of their high-dimensional probability landscapes using persistent homology. Through analysis of the degree of multimodality for each of a set of 10,812 probability landscapes, where each landscape resides over 10^5-10^6 microstates, we have constructed comprehensive phase diagrams of all relevant behavior of FFL multimodality over broad ranges of input and regulation intensities, as well as different regimes of promoter binding dynamics. Our results show that with slow binding and unbinding dynamics of transcription factor to promoter, FFLs exhibit strong stochastic behavior that is very different from what would be inferred from deterministic models. In addition, input intensity play major roles in the phenotypes of FFLs: At weak input intensity, FFL exhibit monomodality, but strong input intensity may result in up to 6 stable phenotypes. Furthermore, we found that gene duplication can enlarge stable regions of specific multimodalities and enrich the phenotypic diversity of FFL networks, providing means for cells towards better adaptation to changing environment. Our results are directly applicable to analysis of behavior of FFLs in biological processes such as stem cell differentiation and for design of synthetic networks when certain phenotypic behavior is desired.
Temporal patterns of synchrony in a pyramidal-interneuron gamma (PING) network
Authors: Quynh-Anh Nguyen, Leonid L Rubchinsky
Date: 2021-04-05 00:00:00
Tasks: Rhythm

Synchronization in neural system plays an important role in many brain functions. Synchronization in the gamma frequency band (30Hz-100Hz) is involved in a variety of cognitive phenomena; abnormalities of the gamma synchronization are found in schizophrenia and autism spectrum disorder. Frequently, the strength of synchronization is not very high and is intermittent even on short time scales (a few cycles of oscillations). That is, the network exhibits intervals of synchronization followed by intervals of desynchronization. Neural circuits dynamics may show different distributions of desynchronization durations even if the synchronization strength is fixed. In this study, we use a conductance-based neural network exhibiting pyramidal-interneuron (PING) gamma rhythm to study the temporal patterning of synchronized neural oscillations. We found that changes in the synaptic strength (as well as changes in the membrane kinetics) can alter the temporal patterning of synchrony. Moreover, we found that the changes in the temporal pattern of synchrony may be independent of the changes in the average synchrony strength. Even though the temporal patterning may vary, there is a tendency for dynamics with short (although potentially numerous) desynchronizations, similar to what was observed in experimental studies of neural activity synchronization in the brain. Recent studies suggested that the short desynchronizations dynamics may facilitate the formation and the break-up of transient neural assemblies. Thus, the results of this study suggest that changes of synaptic strength may alter the temporal patterning of the gamma synchronization as to make the neural networks more efficient in the formation of neural assemblies and the facilitation of cognitive phenomena.
Data-driven deep learning algorithms for time-varying infection rates of COVID-19 and mitigation measures
Authors: K. D. Olumoyin, A. Q. M. Khaliq, K. M. Furati
Date: 2021-04-05 00:00:00
Tasks: Epidemiology

Epidemiological models with constant parameters may not capture satisfactory infection patterns in the presence of pharmaceutical and non-pharmaceutical mitigation measures during a pandemic, since infectiousness is a function of time. In this paper, an Epidemiology-Informed Neural Network algorithm is introduced to learn the time-varying transmission rate for the COVID-19 pandemic in the presence of various mitigation scenarios. There are asymptomatic infectives, mostly unreported, and the proposed algorithm learns the proportion of the total infective individuals that are asymptomatic infectives. Using cumulative and daily reported cases of the symptomatic infectives, we simulate the impact of non-pharmaceutical mitigation measures such as early detection of infectives, contact tracing, and social distancing on the basic reproduction number. We demonstrate the effectiveness of vaccination on the transmission of COVID-19. The accuracy of the proposed algorithm is demonstrated using error metrics in the data-driven simulation for COVID-19 data of Italy, South Korea, the United Kingdom, and the United States.
A Machine Learning Model for Nowcasting Epidemic Incidence
Authors: Saumya Yashmohini Sahai, Saket Gurukar, Wasiur R. KhudaBukhsh, Srinivasan Parthasarathy, Grzegorz A. Rempala
Date: 2021-04-05 00:00:00
Tasks: BIG-bench Machine Learning

Due to delay in reporting, the daily national and statewide COVID-19 incidence counts are often unreliable and need to be estimated from recent data. This process is known in economics as nowcasting. We describe in this paper a simple random forest statistical model for nowcasting the COVID - 19 daily new infection counts based on historic data along with a set of simple covariates, such as the currently reported infection counts, day of the week, and time since first reporting. We apply the model to adjust the daily infection counts in Ohio, and show that the predictions from this simple data-driven method compare favorably both in quality and computational burden to those obtained from the state-of-the-art hierarchical Bayesian model employing a complex statistical algorithm.
Intraoperative time out to promote the implementation of the critical view of safety in laparoscopic cholecystectomy: a video-based assessment of 343 procedures
Authors: Pietro Mascagni, Maria Rita Rodriguez-Luna, Takeshi Urade, Emanuele Felli, Patrick Pessaux, Didier Mutter, Jacques Marescaux, Guido Costamagna, Bernard Dallemagne, Nicolas Padoy
Date: 2021-04-06 00:00:00

Background: The critical view of safety (CVS) is poorly adopted in surgical practices although it is ubiquitously recommended to prevent major bile duct injuries during laparoscopic cholecystectomy (LC). This study aims to determine whether performing a short intraoperative time out can improve CVS implementation. Methods: Surgeons performing LCs at an academic centre were invited to perform a 5-second long time out to verify CVS before dividing the cystic duct (5-second rule). The primary endpoint was to compare the rate of CVS achievement between LCs performed in the year before and the year after the 5-second rule. The CVS achievement rate was computed using the mediated video-based assessment of two independent reviewers. Clinical outcomes, LC workflows, and postoperative reports were also compared. Results: Three hundred and forty-three (171 before and 172 after the 5-second rule) of the 381 LCs performed over the 2-year study were analysed. After the implementation of the 5-second rule, the rate of CVS achievement increased significantly (15.9 vs 44.1 %; P<0.001) as well as the rate of bailout procedures (8.2 vs 15.7 %; P=0.045), the median time to clip the cystic duct or artery (17:26 [interquartile range: 16:46] vs 23:12 [17:16] minutes; P=0.007), and the rate of postoperative CVS reporting (1.3 vs 28.8 %; P<0.001). Morbidity was comparable (1.75 vs 2.33 % before and after the 5-second rule respectively; P=0.685). Conclusion: Performing a short intraoperative time out improves CVS implementation during LC. Systematic intraoperative cognitive aids should be studied to sustain the uptake of guidelines.
Pricing without no-arbitrage condition in discrete time
Authors: Laurence Carassus, Emmanuel Lépinette
Date: 2021-04-06 00:00:00

In a discrete time setting, we study the central problem of giving a fair price to some financial product. For several decades, the no-arbitrage conditions and the martingale measures have played a major role for solving this problem. We propose a new approach for estimating the super-replication cost based on convex duality instead of martingale measures duality: The prices are expressed using Fenchel conjugate and bi-conjugate without using any no-arbitrage condition.The super-hedging problem resolution leads endogenously to a weak no-arbitrage condition called Absence of Instantaneous Profit (AIP) under which prices are finite. We study this condition in details, propose several characterizations and compare it to the no-arbitrage condition.
Merton Investment Problems in Finance and Insurance for the Hawkes-based Models
Authors: Anatoliy Swishchuk
Date: 2021-04-06 00:00:00

We show how to solve Merton optimal investment stochastic control problem for Hawkes-based models in finance and insurance, i.e., for a wealth portfolio X(t) consisting of a bond and a stock price described by general compound Hawkes process (GCHP), and for a capital R(t) of an insurance company with the amount of claims described by the risk model based on GCHP. The novelty of the results consists of the new Hawkes-based models and in the new optimal investment results in finance and insurance for those models.
On the Robustness of Vision Transformers to Adversarial Examples
Authors: Kaleel Mahmood, Rigel Mahmood, Marten van Dijk
Date: 2021-03-31 00:00:00
Proceeding: ICCV 2021 10
Tasks: image-classification, Image Classification

Recent advances in attention-based networks have shown that Vision Transformers can achieve state-of-the-art or near state-of-the-art results on many image classification tasks. This puts transformers in the unique position of being a promising alternative to traditional convolutional neural networks (CNNs). While CNNs have been carefully studied with respect to adversarial attacks, the same cannot be said of Vision Transformers. In this paper, we study the robustness of Vision Transformers to adversarial examples. Our analyses of transformer security is divided into three parts. First, we test the transformer under standard white-box and black-box attacks. Second, we study the transferability of adversarial examples between CNNs and transformers. We show that adversarial examples do not readily transfer between CNNs and transformers. Based on this finding, we analyze the security of a simple ensemble defense of CNNs and transformers. By creating a new attack, the self-attention blended gradient attack, we show that such an ensemble is not secure under a white-box adversary. However, under a black-box adversary, we show that an ensemble can achieve unprecedented robustness without sacrificing clean accuracy. Our analysis for this work is done using six types of white-box attacks and two types of black-box attacks. Our study encompasses multiple Vision Transformers, Big Transfer Models and CNN architectures trained on CIFAR-10, CIFAR-100 and ImageNet.
Pathological Image Segmentation with Noisy Labels
Authors: Li Xiao, Yinhao Li, Luxi Qv, Xinxia Tian, Yijie Peng, S. Kevin Zhou
Date: 2021-03-20 00:00:00
Tasks: Image Segmentation, Segmentation, Semantic Segmentation

Segmentation of pathological images is essential for accurate disease diagnosis. The quality of manual labels plays a critical role in segmentation accuracy; yet, in practice, the labels between pathologists could be inconsistent, thus confusing the training process. In this work, we propose a novel label re-weighting framework to account for the reliability of different experts' labels on each pixel according to its surrounding features. We further devise a new attention heatmap, which takes roughness as prior knowledge to guide the model to focus on important regions. Our approach is evaluated on the public Gleason 2019 datasets. The results show that our approach effectively improves the model's robustness against noisy labels and outperforms state-of-the-art approaches.
Depth Evaluation for Metal Surface Defects by Eddy Current Testing using Deep Residual Convolutional Neural Networks
Authors: Tian Meng, Yang Tao, Ziqi Chen, Jorge R. Salas Avila, Qiaoye Ran, Yuchun Shao, Ruochen Huang, Yuedong Xie, Qian Zhao, Zhijie Zhang, Hujun Yin, Anthony J. Peyton, Wuliang Yin
Date: 2021-03-08 00:00:00
Tasks: Time Series, Time Series Analysis, Time Series Classification

Eddy current testing (ECT) is an effective technique in the evaluation of the depth of metal surface defects. However, in practice, the evaluation primarily relies on the experience of an operator and is often carried out by manual inspection. In this paper, we address the challenges of automatic depth evaluation of metal surface defects by virtual of state-of-the-art deep learning (DL) techniques. The main contributions are three-fold. Firstly, a highly-integrated portable ECT device is developed, which takes advantage of an advanced field programmable gate array (Zynq-7020 system on chip) and provides fast data acquisition and in-phase/quadrature demodulation. Secondly, a dataset, termed as MDDECT, is constructed using the ECT device by human operators and made openly available. It contains 48,000 scans from 18 defects of different depths and lift-offs. Thirdly, the depth evaluation problem is formulated as a time series classification problem, and various state-of-the-art 1-d residual convolutional neural networks are trained and evaluated on the MDDECT dataset. A 38-layer 1-d ResNeXt achieves an accuracy of 93.58% in discriminating the surface defects in a stainless steel sheet. The depths of the defects vary from 0.3 mm to 2.0 mm in a resolution of 0.1 mm. In addition, results show that the trained ResNeXt1D-38 model is immune to lift-off signals.
Learning from Noisy Labels via Dynamic Loss Thresholding
Authors: Hao Yang, Youzhi Jin, Ziyin Li, Deng-Bao Wang, Lei Miao, Xin Geng, Min-Ling Zhang
Date: 2021-04-01 00:00:00

Numerous researches have proved that deep neural networks (DNNs) can fit everything in the end even given data with noisy labels, and result in poor generalization performance. However, recent studies suggest that DNNs tend to gradually memorize the data, moving from correct data to mislabeled data. Inspired by this finding, we propose a novel method named Dynamic Loss Thresholding (DLT). During the training process, DLT records the loss value of each sample and calculates dynamic loss thresholds. Specifically, DLT compares the loss value of each sample with the current loss threshold. Samples with smaller losses can be considered as clean samples with higher probability and vice versa. Then, DLT discards the potentially corrupted labels and further leverages supervised learning techniques. Experiments on CIFAR-10/100 and Clothing1M demonstrate substantial improvements over recent state-of-the-art methods. In addition, we investigate two real-world problems for the first time. Firstly, we propose a novel approach to estimate the noise rates of datasets based on the loss difference between the early and late training stages of DNNs. Secondly, we explore the effect of hard samples (which are difficult to be distinguished) on the process of learning from noisy labels.