Peu importe la taille : démocratiser la découverte de protéines avec l'IA
Des chercheurs de Mila ont créé un puissant modèle de langage protéique à source ouverte plus compact et efficace afin de démocratiser la découverte de protéines.
La prochaine cohorte de notre programme, conçu pour fournir aux participant·e·s une compréhension fondamentale des technologies de l'IA, se déroulera à Ottawa les 28 et 29 novembre.
Nous utilisons des témoins pour analyser le trafic et l’utilisation de notre site web, afin de personnaliser votre expérience. Vous pouvez désactiver ces technologies à tout moment, mais cela peut restreindre certaines fonctionnalités du site. Consultez notre Politique de protection de la vie privée pour en savoir plus.
Paramètre des cookies
Vous pouvez activer et désactiver les types de cookies que vous souhaitez accepter. Cependant certains choix que vous ferez pourraient affecter les services proposés sur nos sites (ex : suggestions, annonces personnalisées, etc.).
Cookies essentiels
Ces cookies sont nécessaires au fonctionnement du site et ne peuvent être désactivés. (Toujours actif)
Cookies analyse
Acceptez-vous l'utilisation de cookies pour mesurer l'audience de nos sites ?
Multimedia Player
Acceptez-vous l'utilisation de cookies pour afficher et vous permettre de regarder les contenus vidéo hébergés par nos partenaires (YouTube, etc.) ?
Publications
Evaluating the Fairness of Deep Learning Uncertainty Estimates in Medical Image Analysis
Although deep learning (DL) models have shown great success in many medical image analysis tasks, deployment of the resulting models into r… (voir plus)eal clinical contexts requires: (1) that they exhibit robustness and fairness across different sub-populations, and (2) that the confidence in DL model predictions be accurately expressed in the form of uncertainties. Unfortunately, recent studies have indeed shown significant biases in DL models across demographic subgroups (e.g., race, sex, age) in the context of medical image analysis, indicating a lack of fairness in the models. Although several methods have been proposed in the ML literature to mitigate a lack of fairness in DL models, they focus entirely on the absolute performance between groups without considering their effect on uncertainty estimation. In this work, we present the first exploration of the effect of popular fairness models on overcoming biases across subgroups in medical image analysis in terms of bottom-line performance, and their effects on uncertainty quantification. We perform extensive experiments on three different clinically relevant tasks: (i) skin lesion classification, (ii) brain tumour segmentation, and (iii) Alzheimer's disease clinical score regression. Our results indicate that popular ML methods, such as data-balancing and distributionally robust optimization, succeed in mitigating fairness issues in terms of the model performances for some of the tasks. However, this can come at the cost of poor uncertainty estimates associated with the model predictions. This tradeoff must be mitigated if fairness models are to be adopted in medical image analysis.
To offer accurate and diverse recommendation services, recent methods use auxiliary information to foster the learning process of user and i… (voir plus)tem representations. Many state-of-the-art (SOTA) methods fuse different sources of information (user, item, knowledge graph, tags, etc.) into a graph and use Graph Neural Networks (GNNs) to introduce the auxiliary information through the message passing paradigm. In this work, we seek an alternative framework that is light and effective through self-supervised learning across different sources of information, particularly for the commonly accessible item tag information. We use a self-supervision signal to pair users with the auxiliary information (tags) associated with the items they have interacted with before. To achieve the pairing, we create a proxy training task. For a given item, the model predicts which is the correct pairing between the representations obtained from the users that have interacted with this item and the tags assigned to it. This design provides an efficient solution, using the auxiliary information directly to enhance the quality of user and item embeddings. User behavior in recommendation systems is driven by the complex interactions of many factors behind the users’ decision-making processes. To make the pairing process more fine-grained and avoid embedding collapse, we propose a user intent-aware self-supervised pairing process where we split the user embeddings into multiple sub-embedding vectors. Each sub-embedding vector captures a specific user intent via self-supervised alignment with a particular cluster of tags. We integrate our designed framework with various recommendation models, demonstrating its flexibility and compatibility. Through comparison with numerous SOTA methods on seven real-world datasets, we show that our method can achieve better performance while requiring less training time. This indicates the potential of applying our approach on web-scale datasets.
2023-04-03
2023 IEEE 39th International Conference on Data Engineering (ICDE) (publié)
Objective While National Surgical, Obstetric and Anaesthesia Plans (NSOAPs) have emerged as a strategy to strengthen and scale up surgical h… (voir plus)ealthcare systems in low/middle-income countries (LMICs), the degree to which children’s surgery is addressed is not well-known. This study aims to assess the inclusion of children’s surgical care among existing NSOAPs, identify practice examples and provide recommendations to guide inclusion of children’s surgical care in future policies. Design We performed two qualitative content analyses to assess the inclusion of children’s surgical care among NSOAPs. We applied a conventional (inductive) content analysis approach to identify themes and patterns, and developed a framework based on the Global Initiative for Children’s Surgery’s Optimal Resources for Children’s Surgery document. We then used this framework to conduct a directed (deductive) content analysis of the NSOAPs of Ethiopia, Nigeria, Rwanda, Senegal, Tanzania and Zambia. Results Our framework for the inclusion of children’s surgical care in NSOAPs included seven domains. We evaluated six NSOAPs with all addressing at least two of the domains. All six NSOAPs addressed ‘human resources and training’ and ‘infrastructure’, four addressed ‘service delivery’, three addressed ‘governance and financing’, two included ‘research, evaluation and quality improvement’, and one NSOAP addressed ‘equipment and supplies’ and ‘advocacy and awareness’. Conclusions Additional focus must be placed on the development of surgical healthcare systems for children in LMICs. This requires a focus on children’s surgical care separate from adult surgical care in the scaling up of surgical healthcare systems, including children-focused needs assessments and the inclusion of children’s surgery providers in the process. This study proposes a framework for evaluating NSOAPs, highlights practice examples and suggests recommendations for the development of future policies.
In this work, we evaluate three popular fairness preprocessing algorithms and investigate the potential for combining all algorithms into a … (voir plus)more robust preprocessing ensemble. We report on lessons learned that can help practitioners better select fairness algorithms for their models.
Column generation is an iterative method used to solve a variety of optimization problems. It decomposes the problem into two parts: a maste… (voir plus)r problem and one or more pricing problems (PP). The total computing time taken by the method is divided between these two parts. In routing or scheduling applications, the problems are mostly defined on a network, and the PP is usually an NP-hard shortest path problem with resource constraints. In this work, we propose a new heuristic pricing algorithm based on machine learning. By taking advantage of the data collected during previous executions, the objective is to reduce the size of the network and accelerate the PP, keeping only the arcs that have a high chance to be part of the linear relaxation solution. The method has been applied to two specific problems: the vehicle and crew scheduling problem in public transit and the vehicle routing problem with time windows. Reductions in computational time of up to 40% can be obtained.