pedigree
- Europe > Ireland (0.04)
- North America > United States > California (0.04)
- Asia > Japan > Honshū > Kantō > Tokyo Metropolis Prefecture > Tokyo (0.04)
'They don't just fall out of trees': Nobel awards highlight Britain's AI pedigree
It was more than even the most ardent advocates expected. After all the demonstrations of superhuman prowess, and the debates over whether the technology was humanity's best invention yet or its surest route to self-destruction, artificial intelligence landed a Nobel prize this week. And then it landed another. First came the physics prize. The American John Hopfield and the British-Canadian Geoffrey Hinton won for foundational work on artificial neural networks, the computational architecture that underpins modern AI such as ChatGPT.
- Europe > United Kingdom (1.00)
- North America > United States (0.05)
- North America > Canada > Ontario > Toronto (0.05)
- Europe > Sweden > Stockholm > Stockholm (0.05)
Bayesian Pedigree Analysis using Measure Factorization
Pedigrees, or family trees, are directed graphs used to identify sites of the genome that are correlated with the presence or absence of a disease. With the advent of genotyping and sequencing technologies, there has been an explosion in the amount of data available, both in the number of individuals and in the number of sites.
- North America > Canada > British Columbia (0.04)
- Asia > Middle East > Jordan (0.04)
- North America > United States > Oregon > Benton County > Corvallis (0.04)
Parallel Recursive Best-First AND/OR Search for Exact MAP Inference in Graphical Models
The paper presents and evaluates the power of parallel search for exact MAP inference in graphical models. We introduce a new parallel shared-memory recursive best-first AND/OR search algorithm, called SPRBFAOO, that explores the search space in a best-first manner while operating with restricted memory. Our experiments show that SPRBFAOO is often superior to the current state-of-the-art sequential AND/OR search approaches, leading to considerable speed-ups (up to 7-fold with 12 threads), especially on hard problem instances.
- Europe > Ireland (0.04)
- North America > United States > California (0.04)
- Asia > Japan > Honshū > Kantō > Tokyo Metropolis Prefecture > Tokyo (0.04)
- Information Technology > Artificial Intelligence > Representation & Reasoning > Search (1.00)
- Information Technology > Artificial Intelligence > Cognitive Science > Problem Solving (1.00)
- Information Technology > Architecture > Distributed Systems (0.93)
- Information Technology > Artificial Intelligence > Representation & Reasoning > Uncertainty (0.93)
Efficient Reconstruction of Stochastic Pedigrees: Some Steps From Theory to Practice
Mossel, Elchanan, Vulakh, David
In an extant population, how much information do extant individuals provide on the pedigree of their ancestors? Recent work by Kim, Mossel, Ramnarayan and Turner (2020) studied this question under a number of simplifying assumptions, including random mating, fixed length inheritance blocks and sufficiently large founding population. They showed that under these conditions if the average number of offspring is a sufficiently large constant, then it is possible to recover a large fraction of the pedigree structure and genetic content by an algorithm they named REC-GEN. We are interested in studying the performance of REC-GEN on simulated data generated according to the model. As a first step, we improve the running time of the algorithm. However, we observe that even the faster version of the algorithm does not do well in any simulations in recovering the pedigree beyond 2 generations. We claim that this is due to the inbreeding present in any setting where the algorithm can be run, even on simulated data. To support the claim we show that a main step of the algorithm, called ancestral reconstruction, performs accurately in a idealized setting with no inbreeding but performs poorly in random mating populations. To overcome the poor behavior of REC-GEN we introduce a Belief-Propagation based heuristic that accounts for the inbreeding and performs much better in our simulations.
- Energy > Oil & Gas (0.68)
- Health & Medicine > Pharmaceuticals & Biotechnology (0.47)
Prediction of Hereditary Cancers Using Neural Networks
Guan, Zoe, Parmigiani, Giovanni, Braun, Danielle, Trippa, Lorenzo
Family history is a major risk factor for many types of cancer. Mendelian risk prediction models translate family histories into cancer risk predictions based on knowledge of cancer susceptibility genes. These models are widely used in clinical practice to help identify high-risk individuals. Mendelian models leverage the entire family history, but they rely on many assumptions about cancer susceptibility genes that are either unrealistic or challenging to validate due to low mutation prevalence. Training more flexible models, such as neural networks, on large databases of pedigrees can potentially lead to accuracy gains. In this paper, we develop a framework to apply neural networks to family history data and investigate their ability to learn inherited susceptibility to cancer. While there is an extensive literature on neural networks and their state-of-the-art performance in many tasks, there is little work applying them to family history data. We propose adaptations of fully-connected neural networks and convolutional neural networks to pedigrees. In data simulated under Mendelian inheritance, we demonstrate that our proposed neural network models are able to achieve nearly optimal prediction performance. Moreover, when the observed family history includes misreported cancer diagnoses, neural networks are able to outperform the Mendelian BRCAPRO model embedding the correct inheritance laws. Using a large dataset of over 200,000 family histories, the Risk Service cohort, we train prediction models for future risk of breast cancer. We validate the models using data from the Cancer Genetics Network.
- North America > United States > California > San Francisco County > San Francisco (0.14)
- North America > United States > Utah (0.04)
- North America > United States > Massachusetts > Middlesex County > Cambridge (0.04)
- (3 more...)
Efficient Reconstruction of Stochastic Pedigrees
Kim, Younhun, Mossel, Elchanan, Ramnarayan, Govind, Turner, Paxton
We introduce a new algorithm called {\sc Rec-Gen} for reconstructing the genealogy or \textit{pedigree} of an extant population purely from its genetic data. We justify our approach by giving a mathematical proof of the effectiveness of {\sc Rec-Gen} when applied to pedigrees from an idealized generative model that replicates some of the features of real-world pedigrees. Our algorithm is iterative and provides an accurate reconstruction of a large fraction of the pedigree while having relatively low \emph{sample complexity}, measured in terms of the length of the genetic sequences of the population. We propose our approach as a prototype for further investigation of the pedigree reconstruction problem toward the goal of applications to real-world examples. As such, our results have some conceptual bearing on the increasingly important issue of genomic privacy.
- North America > United States > Massachusetts > Middlesex County > Cambridge (0.04)
- North America > United States > New York > New York County > New York City (0.04)
- Europe > United Kingdom > England > Oxfordshire > Oxford (0.04)
Elon Musk 'doesn't care' if employees graduated high school if they're code or AI experts
In a call for new employees, Elon Musk says he doesn't care if applicants have a high-school degree as long as they're best-in-class at coding or developing AI. The Tesla and SpaceX CEO made his priorities clear in a Twitter thread advertising a'super fun AI party/hackathon' at his residence that will include other employees who work for Tesla's AI team. Musk said invitations for the party will be sent out soon. In response from one Twitter user who asked whether they will have to get their PhD in order to secure an invite, Musk said education wasn't the priority. 'A PhD is definitely not required.
- North America > United States > California > Santa Clara County > Palo Alto (0.06)
- Europe > Germany (0.06)
- Asia > Japan (0.06)
- Education > Educational Setting > K-12 Education > Secondary School (1.00)
- Automobiles & Trucks (1.00)
Structural Material Property Tailoring Using Deep Neural Networks
Olesegun, Oshin, Noraas, Ryan, Giering, Michael, Somanath, Nagendra
Advances in robotics, artificial intelligence, and machine learning are ushering in a new age of automation, as machines match or outperform human performance. Machine intelligence can enable businesses to improve performance by reducing errors, improving sensitivity, quality and speed, and in some cases achieving outcomes that go beyond current resource capabilities. Relevant applications include new product architecture design, rapid material characterization, and life-cycle management tied with a digital strategy that will enable efficient development of products from cradle to grave. In addition, there are also challenges to overcome that must be addressed through a major, sustained research effort that is based solidly on both inferential and computational principles applied to design tailoring of functionally optimized structures. Current applications of structural materials in the aerospace industry demand the highest quality control of material microstructure, especially for advanced rotational turbomachinery in aircraft engines in order to have the best tailored material property. In this paper, deep convolutional neural networks were developed to accurately predict processing-structure-property relations from materials microstructures images, surpassing current best practices and modeling efforts. The models automatically learn critical features, without the need for manual specification and/or subjective and expensive image analysis. Further, in combination with generative deep learning models, a framework is proposed to enable rapid material design space exploration and property identification and optimization. The implementation must take account of real-time decision cycles and the trade-offs between speed and accuracy.
- North America > United States > Connecticut > Hartford County (0.14)
- North America > Canada (0.14)
- Europe (0.14)
- Asia > Japan (0.14)
- Aerospace & Defense (1.00)
- Energy > Oil & Gas (0.46)
Explainable Genetic Inheritance Pattern Prediction
Cunningham, Edmond, Schlegel, Dana, DeOrio, Andrew
Diagnosing an inherited disease often requires identifying the pattern of inheritance in a patient's family. We represent family trees with genetic patterns of inheritance using hypergraphs and latent state space models to provide explainable inheritance pattern predictions. Our approach allows for exact causal inference over a patient's possible genotypes given their relatives' phenotypes. By design, inference can be examined at a low level to provide explainable predictions. Furthermore, we make use of human intuition by providing a method to assign hypothetical evidence to any inherited gene alleles. Our analysis supports the application of latent state space models to improve patient care in cases of rare inherited diseases where access to genetic specialists is limited.
- North America > United States > California > San Francisco County > San Francisco (0.14)
- North America > Canada > Ontario > Toronto (0.14)
- North America > United States > Michigan (0.05)