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

arXiv 2022年

作者： Abiad, Aida de Lima, Leonardo Kalantarzadeh, Sina Mohammadi, Mona Oliveira, Carla Department of Mathematics and Computer Science Eindhoven University of Technology Netherlands Department of Mathematics: Analysis Logic and Discrete Mathematics Ghent University Belgium Department of Mathematics and Data Science Vrije Universiteit Brussel Belgium Graduate Program in Mathematics Federal University of Parana Curitiba Brazil Sharif University of Technology Iran Department of Mathematical National School of Statistical Sciences Rio de Janeiro Brazil

关键词： Eigenvalues and eigenfunctions

来源：评论

学校读者我要写书评

暂无评论

SUPP & MAPP: ADAPTABLE STRUCTURE-BASED REPRESENTATIONS FOR MIR TASKS 21

SUPP & MAPP: ADAPTABLE STRUCTURE-BASED REPRESENTATIONS FOR M...

引用

21st International Society for Music Information Retrieval Conference, ISMIR 2020

作者： Savard, Claire Bugbee, Erin H. McGuirl, Melissa R. Kinnaird, Katherine M. Department of Physics University of Colorado Boulder United States Department of Biostatistics Brown University United States Division of Applied Mathematics Brown University United States Department of Computer Science and Program in Statistical and Data Sciences Smith College United States

ISBN: (纸本)9780981353708

Accurate and flexible representations of music data are paramount to addressing MIR tasks, yet many of the existing approaches are difficult to interpret or rigid in nature. This work introduces two new song representations for structure-based retrieval methods: Surface Pattern Preservation (SuPP), a continuous song representation, and Matrix Pattern Preservation (MaPP), SuPP’s discrete counterpart. These representations come equipped with several user-defined parameters so that they are adaptable for a range of MIR tasks. Experimental results show MaPP as successful in addressing the cover song task on a set of Mazurka scores, with a mean precision of 0.965 and recall of 0.776. SuPP and MaPP also show promise in other MIR applications, such as novel-segment detection and genre classification, the latter of which demonstrates their suitability as inputs for machine learning problems. © Claire Savard, Erin H. Bugbee, Melissa R. McGuirl, Katherine M. Kinnaird.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

Cell2Sentence: Teaching Large Language Models the Language of Biology 41

Cell2Sentence: Teaching Large Language Models the Language o...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Levine, Daniel Rizvi, Syed Asad Lévy, Sacha Pallikkavaliyaveetil, Nazreen Zhang, David Chen, Xingyu Ghadermarzi, Sina Wu, Ruiming Zheng, Zihe Vrkic, Ivan Zhong, Anna Raskin, Daphne Han, Insu de Oliveira Fonseca, Antonio Henrique Caro, Josue Ortega Karbasi, Amin Dhodapkar, Rahul M. van Dijk, David Department of Computer Science Yale University New HavenCT United States School of Engineering Applied Science University of Pennsylvania PhiladelphiaPA United States School of Computer and Communication Sciences Swiss Federal Institute of Technology Lausanne Lausanne Switzerland Department of Neuroscience Yale School of Medicine New HavenCT United States Wu Tsai Institute Yale University New HavenCT United States Google United States Yale Institute for Foundations of Data Science New HavenCT United States Yale School of Engineering and Applied Science New HavenCT United States Roski Eye Institute University of Southern California Los AngelesCA United States Yale School of Medicine New HavenCT United States Cardiovascular Research Center Yale School of Medicine New HavenCT United States Interdepartmental Program in Computational Biology & Bioinformatics Yale University New HavenCT United States

We introduce Cell2Sentence (C2S), a novel method to directly adapt large language models to a biological context, specifically single-cell transcriptomics. By transforming gene expression data into"cell sentences," C2S bridges the gap between natural language processing and biology. We demonstrate cell sentences enable the finetuning of language models for diverse tasks in biology, including cell generation, complex cell-type annotation, and direct data-driven text generation. Our experiments reveal that GPT-2, when fine-tuned with C2S, can generate biologically valid cells based on cell type inputs, and accurately predict cell types from cell sentences. This illustrates that language models, through C2S finetuning, can acquire a significant understanding of single-cell biology while maintaining robust text generation capabilities. C2S offers a flexible, accessible framework to integrate natural language processing with transcriptomics, utilizing existing models and libraries for a wide range of biological applications. Copyright 2024 by the author(s)

关键词： Gene expression

来源：评论

学校读者我要写书评

暂无评论

Improving Incremental Learning: A Closer Look at the Softmax Function

SSRN

引用

SSRN 2024年

作者： Zhai, Zheng Zhang, Jiali Wang, Haiyu Wu, Mingxin Yang, Keshun Qiao, Xiaoyan Sun, Qiang Beijing Normal University No.18 Jinfeng Road Guangdong Zhuhai519087 China Shandong Technology and Business University Shandong Yantai China Yantai Key Laboratory of Big Data Modeling and Intelligent Computing Shandong China Immersion Technology and Evaluation Shandong Engineering Research Center Shandong China School of Mathematics Sichuan University Chengdu China College of Liberal Arts and Sciences University of Illinois Urbana-Champaign IL United States Department of Statistical Sciences University of Toronto ON Canada Department of Computer Science University of Toronto ON Canada Department of Statistics and Data Science MBZUAI Abu Dhabi United Arab Emirates

This paper investigates the limitations of the widely adopted softmax cross-entropy loss in incremental learning problems. Specifically, we highlight how the shift-invariant property of this loss function can lead to multiple optimal solutions and imbalanced weights across different tasks, which exacerbates catastrophic forgetting. To address these issues, we propose two key modifications to the objective function: (1) regularizing or replacing the original joint distillation loss with a summation of task-specific distillation losses, and/or (2) utilizing a shift-sensitive prediction loss function, such as the binary cross-entropy loss. Numerical experiments validate the effectiveness of these proposals, demonstrating improved prediction accuracy and a significant reduction in forgetting. © 2024, The Authors. All rights reserved.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Bayesian multinomial logistic normal models through marginally latent matrix-T processes

The Journal of Machine Learning Research

引用

The Journal of Machine Learning Research 2022年第1期23卷 255-296页

作者： Justin D. Silverman Kimberly Roche Zachary C. Holmes Lawrence A. David Sayan Mukherjee College of Information Science and Technology Department of Statistics and Institute for Computational and Data Science Penn State University University Park PA Program in Computational Biology and Bioinformatics Duke University Durham NC Department of Molecular Genetics and Microbiology Duke University Durham NC Department of Molecular Genetics and Microbiology and Center for Genomic and Computational Biology Duke University Durham NC Departments of Statistical Science Mathematics Computer Science Biostatistics & Bioinformatics Duke University Durham NC

Bayesian multinomial logistic-normal (MLN) models are popular for the analysis of sequence count data (e.g., microbiome or gene expression data) due to their ability to model multivariate count data with complex covariance structure. However, existing implementations of MLN models are limited to small datasets due to the non-conjugacy of the multinomial and logistic-normal distributions. Motivated by the need to develop efficient inference for Bayesian MLN models, we develop two key ideas. First, we develop the class of Marginally Latent Matrix-T Process (Marginally LTP) models. We demonstrate that many popular MLN models, including those with latent linear, non-linear, and dynamic linear structure are special cases of this class. Second, we develop an efficient inference scheme for Marginally LTP models with specific accelerations for the MLN subclass. Through application to MLN models, we demonstrate that our inference scheme are both highly accurate and often 4-5 orders of magnitude faster than MCMC.

关键词： Bayesian statistics multivariate analysis count data microbiome gene expression

来源：评论

学校读者我要写书评

暂无评论

Position: Bayesian deep learning is needed in the age of large-scale AI 24

Position: Bayesian deep learning is needed in the age of lar...

引用

Proceedings of the 41st International Conference on Machine Learning

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

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Sequential Markov Chain Monte Carlo for Lagrangian data Assimilation with Applications to Unknown data Locations

arXiv

引用

arXiv 2023年

作者： Ruzayqat, Hamza Beskos, Alexandros Crisan, Dan Jasra, Ajay Kantas, Nikolas Applied Mathematics and Computational Science Program Computer Electrical and Mathematical Sciences and Engineering Division King Abdullah University of Science and Technology Thuwal23955-6900 Saudi Arabia Department of Statistical Science University College London LondonWC1E 6BT United Kingdom Department of Mathematics Imperial College London LondonSW7 2AZ United Kingdom

We consider a class of high-dimensional spatial filtering problems, where the spatial locations of observations are unknown and driven by the partially observed hidden signal. This problem is exceptionally challenging as not only is high-dimensional, but the model for the signal yields longer-range time dependencies through the observation locations. Motivated by this model we revisit a lesser-known and provably convergent computational methodology from [4, 11, 28] that uses sequential Markov Chain Monte Carlo (MCMC) chains. We extend this methodology for data filtering problems with unknown observation locations. We benchmark our algorithms on Linear Gaussian state space models against competing ensemble methods and demonstrate a significant improvement in both execution speed and accuracy. Finally, we implement a realistic case study on a high-dimensional rotating shallow water model (of about 104 - 105 dimensions) with real and synthetic data. The data is provided by the National Oceanic and Atmospheric Administration (NOAA) and contains observations from ocean drifters in a domain of the Atlantic Ocean restricted to the longitude and latitude intervals [-51◦,-41◦], [17◦,27◦] *** Codes 62M20, 60G35, 60J20, 94A12, 93E11, 65C40 © 2023, CC BY.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

Asymptotics of Bayesian Uncertainty Estimation in Random Features Regression

arXiv

引用

arXiv 2023年

作者： Baek, Youngsoo Berchuck, Samuel I. Mukherjee, Sayan Department of Statistical Science Duke University DurhamNC27705 United States Department of Biostatistics & Bioinformatics Duke University DurhamNC27705 United States Center for Scalable Data Analysis and Artificial Intelligence Universität Leipzig Leipzig04105 Germany Deparments of Mathematics Computer Science Biostatistics & Bioinformatics Duke University NC United States Max Planck Institute for Mathematics in the Sciences Leipzig Germany

In this paper, we compare and contrast the behavior of the posterior predictive distribution to the risk of the maximum a posteriori (MAP) estimator for the random features regression model in the overparameterized regime. We will focus on the variance of the posterior predictive distribution (Bayesian model average) and compare its asymptotics to that of the risk of the MAP estimator. In the regime where the model dimensions grow faster than any constant multiple of the number of samples, asymptotic agreement between these two quantities is governed by the phase transition in the signal-to-noise ratio. They also asymptotically agree with each other when the number of samples grows faster than any constant multiple of model dimensions. Numerical simulations illustrate finer distributional properties of the two quantities for finite dimensions. We conjecture they have Gaussian fluctuations and exhibit similar properties as found by previous authors in a Gaussian sequence model, which is of independent theoretical interest. © 2023, CC BY.

关键词： Signal to noise ratio

来源：评论

学校读者我要写书评

暂无评论

Cell2Sentence: teaching large language models the language of biology 24

Cell2Sentence: teaching large language models the language o...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Daniel Levine Syed Asad Rizvi Sacha Lévy Nazreen Pallikkavaliyaveetil David Zhang Xingyu Chen Sina Ghadermarzi Ruiming Wu Zihe Zheng Ivan Vrkic Anna Zhong Daphne Raskin Insu Han Antonio Henrique De Oliveira Fonseca Josue Ortega Caro Amin Karbasi Rahul M. Dhodapkar David Van Dijk Department of Computer Science Yale University New Haven CT School of Engineering Applied Science University of Pennsylvania Philadelphia PA School of Computer and Communication Sciences Swiss Federal Institute of Technology Lausanne Lausanne Switzerland Department of Computer Science Yale University New Haven CT and Department of Neuroscience Yale School of Medicine New Haven CT Department of Computer Science Yale University New Haven CT and Department of Neuroscience Yale School of Medicine New Haven CT and Wu Tsai Institute Yale University New Haven CT Google and Yale Institute for Foundations of Data Science New Haven CT and Department of Computer Science Yale University New Haven CT and Yale School of Engineering and Applied Science New Haven CT Roski Eye Institute University of Southern California Los Angeles CA and Department of Internal Medicine (Cardiology) Yale School of Medicine New Haven CT Department of Computer Science Yale University New Haven CT and Yale Institute for Foundations of Data Science New Haven CT and Wu Tsai Institute Yale University New Haven CT and Cardiovascular Research Center Yale School of Medicine New Haven CT and Interdepartmental Program in Computational Biology & Bioinformatics Yale University New Haven CT and Department of Internal Medicine (Cardiology) Yale School of Medicine New Haven CT

We introduce Cell2Sentence (C2S), a novel method to directly adapt large language models to a biological context, specifically single-cell transcriptomics. By transforming gene expression data into "cell sentences," C2S bridges the gap between natural language processing and biology. We demonstrate cell sentences enable the fine-tuning of language models for diverse tasks in biology, including cell generation, complex cell-type annotation, and direct data-driven text generation. Our experiments reveal that GPT-2, when fine-tuned with C2S, can generate biologically valid cells based on cell type inputs, and accurately predict cell types from cell sentences. This illustrates that language models, through C2S fine-tuning, can acquire a significant understanding of single-cell biology while maintaining robust text generation capabilities. C2S offers a flexible, accessible framework to integrate natural language processing with transcriptomics, utilizing existing models and libraries for a wide range of biological applications.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Explainable machine learning models for estimating daily dissolved oxygen concentration of the Tualatin River

引用

Engineering Applications of Computational Fluid Mechanics 2024年第1期18卷

作者： Li, Shuguang Qasem, Sultan Noman Band, Shahab S. Ameri, Rasoul Pai, Hao-Ting Mehdizadeh, Saeid School of Computer Science and Technology Shandong Technology and Business University Yantai China Computer Science Department College of Computer and Information Sciences Imam Mohammad Ibn Saud Islamic University (IMSIU) Riyadh Saudi Arabia Computer Science Department Faculty of Applied Science Taiz University Taiz Yemen Future Technology Research Center National Yunlin University of Science and Technology Douliu Taiwan Department of Information Management International Graduate School of Artificial Intelligence National Yunlin University of Science and Technology Douliu Taiwan Department of Information Management National Yunlin University of Science and Technology Douliu Taiwan Bachelor Program of Big Data Applications in Business National Pingtung University Pingtung Taiwan Water Engineering Department Urmia University Urmia Iran

Monitoring the quality of river water is of fundamental importance and needs to be taken into consideration when it comes to the research into the hydrological field. In this context, the concentration of the dissolved oxygen (DO) is one of the most significant indicators of the quality of river water. The current study aimed to estimate the minimum, maximum, and mean DO concentrations (DO min, DO max, DO mean) at a gauging station located on Tualatin River, United States. To that end, four machine learning models, such as support vector regression (SVR), multi-layer perceptron (MLP), random forest (RF), and gradient boosting (GB) were established. Root mean square error (RMSE), mean absolute error (MAE), coefficient of correlation (R), and Nash-Sutcliffe efficiency (NSE) metrics were employed to better assess the accuracies of these models. The modeling results demonstrated that the SVR and MLP surpassed the RF and GB models. Despite this, the SVR was concluded to be the best-performing method when used to estimate the DO min, DO max, and DO mean. The best error statistics in the testing phase were related to the SVR model with full (four) inputs to estimate DO mean concentration (RMSE = 0.663 mg/l, MAE = 0.508 mg/l, R = 0.945, NSE = 0.875). Finally, the explainability of the superior models (i.e. SVR models) was conducted using SHapley Additive exPlanations (SHAP) for the first time to estimate DO concentration. In fact, evaluating the explainability of machine learning models can provide useful information about the impact of each of the input estimators used in the procedure of models development. It was concluded that the specific conductance (SC) and followed by water temperature (WT) could provide the most contributions for estimating the DO min, DO max, and DO mean concentrations. © 2024 The Author(s). Published by Informa UK Limited, trading as Taylor & Francis Group.

关键词： dissolved oxygen concentration estimation Explainable machine learning SHapley additive explanations

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：