Miracle-dz/UniFAR-FTUs huggingface dataset:
EPIC30M: An Epidemics Corpus of Over 30 Million Relevant Tweets

Since the start of COVID-19, there has been several relevant corpora from various sources that were released to support research in this area. While these corpora are valuable in supporting analysis for this specific pandemic, researchers will benefit from additional benchmark corpora that contain other epidemics for better generalizability and to facilitate cross-epidemic pattern recognition and trend analysis tasks. During our research, we discover little disease related corpora in the literature that are sizable and rich enough to support such cross-epidemic analysis tasks. To address this issue, we present EPIC30M, a large-scale epidemic corpus that contains more than 30 million micro-blog posts, i.e., tweets crawled from Twitter, from year 2006 to 2020. EPIC30M contains a subset of 26.2 million tweets related to three general diseases, namely Ebola, Cholera and Swine Flu, and another subset of 4.7 million tweets of six global epidemic outbreaks, including the 2009 H1N1 Swine Flu, 2010 Haiti Cholera, 2012 Middle-East Respiratory Syndrome (MERS), 2013 West African Ebola, 2016 Yemen Cholera and 2018 Kivu Ebola. Furthermore, we explore and discuss the properties of this corpus with statistics of key terms and hashtags and trends analysis for each subset. Finally, we discuss the potential value and impact that EPIC30M could generate through a discussion of multiple use cases of cross-epidemic research topics that attract growing interest in recent years. These use cases span multiple research areas, such as epidemiological modeling, pattern recognition, natural language understanding and economical modeling. The corpus is publicly available at https://www.github. com/junhua/epic.
Mining Student Responses to Infer Student Satisfaction Predictors

The identification and analysis of student satisfaction is a challenging issue. This is becoming increasingly important since a measure of student satisfaction is taken as an indication of how well a course has been taught. However, it remains a challenging problem as student satisfaction has various aspects. In this paper, we formulate the student satisfaction estimation as a prediction problem where we predict different levels of student satisfaction and infer the influential predictors related to course and instructor. We present five different aspects of student satisfaction in terms of 1) course content, 2) class participation, 3) achievement of initial expectations about the course, 4) relevancy towards professional development, and 5) if the course connects them and helps to explore the real-world situations. We employ state-of-the-art machine learning techniques to predict each of these aspects of student satisfaction levels. For our experiment, we utilize a large student evaluation dataset which includes student perception using different attributes related to courses and the instructors. Our experimental results and comprehensive analysis reveal that student satisfaction is more influenced by course attributes in comparison to instructor related attributes.
Robust Federated Recommendation System

Federated recommendation systems can provide good performance without collecting users' private data, making them attractive. However, they are susceptible to low-cost poisoning attacks that can degrade their performance. In this paper, we develop a novel federated recommendation technique that is robust against the poisoning attack where Byzantine clients prevail. We argue that the key to Byzantine detection is monitoring of gradients of the model parameters of clients. We then propose a robust learning strategy where instead of using model parameters, the central server computes and utilizes the gradients to filter out Byzantine clients. Theoretically, we justify our robust learning strategy by our proposed definition of Byzantine resilience. Empirically, we confirm the efficacy of our robust learning strategy employing four datasets in a federated recommendation system.
Towards Optimal Convergence Rate in Decentralized Stochastic Training

Parallel training with decentralized communication is a promising method of scaling up machine learning systems. In this paper, we provide a tight lower bound on the iteration complexity for such methods in a stochastic non-convex setting. This lower bound reveals a theoretical gap in known convergence rates of many existing algorithms. To show this bound is tight and achievable, we propose DeFacto, a class of algorithms that converge at the optimal rate without additional theoretical assumptions. We discuss the trade-offs among different algorithms regarding complexity, memory efficiency, throughput, etc. Empirically, we compare DeFacto and other decentralized algorithms via training Resnet20 on CIFAR10 and Resnet110 on CIFAR100. We show DeFacto can accelerate training with respect to wall-clock time but progresses slowly in the first few epochs.
Vehicle Redistribution in Ride-Sourcing Markets Using Convex Minimum Cost Flows

Ride-sourcing platforms often face imbalances in the demand and supply of rides across areas in their operating road-networks. As such, dynamic pricing methods have been used to mediate these demand asymmetries through surge price multipliers, thus incentivising higher driver participation in the market. However, the anticipated commercialisation of autonomous vehicles could transform the current ride-sourcing platforms to fleet operators. The absence of human drivers fosters the need for empty vehicle management to address any vehicle supply deficiencies. Proactive redistribution using integer programming and demand predictive models have been proposed in research to address this problem. A shortcoming of existing models, however, is that they ignore the market structure and underlying customer choice behaviour. As such, current models do not capture the real value of redistribution. To resolve this, we formulate the vehicle redistribution problem as a non-linear minimum cost flow problem which accounts for the relationship of supply and demand of rides, by assuming a customer discrete choice model and a market structure. We demonstrate that this model can have a convex domain, and we introduce an edge splitting algorithm to solve a transformed convex minimum cost flow problem for vehicle redistribution. By testing our model using simulation, we show that our redistribution algorithm can decrease wait times by more than 50%, increase profit up to 10% with less than 20% increase in vehicle mileage. Our findings outline that the value of redistribution is contingent on localised market structure and customer behaviour.
Searching for the Shortest Path to the Point of Voltage Collapse on the Algebraic Manifold

Voltage instability is one of the main causes of power system blackouts. Emerging technologies such as renewable energy integration, distributed energy resources and demand responses may introduce significant uncertainties in analyzing of system-wide voltage stability. This paper starts with summarizing different known voltage instability mechanisms, and then focuses on a class of voltage instability which is induced by the singular surface of the algebraic manifold. We argue and demonstrate that this class can include both dynamic and static voltage instabilities. To determine the minimum distance to the point of voltage collapse, a new formulation is proposed on the algebraic manifold. This formulation is further converted into an optimal control framework for identifying the path with minimum distance on the manifold. Comprehensive numerical studies are conducted on some manifolds of different power system test cases and demonstrate that the proposed method yields candidates for the local shortest paths to the singular surface on the manifold for both the dynamic model and the static model. Simulations show that the proposed method can identify shorter paths on the manifold than the paths associated with the minimum Euclidean distances. Furthermore, the proposed method always locates the right path ending at the correct singular surface which is responsible for the voltage instability; while the Euclidean distance formulation can mistakenly find solutions on the wrong singular surface. A broad range of potential applications using the proposed method are also discussed.
Explaining Predictions by Approximating the Local Decision Boundary

Constructing accurate model-agnostic explanations for opaque machine learning models remains a challenging task. Classification models for high-dimensional data, like images, are often complex and highly parameterized. To reduce this complexity, various authors attempt to explain individual predictions locally, either in terms of a simpler local surrogate model or by communicating how the predictions contrast with those of another class. However, existing approaches still fall short in the following ways: a) they measure locality using a (Euclidean) metric that is not meaningful for non-linear high-dimensional data; or b) they do not attempt to explain the decision boundary, which is the most relevant characteristic of classifiers that are optimized for classification accuracy; or c) they do not give the user any freedom in specifying attributes that are meaningful to them. We address these issues in a new procedure for local decision boundary approximation (DBA). To construct a meaningful metric, we train a variational autoencoder to learn a Euclidean latent space of encoded data representations. We impose interpretability by exploiting attribute annotations to map the latent space to attributes that are meaningful to the user. A difficulty in evaluating explainability approaches is the lack of a ground truth. We address this by introducing a new benchmark data set with artificially generated Iris images, and showing that we can recover the latent attributes that locally determine the class. We further evaluate our approach on the CelebA image data set.
Split-Merge Pooling

There are a variety of approaches to obtain a vast receptive field with convolutional neural networks (CNNs), such as pooling or striding convolutions. Most of these approaches were initially designed for image classification and later adapted to dense prediction tasks, such as semantic segmentation. However, the major drawback of this adaptation is the loss of spatial information. Even the popular dilated convolution approach, which in theory is able to operate with full spatial resolution, needs to subsample features for large image sizes in order to make the training and inference tractable. In this work, we introduce Split-Merge pooling to fully preserve the spatial information without any subsampling. By applying Split-Merge pooling to deep networks, we achieve, at the same time, a very large receptive field. We evaluate our approach for dense semantic segmentation of large image sizes taken from the Cityscapes and GTA-5 datasets. We demonstrate that by replacing max-pooling and striding convolutions with our split-merge pooling, we are able to improve the accuracy of different variations of ResNet significantly.
Estimation of Skill Distributions

In this paper, we study the problem of learning the skill distribution of a population of agents from observations of pairwise games in a tournament. These games are played among randomly drawn agents from the population. The agents in our model can be individuals, sports teams, or Wall Street fund managers. Formally, we postulate that the likelihoods of game outcomes are governed by the Bradley-Terry-Luce (or multinomial logit) model, where the probability of an agent beating another is the ratio between its skill level and the pairwise sum of skill levels, and the skill parameters are drawn from an unknown skill density of interest. The problem is, in essence, to learn a distribution from noisy, quantized observations. We propose a simple and tractable algorithm that learns the skill density with near-optimal minimax mean squared error scaling as $n^{-1+\varepsilon}$, for any $\varepsilon>0$, when the density is smooth. Our approach brings together prior work on learning skill parameters from pairwise comparisons with kernel density estimation from non-parametric statistics. Furthermore, we prove minimax lower bounds which establish minimax optimality of the skill parameter estimation technique used in our algorithm. These bounds utilize a continuum version of Fano's method along with a covering argument. We apply our algorithm to various soccer leagues and world cups, cricket world cups, and mutual funds. We find that the entropy of a learnt distribution provides a quantitative measure of skill, which provides rigorous explanations for popular beliefs about perceived qualities of sporting events, e.g., soccer league rankings. Finally, we apply our method to assess the skill distributions of mutual funds. Our results shed light on the abundance of low quality funds prior to the Great Recession of 2008, and the domination of the industry by more skilled funds after the financial crisis.
Identification of main factors affecting trust and determination of their importance in electronic businesses in Iran

Today, trust has become one of the main concerns of the electronic business in Iran. The role of trust especially in electronic businesses those directly deal with selling physical goods through internet is a lot more evident. Reviewing literature shows that several factors affect establishing of trust in potential customers. Since trust establishment needs to be noticed in each triple stages of an electronic purchase (before, during and finally after purchase). In this study by using field research, the importance of influential factors affecting the potential customers in three stages of an electronic purchase is determined. Based on the results from conducting the research, the certainty of traceability of the purchase with importance factor of 85.97% in pre-purchase stage, safety of transactions and the time of delivery of goods with the importance factor of 85.67% in the middle stage of the purchase and receiving a fault-free and undamaged good with the importance factor of 89.55% in the post purchase stage make up the top three most important factors.
Gaussian unitary ensembles with two jump discontinuities, PDEs, and the coupled Painlevé II and IV systems

We consider the Hankel determinant generated by the Gaussian weight with two jump discontinuities. Utilizing the results of Min and Chen [Math. Methods Appl Sci. 2019;42:301‐321] where a second‐order partial differential equation (PDE) was deduced for the log derivative of the Hankel determinant by using the ladder operators adapted to orthogonal polynomials, we derive the coupled Painlevé IV system which was established in Wu and Xu [arXiv: 2002.11240v2] by a study of the Riemann‐Hilbert problem for orthogonal polynomials. Under double scaling, we show that, as n→∞ , the log derivative of the Hankel determinant in the scaled variables tends to the Hamiltonian of a coupled Painlevé II system and it satisfies a second‐order PDE. In addition, we obtain the asymptotics for the recurrence coefficients of orthogonal polynomials, which are connected with the solutions of the coupled Painlevé II system.
Now that I can see, I can improve: Enabling data-driven finetuning of CNNs on the edge

In today’s world, a vast amount of data is being generated by edge devices that can be used as valuable training data to improve the performance of machine learning algorithms in terms of the achieved accuracy or to reduce the compute requirements of the model. However, due to user data privacy concerns as well as storage and communication bandwidth limitations, this data cannot be moved from the device to the data centre for further improvement of the model and subsequent deployment. As such there is a need for increased edge intelligence, where the deployed models can be fine-tuned on the edge, leading to improved accuracy and/or reducing the model’s workload as well as its memory and power footprint. In the case of Convolutional Neural Networks (CNNs), both the weights of the network as well as its topology can be tuned to adapt to the data that it processes. This paper provides a first step towards enabling CNN finetuning on an edge device based on structured pruning. It explores the performance gains and costs of doing so and presents an extensible open-source framework that allows the deployment of such approaches on a wide range of network architectures and devices. The results show that on average, data-aware pruning with retraining can provide 10.2pp increased accuracy over a wide range of subsets, networks and pruning levels with a maximum improvement of 42.0pp over pruning and retraining in a manner agnostic to the data being processed by the network.
The sociospatial factors of death: Analyzing effects of geospatially-distributed variables in a Bayesian mortality model for Hong Kong

Human mortality is in part a function of multiple socioeconomic factors that differ both spatially and temporally. Adjusting for other covariates, the human lifespan is positively associated with household wealth. However, the extent to which mortality in a geographical region is a function of socioeconomic factors in both that region and its neighbors is unclear. There is also little information on the temporal components of this relationship. Using the districts of Hong Kong over multiple census years as a case study, we demonstrate that there are differences in how wealth indicator variables are associated with longevity in (a) areas that are affluent but neighbored by socially deprived districts versus (b) wealthy areas surrounded by similarly wealthy districts. We also show that the inclusion of spatially-distributed variables reduces uncertainty in mortality rate predictions in each census year when compared with a baseline model. Our results suggest that geographic mortality models should incorporate nonlocal information (e.g., spatial neighbors) to lower the variance of their mortality estimates, and point to a more in-depth analysis of sociospatial spillover effects on mortality rates.
Weighted Optimization: better generalization by smoother interpolation

We provide a rigorous analysis of how implicit bias towards smooth interpolations leads to low generalization error in the overparameterized setting. We provide the first case study of this connection through a random Fourier series model and weighted least squares. We then argue through this model and numerical experiments that normalization methods in deep learning such as weight normalization improve generalization in overparameterized neural networks by implicitly encouraging smooth interpolants.
SD-RSIC: Summarization-Driven Deep Remote Sensing Image Captioning

Deep neural networks (DNNs) have been recently found popular for image captioning problems in remote sensing (RS). Existing DNN-based approaches rely on the availability of a training set made up of a high number of RS images with their captions. However, captions of training images may contain redundant information (they can be repetitive or semantically similar to each other), resulting in information deficiency while learning a mapping from the image domain to the language domain. To overcome this limitation, in this article, we present a novel summarization-driven RS image captioning (SD-RSIC) approach. The proposed approach consists of three main steps. The first step obtains the standard image captions by jointly exploiting convolutional neural networks (CNNs) with long short-term memory (LSTM) networks. The second step, unlike the existing RS image captioning methods, summarizes the ground-truth captions of each training image into a single caption by exploiting sequence to sequence neural networks and eliminates the redundancy present in the training set. The third step automatically defines the adaptive weights associated with each RS image to combine the standard captions with the summarized captions based on the semantic content of the image. This is achieved by a novel adaptive weighting strategy defined in the context of LSTM networks. Experimental results obtained on the RSCID, UCM-Captions, and Sydney-Captions data sets show the effectiveness of the proposed approach compared with the state-of-the-art RS image captioning approaches. The code of the proposed approach is publicly available at https://gitlab.tubit. tu-berlin.de/rsim/SD-RSIC.
MixMOOD: A systematic approach to class distribution mismatch in semi-supervised learning using deep dataset dissimilarity measures

In this work, we propose MixMOOD - a systematic approach to mitigate effect of class distribution mismatch in semi-supervised deep learning (SSDL) with MixMatch. This work is divided into two components: (i) an extensive out of distribution (OOD) ablation test bed for SSDL and (ii) a quantitative unlabelled dataset selection heuristic referred to as MixMOOD. In the first part, we analyze the sensitivity of MixMatch accuracy under 90 different distribution mismatch scenarios across three multi-class classification tasks. These are designed to systematically understand how OOD unlabelled data affects MixMatch performance. In the second part, we propose an efficient and effective method, called deep dataset dissimilarity measures (DeDiMs), to compare labelled and unlabelled datasets. The proposed DeDiMs are quick to evaluate and model agnostic. They use the feature space of a generic Wide-ResNet and can be applied prior to learning. Our test results reveal that supposed semantic similarity between labelled and unlabelled data is not a good heuristic for unlabelled data selection. In contrast, strong correlation between MixMatch accuracy and the proposed DeDiMs allow us to quantitatively rank different unlabelled datasets ante hoc according to expected MixMatch accuracy. This is what we call MixMOOD. Furthermore, we argue that the MixMOOD approach can aid to standardize the evaluation of different semi-supervised learning techniques under real world scenarios involving out of distribution data.
An Economies-of-Scale Service System Design Problem

This paper studies the design of a service system in the presence of economies-of-scale. The goal is to make decision on the number, location, service capacities of facilities as well as on the allocation of customers to the opened facilities in order to minimize the cost of whole system. The total cost includes opening and serving costs of facilities aggregated to the transportation and waiting costs of customers. To reflect the economies-of-scale in the modeling, a general opening cost function is supposed for each service facility with the characteristic of being concave and non-decreasing on its service capacity. A Lagrangian relaxation algorithm is developed for solving the problem in its general form. The algorithm decomposes the relaxed model into some homogeneous subproblems where each one can be optimally solved in polynomial time with no need for any optimization solver. Our computational experiment shows that the developed algorithm is both efficient and effective in solving the proposed problem.
A Matrix Generalization of the Hardy-Littlewood-P\'olya Rearrangement Inequality and Its Applications

Rearrangement inequalities are important tools in mathematical analysis and have found applications to many different areas. This paper proves a new matrix rearrangement inequality: \begin{equation*} \sum_{i=1}^n f\left(\sigma_i (A)\sigma_{n-i+1} (B)\right) \le \sum_{i=1}^n f\left(\sigma_i (AB)\right) \le \sum_{i=1}^n f\left(\sigma_i (A)\sigma_i (B)\right), \end{equation*} for any matrices $A,B\in\mathbb{R}^{n\times n}$ and differentiable function $f$ such that $s\mapsto sf'(s)$ is monotonically increasing. An important tool in the proof of the above inequality is a first-order perturbation formula for a certain class of matrix functions, which could be of independent interests. Applications of the new matrix rearrangement inequality to the Schatten quasi-norms, the affine-invariant geometry and log-determinant divergences for positive definite matrices are also presented.