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

arXiv 2023年

作者： An, Wenbin Tian, Feng Shi, Wenkai Chen, Yan Wu, Yaqiang Wang, Qianying Chen, Ping School of Automation Science and Engineering Xi’an Jiaotong University China School of Computer Science and Technology Xi’an Jiaotong University China National Engineering Laboratory for Big Data Analytics China Lenovo Research China Department of Engineering University of Massachusetts Boston United States

Generalized Category Discovery (GCD) is a crucial real-world task that aims to recognize both known and novel categories from an unlabeled dataset by leveraging another labeled dataset with only known categories. Despite the improved performance on known categories, current methods perform poorly on novel categories. We attribute the poor performance to two reasons: biased knowledge transfer between labeled and unlabeled data and noisy representation learning on the unlabeled data. The former leads to unreliable estimation of learning targets for novel categories and the latter hinders models from learning discriminative features. To mitigate these two issues, we propose a Transfer and Alignment Network (TAN), which incorporates two knowledge transfer mechanisms to calibrate the biased knowledge and two feature alignment mechanisms to learn discriminative features. Specifically, we model different categories with prototypes and transfer the prototypes in labeled data to correct model bias towards known categories. On the one hand, we pull instances with known categories in unlabeled data closer to these prototypes to form more compact clusters and avoid boundary overlap between known and novel categories. On the other hand, we use these prototypes to calibrate noisy prototypes estimated from unlabeled data based on category similarities, which allows for more accurate estimation of prototypes for novel categories that can be used as reliable learning targets later. After knowledge transfer, we further propose two feature alignment mechanisms to acquire both instance- and category-level knowledge from unlabeled data by aligning instance features with both augmented features and the calibrated prototypes, which can boost model performance on both known and novel categories with less noise. Experiments on three benchmark datasets show that our model outperforms SOTA methods, especially on novel categories. Theoretical analysis is provided for an in-depth understanding

关键词： Alignment

来源：评论

学校读者我要写书评

暂无评论

Weakly-Supervised Action Localization by Hierarchically-structured Latent Attention Modeling

Weakly-Supervised Action Localization by Hierarchically-stru...

引用

International Conference on Computer Vision (ICCV)

作者： Guiqin Wang Peng Zhao Cong Zhao Shusen Yang Jie Cheng Luziwei Leng Jianxing Liao Qinghai Guo School of Computer Science and Technology Xi’an Jiao Tong University School of Mathematics and Statistics Xi’an Jiao Tong University National Engineering Laboratory for Big Data Analytics Xi’an Jiao Tong University ACS Lab Huawei Technologies

Weakly-supervised action localization aims to recognize and localize action instancese in untrimmed videos with only video-level labels. Most existing models rely on multiple instance learning(MIL), where the predictions of unlabeled instances are supervised by classifying labeled bags. The MIL-based methods are relatively well studied with cogent performance achieved on classification but not on localization. Generally, they locate temporal regions by the video-level classification but overlook the temporal variations of feature semantics. To address this problem, we propose a novel attention-based hierarchically-structured latent model to learn the temporal variations of feature semantics. Specifically, our model entails two components, the first is an unsupervised change-points detection module that detects change-points by learning the latent representations of video features in a temporal hierarchy based on their rates of change, and the second is an attention-based classification model that selects the change-points of the foreground as the boundaries. To evaluate the effectiveness of our model, we conduct extensive experiments on two benchmark datasets, THUMOS-14 and ActivityNet-v1.3. The experiments show that our method outperforms current state-of-the-art methods, and even achieves comparable performance with fully-supervised methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Mind Reasoning Manners: Enhancing Type Perception for Generalized Zero-shot Logical Reasoning over Text

arXiv

引用

arXiv 2023年

作者： Xu, Fangzhi Liu, Jun Lin, Qika Zhao, Tianzhe Zhang, Jian Zhang, Lingling School of Computer Science and Technology Xi’an Jiaotong University Xi’an China Shaanxi Province Key Laboratory of Satellite and Terrestrial Network Tech. R&D National Engineering lab for Big Data Analytics Xi’an China

Logical reasoning task involves diverse types of complex reasoning over text, based on the form of multiple-choice question answering. Given the context, question and a set of options as the input, previous methods achieve superior performances on the full-data setting. However, the current benchmark dataset has the ideal assumption that the reasoning type distribution on the train split is close to the test split, which is inconsistent with many real application scenarios. To address it, there remain two problems to be studied: (1) How is the zero-shot capability of the models (train on seen types and test on unseen types)? (2) How to enhance the perception of reasoning types for the models? For problem 1, we propose a new benchmark for generalized zero-shot logical reasoning, named ZsLR. It includes six splits based on the three type sampling strategies. For problem 2, a type-aware model TaCo is proposed. It utilizes both the heuristic input reconstruction and the contrastive learning to improve the type perception in the global representation. Extensive experiments on both the zero-shot and full-data settings prove the superiority of TaCo over the state-of-the-art methods. Also, we experiment and verify the generalization capability of TaCo on other logical reasoning dataset. © 2023, CC BY.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Logiformer: A Two-Branch Graph Transformer Network for Interpretable Logical Reasoning

arXiv

引用

arXiv 2022年

作者： Xu, Fangzhi Liu, Jun Lin, Qika Pan, Yudai Zhang, Lingling School of Computer Science and Technology Xi'an Jiaotong University Xi'an China Shaanxi Province Key Laboratory of Satellite and Terrestrial Network Tech. R&d National Engineering Lab for Big Data Analytics Xi'an China

Machine reading comprehension has aroused wide concerns, since it explores the potential of model for text understanding. To further equip the machine with the reasoning capability, the challenging task of logical reasoning is proposed. Previous works on logical reasoning have proposed some strategies to extract the logical units from different aspects. However, there still remains a challenge to model the long distance dependency among the logical units. Also, it is demanding to uncover the logical structures of the text and further fuse the discrete logic to the continuous text embedding. To tackle the above issues, we propose an end-to-end model Logiformer which utilizes a two-branch graph transformer network for logical reasoning of text. Firstly, we introduce different extraction strategies to split the text into two sets of logical units, and construct the logical graph and the syntax graph respectively. The logical graph models the causal relations for the logical branch while the syntax graph captures the co-occurrence relations for the syntax branch. Secondly, to model the long distance dependency, the node sequence from each graph is fed into the fully connected graph transformer structures. The two adjacent matrices are viewed as the attention biases for the graph transformer layers, which map the discrete logical structures to the continuous text embedding space. Thirdly, a dynamic gate mechanism and a question-aware self-attention module are introduced before the answer prediction to update the features. The reasoning process provides the interpretability by employing the logical units, which are consistent with human cognition. The experimental results show the superiority of our model, which outperforms the state-of-the-art single model on two logical reasoning benchmarks. © 2022, CC BY.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

EFFICIENTLY PARAMETERIZED NEURAL METRIPLECTIC SYSTEMS

arXiv

引用

arXiv 2024年

作者： Gruber, Anthony Lee, Kookjin Lim, Haksoo Park, Noseong Trask, Nathaniel Center for Computing Research Sandia National Laboratories AlbuquerqueNM United States School of Computing and Augmented Intelligence Arizona State University TempeAZ United States Big Data Analytics Laboratory Yonsei University Seoul Korea Republic of Big Data Analytics Laboratory Korea Advanced Institute of Science and Technology Daejeon Korea Republic of School of Engineering and Applied Science University of Pennsylvania PhiladelphiaPA United States

Metriplectic systems are learned from data in a way that scales quadratically in both the size of the state and the rank of the metriplectic data. Besides being provably energy conserving and entropy stable, the proposed approach comes with approximation results demonstrating its ability to accurately learn metriplectic dynamics from data as well as an error estimate indicating its potential for generalization to unseen timescales when approximation error is low. Examples are provided which illustrate performance in the presence of both full state information as well as when entropic variables are unknown, confirming that the proposed approach exhibits superior accuracy and scalability without compromising on model expressivity. Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

On privacy protection of latent dirichlet allocation model training

arXiv

引用

arXiv 2019年

作者： Zhao, Fangyuan Ren, Xuebin Yang, Shusen Yang, Xinyu School of Computer Science and Technology Xi'an Jiaotong University China National Engineering Laboratory for Big Data Analytics Xi'an Jiaotong University China Ministry of Education Key Lab For Intelligent Networks and Network Security Xi'an Jiaotong University China

Latent Dirichlet Allocation (LDA) is a popular topic modeling technique for discovery of hidden semantic architecture of text datasets, and plays a fundamental role in many machine learning applications. However, like many other machine learning algorithms, the process of training a LDA model may leak the sensitive information of the training datasets and bring significant privacy risks. To mitigate the privacy issues in LDA, we focus on studying privacy-preserving algorithms of LDA model training in this paper. In particular, we first develop a privacy monitoring algorithm to investigate the privacy guarantee obtained from the inherent randomness of the collapsed gibbs sampling (CGS) process in a typical LDA training algorithm on centralized curated datasets. Then, we further propose a locally private LDA training algorithm on crowdsourced data to provide local differential privacy for individual data contributors. The experimental results on real-world datasets demonstrate the effectiveness of our proposed algorithms. Copyright © 2019, The Authors. All rights reserved.

关键词： Statistics

来源：评论

学校读者我要写书评

暂无评论

Weakly-Supervised Action Localization by Hierarchically-structured Latent Attention Modeling

arXiv

引用

arXiv 2023年

作者： Wang, Guiqin Zhao, Peng Zhao, Cong Yang, Shusen Cheng, Jie Leng, Luziwei Liao, Jianxing Guo, Qinghai School of Computer Science and Technology Xi’an Jiaotong University China ACS Lab Huawei Technologies China School of Mathematics and Statistics Xi’an Jiaotong University China National Engineering Laboratory for Big Data Analytics Xi’an Jiaotong University China

Weakly-supervised action localization aims to recognize and localize action instancese in untrimmed videos with only video-level labels. Most existing models rely on multiple instance learning(MIL), where the predictions of unlabeled instances are supervised by classifying labeled bags. The MIL-based methods are relatively well studied with cogent performance achieved on classification but not on localization. Generally, they locate temporal regions by the video-level classification but overlook the temporal variations of feature semantics. To address this problem, we propose a novel attention-based hierarchically-structured latent model to learn the temporal variations of feature semantics. Specifically, our model entails two components, the first is an unsupervised change-points detection module that detects change-points by learning the latent representations of video features in a temporal hierarchy based on their rates of change, and the second is an attention-based classification model that selects the change-points of the foreground as the boundaries. To evaluate the effectiveness of our model, we conduct extensive experiments on two benchmark datasets, THUMOS-14 and ActivityNetv1.3. The experiments show that our method outperforms current state-of-the-art methods, and even achieves comparable performance with fully-supervised methods. Copyright © 2023, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Meta Mask Correction for Nuclei Segmentation in Histopathological Image

Meta Mask Correction for Nuclei Segmentation in Histopatholo...

引用

2021 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2021

作者： Shi, Jiangbo Jia, Chang Gao, Zeyu Gong, Tieliang Wang, Chunbao Li, Chen Xi'An Jiao Tong University National Engineering Lab for Big Data Analytics Shaanxi Xi'an710049 China School of Computer Science and Technology Xi'An Jiao Tong University Shaanxi Xi'an710049 China Shaanxi Province Key Laboratory of Satellite and Terrestrial Network Tech.RandD Xi'An Jiao Tong University Shaanxi Xi'an710049 China Department of Pathology The First Affiliated Hospital of xi'An Jiaotong University Shaanxi Xi'an710061 China

ISBN: (纸本)9781665401265

Nuclei segmentation is a fundamental task in digital pathology analysis and can be automated by deep learning-based methods. However, the development of such an automated method requires a large amount of data with precisely annotated masks which is hard to obtain. Training with weakly labeled data is a popular solution for reducing the workload of annotation. In this paper, we propose a novel meta-learning-based nuclei segmentation method which follows the label correction paradigm to leverage data with noisy masks. Specifically, we design a fully conventional meta-model that can correct noisy masks using a small amount of clean meta-data. Then the corrected masks can be used to supervise the training of the segmentation model. Meanwhile, a bi-level optimization method is adopted to alternately update the parameters of the main segmentation model and the meta-model in an end-to-end way. Extensive experimental results on two nuclear segmentation datasets show that our method achieves the state-of-the-art result. It even achieves comparable performance with the model training on supervised data in some noisy settings. © 2021 IEEE.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

PathoGraph: A Graph-Based Method for Standardized Representation of Pathology Knowledge

引用

Scientific data 2025年第1期12卷 872页

作者： Peiliang Lou Yuxin Dong Caixia Ding Chunbao Wang Ruifeng Guo XiaoBo Pang Chen Wang Chen Li School of Computer Science and Technology Xi'an Jiaotong University Xi'an Shaanxi 710049 China. Division of Computational Biology Mayo Clinic Rochester MN USA. Department of Pathology Shaanxi Provincial Tumor Hospital Xi'an Jiaotong University 309 Yanta West Road Xi'an Shaanxi China. Department of Pathology The First Affiliated Hospital of Xi'an Jiaotong University 277 West Yanta Road Xi'an Shaanxi China. Division of Anatomic Pathology Department of Laboratory Medicine and Pathology Mayo Clinic Jacksonville Florida USA. Division of Computational Biology Mayo Clinic Rochester MN USA. wang.chen@mayo.edu. National Engineering Lab for Big Data Analytics Xi'an Jiaotong University Xi'an Shaanxi China. cli@***.

Pathology data, primarily consisting of slides and diagnostic reports, inherently contain knowledge that is pivotal for advancing data-driven biomedical research and clinical practice. However, the hidden and fragmented nature of this knowledge across various data modalities not only hinders its computational utilization, but also impedes the effective integration of AI technologies within the domain of pathology. To systematically organize pathology knowledge for its computational use, we propose PathoGraph, a knowledge representation method that describes pathology knowledge in a graph-based format. PathoGraph can represent: (1) pathological entities' types and morphological features; (2) the composition, spatial arrangements, and dynamic behaviors associated with pathological phenotypes; and (3) the differential diagnostic approaches used by pathologists. By applying PathoGraph to neoplastic diseases, we illustrate its ability to comprehensively and structurally capture multi-scale disease characteristics alongside pathologists' expertise. Furthermore, we validate its computational utility by demonstrating the feasibility of large-scale automated PathoGraph construction, showing performance improvements in downstream deep learning tasks, and presenting two illustrative use cases that highlight its clinical potential. We believe PathoGraph opens new avenues for AI-driven advances in the field of pathology.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A sparse semismooth Newton based proximal majorization-minimization algorithm for nonconvex square-root-loss regression problem

The Journal of Machine Learning Research

引用

The Journal of Machine Learning Research 2020年第1期21卷 9253-9290页

作者： Peipei Tang Chengjing Wang Defeng Sun Kim-Chuan Toh School of Computer and Computing Science Zhejiang University City College Hangzhou China School of Mathematics and National Engineering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University Chengdu China Department of Applied Mathematics The Hong Kong Polytechnic University Hung Hom Hong Kong Department of Mathematics and Institute of Operations Research and Analytics National University of Singapore Singapore

In this paper, we consider high-dimensional nonconvex square-root-loss regression problems and introduce a proximal majorization-minimization (PMM) algorithm for solving these problems. Our key idea for making the proposed PMM to be efficient is to develop a sparse semismooth Newton method to solve the corresponding subproblems. By using the Kurdyka-Łojasiewicz property exhibited in the underlining problems, we prove that the PMM algorithm converges to a d-stationary point. We also analyze the oracle property of the initial subproblem used in our algorithm. Extensive numerical experiments are presented to demonstrate the high efficiency of the proposed PMM algorithm.

关键词： nonconvex square-root regression problems proximal majorization-minimization semismooth Newton method

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：