Miracle-dz/UniFAR-FTUs huggingface dataset:
Intravenous corticosteroid treatment in adult patients with sepsis defined by the Sepsis-3 criteria: a systematic review and meta-analysis

Objectives: To summarize the effects of intravenous corticosteroid treatment for sepsis defined by the Sepsis-3 criteria in adult patients. Design: Systematic review and meta-analysis. Methods: We searched RCTs from PubMed, Embase, ClinicalTrials.gov, Cochrane Central Register of Controlled Trials, Web of Science, and International Clinical Trials Registry Platform from inception to July 12th, 2019 and updated on June 28th, 2020. Conference proceedings from relevant societies and the reference lists of previous reviews were manually screened. Abstract or full-text articles were screened by two independent investigators. We included RCTs where (1) the participants had infections and the baseline Sequential Organ Failure Assessment (SOFA) score [≥] 2 (the Sepsis-3 definitions) (2) the intervention involved any intravenous corticosteroids; (3) the control group received placebo or standard of care (4) the outcomes of interest included mortality or clinical recovery. We chose the 28-day mortality as the pre-specified primary outcome and risk ratio (RR) as the effect measure. We followed PRISMA guidelines and chose random-effects models for the pooled analyses. Results: This study included 24 RCTs and 19 of them (7,115 participants) reported the 28-day mortality. Pooled analyses showed that intravenous corticosteroid treatment compared to placebo or standard of care was not associated with a lower risk of 28-day mortality (RR, 0.88; 95%CI, 0.73 to 1.05), but with a higher risk of hyperglycemia (RR, 1.16; 95%CI, 1.06 to 1.27). Sensitivity analysis of high-quality studies revealed a similar result for the 28-day mortality (RR, 0.95; 95%CI, 0.86 to 1.05). Conclusions: Our findings suggested that intravenous corticosteroids compared to placebo or standard of care may not reduce the 28-day mortality in adult patients with sepsis defined by the Sepsis-3 criteria. Further studies are warranted to clarify the roles of disease severity and treatment timing in the effects of corticosteroid treatment in this population. PROSPERO registration number: CRD42019143083
Deep Learning-Based Power Control for Uplink Cell-Free Massive MIMO Systems

In this paper, a general framework for deep learning-based power control methods for max-min, max-product and max-sum-rate optimization in uplink cell-free massive multiple-input multiple-output (CF mMIMO) systems is proposed. Instead of using supervised learning, the proposed method relies on unsupervised learning, in which optimal power allocations are not required to be known, and thus has low training complexity. More specifically, a deep neural network (DNN) is trained to learn the map between fading coefficients and power coefficients within short time and with low computational complexity. It is interesting to note that the spectral efficiency of CF mMIMO systems with the proposed method outperforms previous optimization methods for max-min optimization and fits well for both max-sum-rate and max-product optimizations.
Learning UI Navigation through Demonstrations composed of Macro Actions

We have developed a framework to reliably build agents capable of UI navigation. The state space is simplified from raw-pixels to a set of UI elements extracted from screen understanding, such as OCR and icon detection. The action space is restricted to the UI elements plus a few global actions. Actions can be customized for tasks and each action is a sequence of basic operations conditioned on status checks. With such a design, we are able to train DQfD and BC agents with a small number of demonstration episodes. We propose demo augmentation that significantly reduces the required number of human demonstrations. We made a customization of DQfD to allow demos collected on screenshots to facilitate the demo coverage of rare cases. Demos are only collected for the failed cases during the evaluation of the previous version of the agent. With 10s of iterations looping over evaluation, demo collection, and training, the agent reaches a 98.7\% success rate on the search task in an environment of 80+ apps and websites where initial states and viewing parameters are randomized.
A Serverless Distributed Ledger for Enterprises

Enterprises have been attracted by the capability of blockchains to provide a single source of truth for workloads that span companies, geographies, and clouds while retaining the independence of each party's IT operations. However, so far production applications have remained rare, stymied by technical limitations of existing blockchain technologies and challenges with their integration into enterprises' IT systems. In this paper, we collect enterprises' requirements on distributed ledgers for data sharing and integration from a technical perspective, argue that they are not sufficiently addressed by available blockchain frameworks, and propose a novel distributed ledger design that is"serverless", i.e., built on cloud-native resources. We evaluate its qualitative and quantitative properties and give evidence that enterprises already heavily reliant on cloud service providers would consider such an approach acceptable, particularly if it offers ease of deployment, low transactional cost structure, and a combination of latency and scalability aligned with real-time IT application needs.
When heart beats differently in depression: a review of HRV measures

Background and Objective: The connection between depression and autonomous nervous system (ANS) is well documented in scientific literature. Heart rate variability (HRV) is a rich source of information for studying the dynamics of this relation. Disturbed heart dynamics in depression seriously increases mortality risk. Technical sciences help improve early detection and monitoring and offer more accurate management of treatment. Based on advances in computational power, information theory, complex systems dynamics, and nonlinear analysis applied to physiological complexity, we can now turn to novel biomarkers extracted from electrophysiological signals. This work is a cross-sectional analysis with methodological commentary of application of nonlinear measures of HRV related to depression. Methods: We systematically searched online for papers exploring the connection of depression and HRV, using both conventional and nonlinear analysis. We scrutinized chosen publications and methodologically analyzed and compared them. Results: Sixty-seven publications on the connection of HRV measures and depression meeting our inclusion criteria are selected. The effectiveness of the applied methods of electrocardiogram (ECG) analysis are compared and discussed in the light of detection and prevention of depression-related cardiac diseases. Conclusions: It is clear that aberrated ANS dynamics can be detected via ECG analysis, where nonlinear measures show to be more sensitive and accurate than standard time and spectral ones. With the portable ECG devices and cloud-based telehealth applications, monitoring of outpatients could be done anytime anywhere. We appeal for early screening for cardiovascular abnormalities in depressive patients to prevent possible deleterious events.
Taming Visually Guided Sound Generation

Recent advances in visually-induced audio generation are based on sampling short, low-fidelity, and one-class sounds. Moreover, sampling 1 second of audio from the state-of-the-art model takes minutes on a high-end GPU. In this work, we propose a single model capable of generating visually relevant, high-fidelity sounds prompted with a set of frames from open-domain videos in less time than it takes to play it on a single GPU. We train a transformer to sample a new spectrogram from the pre-trained spectrogram codebook given the set of video features. The codebook is obtained using a variant of VQGAN trained to produce a compact sampling space with a novel spectrogram-based perceptual loss. The generated spectrogram is transformed into a waveform using a window-based GAN that significantly speeds up generation. Considering the lack of metrics for automatic evaluation of generated spectrograms, we also build a family of metrics called FID and MKL. These metrics are based on a novel sound classifier, called Melception, and designed to evaluate the fidelity and relevance of open-domain samples. Both qualitative and quantitative studies are conducted on small- and large-scale datasets to evaluate the fidelity and relevance of generated samples. We also compare our model to the state-of-the-art and observe a substantial improvement in quality, size, and computation time. Code, demo, and samples: v-iashin.github. io/SpecVQGAN
Predictable Forward Performance Processes: Infrequent Evaluation and Robo-Advising Applications

We study discrete-time predictable forward processes when trading times do not coincide with performance evaluation times in the binomial tree model for the financial market. The key step in the construction of these processes is to solve a linear functional equation of higher order associated with the inverse problem driving the evolution of the predictable forward process. We provide sufficient conditions for the existence and uniqueness and an explicit construction of the predictable forward process under these conditions. Furthermore, we show that these processes are time-monotone in the evaluation period. Finally, we argue that predictable forward preferences are a viable framework to model preferences for robo-advising applications and determine an optimal interaction schedule between client and robo-advisor that balances a tradeoff between increasing uncertainty about the client's beliefs on the financial market and an interaction cost.
Vega: A Ten-Core SoC for IoT Endnodes With DNN Acceleration and Cognitive Wake-Up From MRAM-Based State-Retentive Sleep Mode

The Internet-of-Things (IoT) requires endnodes with ultra-low-power always-on capability for a long battery lifetime, as well as high performance, energy efficiency, and extreme flexibility to deal with complex and fast-evolving near-sensor analytics algorithms (NSAAs). We present Vega, an IoT endnode system on chip (SoC) capable of scaling from a 1.7- $\mu \text{W}$ fully retentive cognitive sleep mode up to 32.2-GOPS (at 49.4 mW) peak performance on NSAAs, including mobile deep neural network (DNN) inference, exploiting 1.6 MB of state-retentive SRAM, and 4 MB of non-volatile magnetoresistive random access memory (MRAM). To meet the performance and flexibility requirements of NSAAs, the SoC features ten RISC-V cores: one core for SoC and IO management and a nine-core cluster supporting multi-precision single instruction multiple data (SIMD) integer and floating-point (FP) computation. Vega achieves the state-of-the-art (SoA)-leading efficiency of 615 GOPS/W on 8-bit INT computation (boosted to 1.3 TOPS/W for 8-bit DNN inference with hardware acceleration). On FP computation, it achieves the SoA-leading efficiency of 79 and 129 GFLOPS/W on 32- and 16-bit FP, respectively. Two programmable machine learning (ML) accelerators boost energy efficiency in cognitive sleep and active states.
Online Sign Identification: Minimization of the Number of Errors in Thresholding Bandits

In the fixed budget thresholding bandit problem, an algorithm sequentially allocates a budgeted number of samples to different distributions. It then predicts whether the mean of each distribution is larger or lower than a given threshold. We introduce a large family of algorithms (containing most existing relevant ones), inspired by the Frank-Wolfe algorithm, and provide a thorough yet generic analysis of their performance. This allowed us to construct new explicit algorithms, for a broad class of problems, whose losses are within a small constant factor of the non-adaptive oracle ones. Quite interestingly, we observed that adaptive methods empirically greatly out-perform non-adaptive oracles, an uncommon behavior in standard online learning settings, such as regret minimization. We explain this surprising phenomenon on an insightful toy problem.
Does human-robot trust need reciprocity?

Trust is one of the hallmarks of human-human and human-robot interaction. Extensive evidence has shown that trust among humans requires reciprocity. Conversely, research in human-robot interaction (HRI) has mostly relied on a unidirectional view of trust that focuses on robots' reliability and performance. The current paper argues that reciprocity may also play a key role in the emergence of mutual trust and successful collaboration between humans and robots. We will gather and discuss works that reveal a reciprocal dimension in human-robot trust, paving the way to a bidirectional and dynamic view of trust in HRI.
Intrusion-Free Graph Mixup

We present a simple and yet effective interpolation-based regularization technique to improve the generalization of Graph Neural Networks (GNNs). We leverage the recent advances in Mixup regularizer for vision and text, where random sample pairs and their labels are interpolated to create synthetic samples for training. Unlike images or natural sentences, which embrace a grid or linear sequence format, graphs have arbitrary structure and topology, which play a vital role on the semantic information of a graph. Consequently, even simply deleting or adding one edge from a graph can dramatically change its semantic meanings. This makes interpolating graph inputs very challenging because mixing random graph pairs may naturally create graphs with identical structure but with different labels, causing the manifold intrusion issue. To cope with this obstacle, we propose the ﬁrst input mixing schema for Mixup on graph. We theoretically prove that our mixing strategy can recover the source graphs from the mixed graph
A model for the electric field-driven deformation of a drop or vesicle in strong electrolyte solutions

A model is constructed to describe the arbitrary deformation of a drop or vesicle that contains and is embedded in an electrolyte solution, where the deformation is caused by an applied electric field. The applied field produces an electrokinetic flow or induced charge electro-osmosis. The model is based on the coupled Poisson-Nernst-Planck and Stokes equations. These are reduced or simplified by forming the limit of strong electrolytes, for which ion densities are relatively large, together with the limit of thin Debye layers. Debye layers of opposite polarity form on either side of the drop interface or vesicle membrane, together forming an electrical double layer. Two formulations of the model are given. One utilizes an integral equation for the velocity field on the interface or membrane surface together with a pair of integral equations for the electrostatic potential on the outer faces of the double layer. The other utilizes a form of the stress-balance boundary condition that incorporates the double layer structure into relations between the dependent variables on the layer’s outer faces. This constitutes an interfacial boundary condition that drives an otherwise unforced Stokes flow outside the double layer. For both formulations relations derived from the transport of ions in each Debye layer give additional boundary conditions for the potential and ion concentrations outside the double layer.
Generative Adversarial Imitation Learning for End-to-End Autonomous Driving on Urban Environments

Autonomous driving is a complex task, which has been tackled since the first self-driving car ALVINN in 1989, with a supervised learning approach, or behavioral cloning (BC). In BC, a neural network is trained with state-action pairs that constitute the training set made by an expert, i.e., a human driver. However, this type of imitation learning does not take into account the temporal dependencies that might exist between actions taken in different moments of a navigation trajectory. These type of tasks are better handled by reinforcement learning (RL) algorithms, which need to define a reward function. On the other hand, more recent approaches to imitation learning, such as Generative Adversarial Imitation Learning (GAIL), can train policies without explicitly requiring to define a reward function, allowing an agent to learn by trial and error directly on a training set of expert trajectories. In this work, we propose two variations of GAIL for autonomous navigation of a vehicle in the realistic CARLA simulation environment for urban scenarios. Both of them use the same network architecture, which process high-dimensional image input from three frontal cameras, and other nine continuous inputs representing the velocity, the next point from the sparse trajectory and a high-level driving command. We show that both of them are capable of imitating the expert trajectory from start to end after training ends, but the GAIL loss function that is augmented with BC outperforms the former in terms of convergence time and training stability.
Context-aware Reranking with Utility Maximization for Recommendation

As a critical task for large-scale commercial recommender systems, reranking has shown the potential of improving recommendation results by uncovering mutual influence among items. Reranking rearranges items in the initial ranking lists from the previous ranking stage to better meet users' demands. However, rather than considering the context of initial lists as most existing methods do, an ideal reranking algorithm should consider the counterfactual context -- the position and the alignment of the items in the reranked lists. In this work, we propose a novel pairwise reranking framework, Context-aware Reranking with Utility Maximization for recommendation (CRUM), which maximizes the overall utility after reranking efficiently. Specifically, we first design a utility-oriented evaluator, which applies Bi-LSTM and graph attention mechanism to estimate the listwise utility via the counterfactual context modeling. Then, under the guidance of the evaluator, we propose a pairwise reranker model to find the most suitable position for each item by swapping misplaced item pairs. Extensive experiments on two benchmark datasets and a proprietary real-world dataset demonstrate that CRUM significantly outperforms the state-of-the-art models in terms of both relevance-based metrics and utility-based metrics.
On the Completeness and Complexity of the Lifted Dynamic Junction Tree Algorithm

Lifted inference allows to perform inference in polynomial time w.r. t. domain sizes. For a lifted algorithm, completeness investigates model classes for which the algorithm is guaranteed to compute a lifted solution. We contribute, to the best of our knowledge, the first completeness and complexity analysis for a temporal lifted algorithm, the so-called lifted dynamic junction tree algorithm (LDJT). To treat time as a first class citizen, LDJT introduces some constraints. Given these constraints, we analyse the classes of liftable models. Further, we show that LDJT has many advantages from a complexity point of view compared to a propositional temporal inference algorithm w.r. t. domain sizes. Therefore, LDJT advances the number of models for which inference tasks can be solved in reasonable time not only from a practically point of view, but also from a theoretical point of view.
Ranking Facts for Explaining Answers to Elementary Science Questions

In multiple-choice exams, students select one answer from among typically four choices and can explain why they made that particular choice. Students are good at understanding natural language questions and based on their domain knowledge can easily infer the question’s answer by “connecting the dots” across various pertinent facts. Considering automated reasoning for elementary science question answering, we address the novel task of generating explanations for answers from human-authored facts. For this, we examine the practically scalable framework of feature-rich support vector machines leveraging domain-targeted, hand-crafted features. Explanations are created from a human-annotated set of nearly 5000 candidate facts in the WorldTree corpus. Our aim is to obtain better matches for valid facts of an explanation for the correct answer of a question over the available fact candidates. To this end, our features offer a comprehensive linguistic and semantic unification paradigm. The machine learning problem is the preference ordering of facts, for which we test pointwise regression versus pairwise learning-to-rank. Our contributions, originating from comprehensive evaluations against nine existing systems, are (1) a case study in which two preference ordering approaches are systematically compared, and where the pointwise approach is shown to outperform the pairwise approach, thus adding to the existing survey of observations on this topic; (2) since our system outperforms a highly-effective TF-IDF-based IR technique by 3.5 and 4.9 points on the development and test sets, respectively, it demonstrates some of the further task improvement possibilities (e.g., in terms of an efficient learning algorithm, semantic features) on this task; (3) it is a practically competent approach that can outperform some variants of BERT-based reranking models; and (4) the human-engineered features make it an interpretable machine learning model for the task.
Towards More Accountable Search Engines: Online Evaluation of Representation Bias

Information availability affects people's behavior and perception of the world. Notably, people rely on search engines to satisfy their need for information. Search engines deliver results relevant to user requests usually without being or making themselves accountable for the information they deliver, which may harm people's lives and, in turn, society. This potential risk urges the development of evaluation mechanisms of bias in order to empower the user in judging the results of search engines. In this paper, we give a possible solution to measuring representation bias with respect to societal features for search engines and apply it to evaluating the gender representation bias for Google's Knowledge Graph Carousel for listing occupations.
DFW-PP: Dynamic Feature Weighting based Popularity Prediction for Social Media Content

The increasing popularity of social media platforms makes it important to study user engagement, which is a crucial aspect of any marketing strategy or business model. The over-saturation of content on social media platforms has persuaded us to identify the important factors that affect content popularity. This comes from the fact that only an iota of the humongous content available online receives the attention of the target audience. Comprehensive research has been done in the area of popularity prediction using several Machine Learning techniques. However, we observe that there is still significant scope for improvement in analyzing the social importance of media content. We propose the DFW-PP framework, to learn the importance of different features that vary over time. Further, the proposed method controls the skewness of the distribution of the features by applying a log-log normalization. The proposed method is experimented with a benchmark dataset, to show promising results. The code will be made publicly available at https://github.com/chaitnayabasava/DFW-PP.
On Estimating the Probabilistic Region of Attraction for Partially Unknown Nonlinear Systems: An Sum-of-Squares Approach

Estimating the region of attraction for partially unknown nonlinear systems is a challenging issue. In this paper, we propose a tractable method to generate an estimated region of attraction with probability bounds, by searching an optimal polynomial barrier function. Chebyshev interpolants, Gaussian processes and sum-of-squares programmings are used in this paper. To approximate the unknown non-polynomial dynamics, a polynomial mean function of Gaussian processes model is computed to represent the exact dynamics based on the Chebyshev interpolants. Furthermore, probabilistic conditions are given such that all the estimates are located in certain probability bounds. Numerical examples are provided to demonstrate the effectiveness of the proposed method.