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

arXiv 2017年

作者： Lin, Liang Wang, Keze Meng, Deyu Zuo, Wangmeng Zhang, Lei School of Data and Computer Science Sun Yat-sen University Guangzhou China Engineering Research Center Advanced Computing Engineering Software of Ministry of Education China School of Mathematics and Statistics Ministry of Education Key Lab of Intelligent Networks and Network Security Xi'an Jiaotong University China School of Computer Science and Technology Harbin Institute of Technology Harbin China Dept. of Computing Hong Kong Polytechnic University Hong Kong

This paper aims to develop a novel cost-effective framework for face identification, which progressively maintains a batch of classifiers with the increasing face images of different individuals. By naturally combining two recently rising techniques: active learning (AL) and self-paced learning (SPL), our framework is capable of automatically annotating new instances and incorporating them into training under weak expert recertification. We first initialize the classifier using a few annotated samples for each individual, and extract image features using the convolutional neural nets. Then, a number of candidates are selected from the unannotated samples for classifier updating, in which we apply the current classifiers ranking the samples by the prediction confidence. In particular, our approach utilizes the high-confidence and low-confidence samples in the self-paced and the active user-query way, respectively. The neural nets are later fine-tuned based on the updated classifiers. Such heuristic implementation is formulated as solving a concise active SPL optimization problem, which also advances the SPL development by supplementing a rational dynamic curriculum constraint. The new model finely accords with the "instructor-student-collaborative" learning mode in human education. The advantages of this proposed framework are two-folds: i) The required number of annotated samples is significantly decreased while the comparable performance is guaranteed. A dramatic reduction of user effort is also achieved over other state-of-the-art active learning techniques. ii) The mixture of SPL and AL effectively improves not only the classifier accuracy compared to existing AL/SPL methods but also the robustness against noisy data. We evaluate our framework on two challenging datasets, which include hundreds of persons under diverse conditions, and demonstrate very promising results. Please find the code of this project at: http://***/projects/aspl/ Copyright © 201

关键词： Cost effectiveness

来源：评论

学校读者我要写书评

暂无评论

Joint-Motion Mutual Learning for Pose Estimation in Videos

arXiv

引用

arXiv 2024年

作者： Wu, Sifan Chen, Haipeng Yin, Yifang Hu, Sihao Feng, Runyang Jiao, Yingying Yang, Ziqi Liu, Zhenguang College of Computer Science and Technology Jilin University Changchun China A*STAR Singapore Georgia Institute of Technology Atlanta United States School of Artificial Intelligence Jilin University Changchun China The State Key Laboratory of Blockchain and Data Security Zhejiang University Hangzhou China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun China Institute of Blockchain and Data Security Hangzhou China

Human pose estimation in videos has long been a compelling yet challenging task within the realm of computer vision. Nevertheless, this task remains difficult because of the complex video scenes, such as video defocus and self-occlusion. Recent methods strive to integrate multi-frame visual features generated by a backbone network for pose estimation. However, they often ignore the useful joint information encoded in the initial heatmap, which is a byproduct of the backbone generation. Comparatively, methods that attempt to refine the initial heatmap fail to consider any spatiotemporal motion features. As a result, the performance of existing methods for pose estimation falls short due to the lack of ability to leverage both local joint (heatmap) information and global motion (feature) dynamics. To address this problem, we propose a novel joint-motion mutual learning framework for pose estimation, which effectively concentrates on both local joint dependency and global pixel-level motion dynamics. Specifically, we introduce a context-aware joint learner that adaptively leverages initial heatmaps and motion flow to retrieve robust local joint feature. Given that local joint feature and global motion flow are complementary, we further propose a progressive joint-motion mutual learning that synergistically exchanges information and interactively learns between joint feature and motion flow to improve the capability of the model. More importantly, to capture more diverse joint and motion cues, we theoretically analyze and propose an information orthogonality objective to avoid learning redundant information from multi-cues. Empirical experiments show our method outperforms prior arts on three challenging benchmarks. Copyright © 2024, The Authors. All rights reserved.

关键词： Motion estimation

来源：评论

学校读者我要写书评

暂无评论

QGEval: Benchmarking Multi-dimensional Evaluation for Question Generation

arXiv

引用

arXiv 2024年

作者： Fu, Weiping Wei, Bifan Hu, Jianxiang Cai, Zhongmin Liu, Jun School of Computer Science and Technology Xi’an Jiaotong University Xi’an China School of Continuing Education Xi’an Jiaotong University Xi’an China MOE KLINNS Lab School of Automation Science and Engineering Xi’an Jiaotong University Xi’an China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University Xi’an China

Automatically generated questions often suffer from problems such as unclear expression or factual inaccuracies, requiring a reliable and comprehensive evaluation of their quality. Human evaluation is widely used in the field of question generation (QG) and serves as the gold standard for automatic metrics. However, there is a lack of unified human evaluation criteria, which hampers consistent and reliable evaluations of both QG models and automatic metrics. To address this, we propose QGEval, a multi-dimensional Evaluation benchmark for Question Generation, which evaluates both generated questions and existing automatic metrics across 7 dimensions: fluency, clarity, conciseness, relevance, consistency, answerability, and answer consistency. We demonstrate the appropriateness of these dimensions by examining their correlations and distinctions. Through consistent evaluations of QG models and automatic metrics with QGEval, we find that 1) most QG models perform unsatisfactorily in terms of answerability and answer consistency, and 2) existing metrics fail to align well with human judgments when evaluating generated questions across the 7 dimensions. We expect this work to foster the development of both QG technologies and their evaluation. Copyright © 2024, The Authors. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Dfier: A Directed Vulnerability Verifier for Ethereum Smart Contracts

SSRN

引用

SSRN 2023年

作者： Wang, Zeli Dai, Weiqi Li, Ming Choo, Kim-Kwang Raymond Zou, Deqing Chongqing Key Laboratory of Computational Intelligence Key Laboratory of Big Data Intelligent Computing Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education College of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing40065 China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China Department of Information Systems and Cyber Security University of Texas at San Antonio San Antonio United States

Existing smart contract vulnerability identification approaches mainly focus on complete program detection. Consequently, lots of known potentially vulnerable locations need manual verification, which is energy-exhaustive and error-prone. Fuzzing is an effective way to detect vulnerabilities. However, current fuzzers cannot effectively probe these suspicious targets because they overlook two key factors: exploring all paths toward the targets and providing high-quality directed seed inputs. This paper presents a Directed vulnerability veriFier (DFier), elaborating effective transaction sequences with directed inputs for the fuzzer, to focus on analyzing target paths and automatically detect whether the given locations are vulnerable. Specifically, DFier fuses the effectiveness of static analysis and the efficiency of fuzzing. The static analysis helps locate target paths and generate directed inputs for the fuzzer under three heuristic strategies. The first prefers inputs with the larger possibility of triggering potential vulnerabilities based on target features. The second guides the value mutation to satisfy the path constraints. The third adequately leverages execution information to help find exploits faster. Extensive experiments demonstrate that DFier is effective in verifying contract security, compared with three existing contract fuzzers (i.e., contractFuzzer, sFuzz, and conFuzzius). And the performance losses are in an acceptable range. © 2023, The Authors. All rights reserved.

关键词： Smart contract

来源：评论

学校读者我要写书评

暂无评论

A Survey on Fairness in Large Language Models

arXiv

引用

arXiv 2023年

作者： Li, Yingji Du, Mengnan Song, Rui Wang, Xin Wang, Ying College of Computer Science and Technology Jilin University Changchun130012 China Department of Data Science New Jersey Institute of Technology Newark United States School of Artificial Intelligence Jilin University Changchun130012 China Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Ministry of Education Changchun130012 China

Large Language Models (LLMs) have shown powerful performance and development prospects and are widely deployed in the real world. However, LLMs can capture social biases from unprocessed training data and propagate the biases to downstream tasks. Unfair LLM systems have undesirable social impacts and potential harms. In this paper, we provide a comprehensive review of related research on fairness in LLMs. Considering the influence of parameter magnitude and training paradigm on research strategy, we divide existing fairness research into oriented to medium-sized LLMs under pre-training and fine-tuning paradigms and oriented to large-sized LLMs under prompting paradigms. First, for medium-sized LLMs, we introduce evaluation metrics and debiasing methods from the perspectives of intrinsic bias and extrinsic bias, respectively. Then, for large-sized LLMs, we introduce recent fairness research, including fairness evaluation, reasons for bias, and debiasing methods. Finally, we discuss and provide insight on the challenges and future directions for the development of fairness in LLMs. Copyright © 2023, The Authors. All rights reserved.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Few-shot Open Relation Extraction with Gaussian Prototype and Adaptive Margin

arXiv

引用

arXiv 2024年

作者： Guo, Tianlin Zhang, Lingling Wang, Jiaxin Lei, Yunkuo Li, Yifei Wang, Haofen Liu, Jun School of Computer Science and Technology Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi'an Jiaotong University Xi’an710049 China School of Computer Science and Technology Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Xi’an710049 China College of Design and Innovation Tongji University Shanghai200092 China

Few-shot relation extraction with none-of-the-above (FsRE with NOTA) aims at predicting labels in few-shot scenarios with unknown classes. FsRE with NOTA is more challenging than the conventional few-shot relation extraction task, since the boundaries of unknown classes are complex and difficult to learn. Meta-learning based methods, especially prototype-based methods, are the mainstream solutions to this task. They obtain the classification boundary by learning the sample distribution of each class. However, their performance is limited because few-shot overfitting and NOTA boundary confusion lead to misclassification between known and unknown classes. To this end, we propose a novel framework based on Gaussian prototype and adaptive margin named GPAM for FsRE with NOTA, which includes three modules, semi-factual representation, GMM-prototype metric learning and decision boundary learning. The first two modules obtain better representations to solve the few-shot problem through debiased information enhancement and Gaussian space distance measurement. The third module learns more accurate classification boundaries and prototypes through adaptive margin and negative sampling. In the training procedure of GPAM, we use contrastive learning loss to comprehensively consider the effects of range and margin on the classification of known and unknown classes to ensure the model's stability and robustness. Sufficient experiments and ablations on the FewRel dataset show that GPAM surpasses previous prototype methods and achieves state-of-the-art performance. Copyright © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Mandari: Multi-Modal Temporal knowledge Graph-aware Sub-graph Embedding for Next-POI Recommendation

Mandari: Multi-Modal Temporal Knowledge Graph-aware Sub-grap...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Xiaoqian Liu Xiuyun Li Yuan Cao Fan Zhang Xiongnan Jin Jinpeng Chen School of Computer Science (National Pilot Software Engineering School) Beijing University of Posts and Telecommunications Beijing China Key Laboratory of Trustworthy Distributed Computing and Service (BUPT) Ministry of Education Beijing China The Technology Innovation Center of Cultural Tourism Big Data of Hebei Province Chengde China Hebei Normal University for Nationalities Chengde China Knowledge Discovery and Data Mining Research Center Zhejiang Lab Hangzhou China

Next-POI recommendation aims to explore from user check-in sequence to predict the next possible location to be visited. Existing methods are often difficult to model the implicit association of multi-modal data with user choices. Moreover, traditional methods struggle to fully explore the variation of user preferences at variable time intervals. To tackle these limitations, we propose a Multi-Modal Temporal knowledge Graph-aware Sub-graph Embedding approach (Mandari). We first construct a novel Multi-Modal Temporal knowledge Graph. Based on the proposed knowledge graph, we integrate multi-modal information and leverage the graph attention network to calculate sub-graph prediction probability. Next, we implement a temporal knowledge mining method to model the segmentation and periodicity of user check-in and obtain temporal prediction probability. Finally, we fuse temporal prediction probability with the previous sub-graph prediction probability to obtain the final result. Extensive experiments demonstrate that our approach outperforms existing state-of-the-art methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Game Theoretic Approaches in Vehicular Networks: A Survey

arXiv

引用

arXiv 2020年

作者： Sun, Zemin Liu, Yanheng Wang, Jian Anil, Carie Cao, Dongpu College of Computer Science and Technology Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China Engineering VIT-AP AmaravatiAndhra Pradesh522237 India College of Engineering Nanjing Agricultural University Nanjing210031 China Waterloo Cognitive Autonomous Driving Lab University of Waterloo N2L 3G1 Canada

—In the era of the Internet of Things (IoT), vehicles and other intelligent components in Intelligent Transportation System (ITS) are connected, forming the Vehicular Networks (VNs) that provide efficient and secure traffic, ubiquitous access to information, and various applications. However, as the number of connected nodes keeps increasing, it is challenging to satisfy various and large amounts of service requests with different Quality of Service (QoS) and security requirements in the highly dynamic VNs. Intelligent nodes in VNs can compete or cooperate for limited network resources so that either an individual or a group objectives can be achieved. Game theory, a theoretical framework designed for strategic interactions among rational decision-makers who faced with scarce resources, can be used to model and analyze individual or group behaviors of communication entities in VNs. This paper primarily surveys the recent advantages of GT used in solving various challenges in VNs. As VNs and GT have been extensively investigate34d, this survey starts with a brief introduction of the basic concept and classification of GT used in VNs. Then, a comprehensive review of applications of GT in VNs is presented, which primarily covers the aspects of QoS and security. Moreover, with the development of fifth-generation (5G) wireless communication, recent contributions of GT to diverse emerging technologies of 5G integrated into VNs are surveyed in this paper. Finally, several key research challenges and possible solutions for applying GT in VNs are outlined. Copyright © 2020, The Authors. All rights reserved.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

Median query research in wireless sensor networks

引用

Tien Tzu Hsueh Pao/Acta Electronica Sinica 2010年第2A期38卷 133-137页

作者： Wu, Zhong-Bo Zhang, Hui Chen, Hong Information School Renmin University of China Beijing 100872 China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Beijing 100872 China School of Mathematics and Computer Science Xiangfan University Xiangfan Hubei 441053 China

Poor quality and harsh condition can result in faulty and outlier data in sampling data of sensor nodes. So we need median query to reflect average level of monitoring region. First, we put forward HMA algorithm. Second, we extend HMA algorithm and put forward HFMA algorithm. In HFMA, We only need collect data inside filter and aggregate influence coefficient during sampling period. Base station can compute median result according to the sample data inside filter and influence coefficient aggregation value. Experimental results have shown that HFMA outperforms Naive algorithm and HMA algorithm and can prolong the lifetime of sensor network.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

Towards Feature Distribution Alignment and Diversity Enhancement for data-Free Quantization

Towards Feature Distribution Alignment and Diversity Enhance...

引用

IEEE International Conference on data Mining (ICDM)

作者： Yangcheng Gao Zhao Zhang Richang Hong Haijun Zhang Jicong Fan Shuicheng Yan School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Knowledge Engineering with Big Data (Ministry of Education) & Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China Department of Computer Science Harbin Institute of Technology (Shenzhen) Xili University Town Shenzhen China School of Data Science The Chinese University of Hong Kong Shenzhen China Shenzhen Research Institute of Big Data Shenzhen China National University of Singapore Singapore

To obtain lower inference latency and less memory footprint of deep neural networks, model quantization has been widely employed in deep model deployment, by converting the floating points to low-precision integers. However, previous methods (such as quantization aware training and post training quantization) require original data for the fine-tuning or calibration of quantized model, which makes them inapplicable to the cases that original data are not accessed due to privacy or security. This gives birth to the data-free quantization method with synthetic data generation. While current data-free quantization methods still suffer from severe performance degradation when quantizing a model into lower bit, caused by the low inter-class separability of semantic features. To this end, we propose a new and effective data-free quantization method termed ClusterQ, which utilizes the feature distribution alignment for synthetic data generation. To obtain high inter-class separability of semantic features, we cluster and align the feature distribution statistics to imitate the distribution of real data, so that the performance degradation is alleviated. Moreover, we incorporate the diversity enhancement to solve class-wise mode collapse. We also employ the exponential moving average to update the centroid of each cluster for further feature distribution improvement. Extensive experiments based on different deep models (e.g., ResNet-18 and MobileNet-V2) over the ImageNet dataset demonstrate that our proposed ClusterQ model obtains state-of-the-art performance.

关键词： Degradation Training Quantization (signal) Semantics Neural networks Memory management data models

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：