The immune system is complex and involves many genes, including those that encode cytokines known as interferons (IFNs). Individuals that lack specific IFNs can be more susceptible to infectious diseases. Furthermore, the autoantibody system dampens IFN response to prevent damage from pathogen-induced inflammation. Two studies now examine the likelihood that genetics affects the risk of severe coronavirus disease 2019 (COVID-19) through components of this system (see the Perspective by Beck and Aksentijevich). Q. Zhang et al. used a candidate gene approach and identified patients with severe COVID-19 who have mutations in genes involved in the regulation of type I and III IFN immunity. They found enrichment of these genes in patients and conclude that genetics may determine the clinical course of the infection. Bastard et al. identified individuals with high titers of neutralizing autoantibodies against type I IFN-α2 and IFN-ω in about 10% of patients with severe COVID-19 pneumonia. These autoantibodies were not found either in infected people who were asymptomatic or had milder phenotype or in healthy individuals. Together, these studies identify a means by which individuals at highest risk of life-threatening COVID-19 can be identified. Science , this issue p. [eabd4570][1], p. [eabd4585][2]; see also p. [404][3] ### INTRODUCTION Clinical outcomes of human severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) infection range from silent infection to lethal coronavirus disease 2019 (COVID-19). Epidemiological studies have identified three risk factors for severe disease: being male, being elderly, and having other medical conditions. However, interindividual clinical variability remains huge in each demographic category. Discovering the root cause and detailed molecular, cellular, and tissue- and body-level mechanisms underlying life-threatening COVID-19 is of the utmost biological and medical importance. ### RATIONALE We established the COVID Human Genetic Effort ([www.covidhge.com][4]) to test the general hypothesis that life-threatening COVID-19 in some or most patients may be caused by monogenic inborn errors of immunity to SARS-CoV-2 with incomplete or complete penetrance. We sequenced the exome or genome of 659 patients of various ancestries with life-threatening COVID-19 pneumonia and 534 subjects with asymptomatic or benign infection. We tested the specific hypothesis that inborn errors of Toll-like receptor 3 (TLR3)– and interferon regulatory factor 7 (IRF7)–dependent type I interferon (IFN) immunity that underlie life-threatening influenza pneumonia also underlie life-threatening COVID-19 pneumonia. We considered three loci identified as mutated in patients with life-threatening influenza: TLR3 , IRF7 , and IRF9 . We also considered 10 loci mutated in patients with other viral illnesses but directly connected to the three core genes conferring influenza susceptibility: TICAM1/TRIF , UNC93B1 , TRAF3 , TBK1 , IRF3 , and NEMO/IKBKG from the TLR3-dependent type I IFN induction pathway, and IFNAR1 , IFNAR2 , STAT1 , and STAT2 from the IRF7- and IRF9-dependent type I IFN amplification pathway. Finally, we considered various modes of inheritance at these 13 loci. ### RESULTS We found an enrichment in variants predicted to be loss-of-function (pLOF), with a minor allele frequency <0.001, at the 13 candidate loci in the 659 patients with life-threatening COVID-19 pneumonia relative to the 534 subjects with asymptomatic or benign infection ( P = 0.01). Experimental tests for all 118 rare nonsynonymous variants (including both pLOF and other variants) of these 13 genes found in patients with critical disease identified 23 patients (3.5%), aged 17 to 77 years, carrying 24 deleterious variants of eight genes. These variants underlie autosomal-recessive (AR) deficiencies ( IRF7 and IFNAR1 ) and autosomal-dominant (AD) deficiencies ( TLR3 , UNC93B1 , TICAM1 , TBK1 , IRF3 , IRF7 , IFNAR1 , and IFNAR2 ) in four and 19 patients, respectively. These patients had never been hospitalized for other life-threatening viral illness. Plasmacytoid dendritic cells from IRF7-deficient patients produced no type I IFN on infection with SARS-CoV-2, and TLR3−/−, TLR3+/−, IRF7−/−, and IFNAR1−/− fibroblasts were susceptible to SARS-CoV-2 infection in vitro. ### CONCLUSION At least 3.5% of patients with life-threatening COVID-19 pneumonia had known (AR IRF7 and IFNAR1 deficiencies or AD TLR3, TICAM1, TBK1, and IRF3 deficiencies) or new (AD UNC93B1, IRF7, IFNAR1, and IFNAR2 deficiencies) genetic defects at eight of the 13 candidate loci involved in the TLR3- and IRF7-dependent induction and amplification of type I IFNs. This discovery reveals essential roles for both the double-stranded RNA sensor TLR3 and type I IFN cell-intrinsic immunity in the control of SARS-CoV-2 infection. Type I IFN administration may be of therapeutic benefit in selected patients, at least early in the course of SARS-CoV-2 infection. ![Figure][5] Inborn errors of TLR3- and IRF7-dependent type I IFN production and amplification underlie life-threatening COVID-19 pneumonia. Molecules in red are encoded by core genes, deleterious variants of which underlie critical influenza pneumonia with incomplete penetrance, and deleterious variants of genes encoding biochemically related molecules in blue underlie other viral illnesses. Molecules represented in bold are encoded by genes with variants that also underlie critical COVID-19 pneumonia. Clinical outcome upon infection with severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) ranges from silent infection to lethal coronavirus disease 2019 (COVID-19). We have found an enrichment in rare variants predicted to be loss-of-function (LOF) at the 13 human loci known to govern Toll-like receptor 3 (TLR3)– and interferon regulatory factor 7 (IRF7)–dependent type I interferon (IFN) immunity to influenza virus in 659 patients with life-threatening COVID-19 pneumonia relative to 534 subjects with asymptomatic or benign infection. By testing these and other rare variants at these 13 loci, we experimentally defined LOF variants underlying autosomal-recessive or autosomal-dominant deficiencies in 23 patients (3.5%) 17 to 77 years of age. We show that human fibroblasts with mutations affecting this circuit are vulnerable to SARS-CoV-2. Inborn errors of TLR3- and IRF7-dependent type I IFN immunity can underlie life-threatening COVID-19 pneumonia in patients with no prior severe infection. [1]: /lookup/doi/10.1126/science.abd4570 [2]: /lookup/doi/10.1126/science.abd4585 [3]: /lookup/doi/10.1126/science.abe7591 [4]: https://www.covidhge.com [5]: pending:yes

Artificial intelligence researchers have not been successful in giving intelligent agents the common-sense knowledge they need to reason about the world. Without this knowledge, it is impossible for intelligent agents to truly interact with the world. Traditionally, there have been two unsuccessful approaches to getting computers to reason about the world--symbolic logic and deep learning. A new project, called COMET, tries to bring these two approaches together. Although it has not yet succeeded, it offers the possibility of progress.

Artificial intelligence researchers have not been successful in giving intelligent agents the common-sense knowledge they need to reason about the world. Without this knowledge, it is impossible for intelligent agents to truly interact with the world. Traditionally, there have been two unsuccessful approaches to getting computers to reason about the world--symbolic logic and deep learning. A new project, called COMET, tries to bring these two approaches together. Although it has not yet succeeded, it offers the possibility of progress.

In singular models, the optimal set of parameters forms an analytic set with singularities and classical statistical inference cannot be applied to such models. This is significant for deep learning as neural networks are singular and thus "dividing" by the determinant of the Hessian or employing the Laplace approximation are not appropriate. Despite its potential for addressing fundamental issues in deep learning, singular learning theory appears to have made little inroads into the developing canon of deep learning theory. Via a mix of theory and experiment, we present an invitation to singular learning theory as a vehicle for understanding deep learning and suggest important future work to make singular learning theory directly applicable to how deep learning is performed in practice.

Submodular functions allow to model many real-world optimisation problems. This paper introduces approaches for computing diverse sets of high quality solutions for submodular optimisation problems. We first present diversifying greedy sampling approaches and analyse them with respect to the diversity measured by entropy and the approximation quality of the obtained solutions. Afterwards, we introduce an evolutionary diversity optimisation approach to further improve diversity of the set of solutions. We carry out experimental investigations on popular submodular benchmark functions that show that the combined approaches achieve high quality solutions of large diversity.

Personalized recommendation based on multi-arm bandit (MAB) algorithms has shown to lead to high utility and efficiency as it can dynamically adapt the recommendation strategy based on feedback. However, unfairness could incur in personalized recommendation. In this paper, we study how to achieve user-side fairness in personalized recommendation. We formulate our fair personalized recommendation as a modified contextual bandit and focus on achieving fairness on the individual whom is being recommended an item as opposed to achieving fairness on the items that are being recommended. We introduce and define a metric that captures the fairness in terms of rewards received for both the privileged and protected groups. We develop a fair contextual bandit algorithm, Fair-LinUCB, that improves upon the traditional LinUCB algorithm to achieve group-level fairness of users. Our algorithm detects and monitors unfairness while it learns to recommend personalized videos to students to achieve high efficiency. We provide a theoretical regret analysis and show that our algorithm has a slightly higher regret bound than LinUCB. We conduct numerous experimental evaluations to compare the performances of our fair contextual bandit to that of LinUCB and show that our approach achieves group-level fairness while maintaining a high utility.

Directional data consist of observations distributed on a (hyper)sphere, and appear in many applied fields, such as astronomy, ecology, and environmental science. This paper studies both statistical and computational problems of kernel smoothing for directional data. We generalize the classical mean shift algorithm to directional data, which allows us to identify local modes of the directional kernel density estimator (KDE). The statistical convergence rates of the directional KDE and its derivatives are derived, and the problem of mode estimation is examined. We also prove the ascending property of our directional mean shift algorithm and investigate a general problem of gradient ascent on the unit hypersphere. To demonstrate the applicability of our proposed algorithm, we evaluate it as a mode clustering method on both simulated and real-world datasets.

Deep learning classifiers are susceptible to well-crafted, imperceptible variations of their inputs, known as adversarial attacks. In this regard, the study of powerful attack models sheds light on the sources of vulnerability in these classifiers, hopefully leading to more robust ones. In this paper, we introduce AdvFlow: a novel black-box adversarial attack method on image classifiers that exploits the power of normalizing flows to model the density of adversarial examples around a given target image. We see that the proposed method generates adversaries that closely follow the clean data distribution, a property which makes their detection less likely. Also, our experimental results show competitive performance of the proposed approach with some of the existing attack methods on defended classifiers. The code is available at https://github.com/hmdolatabadi/AdvFlow.

In recent years, deep neural networks have been successful in both industry and academia, especially for computer vision tasks. The great success of deep learning is mainly due to its scalability to encode large-scale data and to maneuver billions of model parameters. However, it is a challenge to deploy these cumbersome deep models on devices with limited resources, e.g., mobile phones and embedded devices, not only because of the high computational complexity but also the large storage requirements. To this end, a variety of model compression and acceleration techniques have been developed. As a representative type of model compression and acceleration, knowledge distillation effectively learns a small student model from a large teacher model. It has received rapid increasing attention from the community. This paper provides a comprehensive survey of knowledge distillation from the perspectives of knowledge categories, training schemes, teacher-student architecture, distillation algorithms, performance comparison and applications. Furthermore, challenges in knowledge distillation are briefly reviewed and comments on future research are discussed and forwarded.

We present a framework to derive bounds on the test loss of randomized learning algorithms for the case of bounded loss functions. This framework leads to bounds that depend on the conditional information density between the the output hypothesis and the choice of the training set, given a larger set of data samples from which the training set is formed. If the conditional information density is bounded uniformly in the sizenof the training set, our bounds decay as1/n, which is referred to as a fast rate. This is in contrast with the tail bounds involving conditional information measures available in the literature, which have a less benign 1/ n dependence. We demonstrate the usefulness of our tail bounds by showing that they lead to estimates of the test loss achievable with several neural network architectures trained on MNIST and Fashion-MNIST that match the state-of-the-art bounds available in the literature. In recent years, there has been a surge of interest in the use of information-theoretic techniques for bounding the loss of learning algorithms. While the first results of this flavor can be traced to the probably approximately correct (PAC)-Bayesian approach (McAllester, 1998; Catoni, 2007) (see also (Guedj, 2019) for a recent review), the connection between loss bounds and classical information-theoretic measures was made explicit in the works of Russo & Zou (2016) and Xu & Raginsky (2017), where bounds on the average population loss were derived in terms of the mutual information between the training data and the output hypothesis. Since then, these average loss bounds have been tightened (Bu et al., 2019; Asadi et al., 2018; Negrea et al., 2019). Furthermore, the information-theoretic framework has also been successfully applied to derive tail probability bounds on the population loss (Bassily et al., 2018; Esposito et al., 2019; Hellström & Durisi, 2020a). Of particular relevance to the present paper is the random-subset setting, introduced by Steinke & Zakynthinou (2020) and further studied in (Hellström & Durisi, 2020b; Haghifam et al., 2020).