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

19th International Meeting on Computational Intelligence Methods for Bioinformatics and Biostatistics, CIBB 2024

作者： Hannemann, Anika Swaminathan, Arjhun Ünal, Ali Burak Akgün, Mete Department of Computer Science Leipzig University Leipzig Germany Center for Scalable Data Analytics and Artificial Intelligence (ScaDS.AI) Dresden/Leipzig Germany Medical Data Privacy and Privacy-preserving Machine Learning (MDPPML) University of Tübingen Tübingen Germany Institute for Bioinformatics and Medical Informatics (IBMI) University of Tübingen Tübingen Germany

ISBN: (纸本)9783031897030

Medical imaging is key in modern medicine. From magnetic resonance imaging (MRI) to microscopic imaging for blood cell detection, diagnostic medical imaging reveals vital insights into patient health. To predict diseases or provide individualized therapies, machine learning techniques like kernel methods have been widely used. Nevertheless, there are multiple challenges for implementing kernel methods. Medical image data often originates from various hospitals and cannot be combined due to privacy concerns, and the high dimensionality of image data presents another significant obstacle. While randomised encoding offers a promising direction, existing methods often struggle with a trade-off between accuracy and efficiency. Addressing the need for efficient privacy-preserving methods on distributed image data, we introduce OKRA (Orthonormal K-fRAmes), a novel randomized encoding-based approach for kernel-based machine learning. This technique, tailored for widely used kernel functions, significantly enhances scalability and speed compared to current state-of-the-art solutions. Through experiments conducted on various clinical image datasets, we evaluated model quality, computational performance, and resource overhead. Additionally, our method outperforms comparable approaches. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Distributed learning Kernel Methods machine learning Medical Images Privacy

来源：评论

学校读者我要写书评

暂无评论

Contrastive learning for Adapting Language Model to Sequential Recommendation 24

Contrastive Learning for Adapting Language Model to Sequenti...

引用

24th IEEE International Conference on data Mining, ICDM 2024

作者： Liang, Fei-Yao Xi, Wu-Dong Xing, Xing-Xing Wan, Wei Wang, Chang-Dong Chen, Min Guizani, Mohsen School of Computer Science and Engineering Sun Yat-sen University Guangzhou China NetEase Games China UX Center NetEase Games Guangzhou China Guangdong Provincial Key Laboratory of Intellectual Property and Big Data Guangzhou China School of Computer Science and Engineering South China University of Technology Guangzhou China Pazhou Laboratory Guangzhou China Machine Learning Department Abu Dhabi United Arab Emirates

ISBN: (纸本)9798331506681

With the explosive growth of information, recommendation systems have emerged to alleviate the problem of information overload. In order to improve the performance of recommendation systems, many existing methods introduce Large Language Models to extract textual information from description text. However, Large Language Models are trained on large-scale generic textual data and may face a semantic gap for downstream recommendation tasks. To address the above issues, we propose Contrastive learning for Adapting Language Model to Sequential Recommendation (CLA-Rec). In CLA-Rec, we first extract text embeddings from description text using Large Language Models and align the text embeddings learned by Large Language Models with the collaborative information through contrastive learning to obtain high-quality item representations. Through semantic alignment, we bridge the semantic gap between Large Language Models and the recommendation task. To map textual information and collaborative information into user representations, we utilize a Transformer model to learn user representations and capture user preferences by combining the semantically aligned item representations. Extensive experiments on three public datasets demonstrate that our method outperforms state-of-the-art approaches on multiple evaluation metrics, illustrating the effectiveness of the CLA-Rec model in adapting Large Language Models to recommendation tasks. © 2024 IEEE.

关键词： Contrastive learning

来源：评论

学校读者我要写书评

暂无评论

The challenges of the nonlinear regime for physics-informed neural networks 24

The challenges of the nonlinear regime for physics-informed ...

引用

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

作者： Andrea Bonfanti Giuseppe Bruno Cristina Cipriani BMW AG Digital Campus Munich Basque Center for Applied Mathematics University of the Basque Country BMW AG Digital Campus Munich Technical University of Munich Munich Center for Machine Learning Munich Data Science Institute

ISBN: (纸本)9798331314385

The Neural Tangent Kernel (NTK) viewpoint is widely employed to analyze the training dynamics of overparameterized Physics-Informed Neural Networks (PINNs). However, unlike the case of linear Partial Differential Equations (PDEs), we show how the NTK perspective falls short in the nonlinear scenario. Specifically, we establish that the NTK yields a random matrix at initialization that is not constant during training, contrary to conventional belief. Another significant difference from the linear regime is that, even in the idealistic infinite-width limit, the Hessian does not vanish and hence it cannot be disregarded during training. This motivates the adoption of second-order optimization methods. We explore the convergence guarantees of such methods in both linear and nonlinear cases, addressing challenges such as spectral bias and slow convergence. Every theoretical result is supported by numerical examples with both linear and nonlinear PDEs, and we highlight the benefits of second-order methods in benchmark test cases.

关键词：

来源：评论

学校读者我要写书评

暂无评论

RecCoder: Reformulating Sequential Recommendation as Large Language Model-Based Code Completion 24

RecCoder: Reformulating Sequential Recommendation as Large L...

引用

24th IEEE International Conference on data Mining, ICDM 2024

作者： Lai, Kai-Huang Xi, Wu-Dong Xing, Xing-Xing Wan, Wei Wang, Chang-Dong Chen, Min Guizani, Mohsen School of Computer Science and Engineering Sun Yat-sen University Guangzhou China NetEase Games China UX Center NetEase Games Guangzhou China Guangdong Provincial Key Laboratory of Intellectual Property and Big Data Guangzhou China School of Computer Science and Engineering South China University of Technology Guangzhou China Pazhou Laboratory Guangzhou China Machine Learning Department Abu Dhabi United Arab Emirates

ISBN: (纸本)9798331506681

In the evolving landscape of sequential recommendation systems, the application of Large Language Models (LLMs) is increasingly prominent. However, current attempts typically utilize general-purpose LLMs, which present a mismatch in capability and a large semantic gap relative to the specialized needs of recommendation tasks. To tackle these issues, we introduce RecCoder, an innovative model that reformulates sequential recommendation as a code completion task. This approach leverages the superior reasoning capability of code LLMs as a backbone, aligning well with the requirements of recommendation systems. To bridge the semantic gap, RecCoder creates extra tokens for each item and employs item content to initialize token embeddings. Furthermore, we have developed a suite of Semantic Adaptation Fine-tuning tasks, tailored to enhance the model's acquisition of both content and collaborative semantic information, thus aligning the model's intrinsic capabilities with the unique demands of recommendation tasks. Through extensive testing on three public datasets, RecCoder has shown remarkable improvements over existing models in terms of recommendation accuracy and efficiency. This success highlights the substantial yet previously underexplored potential of code LLMs in improving recommendation accuracy and efficiency, suggesting a promising new direction for future research in this area. The implementation code is accessible at https://***/AllminerLab/Code-for-RecCoder-master. © 2024 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

CASSPR: Cross Attention Single Scan Place Recognition

CASSPR: Cross Attention Single Scan Place Recognition

引用

International Conference on Computer Vision (ICCV)

作者： Yan Xia Mariia Gladkova Rui Wang Qianyun Li Uwe Stilla João F. Henriques Daniel Cremers Technical University of Munich Munich Center for Machine Learning (MCML) Visual Geometry Group University of Oxford Munich Data Science Institute Microsoft Zurich

Place recognition based on point clouds (LiDAR) is an important component for autonomous robots or self-driving vehicles. Current SOTA performance is achieved on accumulated LiDAR submaps using either point-based or voxel-based structures. While voxel-based approaches nicely integrate spatial context across multiple scales, they do not exhibit the local precision of point-based methods. As a result, existing methods struggle with fine-grained matching of subtle geometric features in sparse single-shot Li-DAR scans. To overcome these limitations, we propose CASSPR as a method to fuse point-based and voxel-based approaches using cross attention transformers. CASSPR leverages a sparse voxel branch for extracting and aggregating information at lower resolution and a point-wise branch for obtaining fine-grained local information. CASSPR uses queries from one branch to try to match structures in the other branch, ensuring that both extract self-contained descriptors of the point cloud (rather than one branch dominating), but using both to inform the out-put global descriptor of the point cloud. Extensive experiments show that CASSPR surpasses the state-of-the-art by a large margin on several datasets (Oxford RobotCar, TUM, USyd). For instance, it achieves AR@1 of 85.6% on the TUM dataset, surpassing the strongest prior model by ~15%. Our code is publicly available. 1

关键词：

来源：评论

学校读者我要写书评

暂无评论

DFingerNet: Noise-Adaptive Speech Enhancement for Hearing Aids

DFingerNet: Noise-Adaptive Speech Enhancement for Hearing Ai...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Tsangko, Iosif Triantafyllopoulos, Andreas Müller, Michael Schröter, Hendrik Schuller, Björn W. EIHW - Embedded Intelligence for Health Care and Wellbeing University of Augsburg Germany Technical University of Munich Germany MCML - Munich Center for Machine Learning Munich Germany WS Audiology Research and Development Erlangen Germany GLAM - Group on Language Audio & Music Imperial College London United Kingdom MDSI - Munich Data Science Institute Munich Germany

ISBN: (纸本)9798350368741

The DeepFilterNet (DFN) architecture was recently proposed as a deep learning model suited for hearing aid devices. Despite its competitive performance on numerous benchmarks, it still follows a 'one-size-fits-all' approach, which aims to train a single, monolithic architecture that generalises across different noises and environments. However, its limited size and computation budget can hamper its generalisability. Recent work has shown that in-context adaptation can improve performance by conditioning the denoising process on additional information extracted from background recordings to mitigate this. These recordings can be offloaded outside the hearing aid, thus improving performance while adding minimal computational overhead. We introduce these principles to the DFN model, thus proposing the DFingerNet (DFiN) model, which shows superior performance on various benchmarks inspired by the DNS Challenge. © 2025 IEEE.

关键词： Context Adaptation Deep learning Hearing Aids Speech Denoising Speech Enhancement

来源：评论

学校读者我要写书评

暂无评论

HERALD: A NATURAL LANGUAGE ANNOTATED LEAN 4 dataSET

arXiv

引用

arXiv 2024年

作者： Gao, Guoxiong Wang, Yutong Jiang, Jiedong Gao, Qi Qin, Zihan Xu, Tianyi Dong, Bin Peking University China National University of Singapore Singapore Center for Data Science Peking University China Beijing International Center for Mathematical Research The New Cornerstone Science Laboratory Peking University China Center for Machine Learning Research Peking University China

Verifiable formal languages like Lean have profoundly impacted mathematical reasoning, particularly through the use of large language models (LLMs) for automated reasoning. A significant challenge in training LLMs for these formal languages is the lack of parallel datasets that align natural language with formal language proofs. To address this challenge, this paper introduces a novel framework for translating the Mathlib4 corpus (a unified library of mathematics in formal language Lean 4) into natural language. Building upon this, we employ a dual augmentation strategy that combines tactic-based and informal-based approaches, leveraging the Lean-jixia system, a Lean 4 analyzer. We present the results of this pipeline on Mathlib4 as Herald (Hierarchy and Retrieval-based Translated Lean dataset). We also propose the Herald Translator, which is fine-tuned on Herald. Herald translator achieves a 93.2% accuracy (Pass@128) on formalizing statements in the miniF2F-test and a 22.5% accuracy on our internal graduate-level textbook dataset, outperforming InternLM2-Math-Plus-7B (74.0% and 7.5%) and TheoremLlama (50.1% and 4.0%). Furthermore, we propose a section-level translation framework for real-world applications. As a direct application of Herald translator, we have successfully translated a template section in the Stack project, marking a notable progress in the automatic formalization of graduate-level mathematical literature. Our model, along with the datasets, are open-sourced to the public.1 © 2024, CC BY.

关键词： Lean production

来源：评论

学校读者我要写书评

暂无评论

Ai-Driven Automated Tool for Abdominal CT Body Composition Analysis in Gastrointestinal Cancer Management 22

Ai-Driven Automated Tool for Abdominal CT Body Composition A...

引用

22nd IEEE International Symposium on Biomedical Imaging, ISBI 2025

作者： Nan, Xinyu He, Meng Chen, Zifan Dong, Bin Tang, Lei Zhang, Li Peking University Center for Data Science China Peking University Cancer Hospital and Institute Key Laboratory of Carcinogenesis and Translational Research Ministry of Education Department of Radiology Beijing China Peking University Beijing International Center for Mathematical Research (BICMR) Beijing China Peking University Center for Machine Learning Research Beijing China Peking University National Biomedical Imaging Center Beijing China

ISBN: (纸本)9798331520526

The incidence of gastrointestinal cancers remains significantly high, particularly in China, emphasizing the importance of accurate prognostic assessments and effective treatment strategies. Research shows a strong correlation between abdominal muscle and fat tissue composition and patient outcomes. However, existing manual methods for analyzing abdominal tissue composition are time-consuming and costly, limiting clinical research scalability. To address these challenges, we developed an AI-driven tool for automated analysis of abdominal CT scans to effectively identify and segment muscle, subcutaneous fat, and visceral fat. Our tool integrates a multi-view localization model and a high-precision 2D nnUNet-based segmentation model, demonstrating a localization accuracy of 90% and a Dice Score Coefficient of 0.967 for segmentation. Furthermore, it features an interactive interface that allows clinicians to refine the segmentation results, ensuring high-quality outcomes effectively. Our tool offers a standardized method for effectively extracting critical abdominal tissues, potentially enhancing the management and treatment for gastrointestinal cancers. The code is available at https://***/NanXinyu/***. © 2025 IEEE.

关键词： Abdominal CT analysis AI-driven tool body composition analysis gastrointestinal cancer management multi-view localization

来源：评论

学校读者我要写书评

暂无评论

Improving Generalization and Convergence by Enhancing Implicit Regularization

arXiv

引用

arXiv 2024年

作者： Wang, Mingze Wang, Jinbo He, Haotian Wang, Zilin Huang, Guanhua Xiong, Feiyu Li, Zhiyu Weinan, E. Wu, Lei School of Mathematical Sciences Peking University China Center for Machine Learning Research Peking University China China AI for Science Institute China School of Data Science University of Science and Technology of China China ByteDance Research China

In this work, we propose an Implicit Regularization Enhancement (IRE) framework to accelerate the discovery of flat solutions in deep learning, thereby improving generalization and convergence. Specifically, IRE decouples the dynamics of flat and sharp directions, which boosts the sharpness reduction along flat directions while maintaining the training stability in sharp directions. We show that IRE can be practically incorporated with generic base optimizers without introducing significant computational overload. Experiments show that IRE consistently improves the generalization performance for image classification tasks across a variety of benchmark datasets (CIFAR-10/100, ImageNet) and models (ResNets and ViTs). Surprisingly, IRE also achieves a 2× speed-up compared to AdamW in the pre-training of Llama models (of sizes ranging from 60M to 229M) on datasets including Wikitext-103, Minipile, and Openwebtext. Moreover, we provide theoretical guarantees, showing that IRE can substantially accelerate the convergence towards flat minima in sharpness-aware minimization (SAM). Copyright © 2024, The Authors. All rights reserved.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

Approximating Positive Homogeneous Functions with Scale Invariant Neural Networks

arXiv

引用

arXiv 2023年

作者： Bamberger, Stefan Heckel, Reinhard Krahmer, Felix Department of Mathematics Technical University of Munich Holsten Systems GmbH Germany Department of Computer Engineering Technical University of Munich Munich Center for Machine Learning Germany Department of Mathematics Munich Data Science Institute Technical University of Munich Munich Center for Machine Learning Germany

We investigate to what extent it is possible to solve linear inverse problems with ReLu networks. Due to the scaling invariance arising from the linearity, an optimal reconstruction function f for such a problem is positive homogeneous, i.e., satisfies f(λx) = λf(x) for all non-negative λ. In a ReLu network, this condition translates to considering networks without bias terms. We first consider recovery of sparse vectors from few linear measurements. We prove that ReLu- networks with only one hidden layer cannot even recover 1-sparse vectors, not even approximately, and regardless of the width of the network. However, with two hidden layers, approximate recovery with arbitrary precision and arbitrary sparsity level s is possible in a stable way. We then extend our results to a wider class of recovery problems including low-rank matrix recovery and phase retrieval. Furthermore, we also consider the approximation of general positive homogeneous functions with neural networks. Extending previous work, we establish new results explaining under which conditions such functions can be approximated with neural networks. Our results also shed some light on the seeming contradiction between previous works showing that neural networks for inverse problems typically have very large Lipschitz constants, but still perform very well also for adversarial noise. Namely, the error bounds in our expressivity results include a combination of a small constant term and a term that is linear in the noise level, indicating that robustness issues may occur only for very small noise *** Codes 41A30, 68T07 Copyright © 2023, The Authors. All rights reserved.

关键词： Recovery

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：