Efficient Finetuning Large Language Models For Vietnamese Chatbot

Large language models (LLMs), such as GPT-4, PaLM, and LLaMa, have been shown to achieve remarkable performance across a variety of natural language tasks. Recent advancements in instruction tuning bring LLMs with ability in following user's instructions and producing human-like responses. However, the high costs associated with training and implementing LLMs pose challenges to academic research. Furthermore, the availability of pretrained LLMs and instruction-tune datasets for Vietnamese language is limited. To tackle these concerns, we leverage large-scale instruction-following datasets from open-source projects, namely Alpaca, GPT4All, and Chat-Doctor, which cover general domain and specific medical domain. To the best of our knowledge, these are the first instructional dataset for Vietnamese. Subsequently, we utilize parameter-efficient tuning through Low-Rank Adaptation (LoRA) on two open LLMs: Bloomz (Multilingual) and GPTJ-6B (Vietnamese), resulting four models: Bloomz-Chat, Bloomz-Doctor, GPTJ-Chat, GPTJ-Doctor.Finally, we assess the effectiveness of our methodology on a per-sample basis, taking into consideration the helpfulness, relevance, accuracy, level of detail in their responses. This evaluation process entails the utilization of GPT-4 as an automated scoring mechanism. Despite utilizing a low-cost setup, our method demonstrates about 20-30\% improvement over the original models in our evaluation tasks.Comment: arXiv admin note: text overlap with arXiv:2304.08177, arXiv:2303.16199 by other author

Few-Shot Object Detection via Synthetic Features with Optimal Transport

Few-shot object detection aims to simultaneously localize and classify the objects in an image with limited training samples. However, most existing few-shot object detection methods focus on extracting the features of a few samples of novel classes that lack diversity. Hence, they may not be sufficient to capture the data distribution. To address that limitation, in this paper, we propose a novel approach in which we train a generator to generate synthetic data for novel classes. Still, directly training a generator on the novel class is not effective due to the lack of novel data. To overcome that issue, we leverage the large-scale dataset of base classes. Our overarching goal is to train a generator that captures the data variations of the base dataset. We then transform the captured variations into novel classes by generating synthetic data with the trained generator. To encourage the generator to capture data variations on base classes, we propose to train the generator with an optimal transport loss that minimizes the optimal transport distance between the distributions of real and synthetic data. Extensive experiments on two benchmark datasets demonstrate that the proposed method outperforms the state of the art. Source code will be available

Smart Shopping Assistant: A Multimedia and Social Media Augmented System with Mobile Devices to Enhance Customers’ Experience and Interaction

Multimedia, social media content, and interaction are common means to attract customers in shopping. However these features are not always fully available for customers when they go shopping in physical shopping centers. The authors propose Smart Shopping Assistant, a multimedia and social media augmented system on mobile devices to enhance users’ experience and interaction in shopping. Smart Shopping turns a regular mobile device into a special prism so that a customer can enjoy multimedia, get useful social media related to a product, give feedbacks or make actions on a product during shopping. The system is specified as a flexible framework to take advantages of different visual descriptors and web information extraction modules. Experimental results show that Smart Shopping can process and provide augmented data in a realtime-manner. Smart Shopping can be used to attract more customers and to build an online social community of customers to share their interests in shopping

TextANIMAR: Text-based 3D Animal Fine-Grained Retrieval

3D object retrieval is an important yet challenging task, which has drawn more and more attention in recent years. While existing approaches have made strides in addressing this issue, they are often limited to restricted settings such as image and sketch queries, which are often unfriendly interactions for common users. In order to overcome these limitations, this paper presents a novel SHREC challenge track focusing on text-based fine-grained retrieval of 3D animal models. Unlike previous SHREC challenge tracks, the proposed task is considerably more challenging, requiring participants to develop innovative approaches to tackle the problem of text-based retrieval. Despite the increased difficulty, we believe that this task has the potential to drive useful applications in practice and facilitate more intuitive interactions with 3D objects. Five groups participated in our competition, submitting a total of 114 runs. While the results obtained in our competition are satisfactory, we note that the challenges presented by this task are far from being fully solved. As such, we provide insights into potential areas for future research and improvements. We believe that we can help push the boundaries of 3D object retrieval and facilitate more user-friendly interactions via vision-language technologies.Comment: arXiv admin note: text overlap with arXiv:2304.0573

A Hybridized Flower Pollination Algorithm and Its Application on Microgrid Operations Planning

The meta-heuristic algorithms have been applied to handle various real-world optimization problems because their approach closely resembles natural human thinking and processing relatively quickly. Flowers pollination algorithm (FPA) is one of the advanced meta-heuristic algorithms; still, it has suffered from slow convergence and insufficient accuracy when dealing with complicated problems. This study suggests hybridizing the FPA with the sine–cosine algorithm (call HSFPA) to avoid FPA drawbacks for microgrid operations planning and global optimization problems. The objective function of microgrid operations planning is constructed based on the power generation distribution system’s relevant economic costs and environmental profits. Adapting hop size, diversifying local search, and diverging agents as strategies from learning SCA are used to modify the original FPA equation for improving the HSFPA solutions in terms of diversity pollinations, increasing convergence, and preventing local optimal traps. The experimental results of the HSFPA compared with the other algorithms in the literature for the benchmark test function and microgrid operations planning problem to evaluate the proposed scheme. Compared results show that the HSFPA offers outstanding performance compared to other competitors for the testing function. The HSFPA also delivers efficient optimal performance in microgrid optimization for solving the operations planning problem

An Optimal WSN Node Coverage Based on Enhanced Archimedes Optimization Algorithm

Node coverage is one of the crucial metrics for wireless sensor networks’ (WSNs’) quality of service, directly affecting the target monitoring area’s monitoring capacity. Pursuit of the optimal node coverage encounters increasing difficulties because of the limited computational power of individual nodes, the scale of the network, and the operating environment’s complexity and constant change. This paper proposes a solution to the optimal node coverage of unbalanced WSN distribution during random deployment based on an enhanced Archimedes optimization algorithm (EAOA). The best findings for network coverage from several sub-areas are combined using the EAOA. In order to address the shortcomings of the original Archimedes optimization algorithm (AOA) in handling complicated scenarios, we suggest an EAOA based on the AOA by adapting its equations with reverse learning and multidirection techniques. The obtained results from testing the benchmark function and the optimal WSN node coverage of the EAOA are compared with the other algorithms in the literature. The results show that the EAOA algorithm performs effectively, increasing the feasible range and convergence speed

Few-Shot Object Detection via Baby Learning

Few-shot learning is proposed to overcome the problem of scarce training data in novel classes. Recently, few-shot learning has been well adopted in various computer vision tasks such as object recognition and object detection. However, the state-of-the-art (SOTA) methods have less attention to effectively reuse the information from previous stages. In this paper, we propose a new framework of few-shot learning for object detection. In particular, we adopt Baby Learning mechanism along with the multiple receptive fields to effectively utilize the former knowledge in novel domain. The propoed framework imitates the learning process of a baby through visual cues. The extensive experiments demonstrate the superiority of the proposed method over the SOTA methods on the benchmarks (improve average 7.0% on PASCAL VOC and 1.6% on MS COCO).(c) 2022 Elsevier B.V. All rights reserved

Tutorial -- Video Indexing, Search, Detection, and Description with Focus on TRECVID

International audienc

SHREC\u2719 Track: Extended 2D Scene Sketch-Based 3D Scene Retrieval

Sketch-based 3D scene retrieval is to retrieve 3D scene models given a user’s hand-drawn 2D scene sketch. It is a brand new but also very challenging research topic in the field of 3D object retrieval due to the semantic gap in their representations: 3D scene models or views differ from non-realistic 2D scene sketches. To boost this interesting research, we organized a 2D Scene Sketch-Based 3D Scene Retrieval track in SHREC’18, resulting a SceneSBR18 benchmark which contains 10 scene classes. In order to make it more comprehensive, we have extended the number of the scene categories from the initial 10 classes in the SceneSBR2018 benchmark to 30 classes, resulting in a new and more challenging benchmark SceneSBR2019 which has 750 2D scene sketches and 3,000 3D scene models. Therefore, the objective of this track is to further evaluate the performance and scalability of different 2D scene sketch-based 3D scene model retrieval algorithms using this extended and more comprehensive new benchmark. In this track, two groups from USA and Vietnam have successfully submitted 4 runs. Based on 7 commonly used retrieval metrics, we evaluate their retrieval performance. We have also conducted a comprehensive analysis and discussion of these methods and proposed several future research directions to deal with this challenging research topic. Deep learning techniques have been proved their great potentials again in dealing with this challenging retrieval task, in terms of both retrieval accuracy and scalability to a larger dataset. We hope this publicly available benchmark, together with its evaluation results and source code, will further enrich and promote 2D scene sketch-based 3D scene retrieval research area and its corresponding applicatio

NII-HITACHI-UIT at TRECVID 2015 instance search

In this paper, we propose two methods to improve last year instance search framework. Both of them are based on post processing scheme that try to rerank top K shots returned from BOW model. The rst system is to propose a query-adaptive weighting technique between DPM object detectors score and BOW's score. In order to nd a good weight, we use a neural network which learns characteristics of the query including number of features, number of shared words and area of the query topic. The second system combines two state-of-the-art object detectors: DPM and Fast RCNN to estimate object location and similarity score, respectively. The nal score is computed using these components together with BOW based similarity score returned from the baseline system. The experimental results show that our system improved pretty much even with a smaller number of top K input ranked list. Compared to other teams, we got the second place with the same run.Peer ReviewedPostprint (published version