Latest ArticlesThe increasing number of the Internet of things (IoT) devices in our environment presents significant opportunities as well as challenges, including limited battery life, low computing power, and scalability for multiple access. Recent advances in backscatter communication have enabled ubiquitous IoT devices to communicate in an energy-effective manner. However, a fundamental challenge in backscatter communication is to design a multiple access protocol to support concurrent communications from numerous tags. Aiming at tackling the high bit error rate and low transmission rate of large-scale tag concurrent communication, we design a coding-based code division multiple access technique to facilitate multi-tag backscattering with reliable communication. Firstly, the chip discrimination tags with strong orthogonality such as Walsh code are combined with error correction coding to enhance the anti-interference ability. Secondly, the joint decoding of correlation detection and decoding is used to reduce the bit error rate and realize the reliable communication from the backscatter link. Finally, a grouping algorithm is designed to cluster tags based on the K-means clustering algorithm, which fully utilizes the time-code resources and enhances the capacity. Experimental results demonstrate that our scheme can achieve reliable communication with 100+ tags, with a bit error rate of approximately 2%, and the achieved throughput of 39 Mbps.
As a common temporal abstraction method for hierarchical reinforcement learning, Option framework allows agents to learn strategies at different time scales, which can effectively solve sparse reward problems. In order to ensure that options can guide agents to access more state space, some methods improve the diversity of options by introducing mutual information in internal reward and termination functions. However, it will lead to slow algorithm learning speed and low knowledge transfer ability of internal strategy, which seriously affect algorithm performance. To address the above problems, diversity-enriched option-critic algorithm with interest functions(DEOC-IF) is proposed. Based on the diversity-enriched option-critic (DEOC) algorithm, the algorithm constrains the selection of the upper-level strategy on the internal strategy of Option by introducing the interest function, which not only ensures the diversity of the Option set, but also makes the learned internal strategies focus on different regions of the state space, which is conducive to improving the knowledge transfer ability of the algorithm and accelerating the learning speed. In addition, DEOC-IF introduces a new interest function update gradient, which is beneficial to improve the exploration ability of the algorithm. In order to verify the effectiveness and option reusability of the algorithm, the algorithm comparison experiments are carried out in four-room navigation task, Mujoco, and MiniWorld. Experimental results show that DEOC-IF algorithm has better performance and option reusability compared with other algorithms.
Training deep learning models with noisy data containing lossy labels is a hot research topic in machine learning. Studies have shown that deep learning model training is susceptible to overfitting due to noisy data. Recently, a method combining meta-learning and label correction can make the model better adapt to the noisy data to mitigate the overfitting phenomenon. However, this meta-label correction method relies on the model’s performance, and the lightweight model does not have good generalization performance under noisy data. To address this problem, we propose a knowledge distillation-based meta-label correction learning method (KDMLC), which treats the meta label correction model (MLC) composed of a deep neural network and a multilayer perceptron as a teacher model to correct the noise labels and guide the training of the lightweight model, and at the same time, KDMLC adopts a two-layer optimization strategy to train and enhance the generalization ability of the teacher model, so as to generate a higher-quality pseudo-labels for training the lightweight model. The experiments show that KDMLC improves the test accuracy by 5.50% compared with MLC method at high noise level; meanwhile, using Cutout data enhancement on the CIFAR10 dataset, KDMLC improves the test accuracy by 9.11% compared with MLC at high noise level, and the experiments on the real noisy dataset, Clothing1M, also show that KDMLC outperforms the other methods, verifying that KDMLC is better than the other methods, which verifies the feasibility and validity of KDMLC method.
Traditional cross-rating collaborative filtering paradigm ignores the influence of rating density in the target domain on the accuracy of user and item latent vectors, resulting in less accurate rating prediction in regions with sparse ratings. To overcome the influence of regional rating density on rating prediction, based on the thought of transfer learning, a cross-region and cross-rating collaborative filtering recommendation algorithm (CRCRCF) is proposed. Compared with the traditional cross-rating collaborative filtering paradigm, CRCRCF algorithm can effectively exploit not only the important knowledge from the auxiliary domain, but also the important knowledge from the rating-dense regions in the target domain, which can further improve the rating prediction accuracy of the whole target domain, especially the rating-sparse regions. Firstly, for users and items, active users and inactive users, popular items and unpopular items are divided respectively. Graph convolution matrix complementation algorithm is used to extract the latent vectors of active users and popular items in the target domain and all users and items in the auxiliary domain. Secondly, for users and items in rating-dense regions, deep regression models based on self-taught learning are constructed to learn the mapping relationships between latent vectors in the target domain and in the auxiliary domain, respectively. Then the mapping relationships are generalized to the whole target domain, and the relatively accurate latent vectors of inactive users and unpopular items in the auxiliary domain are used to derive their latent vectors in the target domain, which achieves the cross-region mapping relationships transfer and cross-rating latent vector information transfer successively. Finally, the restricted graph convolutional matrix completion model is proposed with the obtained latent vectors of inactive users and non-popular items in the target domain as constraints, and the corresponding recommendation results are given. The simulation experiments on MovieLens and Netflix datasets show that the CRCRCF algorithm has obvious advantages over other state-of-the-art algorithms.
With the promotion of data as a production factor, traditional query pricing methods face tremendous challenges in practical applications due to their overly strict premise assumptions, limited support for flexibility and dynamics, and inadequate consideration of key factors. To address these issues, we innovatively design a query pricing algorithm based on the labor game model. This algorithm models the participants in data transactions as labor unions and employers, and treats the data trading platform and data buyers as the labor union and employers, respectively. The data trading platform (labor union) is responsible for the fair and transparent calculation of the value of each traded dataset (wages), aiming to facilitate transactions as much as possible. Data buyers determine the purchase quantities of datasets based on their estimated value, personal needs, and budgets, thereby achieving a pricing strategy that balances the interests of all three parties. Experimental results demonstrate that compared with the popular Stackelberg game model, our algorithm better accommodates the interests of all parties and ensures greater fairness. Compared with traditional query-based data pricing methods, our pricing algorithm is more practical, offers greater flexibility and dynamics, and can dynamically adjust prices in response to changes in query results. The time complexity of our pricing algorithm is O(N), where N is the number of datasets related to the query, and it also guarantees no arbitrage.
Query suggestion (QS) is an indispensable part of search engines. It can provide query candidates before users entering a complete query to help express their information needs more accurately and more quickly. Deep learning helps to improve the accuracy of QS and it has become the mainstream technology to promote the development of QS in recent years. We mainly summarize, analyze and compare the research status of deep learning based QS (DQS). According to the different application stages of deep learning, DQS methods are divided into two categories: generative QS methods and ranking-based QS suggestion methods, and the modeling ideas of each model are analyzed. In addition, the data sets, baselines and evaluation indexes commonly used in the field of QS are introduced, and the technical characteristics and experimental results of different models are compared. Finally, the current challenges and future development trends of QS research based on deep learning are summarized.
Large language models (LLMs) with hundreds of billions of parameters have brought significant technological and business transformations to today’s AI and cloud services. However, there exists a fundamental difference in network pattern between LLM training and general cloud computing (e.g., Amazon EC2 Elastic compute service), leading to a variety of new challenges. These challenges mainly include load balancing difficulties due to the traffic pattern difference (Challenge 1), the impact of multi-job communication contention on GPU utilization (Challenge 2), and high sensitivity to network failures (Challenge 3). Therefore, data center network technologies designed for general cloud computing (e.g., network architecture, routing, communication scheduling, and reliability) are no longer suitable for LLM training today. This necessitates the development of new data center networks and accompanying technical solutions specifically for LLM training. We introduce Alibaba Cloud’s high-performance network (HPN) and the multi-job communication scheduling approach Crux, designed to address the aforementioned challenges. HPN introduces a two-layer, dual-plane network architecture, which not only achieves high-speed interconnectivity for 15 000 GPUs within a Pod but also ensures precise routing suitable for LLM training (addressing Challenge 1). Furthermore, HPN proposes a novel dual-top-of-rack (ToR) design, replacing the traditional single ToR switch connection in data center networks and fundamentally avoiding single-point failure reliability risks (partially addressing Challenge 3). To tackle Challenge 2, Crux reduces the NP-complete problem of optimizing GPU utilization by modeling it as a communication scheduling issue related to GPU computational intensity. Crux then proposes an algorithm that prioritizes the flows of job with higher GPU computational intensity, significantly reducing multi-job communication contention and improving GPU utilization. Compared with the state-of-the-art efforts, Crux increases GPU utilization by up to 23%. Both HPN and Crux have been deployed and used in Alibaba Cloud production for over eight months and will continue to evolve and iterate. Building on this, we further envision possible research directions in the field of LLM training and inference, providing guidance for subsequent work.
Reputation management is an effective way to improve the quality of data collection in mobile crowdsensing, but existing subjective evaluation-based schemes are difficult to realize the real evaluation of worker reputation under privacy protection. To this end, we propose a bilateral reputation evaluation privacy-preserving (BREPP) scheme based on blockchain. The scheme firstly adopts random interference and Pedersen Commitment to hide the parameters of the workers’ reputation update, and utilizes the compact linkable spontaneous anonymous group (CLSAG) signature to anonymously verify the reputation update process. Besides, it employs a combination of Bulletproofs and Schnnor signature to verify the reputation feedback process of the workers. Then, the sub-address method is adopted to achieve fast location retrieval when the identities of the workers and requesters are anonymized. Finally, a prototype system is deployed on Hyperledger Fabric to evaluate the performance of the reputation update. The simulation results show that compared with existing reputation privacy protection schemes, BREPP scheme reduces the total reputation management delay and reputation evaluation error rate by at least 2.00% and 24.96%, respectively. Compared with schemes without privacy protection, our scheme achieves a better balance between reputation evaluation accuracy and total delay.
To address the complex challenges posed by node heterogeneity and connectivity changes in integrated stereoscopic heterogeneous networks, we propose a transmission control method with bounded, loop-free, and blocking-free policy update capabilities. This method incorporates network routing algorithms into the transmission control framework through cross-layer cooperative control. The selection of routing update nodes is modeled as a node search problem, ensuring that the resources involved in network transmission are bounded. On this basis, a breadth-first heuristic incremental search algorithm is designed to efficiently update both global and local routing configurations, ensuring that new paths are loop-free and devoid of network black holes. Additionally, to adapt to the volatility of integrated stereoscopic heterogeneous networks, a multi-mode hybrid congestion control mechanism is designed. This mechanism can switch to a more gradual window-increase mode when approaching the network bandwidth threshold, promptly adjusting policies to handle various potential network conditions. Simulation results demonstrate that HWCTC method provides high-quality data transmission services in dynamic and high packet loss rate integrated space-air-ground heterogeneous network environments. Compared with the classical Cubic and Reno algorithms, HWCTC achieves approximately 61.5% improvement in throughput, significantly enhancing data transmission stability and effectively reducing the impact of dynamic node routing changes on transmission performance.
Integrating large language models (LLMs) into personal assistants, like Xiao Ai and Blue Heart V, effectively enhances their ability to interact with humans, solve complex tasks, and manage IoT devices. Such assistants are also termed LLM-driven agents. Upon receiving user requests, the LLM-driven agent generates plans using an LLM, executes these plans through various tools, and then returns the response to the user. During this process, the latency for generating a plan with an LLM can reach tens of seconds, significantly degrading user experience. Real-world dataset analysis shows that about 30% of the requests received by LLM-driven agents are identical or similar, which allows the reuse of previously generated plans to reduce latency. However, it is difficult to accurately define the similarity between the request texts received by the LLM-driven agent through directly evaluating the original request texts. Moreover, the diverse expressions of natural language and the unstructured format of plan texts make implementing plan reuse challenging. To address these issues, we present and implement a plan reuse mechanism for LLM-driven agents called AgentReuse. AgentReuse leverages the similarities and differences among requests’ semantics and uses intent classification to evaluate the similarities between requests and enable the reuse of plans. Experimental results based on a real-world dataset demonstrate that AgentReuse achieves a 93% effective plan reuse rate, an F1 score of