YLYouqi Li

Youqi Li

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Youqi Li has a total of 54 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • TeethID: Teeth Gesture-Independent Earable Authentication Robust to Environmental Noise

    by Huijie Chen, Yongxu Xia, Xiaobin Xu, Shuopeng Li, Haoru Su, Youqi Li, Juan Fang

    Earbuds are increasingly used as human-centered computing platforms that store sensitive user data, creating a need for secure and unobtrusive authentication. Teeth-gesture-based authentication has emerged as a promising solution for implicit user verification, but existing approaches are often susceptible to environmental noise and variability in gesture execution, which can degrade authentication performance. This paper proposes a teeth-gesture-independent earbud authentication system (TeethID) that is robust to environmental noise. TeethID leverages the microphones embedded in commodity earbuds to capture teeth-gesture sounds from out-ear and in-ear microphones and constructs a user-specific out-ear-to-in-ear audio mapping function using predefined excitation signals, effectively suppressing environmental interference. In addition, TeethID incorporates an adversarial learning-based model to mitigate variations across different teeth gestures and inconsistencies across repeated occlusion instances. Extensive experiments involving 20 participants under diverse environmental noise levels demonstrate that TeethID achieves a balanced accuracy (BAC) of 97.11%, with a false acceptance rate (FAR) of 1.12% and a false rejection rate (FRR) of 4.66%. Security evaluations further show that TeethID is resilient to both replay and mimic attacks.

  • Communication-Efficient Decentralized Contextual $\mathcal{X}$ -Armed Bandit Learning in Multi-Agent Stochastic Networks

    by Youqi Li, Fan Li, Pan Zhou, Yu Wang

    Bandit with infinitely many arms (i.e., $\mathcal {X}$ -armed bandit) is an important variant of multi-armed stochastic bandits, which is useful to model different networking problems under both wired and wireless settings, e.g., online caching, dynamic channel/power allocation, rate adaption. However, the problem becomes challenging when the characteristic of the networking setting is affected by the side information (i.e., context) and distributed behavior. In this paper, we identify and study a novel problem, decentralized contextual $\mathcal {X}$ -armed bandit, where $N$ agents collaboratively solve the problem within time span $T$ . The problem is nontrivial because the infinite arms challenge and statistical information consensus issue make our setting go beyond a simple combination of $\mathcal {X}$ -armed bandits and multi-agent bandits. We develop a decentralized arm selection algorithm, called MACXUCB, by elaborating the contextual covering tree technique with a novel gossip communication protocol, which allows each agent to communicate efficiently with her neighbors. We prove that MACXUCB achieves a sublinear regret upper bound $\widetilde {\mathcal {O}}\left ({{D^{\frac {1}{2d_{\mathcal {X}}+2d_{\mathcal {Y}}+4}} N^{\frac {d_{\mathcal {X}}+d_{\mathcal {Y}}+1.5}{d_{\mathcal {X}}+d_{\mathcal {Y}}+2}} T^{\frac {d_{\mathcal {X}}+d_{\mathcal {Y}}+1}{d_{\mathcal {X}}+d_{\mathcal {Y}}+2}}}}\right)$ given aggregation period $D$ , and the covering dimensions $d_{\mathcal {X}}$ and $d_{\mathcal {Y}}$ of arm and context spaces, which asymptomatically matches the lower bound $\Omega \left ({{(DN)^{\frac {1}{d_{\mathcal {X}}+d_{\mathcal {Y}}+2}}T^{\frac {d_{\mathcal {X}}+d_{\mathcal {Y}}+1}{d_{\mathcal {X}}+d_{\mathcal {Y}}+2}}}}\right)$ up to a time-dependent factor. Moreover, MACXUCB enjoys a sublinear communication complexity $\widetilde {\mathcal {O}}(NDT^{0.5/(1-\rho)})$ when tuning parameter $\rho \in \left ({{0,\frac {1}{2}}}\right)$ . Finally, we carry out experiments to verify the performance of our MACXUCB. The results show the effectiveness and efficiency of our MACXUCB.

  • Cetus: Online Context-Aware Cross-Layer Coordination for Efficient Live Volumetric Video Streaming

    by Biao Hou, Song Yang, Youqi Li, Fan Li, Liehuang Zhu, Xu Chen, Ramin Yahyapour

    In recent years, volumetric videos have gradually prospered as an intriguing video paradigm, offering users a fully immersive viewing experience with six Degrees of Freedom (DoF). However, most current live volumetric video streaming methods struggle to facilitate the real-time performance requirements due to the nature of frequent user interactions and the complexity of network environments during video playback. Inspired by the correlation between the human visual effects and adjacent frame motion features, we propose Cetus, a context-aware cross-layer coordination system for live volumetric videos. First, we present an application-layer Neural Radiance Fields (NeRF)-based codec framework that leverages spatio-temporal semantic information for optimizing the compression quality of each video frame. Second, we exploit a flexible cross-layer coordination framework that seamlessly integrates frame drop strategy with partially reliable transmission, orchestrating transport protocols and application-informed rates to enhance the Quality of Experience (QoE) for multiple users. Furthermore, we develop a lightweight branching decision tree algorithm that adaptively makes fine-grained frame drop decisions. Experimental evaluations of our implemented system prototype demonstrate that Cetus significantly outperforms existing baseline approaches. Compared to the state-of-the-art baselines, Cetus effectively improves video frame rate by at least 24.7% and video quality by an average of 32.6%.


  • Efficient and Flexible Multi-Qubit Entanglement Transmission in Quantum Networks

    by Yanan Gao, Song Yang, Fan Li, Youqi Li, Liehuang Zhu, Stojan Trajanovski, Xiaoming Fu

    The unprecedented advancements in quantum technology have opened new prospects for the widespread adoption of quantum applications, placing new demands on the information transmission capabilities of large-scale quantum networks. Long-distance and stable entanglements are deemed as the lifeline in quantum network communication. However, some weaknesses, e.g., quantum decoherence, scarce quantum memory, and uneven-quality entanglement, of the quantum entanglement hinder the development. In this paper, we propose Sophon, an online transmission framework for quantum networks, which utilizes high-dimensional entanglements to concurrently transmit multi-qubit data to satisfy the transmission requirements of the real-time request set. We first model the quantum network with multi-qubit entanglement represented by $W$ quantum state and then formulate the Entanglement Routing and Qubit Provisioning (ERQP) problem as a global-local optimization process. To solve the ERQP problem, we distributedly regard each network node as an RL agent for resource provisioning and extend the step-updating of the Markov Decision Process by introducing a centralized controller for entanglement route selection to optimize local and global objectives, respectively. Extensive simulations demonstrate, on the self-made simulation platform, Sophon achieves a $21.89\%-66.52\%$ decrease in the communication cost, and is more robust on different scales of the network topology and the request set than the baselines.


  • EEGAuth: A Secure and Lightweight EEG-Based System Integrating Authentication and Key Generation

    by Xun Han, Jun Xiao, Yifan Liu, Ruilin Zhang, Biaokai Zhu, Hongyi Hao, Youqi Li, Fan Li, Qian Zhang

    Electroencephalography (EEG) signals have emerged as a novel biometric feature in identity authentication. However, in highly sensitive scenarios such as remote access control and sensitive operation confirmation, identity authentication alone is insufficient to ensure system security. This article proposes EEGAuth, an EEG-based secure and lightweight authentication system with cryptographic key generation, addressing the demand for integrated systems that enhance both security and user convenience by combining identity authentication and key generation into a unified solution. The proposed system employs a genetic algorithm (GA) for optimal channel selection, integrates a discrete wavelet transform (DWT) with an autoencoder-based feature extraction framework, and implements a convolutional neural network (CNN)-based architecture for robust identity authentication. In addition, the system discretizes feature vectors to generate unique and repeatable seeds, which are used as inputs to a secure hash function to produce keys. The evaluation results show that our model achieves a classification accuracy of 99.38% with only 15 channels, significantly outperforming state-of-the-art methods and baseline models. The generated cryptographic keys demonstrate robust security properties, as evidenced by their successful passage through the NIST statistical test suite for randomness verification, scale index analysis for aperiodicity assessment, and autocorrelation testing for bit-sequence independence, collectively confirming their resistance to cryptographic attacks and compliance with security standards.

  • Open Access

    Stability and Generalization for Stochastic (Compositional) Optimizations

    by Xiaokang Pan, Jin Liu, Hulin Kuang, Youqi Li, Lixing Chen, Zhe Qu

    The use of estimators instead of stochastic gradients for updates has been shown to improve algorithm convergence rates of, but their impact on generalization remains under-explored. In this paper, we investigate how estimators influence generalization. Our focus is on two widely studied problems: stochastic optimization (SO) and stochastic compositional optimization (SCO), both under convex and non-convex settings. For SO problems, we first analyze the generalization error of the STORM algorithm as a foundational step. We then extend our analysis to SCO problems by introducing an algorithmic framework that encompasses several popular algorithmic approaches. Through this framework, we conduct a generalization analysis, uncovering new insights into the impact of estimators on generalization. Subsequently, we provide a detailed analysis of three specific algorithms within this framework: SCGD, SCSC, and COVER, to explore the effects of different estimator strategies. Furthermore, in the context of SCO, we propose a novel definition of stability and a new decomposition of excess risk in the non-convex setting. Our analysis indicates two key findings: (1) In SCO problems, eliminating the estimator for the gradient of the inner function does not impact generalization performance while significantly reducing computational and storage overhead. (2) Faster convergence rates are consistently associated with better generalization performance.

  • BGEFL: Enabling Communication-Efficient Federated Learning via Bandit Gradient Estimation in Resource-Constrained Networks

    by Youqi Li, Fan Li, Song Yang, Yu Wang

    Federated learning (FL) has achieved state-of-the-art performance in distributed machine learning with privacy preservation, which promotes AIoT. However, FL is restricted by the expensive communication cost due to exchanging a large number of model parameters and model updates (e.g., gradients) between the aggregator and participants in multiple rounds. This could be challenging in resource-constrained networks where devices are often resource-constrained in terms of computation and communication. Existing works mainly focus on improving communication efficiency from local training and model/gradient compression; nevertheless, studying communication efficiency for FL from the perspective of gradient estimation remains unexplored. In this paper, we bridge this gap by conducting a systematic study on gradient estimation for the communication-efficient FL. We propose a bandit-based gradient estimation-aware FL ( $\mathtt{BGEFL }$ ) framework that can directly estimate participants’ gradients with limited bandit feedback (i.e., their local function values). We prove that $\mathtt{BGEFL }$ enjoys an $\mathcal {O}(1)$ communication complexity, that is a constant-size uplink communication in which each client uploads only one point’s feedback in the uplink. Moreover, our bandit-based gradient estimator is communication-efficient, unbiased, and stable. We prove the convergence performance of $\mathtt{BGEFL }$ for training strongly convex, general convex, and non-convex models. Finally, we evaluate our $\mathtt{BGEFL }$ over several datasets and the experimental results demonstrate the effectiveness of $\mathtt{BGEFL }$ .


  • Toward Collaborative Intelligence for Meta-Computing-Driven IIoT Based on Vertical Federated Learning With Fast Convergence

    by Youqi Li, Shuangji Liu, Yanchen Meng, Shenyi Qi, Zhe Qu, Fan Li, Yu Wang

    Industrial Internet of Things (IIoT) is an emerging technology that digitizes industrial production and realizes Industry 4.0. However, it shows that IIoT is difficult to enable sophisticated downstream applications without eliciting all devices to achieve collaborative intelligence. Existing works on IIoT either require the consolidation of various IIoT devices’ data into a single centralized server which has potential privacy breach, or coordinate devices to learn a global model in privacy-preserving federated learning (FL) but assume data across devices has the sample feature space and neglect the heterogeneity of IIoT devices. In this paper, we propose Meta-computing-driven vertical FL algorithms to achieve collaborative intelligence in IIoT where heterogeneous devices have imperfect data with incomplete features. Specifically, we first provide the modeling of N devices’ VFL to collectively train the sub-models and the common model. We present the computing graph to clearly indicate the gradient evaluation. To enable a fast convergence performance, we design a variance-reduced gradient estimator that can be seamlessly integrated into the basic VFL. Finally, we evaluate our proposed VFL by conducting experiments on the MNIST dataset regarding image recognition and the DAWM dataset for detecting anomalies in wafer manufacturing. The experimental results show that our VFL for IIoT is both effective and efficient.


  • On Adaptive Edge Microservice Placement: A Reinforcement Learning Approach Endowed With Graph Comprehension

    by Lixing Chen, Yang Bai, Pan Zhou, Youqi Li, Zhe Qu, Jie Xu

    Microservice (MS) structures a service application as a collection of independently deployable service modules, making it particularly suitable for delivering complex applications in distributed computing systems. This article investigates MS architecture over Mobile Edge Computing (MEC) networks (hereafter referred to as EdgeMS) and studies an EdgeMS placement problem that aims to deploy MS modules over the MEC network in a manner that maximizes the reward of MS application providers. A novel algorithm called Dual-GNN Deep Deterministic Policy Gradient (DG-DDPG) is proposed to establish an intelligent EdgeMS placement policy for optimizing the location of MS modules and performing fractional computing resource allocation. DG-DDPG leverages the graph neural network (GNN) to comprehend the graph-structured information encapsulated in the MS application structure and MEC network. A dual-GNN core is constructed in DG-DDPG, one GNN for MS applications to distill knowledge from intricate connections between MS modules, and the other GNN for MEC networks to capture complicated interactions between edge sites when providing EdgeMS. DG-DDPG embeds the dual-GNN core in a DDPG-based reinforcement learning framework, which not only handles temporal dependencies between EdgeMS placement decisions for maximizing long-term reward but also supports continuous action space for enabling fractional resource allocation. In particular, the learning process of DG-DDPG is tailored to address hard constraints (i.e., computing capacity and MS application completeness) in the EdgeMS placement problem. We design constraint-based regularization terms and add them to the objective of DG-DDPG, which facilitates the identification of feasible placement decisions during learning. We carry out systematic experiments to evaluate the performance of DG-DDPG, and the results show that DG-DDPG outperforms state-of-the-art benchmarks in terms of reward, service delay and deployment cost.