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

12th International Conference on Learning Representations, ICLR 2024

作者： Caro, Josue Ortega de Fonseca, Antonio H. Rizvi, Syed A. Rosati, Matteo Averill, Christopher Cross, James L. Mittal, Prateek Zappala, Emanuele Dhodapkar, Rahul M. Abdallah, Chadi G. van Dijk, David Wu Tsai Institute United States Interdepartmental Neuroscience Program Yale University United States Baylor College of Medicine United States Department of Computer Science United States Yale School of Medicine United States University of Southern California United States Interdepartmental Program in Computational Biology & Bioinformatics United States Internal Medicine United States Cardiovascular Research Center Yale University United States Department of Mathematics and Statistics Idaho State University United States

We introduce the Brain Language Model (BrainLM), a foundation model for brain activity dynamics trained on 6,700 hours of fMRI recordings. Utilizing self-supervised masked-prediction training, BrainLM demonstrates proficiency in both fine-tuning and zero-shot inference tasks. Fine-tuning allows for the accurate prediction of clinical variables like age, anxiety, and PTSD as well as forecasting of future brain states. Critically, the model generalizes well to entirely new external cohorts not seen during training. In zero-shot inference mode, BrainLM can identify intrinsic functional networks directly from raw fMRI data without any network-based supervision during training. The model also generates interpretable latent representations that reveal relationships between brain activity patterns and cognitive states. Overall, BrainLM offers a versatile and interpretable framework for elucidating the complex spatiotemporal dynamics of human brain activity. It serves as a powerful "lens" through which massive repositories of fMRI data can be analyzed in new ways, enabling more effective interpretation and utilization at scale. The work demonstrates the potential of foundation models to advance computational neuroscience research. © 2024 12th International Conference on Learning Representations, ICLR 2024. All rights reserved.

关键词： Brain

来源：评论

学校读者我要写书评

暂无评论

Hyperbolic Diffusion Procrustes Analysis for Intrinsic Representation of Hierarchical Data Sets

Hyperbolic Diffusion Procrustes Analysis for Intrinsic Repre...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Ya-Wei Eileen Lin Yuval Kluger Ronen Talmon Viterbi Faculty of Electrical and Computer Engineering Technion Interdepartmental Program in Computational Biology and Bioinformatics Yale University Applied Math Program Yale University Department of Pathology School of Medicine Yale University

In this paper, we present Hyperbolic Diffusion Procrustes Analysis (HDPA), a new method for informative representation of hierarchical datasets based on hyperbolic geometry, diffusion geometry, and Procrustes analysis. Our method jointly embeds multiple datasets in a product manifold of hyperbolic spaces, where the data's hidden common hierarchical structure is provably recovered. In addition, our method generates an intrinsic embedding that accommodates the joint representation of multiple datasets with different features, acquired by different equipment, at different sites, or under different environmental conditions. Experimental results demonstrate the efficacy of HDPA on three biomedical datasets comprising heterogeneous gene expression and mass cytometry data.

关键词：

来源：评论

学校读者我要写书评

暂无评论

APIR:Aggregating Universal Proteomics Database Search Algorithms for Peptide Identification with FDR Control

引用

Genomics, Proteomics & bioinformatics 2024年第2期22卷 171-187页

作者： Yiling Elaine Chen Xinzhou Ge Kyla Woyshner MeiLu McDermott Antigoni Manousopoulou Scott B.Ficarro Jarrod A.Marto Kexin Li Leo David Wang Jingyi Jessica Li Department of Statistics and Data Science University of CaliforniaLos AngelesCA 90095USA Department of Immuno-Oncology Beckman Research InstituteCity of Hope National Medical CenterDuarteCA 91010USA Department of Quantitative and Computational Biology University of Southern CaliforniaLos AngelesCA 90089USA Department of Cancer Biology and Blais Proteomics Center Dana-Farber Cancer InstituteDepartment of PathologyBrigham and Women’s Hospital and Harvard Medical SchoolBostonMA 02215USA Department of Pediatrics City of Hope National Medical CenterDuarteCA 91010USA Bioinformatics Interdepartmental Program University of CaliforniaLos AngelesCA 90095USA Department of Human Genetics University of CaliforniaLos AngelesCA 90095USA Department of Computational Medicine University of CaliforniaLos AngelesCA 90095USA Department of Biostatistics University of CaliforniaLos AngelesCA 90095USA

Advances in mass spectrometry(MS)have enabled high-throughput analysis of proteomes in biological *** state-of-the-art MS data analysis relies on database search algorithms to quantify proteins by identifying peptide–spectrum matches(PSMs),which convert mass spectra to peptide *** database search algorithms use distinct search strategies and thus may identify unique ***,no existing approaches can aggregate all user-specified database search algorithms with a guaranteed increase in the number of identified peptides and a control on the false discovery rate(FDR).To fill in this gap,we proposed a statistical framework,Aggregation of Peptide Identification Results(APIR),that is universally compatible with all database search ***,under an FDR threshold,APIR is guaranteed to identify at least as many,if not more,peptides as individual database search algorithms *** of APIR on a complex proteomics standard dataset showed that APIR outpowers individual database search algorithms and empirically controls the *** data studies showed that APIR can identify disease-related proteins and post-translational modifications missed by some individual database search *** APIR framework is easily extendable to aggregating discoveries made by multiple algorithms in other high-throughput biomedical data analysis,e.g.,differential gene expression analysis on RNA sequencing *** APIR R package is available at https://***/yiling0210/APIR.

关键词： Shotgun proteomics Peptide–spectrum match Peptide identification Aggregation of lists FDR control

来源：评论

学校读者我要写书评

暂无评论

Pre-Training Genomic Language Model with Variants for Better Modeling Functional Genomics

SSRN

引用

SSRN 2025年

作者： Liu, Tianyu Zhang, Xiangyu Ying, Rex Zhao, Hongyu Interdepartmental Program in Computational Biology & Bioinformatics Yale University New HavenCT06511 United States Department of Biostatistics Yale University New HavenCT06511 United States Department of Computer Science Yale University New HavenCT06511 United States

Sequence-to-function models can predict gene expression from sequence data and be used to link genetic information with transcriptomics data to understand regulatory processes and their effects on complex phenotypes. The genomic language models are pre-trained with large-scale DNA sequences and can generate robust representations of these sequences by learning the genomic context. However, few studies can estimate the predictability of gene expression levels and bridge these two classes of models together to explore individualized gene expression prediction. In this manuscript, we propose UKBioBERT as a DNA language model pre-trained with genetic variants from UK BioBank. We demonstrate that UKBioBERT generates informative embeddings capable of identifying gene functions, and improving gene expression prediction in cell lines, thereby enhancing our understanding of gene expression predictability. Building upon these embeddings, we combine UKBioBERT with state-of-the-art sequence-to-function architectures, Enformer and Borzoi, to create UKBioFormer and UKBioZoi. These models exhibit better performance in predicting highly predictable gene expression levels and can be generalized across different cohorts. Furthermore, UKBioFormer effectively captures the relationship between genetic variants and expression variations, enabling in-silico mutation analyses. Collectively, our findings underscore the value of integrating genomic language models and sequence-to-function approaches for advancing functional genomics research. © 2025, The Authors. All rights reserved.

关键词： Genome

来源：评论

学校读者我要写书评

暂无评论

Entropic Optimal Transport Eigenmaps for Nonlinear Alignment and Joint Embedding of High-Dimensional Datasets

arXiv

引用

arXiv 2024年

作者： Landa, Boris Kluger, Yuval Ma, Rong Department of Electrical Engineering Yale University United States Program in Applied Mathematics Yale University United States Department of Biostatistics Harvard University United States Interdepartmental Program in Computational Biology and Bioinformatics Yale University United States Department of Pathology Yale University School of Medicine United States

Embedding high-dimensional data into a low-dimensional space is an indispensable component of data analysis. In numerous applications, it is necessary to align and jointly embed multiple datasets from different studies or experimental conditions. Such datasets may share underlying structures of interest but exhibit individual distortions, resulting in misaligned embeddings using traditional techniques. In this work, we propose Entropic Optimal Transport (EOT) eigenmaps, a principled approach for aligning and jointly embedding a pair of datasets with theoretical guarantees. Our approach leverages the leading singular vectors of the EOT plan matrix between two datasets to extract their shared underlying structure and align the datasets accordingly in a common embedding space. We interpret our approach as an inter-data variant of the classical Laplacian eigenmaps and diffusion maps embeddings, showing that it enjoys many favorable analogous properties. We then analyze a data-generative model where two observed high-dimensional datasets share latent variables on a common low-dimensional manifold, but each dataset is subject to data-specific translation, scaling, nuisance structures, and noise. We show that in a high-dimensional asymptotic regime, the EOT plan recovers the shared manifold structure by approximating a kernel function evaluated at the locations of the latent variables. Subsequently, we provide a geometric interpretation of our embedding by relating it to the eigenfunctions of population-level operators encoding the density and geometry of the shared manifold. Finally, we showcase the performance of our approach for data integration and embedding through simulations and analyses of real-world biological data, demonstrating its advantages over alternative methods in challenging scenarios. Copyright © 2024, The Authors. All rights reserved.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Learning Multi-cellular Representations of Single-Cell Transcriptomics Data Enables Characterization of Patient-Level Disease States 29th

Learning Multi-cellular Representations of Single-Cell Tran...

引用

29th International Conference on Research in computational Molecular biology, RECOMB 2025

作者： Liu, Tianyu De Brouwer, Edward Kuo, Tony Diamant, Nathaniel Missarova, Alsu Wang, Hanchen Hao, Minsheng Bravo, Hector Corrada Scalia, Gabriele Regev, Aviv Heimberg, Graham Research and Early Development Genentech South San FranciscoCA94080 United States Interdepartmental Program in Computational Biology and Bioinformatics Yale University New HavenCT06511 United States Roche Informatics F. Hoffmann-La Roche Ltd. Mississauga Canada Department of Computer Science Stanford University Palo AltoCA94035 United States

ISBN: (纸本)9783031902512

Single-cell RNA-seq (scRNA-seq) has become a prominent tool for studying human biology and disease. The availability of massive scRNA-seq datasets and advanced machine learning techniques has recently driven the development of single-cell foundation models that provide informative and versatile cell representations based on expression profiles. However, to understand disease states, we need to consider entire tissue ecosystems, simultaneously considering many different interacting cells. Here, we tackle this challenge by generating patient-level representations derived from multi-cellular expression context measured with scRNA-seq of tissues. We develop PaSCient, a novel model that employs a multi-level representation learning paradigm and provides importance scores at the individual cell and gene levels for fine-grained analysis across multiple cell types and gene programs characteristic of a given disease. We apply PaSCient to learn a disease model across a large-scale scRNA-seq atlas of 12.5 million cells from over 2,700 patients. Comprehensive and rigorous benchmarking demonstrates the superiority of PaSCient in disease classification and its multiple downstream applications, including dimensionality reduction, gene/cell type prioritization, and patient subgroup discovery. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Biomolecules

来源：评论

学校读者我要写书评

暂无评论

Continuous Spatiotemporal Transformers

arXiv

引用

arXiv 2023年

作者： de Oliveira Fonseca, Antonio Henrique Zappala, Emanuele Caro, Josue Ortega van Dijk, David Interdepartmental Neuroscience Program Yale University New HavenCT United States Department of Computer Science Yale University New HavenCT United States Department of Neuroscience Yale University New HavenCT United States Wu Tsai Institute Yale University New HavenCT United States Yale University New HavenCT United States Interdepartmental Program in Computational Biology & Bioinformatics Yale University New HavenCT United States

Modeling spatiotemporal dynamical systems is a fundamental challenge in machine learning. Transformer models have been very successful in NLP and computer vision where they provide interpretable representations of data. However, a limitation of transformers in modeling continuous dynamical systems is that they are fundamentally discrete time and space models and thus have no guarantees regarding continuous sampling. To address this challenge, we present the Continuous Spatiotemporal Transformer (CST), a new transformer architecture that is designed for modeling of continuous systems. This new framework guarantees a continuous and smooth output via optimization in Sobolev space. We benchmark CST against traditional transformers as well as other spatiotemporal dynamics modeling methods and achieve superior performance in a number of tasks on synthetic and real systems, including learning brain dynamics from calcium imaging data. © 2023, CC BY-NC-SA.

关键词： Sobolev spaces

来源：评论

学校读者我要写书评

暂无评论

Hyperbolic procrustes analysis using riemannian geometry 21

Hyperbolic procrustes analysis using riemannian geometry

引用

Proceedings of the 35th International Conference on Neural Information Processing Systems

作者： Ya-Wei Eileen Lin Yuval Kluger Ronen Talmon Viterbi Faculty of Electrical and Computer Engineering Technion Program in Applied Mathematics Yale University and Interdepartmental Program in Computational Biology and Bioinformatics Yale University and Department of Pathology Yale University

ISBN: (纸本)9781713845393

Label-free alignment between datasets collected at different times, locations, or by different instruments is a fundamental scientific task. Hyperbolic spaces have recently provided a fruitful foundation for the development of informative representations of hierarchical data. Here, we take a purely geometric approach for label-free alignment of hierarchical datasets and introduce hyperbolic Procrustes analysis (HPA). HPA consists of new implementations of the three prototypical Procrustes analysis components: translation, scaling, and rotation, based on the Riemannian geometry of the Lorentz model of hyperbolic space. We analyze the proposed components, highlighting their useful properties for alignment. The efficacy of HPA, its theoretical properties, stability and computational efficiency are demonstrated in simulations. In addition, we showcase its performance on three batch correction tasks involving gene expression and mass cytometry data. Specifically, we demonstrate high-quality unsupervised batch effect removal from data acquired at different sites and with different technologies that outperforms recent methods for label-free alignment in hyperbolic spaces.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Biwhitening reveals the rank of a count matrix

arXiv

引用

arXiv 2021年

作者： Landa, Boris Zhang, Thomas T.C.K. Kluger, Yuval Program in Applied Mathematics Yale University United States Department of Electrical and Systems Engineering University of Pennsylvania United States Interdepartmental Program in Computational Biology and Bioinformatics Yale University United States Department of Pathology Yale University School of Medicine United States

Estimating the rank of a corrupted data matrix is an important task in data analysis, most notably for choosing the number of components in PCA. Significant progress on this task was achieved using random matrix theory by characterizing the spectral properties of large noise matrices. However, utilizing such tools is not straightforward when the data matrix consists of count random variables, e.g., Poisson, in which case the noise can be heteroskedastic with an unknown variance in each entry. In this work, we consider a Poisson random matrix with independent entries, and propose a simple procedure termed biwhitening for estimating the rank of the underlying signal matrix (i.e., the Poisson parameter matrix) without any prior knowledge. Our approach is based on the key observation that one can scale the rows and columns of the data matrix simultaneously so that the spectrum of the corresponding noise agrees with the standard Marchenko-Pastur (MP) law, justifying the use of the MP upper edge as a threshold for rank selection. Importantly, the required scaling factors can be estimated directly from the observations by solving a matrix scaling problem via the Sinkhorn-Knopp algorithm. Aside from the Poisson, our approach is extended to families of distributions that satisfy a quadratic relation between the mean and the variance, such as the generalized Poisson, binomial, negative binomial, gamma, and many others. This quadratic relation can also account for missing entries in the data. We conduct numerical experiments that corroborate our theoretical findings, and showcase the advantage of our approach for rank estimation in challenging regimes. Furthermore, we demonstrate the favorable performance of our approach on several real datasets of single-cell RNA sequencing (scRNA-seq), High-Throughput Chromosome Conformation Capture (Hi-C), and document topic *** Codes 62H12, 62H25. Copyright © 2021, The Authors. All rights reserved.

关键词： Random variables

来源：评论

学校读者我要写书评

暂无评论

Doubly-stochastic normalization of the Gaussian kernel is robust to heteroskedastic noise

arXiv

引用

arXiv 2020年

作者： Landa, Boris Coifman, Ronald R. Kluger, Yuval Program in Applied Mathematics Yale University Interdepartmental Program in Computational Biology and Bioinformatics Yale University Department of Pathology Yale University School of Medicine

A fundamental step in many data-analysis techniques is the construction of an affinity matrix describing similarities between data points. When the data points reside in Euclidean space, a widespread approach is to from an affinity matrix by the Gaussian kernel with pairwise distances, and to follow with a certain normalization (e.g. the row-stochastic normalization or its symmetric variant). We demonstrate that the doubly-stochastic normalization of the Gaussian kernel with zero main diagonal (i.e. no self loops) is robust to heteroskedastic noise. That is, the doubly-stochastic normalization is advantageous in that it automatically accounts for observations with different noise variances. Specifically, we prove that in a suitable high-dimensional setting where heteroskedastic noise does not concentrate too much in any particular direction in space, the resulting (doubly-stochastic) noisy affinity matrix converges to its clean counterpart with rate m−1/2, where m is the ambient dimension. We demonstrate this result numerically, and show that in contrast, the popular row-stochastic and symmetric normalizations behave unfavourably under heteroskedastic noise. Furthermore, we provide a prototypical example of simulated single-cell RNA sequence data with strong intrinsic heteroskedasticity, where the advantage of the doubly-stochastic normalization for exploratory analysis is evident. Copyright © 2020, The Authors. All rights reserved.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：