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

Reduce the rank calculation of a high-dimensional sparse matrix based on network controllability theory

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Zhao, Chen Liu, Yuqing Hu, Li Yuan, Zhengzhong College of Computer and Cyber Security Hebei Normal University Shijiazhuang050024 China Hebei Provincial Engineering Research Center for Supply Chain Big Data Analytics & Data Security Shijiazhuang050024 China Hebei Key Laboratory of Network and Information Security Shijiazhuang050024 China School of Mathematics and Statistics Minnan Normal University Zhangzhou363000 China Fujian Key Laboratory of Data Science and Statistics Minnan Normal University Zhangzhou363000 China Institute of Meteorological Big Data-Digital Fujian Minnan Normal University Zhangzhou363000 China

Numerical computing of the rank of a matrix is a fundamental problem in scientific computation. The datasets generated by the internet often correspond to the analysis of high-dimensional sparse matrices. Notwithstanding recent advances in the promotion of traditional singular value decomposition (SVD), an efficient estimation algorithm for the rank of a high-dimensional sparse matrix is still lacking. Inspired by the controllability theory of complex networks, we converted the rank of a matrix into maximum matching computing. Then, we established a fast rank estimation algorithm by using the cavity method, a powerful approximate technique for computing the maximum matching, to estimate the rank of a sparse matrix. In the merit of the natural low complexity of the cavity method, we showed that the rank of a high-dimensional sparse matrix can be estimated in a much faster way than SVD with high accuracy. Our method offers an efficient pathway to quickly estimate the rank of the high-dimensional sparse matrix when the time cost of computing the rank by SVD is unacceptable. Copyright © 2021, The Authors. All rights reserved.

关键词： Singular value decomposition

Generalized Category Discovery with Decoupled Prototypical Network

学校读者我要写书评

暂无评论

arXiv 2022年

作者： An, Wenbin Tian, Feng Zheng, Qinghua Ding, Wei 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 Department of Computer Science University of Massachusetts Boston United States Lenovo Research Department of Engineering University of Massachusetts Boston United States

Generalized Category Discovery (GCD) aims to recognize both known and novel categories from a set of unlabeled data, based on another dataset labeled with only known categories. Without considering differences between known and novel categories, current methods learn about them in a coupled manner, which can hurt model’s generalization and discriminative ability. Furthermore, the coupled training approach prevents these models transferring category-specific knowledge explicitly from labeled data to unlabeled data, which can lose high-level semantic information and impair model performance. To mitigate above limitations, we present a novel model called Decoupled Prototypical Network (DPN). By formulating a bipartite matching problem for category prototypes, DPN can not only decouple known and novel categories to achieve different training targets effectively, but also align known categories in labeled and unlabeled data to transfer category-specific knowledge explicitly and capture high-level semantics. Furthermore, DPN can learn more discriminative features for both known and novel categories through our proposed Semantic-aware Prototypical Learning (SPL). Besides capturing meaningful semantic information, SPL can also alleviate the noise of hard pseudo labels through semantic-weighted soft assignment. Extensive experiments show that DPN outperforms state-of-the-art models by a large margin on all evaluation metrics across multiple benchmark datasets. Code and data are available at https://***/Lackel/DPN. Copyright © 2022, The Authors. All rights reserved.

关键词： Semantics

MoCA: Incorporating multi-stage domain pretraining and cross-guided multimodal attention for Textbook Question Answering

学校读者我要写书评

暂无评论

arXiv 2021年

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

Textbook Question Answering (TQA) is a complex multimodal task to infer answers given large context descriptions and abundant diagrams. Compared with Visual Question Answering(VQA), TQA contains a large number of uncommon terminologies and various diagram inputs. It brings new challenges to the representation capability of language model for domain-specific spans. And it also pushes the multimodal fusion to a more complex level. To tackle the above issues, we propose a novel model named MoCA, which incorporates multi-stage domain pretraining and multimodal cross attention for the TQA task. Firstly, we introduce a multi-stage domain pretraining module to conduct unsupervised post-pretraining with the span mask strategy and supervised pre-finetune. Especially for domain post-pretraining, we propose a heuristic generation algorithm to employ the terminology corpus. Secondly, to fully consider the rich inputs of context and diagrams, we propose cross-guided multimodal attention to update the features of text, question diagram and instructional diagram based on a progressive strategy. Further, a dual gating mechanism is adopted to improve the model ensemble. The experimental results show the superiority of our model, which outperforms the state-of-the-art methods by 2.21% and 2.43% for validation and test split respectively. Copyright © 2021, The Authors. All rights reserved.

关键词： Textbooks

FEDLAB: A FLEXIBLE FEDERATED LEARNING FRAMEWORK

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Zeng, Dun Liang, Siqi Hu, Xiangjing Wang, Hui Xu, Zenglin School of Computer Science and Engineering University of Electronic Science and Technology of China China Rich Media Big Data Analytics and Application Key Laboratory Shenzhen Research Institute The Chinese University of Hong Kong Hong Kong School of Computer Science and Technology Harbin Institute of Technology Shenzhen China Peng Cheng Laboratory Shenzhen China

Federated learning (FL) is a machine learning field in which researchers try to facilitate model learning process among multiparty without violating privacy protection regulations. Considerable effort has been invested in FL optimization and communication related researches. In this work, we introduce FedLab, a lightweight open-source framework for FL simulation. The design of FedLab focuses on FL algorithm effectiveness and communication efficiency. Also, FedLab is scalable in different deployment scenario. We hope FedLab could provide flexible API as well as reliable baseline implementations, and relieve the burden of implementing novel approaches for researchers in FL community. The source code is available at https://***/SMILELab-FL/FedLab. © 2021, CC BY.

关键词： Learning systems

Top-N-Rank: A Scalable List-wise Ranking Method for Recommender Systems

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Liang, Junjie Hu, Jinlong Dong, Shoubin Honavar, Vasant Artificial Intelligence Research Laboratory Center for Big Data Analytics and Discovery Informatics College of Information Sciences and Technology Pennsylvania State University University ParkPA16802 United States Guangdong Key Laboratory of Communication & Computer Network School of Computer Science and Engineering South China University of Technology Guangzhou510006 China

We propose Top-N-Rank, a novel family of list wise Learning-to-Rank models for reliably recommending the N top-ranked items. The proposed models optimize a variant of the widely used discounted cumulative gain (DCG) objective function which differs from DCG in two important aspects: (i) It limits the evaluation of DCG only on the top N items in the ranked lists, thereby eliminating the impact of low-ranked items on the learned ranking function;and (ii) it incorporates weights that allow the model to leverage multiple types of implicit feedback with differing levels of reliability or trustworthiness. Because the resulting objective function is non-smooth and hence challenging to optimize, we consider two smooth approximations of the objective function, using the traditional sigmoid function and the rectified linear unit (ReLU). We propose a family of learning-to-rank algorithms (Top-N-Rank) that work with any smooth objective function. Then, a more efficient variant, ***, is introduced, which effectively exploits the properties of ReLU function to reduce the computational complexity of Top-N-Rank from quadratic to linear in the average number of items rated by users. The results of our experiments using two widely used benchmarks, namely, the MovieLens data set and the Amazon Video Games data set demonstrate that: (i) The "top-N truncation" of the objective function substantially improves the ranking quality of the top N recommendations;(ii) using the ReLU for smoothing the objective function yields significant improvement in both ranking quality as well as runtime as compared to using the sigmoid;and (iii) *** substantially outperforms the well-performing list-wise ranking methods in terms of ranking quality. Copyright © 2018, The Authors. All rights reserved.

关键词： Benchmarking

Interplays of liver fibrosis-associated microRNAs:Molecular mechanisms and implications in diagnosis and therapy

学校读者我要写书评

暂无评论

Genes & Diseases 2023年第4期10卷 1457-1469页

作者： Hong Li Tingli Liu Yongchun Yang William C.Cho Robin J.Flynn Majid Fasihi Harandi Houhui Song Xuenong Luo Yadong Zheng State Key Laboratory of Veterinary Etiological Biology Key Laboratory of Veterinary Parasitology of Gansu ProvinceLanzhou Veterinary Research InstituteChinese Academy of Agricultural SciencesLanzhouGansu 730046China Key Laboratory of Applied Technology on Green-Eco-Healthy Animal Husbandry of Zhejiang Province Zhejiang Provincial Engineering Laboratory for Animal Health Inspection&Internet TechnologyZhejiang International Science and Technology Cooperation Base for Veterinary Medicine and Health ManagementChina-Australia Joint Laboratory for Animal Health Big Data AnalyticsCollege of Animal Science and Technology&College of Veterinary Medicine of Zhejiang A&F UniversityHangzhouZhejiang 311300China Department of Clinical Oncology Queen Elizabeth HospitalHong Kong SAR 999077China Department of Infection Biology Institute of Infection and Global HealthUniversity of LiverpoolLiverpool L35RFUK Graduate Studies Office Department of ResearchInnovation and Graduate StudiesWaterford Institute of TechnologyX91 K0EKIreland Research Center for Hydatid Disease in Iran Kerman University of Medical SciencesKerman ***Iran

microRNAs(miRNAs)are a class of non-coding functional small RNA composed of 21e23 nucleotides,having multiple associations with liver ***-associated miRNAs are roughly classified into pro-fibrosis or anti-fibrosis *** former is capable of activating hepatic stellate cells(HSCs)by modulating pro-fibrotic signaling pathways,mainly including TGF-b/SMAD,WNT/b-catenin,and Hedgehog;the latter is responsible for maintenance of the quiescent phenotype of normal HSCs,phenotypic reversion of activated HSCs(aHSCs),inhibition of HSCs proliferation and suppression of the extracellular matrix-associated gene ***,several miRNAs are involved in regulation of liver fibrosis via alternative mechanisms,such as interacting between hepatocytes and other liver cells via exosomes and increasing autophagy of ***,understanding the role of these miRNAs may provide new avenues for the development of novel interventions against hepatic fibrosis.

关键词： Diagnosis Hepatic stellate cell Liver fibrosis miRNA Therapy

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

Scientific data Lake for High Luminosity LHC project and other data-intensive particle and astro-particle physics experiments 5

学校读者我要写书评

暂无评论

Scientific Data Lake for High Luminosity LHC project and oth...

5th International Conference on Particle Physics and Astrophysics, ICPPA 2020

作者： Alekseev, A. Kiryanov, A. Klimentov, A. Korchuganova, T. Mitsyn, V. Oleynik, D. Smirnov, A. Smirnov, S. Zarochentsev, A. Compiler Technology Department Ivannikov Institute for System Programming of the Ras Moscow109004 Russia Cloud Technologies and Big Data Analytics Laboratory Plekhanov Russian University of Economics Moscow117997 Russia Atlas Group Universidad Andres Bello Santiago7550196 Chile Department of Computing Resources and Technologies Nrc "kurchatov Institute"-PNPI Gatchina188300 Russia Physics Department Brookhaven National Laboratory UptonNY11973 United States Laboratory of Information Technologies Joint Institute for Nuclear Research Dubna141980 Russia Institute of Nuclear Physics and Engineering National Research Nuclear University MEPhI Moscow115409 Russia Laboratory of Ultra-High Energy Physics Saint Petersburg State University Saint Petersburg198504 Russia

The next phase of LHC Operations-High Luminosity LHC (HL-LHC), which is aimed at ten-fold increase in the luminosity of proton-proton collisions at the energy of 14 TeV, is expected to start operation in 2027-2028 and will deliver an unprecedented scientific data volume of multi-exabyte scale. This amount of data has to be stored and the corresponding storage system should ensure fast and reliable data delivery for processing by scientific groups distributed all over the world. The present LHC computing and data processing model will not be able to provide the required infrastructure growth even taking into account the expected hardware technology evolution. To address this challenge the new state-of-The-Art computing infrastructure technologies are now being developed and are presented here. The possibilities of application of the HL-LHC distributed data handling technique for other particle and astro-particle physics experiments dealing with large-scale data volumes like DUNE, LSST, Belle-II, JUNO, SKAO etc. are also discussed. © Published under licence by IOP Publishing Ltd.

关键词： Luminance

Context-Aware Feature Attention Model for Coreference Resolution on Biomedical Texts

学校读者我要写书评

暂无评论

Research Square

Research Square 2021年

作者： Li, Yufei Zhou, Xiangyu Ma, Jie Ma, Xiaoyong Li, Chen School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an China National Engineering Lab for Big Data Analytics Xi’an Jiaotong University Shaanxi Xi’an China Shaanxi Province Key Laboratory of Satellite and Terrestrial Network Technology Research and Development Xi’an Jiaotong University Shaanxi Xi’an China

Background: Bio-entity Coreference resolution is an important task to gain a complete understanding of biomedical texts automatically. Previous neural network-based studies on this topic are domain system based methods which rely on some domain-specific information integration. However, for the identical mentions, this may lead to misleading information, as the model tends to get similar or even identical representations, which further leads to wrongful predictions. Results: we propose a new context-aware Feature Attention model to distinguish identical mentions effectively to better resolve coreference. The new model can represent identical mentions based on different contexts by adaptively exploiting features effectively. The proposed model substantially outperforms the state-of-the-art baselines on the BioNLP dataset with a 64.0% F1 score and further demonstrates superior performance on the differential representation and coreferential link of identical mentions. Conclusion: The context-aware Feature Attention model adaptively exploit features and represent identical mentions according to different contexts, which significantly makes the system obtain semantic information effectively and make more accurate predictions. Considering that this approach is still limited when context information is insufficient, we expect to utilize such information more fine-grained with the help of the external knowledge base in coreference resolution. © 2021, CC BY.

关键词： Semantics