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
Joint Multisided Exposure Fairness for Recommendation
Prior research on exposure fairness in the context of recommender systems has focused mostly on disparities in the exposure of individual or… (voir plus) groups of items to individual users of the system. The problem of how individual or groups of items may be systemically under or over exposed to groups of users, or even all users, has received relatively less attention. However, such systemic disparities in information exposure can result in observable social harms, such as withholding economic opportunities from historically marginalized groups (allocative harm) or amplifying gendered and racialized stereotypes (representational harm). Previously, Diaz et al. developed the expected exposure metric---that incorporates existing user browsing models that have previously been developed for information retrieval---to study fairness of content exposure to individual users. We extend their proposed framework to formalize a family of exposure fairness metrics that model the problem jointly from the perspective of both the consumers and producers. Specifically, we consider group attributes for both types of stakeholders to identify and mitigate fairness concerns that go beyond individual users and items towards more systemic biases in recommendation. Furthermore, we study and discuss the relationships between the different exposure fairness dimensions proposed in this paper, as well as demonstrate how stochastic ranking policies can be optimized towards said fairness goals.
Radiomics-Based Machine Learning for Outcome Prediction in a Multicenter Phase II Study of Programmed Death-Ligand 1 Inhibition Immunotherapy for Glioblastoma
BACKGROUND AND PURPOSE: Imaging assessment of an immunotherapy response in glioblastoma is challenging due to overlap in the appearance of t… (voir plus)reatment-related changes with tumor progression. Our purpose was to determine whether MR imaging radiomics-based machine learning can predict progression-free survival and overall survival in patients with glioblastoma on programmed death-ligand 1 inhibition immunotherapy. MATERIALS AND METHODS: Post hoc analysis was performed of a multicenter trial on the efficacy of durvalumab in glioblastoma (n = 113). Radiomics tumor features on pretreatment and first on-treatment time point MR imaging were extracted. The random survival forest algorithm was applied to clinical and radiomics features from pretreatment and first on-treatment MR imaging from a subset of trial sites (n = 60–74) to train a model to predict long overall survival and progression-free survival and was tested externally on data from the remaining sites (n = 29–43). Model performance was assessed using the concordance index and dynamic area under the curve from different time points. RESULTS: The mean age was 55.2 (SD, 11.5) years, and 69% of patients were male. Pretreatment MR imaging features had a poor predictive value for overall survival and progression-free survival (concordance index = 0.472–0.524). First on-treatment MR imaging features had high predictive value for overall survival (concordance index = 0.692–0.750) and progression-free survival (concordance index = 0.680–0.715). CONCLUSIONS: A radiomics-based machine learning model from first on-treatment MR imaging predicts survival in patients with glioblastoma on programmed death-ligand 1 inhibition immunotherapy.
Radiomics-Based Machine Learning for Outcome Prediction in a Multicenter Phase II Study of Programmed Death-Ligand 1 Inhibition Immunotherapy for Glioblastoma
BACKGROUND AND PURPOSE: Imaging assessment of an immunotherapy response in glioblastoma is challenging due to overlap in the appearance of t… (voir plus)reatment-related changes with tumor progression. Our purpose was to determine whether MR imaging radiomics-based machine learning can predict progression-free survival and overall survival in patients with glioblastoma on programmed death-ligand 1 inhibition immunotherapy. MATERIALS AND METHODS: Post hoc analysis was performed of a multicenter trial on the efficacy of durvalumab in glioblastoma (n = 113). Radiomics tumor features on pretreatment and first on-treatment time point MR imaging were extracted. The random survival forest algorithm was applied to clinical and radiomics features from pretreatment and first on-treatment MR imaging from a subset of trial sites (n = 60–74) to train a model to predict long overall survival and progression-free survival and was tested externally on data from the remaining sites (n = 29–43). Model performance was assessed using the concordance index and dynamic area under the curve from different time points. RESULTS: The mean age was 55.2 (SD, 11.5) years, and 69% of patients were male. Pretreatment MR imaging features had a poor predictive value for overall survival and progression-free survival (concordance index = 0.472–0.524). First on-treatment MR imaging features had high predictive value for overall survival (concordance index = 0.692–0.750) and progression-free survival (concordance index = 0.680–0.715). CONCLUSIONS: A radiomics-based machine learning model from first on-treatment MR imaging predicts survival in patients with glioblastoma on programmed death-ligand 1 inhibition immunotherapy.
We provide a brief review of the common assumptions about biological learning with findings from experimental neuroscience and contrast them… (voir plus) with the efficiency of gradient-based learning in recurrent neural networks. The key issues discussed in this review include: synaptic plasticity, neural circuits, theory-experiment divide, and objective functions. We conclude with recommendations for both theoretical and experimental neuroscientists when designing new studies that could help bring clarity to these issues.
2022-04-27
Neurons, Behavior, Data analysis, and Theory (publié)
A common occurrence in reinforcement learning (RL) research is making use of a pretrained vision stack that converts image observations to l… (voir plus)atent vectors. Using a visual embedding in this way leaves open questions, though: should the vision stack be updated with the policy? In this work, we evaluate the effectiveness of such decisions in RL transfer settings. We introduce policy update formulations for use after pretraining in a different environment and analyze the performance of such formulations. Through this evaluation, we also detail emergent metrics of benchmark suites and present results on Atari and AndroidEnv.
This paper summarizes the content of the 20 tutorials that have been given at The Web Conference 2022: 85% of these tutorials are lecture st… (voir plus)yle, and 15% of these are hands on.
Research on exploration in reinforcement learning has mostly focused on problems with a single agent interacting with an environment. Howeve… (voir plus)r many problems are better addressed by the concurrent reinforcement learning paradigm, where multiple agents operate in a common environment. Recent work has tackled the challenge of exploration in this particular setting (Dimakopoulou & Van Roy, 2018; Dimakopoulou et al., 2018). Nonetheless, they do not completely leverage the characteristics of this framework and agents end up behaving independently from each other. In this work we argue that coordination among concurrent agents is crucial for efficient exploration. We introduce coordination in Thompson Sampling based methods by drawing correlated samples from an agent’s posterior. We apply this idea to extend existing exploration schemes such as randomized least squares value iteration (RLSVI). Empirical results on simple toy tasks emphasize the merits of our approach and call attention to coordination as a key objective for efficient exploration in concurrent reinforcement learning.
