检索结果-内蒙古大学图书馆

Tensor completion via gaussian process based initialization

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Kapushev, Yermek Oseledets, Ivan Burnaev, Evgeny Center for Computational and Data-Intensive Science Engineering of Skolkovo Institute of Science and Technology Moscow Russia

In this paper, we consider the tensor completion problem representing the solution in the tensor train (TT) format. It is assumed that tensor is high-dimensional, and tensor values are generated by an unknown smooth function. The assumption allows us to develop an efficient initialization scheme based on Gaussian Process Regression and TT-cross approximation technique. The proposed approach can be used in conjunction with any optimization algorithm that is usually utilized in tensor completion problems. We empirically justify that in this case the reconstruction error improves compared to the tensor completion with random initialization. As an additional benefit, our technique automatically selects rank thanks to using the TT-cross approximation *** Codes 68W25, 65F99, 60G15 Copyright © 2019, The Authors. All rights reserved.

关键词： Tensors

An Approach to Prevent Weight Manipulation by Minimum Adjustment and Maximum Entropy Method in Large-Scale Group Decision Making

学校读者我要写书评

暂无评论

SSRN

SSRN 2022年

作者： Sun, Qi Wu, Jian Chiclana, Francisco Wang, Sha Herrera-Viedma, Enrique School of Economics and Management Shanghai Maritime University Shanghai201306 China Center for Artificial Intelligence and Decision Sciences Shanghai Maritime University Shanghai201306 China Institute of Artificial Intelligence Faculty of Computing Engineering and Media De Montfort University Leicester United Kingdom Andalusian Research Institute in Data Science and Computational Intelligence Dept. of Computer Science and AI University of Granada Granada18071 Spain Department of Electrical and Computer Engineering Faculty of Engineering King Abdulaziz University Jeddah21589 Saudi Arabia

This paper proposes a theoretical framework to prevent weight manipulation in large-scale group decision making (LSGDM). Firstly, a community detection based method is used to cluster the large group. The power relations of subgroups are measured by the rights index (RI), which depends on the subgroups size and cohesion. Then, a minimum adjustment feedback model with maximum entropy is proposed to prevent subgroups’manipulation behavior. The minimum adjustment rule aims for ‘effificiency’ while the maximum entropy rule aims for ‘justice’. Consequently, by keeping a balance between ‘effificiency’ and ‘justice’ in the mechanism of assigning weights, the rationality of weight allocation to reach consensus effificiently can be ensured. Detailed numerical and simulation analyses are carried out to verify the validity of the proposed method. © 2022, The Authors. All rights reserved.

关键词： Decision making

Position: Bayesian Deep Learning is Needed in the Age of Large-Scale AI

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Papamarkou, Theodore Skoularidou, Maria Palla, Konstantina Aitchison, Laurence Arbel, Julyan Dunson, David Filippone, Maurizio Fortuin, Vincent Hennig, Philipp Hernández-Lobato, José Miguel Hubin, Aliaksandr Immer, Alexander Karaletsos, Theofanis Khan, Mohammad Emtiyaz Kristiadi, Agustinus Li, Yingzhen Mandt, Stephan Nemeth, Christopher Osborne, Michael A. Rudner, Tim G.J. Rügamer, David Teh, Yee Whye Welling, Max Wilson, Andrew Gordon Zhang, Ruqi Department of Mathematics The University of Manchester Manchester United Kingdom Eric and Wendy Schmidt Center Broad Institute of MIT and Harvard Cambridge United States Spotify London United Kingdom Computational Neuroscience Unit University of Bristol Bristol United Kingdom Centre Inria de l'Université Grenoble Alpes Grenoble France Department of Statistical Science Duke University United States Statistics Program KAUST Saudi Arabia Helmholtz AI Munich Germany Department of Computer Science Technical University of Munich Munich Germany Munich Center for Machine Learning Munich Germany Tübingen AI Center University of Tübingen Tübingen Germany Department of Engineering University of Cambridge Cambridge United Kingdom Department of Mathematics University of Oslo Oslo Norway Bioinformatics and Applied Statistics Norwegian University of Life Sciences Ås Norway Department of Computer Science ETH Zurich Switzerland Chan Zuckerberg Initiative CA United States Center for Advanced Intelligence Project RIKEN Tokyo Japan Vector Institute Toronto Canada Department of Computing Imperial College London London United Kingdom Department of Computer Science UC Irvine Irvine United States Department of Mathematics and Statistics Lancaster University Lancaster United Kingdom Department of Engineering Science University of Oxford Oxford United Kingdom Center for Data Science New York University New York United States Department of Statistics LMU Munich Munich Germany DeepMind London United Kingdom Department of Statistics University of Oxford Oxford United Kingdom Informatics Institute University of Amsterdam Amsterdam Netherlands Courant Institute of Mathematical Sciences Center for Data Science Computer Science Department New York University New York United States Department of Computer Science Purdue University West Lafayette United States

In the current landscape of deep learning research, there is a predominant emphasis on achieving high predictive accuracy in supervised tasks involving large image and language datasets. However, a broader perspective reveals a multitude of overlooked metrics, tasks, and data types, such as uncertainty, active and continual learning, and scientific data, that demand attention. Bayesian deep learning (BDL) constitutes a promising avenue, offering advantages across these diverse settings. This paper posits that BDL can elevate the capabilities of deep learning. It revisits the strengths of BDL, acknowledges existing challenges, and highlights some exciting research avenues aimed at addressing these obstacles. Looking ahead, the discussion focuses on possible ways to combine large-scale foundation models with BDL to unlock their full potential. © 2024, CC BY-NC-ND.

关键词： Large datasets

Narrowing of the Racial Disparities Gap in Survival of Patients With Mycosis Fungoides: A Longitudinal Analysis of the SEER database

学校读者我要写书评

暂无评论

Clinical Lymphoma, Myeloma and Leukemia 2025年第7期25卷 e501-e506页

作者： Le, Britney Soror, Noha Ismail, Hamid D. Baker, Mohammed Shetayyah, Salman Abu Chung, Catherine G. William, Basem M. Ohio University Heritage College of Osteopathic Medicine Dublin OH The University of Oklahoma College of Medicine Oklahoma City OK United States Department of Computational Data Science and Engineering North Carolina Agricultural and Technical State University Greensboro NC United States Faculty of Medicine Jordan University of Science and Technology Irbid Jordan The Ohio State University Comprehensive Cancer Center: Arthur G. James Cancer Hospital and Richard J. Solove Research Institute Division of Dermatology Columbus OH Ohio Health Blood and Marrow Transplant Program Columbus OH

Background: Mycosis fungoides (MF) is the commonest subtype of cutaneous T-cell lymphoma. In the United States, prior studies reported that African Americans (AA) with MF had poor outcomes. data characterizing differences in racial disparity outcomes over time are limited. Patients and Methods: We collected data from the United States Surveillance, Epidemiology, and End Results (SEER) database to investigate the survival patterns of patients with MF from 1988 to 2011. Cases were divided into 3 cohorts based on the year of diagnosis. Univariable and multivariable analysis were conducted to assess for factors associated with overall survival (OS). Results: 2896 cases of MF were detected, with a median follow-up duration of 60 months. The disparity in survival between the years 1988-1995 and 2004-2011 was significant (P = .05). The parameter estimates of the Cox proportional hazards model for the 1988-1995 period (using the 2004-2011 period as a reference) was also significant (P = .024). Patients diagnosed between 1988 and 1995 were 1.4 times more likely to die from the disease than those diagnosed between 2004 and 2011. The survival gap between AA and white patients narrowed in 1996-2003 and 2004-2011 in comparison to 1988-1995. This indicates improvements in the survival of AA patients over time. Conversely, the survival rates of white patients remained relatively stable over time. Conclusions: Our study demonstrates that AA with MF have reduced survival. Despite the persistent pattern of lower survival across all periods, the gap in survival between white and AA seems to be narrowing over time. © 2025 Elsevier Inc.

关键词： Cutaneous lymphoma Mycosis fungoides Outcome research Racial disparity SEER database

Gaussian polymer chains in a harmonic potential: The path integral approach

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Paradezhenko, G.V. Gascoigne, C. Brilliantov, N.V. Center for Computational and Data-Intensive Science and Engineering Skolkovo Institute of Science and Technology Moscow121205 Russia Department of Mathematical Sciences University of Bath Claverton Down BathBA2 7AY United Kingdom

We study conformations of the Gaussian polymer chains in d-dimensional space in the presence of an external field with the harmonic potential. We apply a path integral approach to derive an explicit expression for the probability distribution function of the gyration radius. We calculate this function using Monte Carlo simulations and show that our numerical and theoretical results are in a good agreement for different values of the external *** Codes 82D60, 82M31 Copyright © 2020, The Authors. All rights reserved.

关键词： Monte Carlo methods

Validating the predictions of mathematical models describing tumor growth and treatment response

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Lorenzo, Guillermo Hormuth, David A. Wu, Chengyue Pash, Graham Chaudhuri, Anirban Lima, Ernesto A.B.F. Okereke, Lois C. Patel, Reshmi Willcox, Karen Yankeelov, Thomas E. Group of Numerical Methods in Engineering Department of Mathematics University of A Coruña Spain Oden Institute for Computational Engineering and Sciences The University of Texas at Austin AustinTX United States Livestrong Cancer Institutes The University of Texas at Austin AustinTX United States Department of Imaging Physics The University of Texas MD Anderson Cancer Center HoustonTX United States Department of Breast Imaging The University of Texas MD Anderson Cancer Center HoustonTX United States Department of Biostatistics The University of Texas MD Anderson Cancer Center HoustonTX United States Institute for Data Science in Oncology The University of Texas MD Anderson Cancer Center HoustonTX United States Texas Advanced Computing Center The University of Texas at Austin AustinTX United States Department of Biomedical Engineering The University of Texas at Austin AustinTX United States Department of Diagnostic Medicine The University of Texas at Austin AustinTX United States Department of Oncology The University of Texas at Austin AustinTX United States

Despite advances in methods to interrogate tumor biology, the observational and population-based approach of classical cancer research and clinical oncology does not enable anticipation of tumor outcomes to hasten the discovery of cancer mechanisms and personalize disease management. To address these limitations, individualized cancer forecasts have been shown to predict tumor growth and therapeutic response, inform treatment optimization, and guide experimental efforts. These predictions are obtained via computer simulations of mathematical models that are constrained with data from a patient’s cancer and experiments. This book chapter addresses the validation of these mathematical models to forecast tumor growth and treatment response. We start with an overview of mathematical modeling frameworks, model selection techniques, and fundamental metrics. We then describe the usual strategies employed to validate cancer forecasts in preclinical and clinical scenarios. Finally, we discuss existing barriers in validating these predictions along with potential strategies to address them. © 2025, CC BY-NC-ND.

关键词： Prediction models

K-Core Decomposition on Super Large Graphs with Limited Resources

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Gao, Shicheng Xu, Jie Li, Xiaosen Fu, Fangcheng Zhang, Wentao Ouyang, Wen Tao, Yangyu Cui, Bin School of Electronic and Computer Engineering Shenzhen Graduate School Peking University China Tencent Inc. China Center for Data Science Peking University National Engineering Laboratory for Big Data Analysis and Applications China School of CS Key Laboratory of High Confidence Software Technologies Peking University China Institute of Computational Social Science Peking University Qingdao China

K-core decomposition is a commonly used metric to analyze graph structure or study the relative importance of nodes in complex graphs. Recent years have seen rapid growth in the scale of the graph, especially in industrial settings. For example, our industrial partner runs popular social applications with billions of users and is able to gather a rich set of user data. As a result, applying K-core decomposition on large graphs has attracted more and more attention from academics and the industry. A simple but effective method to deal with large graphs is to train them in the distributed settings, and some distributed K-core decomposition algorithms are also proposed. Despite their effectiveness, we experimentally and theoretically observe that these algorithms consume too many resources and become unstable on super-large-scale graphs, especially when the given resources are limited. In this paper, we deal with those super-large-scale graphs and propose a divide-and-conquer strategy on top of the distributed K-core decomposition algorithm. We evaluate our approach on three large graphs. The experimental results show that the consumption of resources can be significantly reduced, and the calculation on large-scale graphs becomes more stable than the existing methods. For example, the distributed K-core decomposition algorithm can scale to a large graph with 136 billion edges without losing correctness with our divide-and-conquer technique. Copyright © 2021, The Authors. All rights reserved.

关键词： Graphic methods

Dynamic prediction of mortality in COVID-19 patients in the intensive care unit: A retrospective multi-center cohort study

学校读者我要写书评

暂无评论

Intelligence-Based Medicine 2022年 6卷 100071-100071页

作者： Smit, J.M. Krijthe, J.H. Endeman, H. Tintu, A.N. de Rijke, Y.B. Gommers, D.A.M.P.J. Cremer, O.L. Bosman, R.J. Rigter, S. Wils, E.-J. Frenzel, T. Dongelmans, D.A. De Jong, R. Peters, M.A.A. Kamps, M.J.A. Ramnarain, D. Nowitzky, R. Nooteboom, F.G.C.A. De Ruijter, W. Urlings-Strop, L.C. Smit, E.G.M. Mehagnoul-Schipper, D.J. Dormans, T. De Jager, C.P.C. Hendriks, S.H.A. Achterberg, S. Oostdijk, E. Reidinga, A.C. Festen-Spanjer, B. Brunnekreef, G.B. Cornet, A.D. Van den Tempel, W. Boelens, A.D. Koetsier, P. Lens, J.A. Faber, H.J. karakus, A. Entjes, R. De Jong, P. Rettig, T.C.D. Arbous, M.S. Lalisang, R.C.A. Tonutti, M. De Bruin, D.P. Elbers, P.W.G. Van Bommel, J. Reinders, M.J.T. Intensive Care Erasmus University Medical Center Rotterdam Netherlands Pattern Recognition & Bioinformatics Group EEMCS Delft University of Technology Delft Netherlands Clinical Chemistry Erasmus University Medical Center Rotterdam Netherlands Intensive Care UMC Utrecht Utrecht Netherlands Intensive Care OLVG Amsterdam Netherlands Anesthesiology and Intensive Care St. Antonius Hospital Nieuwegein Netherlands Intensive Care Franciscus Gasthuis Vlietland Rotterdam Netherlands Intensive Care Radboud University Medical Center Nijmegen Netherlands Intensive Care Amsterdam UMC Amsterdam Netherlands Intensive Care Bovenij Ziekenhuis Amsterdam Netherlands Intensive Care Canisius Wilhelmina Ziekenhuis Nijmegen Netherlands Intensive Care Catharina Ziekenhuis Eindhoven Eindhoven Netherlands Intensive Care ETZ Tilburg Tilburg Netherlands Intensive Care HagaZiekenhuis Den Haag Netherlands Intensive Care Laurentius Ziekenhuis Roermond Netherlands Intensive Care Northwest Clinics Alkmaar Netherlands Intensive Care Reinier de Graaf Gasthuis Delft Netherlands Intensive Care Spaarne Gasthuis Haarlem en Hoofddorp Netherlands Intensive Care VieCuri Medisch Centrum Venlo Netherlands Intensive Care Zuyderland MC Heerlen Netherlands Intensive Care Jeroen Bosch Ziekenhuis 's-Hertogenbosch Netherlands Intensive Care Albert Schweitzerziekenhuis Dordrecht Netherlands Intensive Care Haaglanden Medisch Centrum Den Haag Netherlands Intensive Care Maasstad Ziekenhuis Rotterdam Rotterdam Netherlands Intensive Care SEH BWC Martiniziekenhuis Groningen Netherlands Intensive Care Ziekenhuis Gelderse Vallei Ede Netherlands Intensive Care Ziekenhuisgroep Twente Almelo Netherlands Intensive Care Medisch Spectrum Twente Enschede Netherlands Intensive Care Ikazia Ziekenhuis Rotterdam Rotterdam Netherlands Anesthesiology Antonius Ziekenhuis Sneek Sneek Netherlands Intensive Care Medisch Centrum Leeuwarden Leeuwarden Netherlands Intensive Care IJsselland Zieke

Background: The COVID-19 pandemic continues to overwhelm intensive care units (ICUs) worldwide, and improved prediction of mortality among COVID-19 patients could assist decision making in the ICU setting. In this work, we report on the development and validation of a dynamic mortality model specifically for critically ill COVID-19 patients and discuss its potential utility in the ICU. Methods: We collected electronic medical record (EMR) data from 3222 ICU admissions with a COVID-19 infection from 25 different ICUs in the Netherlands. We extracted daily observations of each patient and fitted both a linear (logistic regression) and non-linear (random forest) model to predict mortality within 24 h from the moment of prediction. Isotonic regression was used to re-calibrate the predictions of the fitted models. We evaluated the models in a leave-one-ICU-out (LOIO) cross-validation procedure. Results: The logistic regression and random forest model yielded an area under the receiver operating characteristic curve of 0.87 [0.85;0.88] and 0.86 [0.84;0.88], respectively. The recalibrated model predictions showed a calibration intercept of −0.04 [−0.12;0.04] and slope of 0.90 [0.85;0.95] for logistic regression model and a calibration intercept of −0.19 [−0.27;−0.10] and slope of 0.89 [0.84;0.94] for the random forest model. Discussion: We presented a model for dynamic mortality prediction, specifically for critically ill COVID-19 patients, which predicts near-term mortality rather than in-ICU mortality. The potential clinical utility of dynamic mortality models such as benchmarking, improving resource allocation and informing family members, as well as the development of models with more causal structure, should be topics for future research. © 2022 The Authors

关键词：

Momentum transfer dependence of kaon semileptonic form factor on (10 fm)4 at the physical point

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Yamazaki, Takeshi Ishikawa, Ken-Ichi Ishizuka, Naruhito Kuramashi, Yoshinobu Namekawa, Yusuke Taniguchi, Yusuke Ukita, Naoya Yoshié, Tomoteru Faculty of Pure and Applied Sciences University of Tsukuba Ibaraki Tsukuba305-8571 Japan Center for Computational Sciences University of Tsukuba Ibaraki Tsukuba305-8577 Japan Core of Research for the Energetic Universe Graduate School of Advanced Science and Engineering Hiroshima University Higashi-Hiroshima739-8526 Japan Education and Research Center for Artificial Intelligence and Data Innovation Hiroshima University Higashi-Hiroshima739-8521 Japan

We calculate the kaon semileptonic form factors using the two sets of the PACS10 configuration, whose physical volumes are more than (10 fm)4 at the physical point. The lattice spacings are 0.063 and 0.085 fm. The configurations were generated using the Iwasaki gauge action and Nf= 2 + 1 stout-smeared nonperturbatively O(A)-improved Wilson quark action. From the momentum transfer dependence of the form factors, we evaluate the slope and curvature for the form factors at the zero momentum transfer. Furthermore, we calculate the phase space factor, which is used to obtain |Vus| through the kaon semileptonic decay. These results are compared with previous lattice results and experimental values. Copyright © 2022, The Authors. All rights reserved.

关键词： Momentum transfer