pwc-archive/papers-with-abstracts huggingface dataset:
Covariance regression with random forests
Authors: Cansu Alakus, Denis Larocque, Aurelie Labbe
Date: 2022-09-16 00:00:00
Tasks: Epidemiology, regression

Capturing the conditional covariances or correlations among the elements of a multivariate response vector based on covariates is important to various fields including neuroscience, epidemiology and biomedicine. We propose a new method called Covariance Regression with Random Forests (CovRegRF) to estimate the covariance matrix of a multivariate response given a set of covariates, using a random forest framework. Random forest trees are built with a splitting rule specially designed to maximize the difference between the sample covariance matrix estimates of the child nodes. We also propose a significance test for the partial effect of a subset of covariates. We evaluate the performance of the proposed method and significance test through a simulation study which shows that the proposed method provides accurate covariance matrix estimates and that the Type-1 error is well controlled. An application of the proposed method to thyroid disease data is also presented. CovRegRF is implemented in a freely available R package on CRAN.
Sparse high-dimensional linear regression with a partitioned empirical Bayes ECM algorithm
Authors: Alexander C. McLain, Anja Zgodic, Howard Bondell
Date: 2022-09-16 00:00:00
Tasks: Prediction Intervals, regression, Variable Selection

Bayesian variable selection methods are powerful techniques for fitting and inferring on sparse high-dimensional linear regression models. However, many are computationally intensive or require restrictive prior distributions on model parameters. In this paper, we proposed a computationally efficient and powerful Bayesian approach for sparse high-dimensional linear regression. Minimal prior assumptions on the parameters are required through the use of plug-in empirical Bayes estimates of hyperparameters. Efficient maximum a posteriori (MAP) estimation is completed through a Parameter-Expanded Expectation-Conditional-Maximization (PX-ECM) algorithm. The PX-ECM results in a robust computationally efficient coordinate-wise optimization which -- when updating the coefficient for a particular predictor -- adjusts for the impact of other predictor variables. The completion of the E-step uses an approach motivated by the popular two-group approach to multiple testing. The result is a PaRtitiOned empirical Bayes Ecm (PROBE) algorithm applied to sparse high-dimensional linear regression, which can be completed using one-at-a-time or all-at-once type optimization. We compare the empirical properties of PROBE to comparable approaches with numerous simulation studies and analyses of cancer cell drug responses. The proposed approach is implemented in the R package probe.
Duration modeling with semi-Markov Conditional Random Fields for keyphrase extraction
Authors: Xiaolei Lu, Tommy W. S. Chow
Date: 2022-09-19 00:00:00
Tasks: Keyphrase Extraction, Sentence

Existing methods for keyphrase extraction need preprocessing to generate candidate phrase or post-processing to transform keyword into keyphrase. In this paper, we propose a novel approach called duration modeling with semi-Markov Conditional Random Fields (DM-SMCRFs) for keyphrase extraction. First of all, based on the property of semi-Markov chain, DM-SMCRFs can encode segment-level features and sequentially classify the phrase in the sentence as keyphrase or non-keyphrase. Second, by assuming the independence between state transition and state duration, DM-SMCRFs model the distribution of duration (length) of keyphrases to further explore state duration information, which can help identify the size of keyphrase. Based on the convexity of parametric duration feature derived from duration distribution, a constrained Viterbi algorithm is derived to improve the performance of decoding in DM-SMCRFs. We thoroughly evaluate the performance of DM-SMCRFs on the datasets from various domains. The experimental results demonstrate the effectiveness of proposed model.
Reweighting Clicks with Dwell Time in Recommendation
Authors: Ruobing Xie, Lin Ma, Shaoliang Zhang, Feng Xia, Leyu Lin
Date: 2022-09-19 00:00:00
Tasks: valid

The click behavior is the most widely-used user positive feedback in recommendation. However, simply considering each click equally in training may suffer from clickbaits and title-content mismatching, and thus fail to precisely capture users' real satisfaction on items. Dwell time could be viewed as a high-quality quantitative indicator of user preferences on each click, while existing recommendation models do not fully explore the modeling of dwell time. In this work, we focus on reweighting clicks with dwell time in recommendation. Precisely, we first define a new behavior named valid read, which helps to select high-quality click instances for different users and items via dwell time. Next, we propose a normalized dwell time function to reweight click signals in training for recommendation. The Click reweighting model achieves significant improvements on both offline and online evaluations in real-world systems.
Mutual Harmony: Sequential Recommendation with Dual Contrastive Network
Authors: GuanYu Lin, Chen Gao, Yinfeng Li, Yu Zheng, Zhiheng Li, Depeng Jin, Dong Li, Jianye Hao, Yong Li
Date: 2022-09-18 00:00:00
Tasks: Contrastive Learning, Representation Learning, Sequential Recommendation

With the outbreak of today's streaming data, the sequential recommendation is a promising solution to achieve time-aware personalized modeling. It aims to infer the next interacted item of a given user based on the historical item sequence. Some recent works tend to improve the sequential recommendation via random masking on the historical item so as to generate self-supervised signals. But such approaches will indeed result in sparser item sequence and unreliable signals. Besides, the existing sequential recommendation models are only user-centric, i.e., based on the historical items by chronological order to predict the probability of candidate items, which ignores whether the items from a provider can be successfully recommended. Such user-centric recommendation will make it impossible for the provider to expose their new items, failing to consider the accordant interactions between user and item dimensions. In this paper, we propose a novel Dual Contrastive Network (DCN) to achieve mutual harmony between user and item provider, generating ground-truth self-supervised signals for sequential recommendation by auxiliary user-sequence from an item-centric dimension. Specifically, we propose dual representation contrastive learning to refine the representation learning by minimizing the Euclidean distance between the representations of a given user/item and historical items/users of them. Before the second contrastive learning module, we perform the next user prediction to capture the trends of items preferred by certain types of users and provide personalized exploration opportunities for item providers. Finally, we further propose dual interest contrastive learning to self-supervise the dynamic interest from the next item/user prediction and static interest of matching probability. Experiments on four benchmark datasets verify the effectiveness of our proposed method.
Beware of the Ostrich Policy: End-Users' Perceptions Towards Data Transparency and Control
Authors: Sruthi Viswanathan
Date: 2022-09-17 00:00:00
Tasks: Management, Recommendation Systems

End users' awareness about the data they share, the purpose of sharing that data, and their control over it, is key to establishing trust and eradicating privacy concerns. We experimented on personal data management by prototyping a Point-of-Interest recommender system in which data collected on the user can be viewed, edited, deleted, and shared via elements in the User Interface. Based on our qualitative findings, in this paper we discuss "The ostrich policy" adopted by end users who do not want to manage their personal data. We sound a waking whistle to design and model for personal data management by understanding end users' perceptions towards data transparency and control.
How can voting mechanisms improve the robustness and generalizability of toponym disambiguation?
Authors: Xuke Hu, Yeran Sun, Jens Kersten, Zhiyong Zhou, Friederike Klan, Hongchao Fan
Date: 2022-09-17 00:00:00
Tasks: Articles, Entity Linking, Toponym Recognition, Toponym Resolution

A vast amount of geographic information exists in natural language texts, such as tweets and news. Extracting geographic information from texts is called Geoparsing, which includes two subtasks: toponym recognition and toponym disambiguation, i.e., to identify the geospatial representations of toponyms. This paper focuses on toponym disambiguation, which is usually approached by toponym resolution and entity linking. Recently, many novel approaches have been proposed, especially deep learning-based approaches, such as CamCoder, GENRE, and BLINK. In this paper, a spatial clustering-based voting approach that combines several individual approaches is proposed to improve SOTA performance in terms of robustness and generalizability. Experiments are conducted to compare a voting ensemble with 20 latest and commonly-used approaches based on 12 public datasets, including several highly ambiguous and challenging datasets (e.g., WikToR and CLDW). The datasets are of six types: tweets, historical documents, news, web pages, scientific articles, and Wikipedia articles, containing in total 98,300 places across the world. The results show that the voting ensemble performs the best on all the datasets, achieving an average Accuracy@161km of 0.86, proving the generalizability and robustness of the voting approach. Also, the voting ensemble drastically improves the performance of resolving fine-grained places, i.e., POIs, natural features, and traffic ways.
Intrinsically Motivated Reinforcement Learning based Recommendation with Counterfactual Data Augmentation
Authors: Xiaocong Chen, Siyu Wang, Lina Yao, Lianyong Qi, Yong Li
Date: 2022-09-17 00:00:00
Tasks: counterfactual, Data Augmentation, Deep Reinforcement Learning, Recommendation Systems, reinforcement-learning, Reinforcement Learning, Reinforcement Learning (RL)

Deep reinforcement learning (DRL) has been proven its efficiency in capturing users' dynamic interests in recent literature. However, training a DRL agent is challenging, because of the sparse environment in recommender systems (RS), DRL agents could spend times either exploring informative user-item interaction trajectories or using existing trajectories for policy learning. It is also known as the exploration and exploitation trade-off which affects the recommendation performance significantly when the environment is sparse. It is more challenging to balance the exploration and exploitation in DRL RS where RS agent need to deeply explore the informative trajectories and exploit them efficiently in the context of recommender systems. As a step to address this issue, We design a novel intrinsically ,otivated reinforcement learning method to increase the capability of exploring informative interaction trajectories in the sparse environment, which are further enriched via a counterfactual augmentation strategy for more efficient exploitation. The extensive experiments on six offline datasets and three online simulation platforms demonstrate the superiority of our model to a set of existing state-of-the-art methods.
OCR for TIFF Compressed Document Images Directly in Compressed Domain Using Text segmentation and Hidden Markov Model
Authors: Dikshit Sharma, Mohammed Javed
Date: 2022-09-13 00:00:00
Tasks: Optical Character Recognition (OCR), Text Segmentation

In today's technological era, document images play an important and integral part in our day to day life, and specifically with the surge of Covid-19, digitally scanned documents have become key source of communication, thus avoiding any sort of infection through physical contact. Storage and transmission of scanned document images is a very memory intensive task, hence compression techniques are being used to reduce the image size before archival and transmission. To extract information or to operate on the compressed images, we have two ways of doing it. The first way is to decompress the image and operate on it and subsequently compress it again for the efficiency of storage and transmission. The other way is to use the characteristics of the underlying compression algorithm to directly process the images in their compressed form without involving decompression and re-compression. In this paper, we propose a novel idea of developing an OCR for CCITT (The International Telegraph and Telephone Consultative Committee) compressed machine printed TIFF document images directly in the compressed domain. After segmenting text regions into lines and words, HMM is applied for recognition using three coding modes of CCITT- horizontal, vertical and the pass mode. Experimental results show that OCR on pass modes give a promising results.
Safe reinforcement learning control for continuous-time nonlinear systems without a backup controller
Authors: Soutrik Bandyopadhyay, Shubhendu Bhasin
Date: 2022-09-19 00:00:00
Tasks: reinforcement-learning, Reinforcement Learning (RL), Safe Reinforcement Learning

This paper proposes an on-policy reinforcement learning (RL) control algorithm that solves the optimal regulation problem for a class of uncertain continuous-time nonlinear systems under user-defined state constraints. We formulate the safe RL problem as the minimization of the Hamiltonian subject to a constraint on the time-derivative of a barrier Lyapunov function (BLF). We subsequently use the analytical solution of the optimization problem to modify the Actor-Critic-Identifier architecture to learn the optimal control policy safely. The proposed method does not require the presence of external backup controllers, and the RL policy ensures safety for the entire duration. The efficacy of the proposed controller is demonstrated on a class of Euler-Lagrange systems.
Exploiting Nanoelectronic Properties of Memory Chips for Prevention of IC Counterfeiting
Authors: Supriya Chakraborty Tamoghno Das, Manan Suri
Date: 2022-09-09 00:00:00

This study presents a methodology for anticounterfeiting of Non-Volatile Memory (NVM) chips. In particular, we experimentally demonstrate a generalized methodology for detecting (i) Integrated Circuit (IC) origin, (ii) recycled or used NVM chips, and (iii) identification of used locations (addresses) in the chip. Our proposed methodology inspects latency and variability signatures of Commercial-Off-The-Shelf (COTS) NVM chips. The proposed technique requires low-cycle (~100) pre-conditioning and utilizes Machine Learning (ML) algorithms. We observe different trends in evolution of latency (sector erase or page write) with cycling on different NVM technologies from different vendors. ML assisted approach is utilized for detecting IC manufacturers with 95.1 % accuracy obtained on prepared test dataset consisting of 3 different NVM technologies including 6 different manufacturers (9 types of chips).
Multidimensional Economic Complexity and Inclusive Green Growth
Authors: Viktor Stojkoski, Philipp Koch, César A. Hidalgo
Date: 2022-09-17 00:00:00

To achieve inclusive green growth, countries need to consider a multiplicity of economic, social, and environmental factors. These are often captured by metrics of economic complexity derived from the geography of trade, thus missing key information on innovative activities. To bridge this gap, we combine trade data with data on patent applications and research publications to build models that significantly and robustly improve the ability of economic complexity metrics to explain international variations in inclusive green growth. We show that measures of complexity built on trade and patent data combine to explain future economic growth and income inequality and that countries that score high in all three metrics tend to exhibit lower emission intensities. These findings illustrate how the geography of trade, technology, and research combine to explain inclusive green growth.
Crowdsourced-based Deep Convolutional Networks for Urban Flood Depth Mapping
Authors: Bahareh Alizadeh, Amir H. Behzadan
Date: 2022-09-06 00:00:00

Successful flood recovery and evacuation require access to reliable flood depth information. Most existing flood mapping tools do not provide real-time flood maps of inundated streets in and around residential areas. In this paper, a deep convolutional network is used to determine flood depth with high spatial resolution by analyzing crowdsourced images of submerged traffic signs. Testing the model on photos from a recent flood in the U.S. and Canada yields a mean absolute error of 6.978 in., which is on par with previous studies, thus demonstrating the applicability of this approach to low-cost, accurate, and real-time flood risk mapping.
Adaptive Attitude Control for Foldable Quadrotors
Authors: Karishma Patnaik, Wenlong Zhang
Date: 2022-09-18 00:00:00

Recent quadrotors have transcended conventional designs, emphasizing more on foldable and reconfigurable bodies. The state of the art still focuses on the mechanical feasibility of such designs with limited discussions on the tracking performance of the vehicle during configuration switching. In this article, we first present a common framework to analyse the attitude errors of a folding quadrotor via the theory of switched systems. We then employ this framework to investigate the attitude tracking performance for two case scenarios - one with a conventional geometric controller for precisely known system dynamics; and second, with our proposed morphology-aware adaptive controller that accounts for any modeling uncertainties and disturbances. Finally, we cater to the desired switching requirements from our stability analysis by exploiting the trajectory planner to obtain superior tracking performance while switching. Simulation results are presented that validate the proposed control and planning framework for a foldable quadrotor's flight through a passageway.
Representation Learning Strategies to Model Pathological Speech: Effect of Multiple Spectral Resolutions
Authors: Gabriel Figueiredo Miller, Juan Camilo Vásquez-Correa, Juan Rafael Orozco-Arroyave, Elmar Nöth
Date: 2022-09-17 00:00:00
Tasks: Representation Learning

This paper considers a representation learning strategy to model speech signals from patients with Parkinson's disease and cleft lip and palate. In particular, it compares different parametrized representation types such as wideband and narrowband spectrograms, and wavelet-based scalograms, with the goal of quantifying the representation capacity of each. Methods for quantification include the ability of the proposed model to classify different pathologies and the associated disease severity. Additionally, this paper proposes a novel fusion strategy called multi-spectral fusion that combines wideband and narrowband spectral resolutions using a representation learning strategy based on autoencoders. The proposed models are able to classify the speech from Parkinson's disease patients with accuracy up to 95\%. The proposed models were also able to asses the dysarthria severity of Parkinson's disease patients with a Spearman correlation up to 0.75. These results outperform those observed in literature where the same problem was addressed with the same corpus.
Detecting Political Biases of Named Entities and Hashtags on Twitter
Authors: Zhiping Xiao, Jeffrey Zhu, Yining Wang, Pei Zhou, Wen Hong Lam, Mason A. Porter, Yizhou Sun
Date: 2022-09-16 00:00:00
Tasks: Multi-Task Learning, Task 2

Ideological divisions in the United States have become increasingly prominent in daily communication. Accordingly, there has been much research on political polarization, including many recent efforts that take a computational perspective. By detecting political biases in a corpus of text, one can attempt to describe and discern the polarity of that text. Intuitively, the named entities (i.e., the nouns and the phrases that act as nouns) and hashtags in text often carry information about political views. For example, people who use the term "pro-choice" are likely to be liberal, whereas people who use the term "pro-life" are likely to be conservative. In this paper, we seek to reveal political polarities in social-media text data and to quantify these polarities by explicitly assigning a polarity score to entities and hashtags. Although this idea is straightforward, it is difficult to perform such inference in a trustworthy quantitative way. Key challenges include the small number of known labels, the continuous spectrum of political views, and the preservation of both a polarity score and a polarity-neutral semantic meaning in an embedding vector of words. To attempt to overcome these challenges, we propose the Polarity-aware Embedding Multi-task learning (PEM) model. This model consists of (1) a self-supervised context-preservation task, (2) an attention-based tweet-level polarity-inference task, and (3) an adversarial learning task that promotes independence between an embedding's polarity dimension and its semantic dimensions. Our experimental results demonstrate that our PEM model can successfully learn polarity-aware embeddings that perform well classification tasks. We examine a variety of applications and we thereby demonstrate the effectiveness of our PEM model. We also discuss important limitations of our work and encourage caution when applying the it to real-world scenarios.
Modified PSO based PID Sliding Mode Control using Improved Reaching Law for Nonlinear systems
Authors: Kirtiman Singh, Prabin Kumar Padhy
Date: 2022-09-19 00:00:00

In this paper, a new model based nonlinear control technique, called PID (Proportional-Integral-Derivative) type sliding surface based sliding mode control is designed using improved reaching law. To improve the performance of the second order nonlinear differential equations with unknown parameters modified particle swarm intelligent optimization (MPSO) is used for the optimized parameters. This paper throws light on the sliding surface design, on the proposed power rate exponential reaching law, parameters optimization using modified particle swarm optimization and highlights the important features of adding an integral term in the sliding mode such as robustness and higher convergence, through extensive mathematical modeling. Siding mode control law is derived using Lyapunov stability approach and its asymptotic stability is proved mathematically and simulations showing its validity. MPSO PID-type Sliding mode control will stabilize the highly nonlinear systems, will compensate disturbances and uncertainty and reduces tracking errors. Simulations and experimental application is done on the non-linear systems and are presented to make a quantitative comparison.