Searcharxiv⌕ Search

arXiv subjects

Yong Ren

Publications and source records attributed to Yong Ren.

At least 55 records · Page 3Linked to original sources

MERBench: A Unified Evaluation Benchmark for Multimodal Emotion Recognition

Multimodal emotion recognition plays a crucial role in enhancing user experience in human-computer interaction. Over the past few decades, researchers have proposed a series of algorithms and achieved impressive progress. Although each method shows its superior performance, different methods lack a fair comparison due to inconsistencies in feature extractors, evaluation manners, and experimental settings. These inconsistencies severely hinder the development of this field. Therefore, we build MERBench, a unified evaluation benchmark for multimodal emotion recognition. We aim to reveal the contribution of some important techniques employed in previous works, such as feature selection, multimodal fusion, robustness analysis, fine-tuning, pre-training, etc. We hope this benchmark can provide clear and comprehensive guidance for follow-up researchers. Based on the evaluation results of MERBench, we further point out some promising research directions. Additionally, we introduce a new emotion dataset MER2023, focusing on the Chinese language environment. This dataset can serve as a benchmark dataset for research on multi-label learning, noise robustness, and semi-supervised learning. We encourage the follow-up researchers to evaluate their algorithms under the same experimental setup as MERBench for fair comparisons. Our code is available at: https://github.com/zeroQiaoba/MERTools.

cs.HC↗

Fewer-token Neural Speech Codec with Time-invariant Codes

Language model based text-to-speech (TTS) models, like VALL-E, have gained attention for their outstanding in-context learning capability in zero-shot scenarios. Neural speech codec is a critical component of these models, which can convert speech into discrete token representations. However, excessive token sequences from the codec may negatively affect prediction accuracy and restrict the progression of Language model based TTS models. To address this issue, this paper proposes a novel neural speech codec with time-invariant codes named TiCodec. By encoding and quantizing time-invariant information into a separate code, TiCodec can reduce the amount of frame-level information that needs encoding, effectively decreasing the number of tokens as codes of speech. Furthermore, this paper introduces a time-invariant encoding consistency loss to enhance the consistency of time-invariant code within an utterance and force it to capture more global information, which can benefit the zero-shot TTS task. Experimental results demonstrate that TiCodec can not only enhance the quality of reconstruction speech with fewer tokens but also increase the similarity and naturalness, as well as reduce the word error rate of the synthesized speech by the TTS model.

cs.SD↗

On Inhomogeneous Infinite Products of Stochastic Matrices and Applications

With the growth of magnitude of multi-agent networks, distributed optimization holds considerable significance within complex systems. Convergence, a pivotal goal in this domain, is contingent upon the analysis of infinite products of stochastic matrices (IPSMs). In this work, convergence properties of inhomogeneous IPSMs are investigated. The convergence rate of inhomogeneous IPSMs towards an absolute probability sequence $π$ is derived. We also show that the convergence rate is nearly exponential, which coincides with existing results on ergodic chains. The methodology employed relies on delineating the interrelations among Sarymsakov matrices, scrambling matrices, and positive-column matrices. Based on the theoretical results on inhomogeneous IPSMs, we propose a decentralized projected subgradient method for time-varying multi-agent systems with graph-related stretches in (sub)gradient descent directions. The convergence of the proposed method is established for convex objective functions, and extended to non-convex objectives that satisfy Polyak-Lojasiewicz conditions. To corroborate the theoretical findings, we conduct numerical simulations, aligning the outcomes with the established theoretical framework.

math.OC↗

ADD 2023: the Second Audio Deepfake Detection Challenge

Audio deepfake detection is an emerging topic in the artificial intelligence community. The second Audio Deepfake Detection Challenge (ADD 2023) aims to spur researchers around the world to build new innovative technologies that can further accelerate and foster research on detecting and analyzing deepfake speech utterances. Different from previous challenges (e.g. ADD 2022), ADD 2023 focuses on surpassing the constraints of binary real/fake classification, and actually localizing the manipulated intervals in a partially fake speech as well as pinpointing the source responsible for generating any fake audio. Furthermore, ADD 2023 includes more rounds of evaluation for the fake audio game sub-challenge. The ADD 2023 challenge includes three subchallenges: audio fake game (FG), manipulation region location (RL) and deepfake algorithm recognition (AR). This paper describes the datasets, evaluation metrics, and protocols. Some findings are also reported in audio deepfake detection tasks.

cs.SD↗

Trust-Worthy Semantic Communications for the Metaverse Relying on Federated Learning

As an evolving successor to the mobile Internet, the Metaverse creates the impression of an immersive environment, integrating the virtual as well as the real world. In contrast to the traditional mobile Internet based on servers, the Metaverse is constructed by billions of cooperating users by harnessing their smart edge devices having limited communication and computation resources. In this immersive environment an unprecedented amount of multi-modal data has to be processed. To circumvent this impending bottleneck, low-rate semantic communication might be harnessed in support of the Metaverse. But given that private multi-modal data is exchanged in the Metaverse, we have to guard against security breaches and privacy invasions. Hence we conceive a trust-worthy semantic communication system for the Metaverse based on a federated learning architecture by exploiting its distributed decision-making and privacy-preserving capability. We conclude by identifying a suite of promising research directions and open issues.

cs.CR↗

Environment-Aware AUV Trajectory Design and Resource Management for Multi-Tier Underwater Computing

The Internet of underwater things (IoUT) is envisioned to be an essential part of maritime activities. Given the IoUT devices' wide-area distribution and constrained transmit power, autonomous underwater vehicles (AUVs) have been widely adopted for collecting and forwarding the data sensed by IoUT devices to the surface-stations. In order to accommodate the diverse requirements of IoUT applications, it is imperative to conceive a multi-tier underwater computing (MTUC) framework by carefully harnessing both the computing and the communications as well as the storage resources of both the surface-station and of the AUVs as well as of the IoUT devices. Furthermore, to meet the stringent energy constraints of the IoUT devices and to reduce the operating cost of the MTUC framework, a joint environment-aware AUV trajectory design and resource management problem is formulated, which is a high-dimensional NP-hard problem. To tackle this challenge, we first transform the problem into a Markov decision process (MDP) and solve it with the aid of the asynchronous advantage actor-critic (A3C) algorithm. Our simulation results demonstrate the superiority of our scheme.

cs.DC↗

Convergence Theory of Generalized Distributed Subgradient Method with Random Quantization

The distributed subgradient method (DSG) is a widely discussed algorithm to cope with large-scale distributed optimization problems in the arising machine learning applications. Most exisiting works on DSG focus on ideal communication between the cooperative agents such that the shared information between agents is exact and perfect. This assumption, however, could lead to potential privacy concerns and is not feasible when the wireless transmission links are not of good quality. To overcome the challenge, a common approach is to quantize the data locally before transmission, which avoids exposure of raw data and significantly reduces the size of data. Compared with perfect data, quantization poses fundamental challenges on loss of data accuracy, which further impacts the convergence of the algorithms. To settle the problem, we propose a generalized distributed subgradient method with random quantization, which can be intepreted as a two time-scale stochastic approximation method. We provide comprehensive results on the convergence of the algorithm and derive upper bounds on the convergence rates in terms of the quantization bit, stepsizes and the number of network agents. Our results extend the existing results, where only special cases are considered and general conclusions for the convergence rates are missing. Finally, numerical simulations are conducted on linear regression problems to support our theoretical results.

eess.SP↗

Underwater Differential Game: Finite-Time Target Hunting Task with Communication Delay

This work considers designing an unmanned target hunting system for a swarm of unmanned underwater vehicles (UUVs) to hunt a target with high maneuverability. Differential game theory is used to analyze combat policies of UUVs and the target within finite time. The challenge lies in UUVs must conduct their control policies in consideration of not only the consistency of the hunting team but also escaping behaviors of the target. To obtain stable feedback control policies satisfying Nash equilibrium, we construct the Hamiltonian function with Leibniz's formula. For further taken underwater disturbances and communication delay into consideration, modified deep reinforcement learning (DRL) is provided to investigate the underwater target hunting task in an unknown dynamic environment. Simulations show that underwater disturbances have a large impact on the system considering communication delay. Moreover, consistency tests show that UUVs perform better consistency with a relatively small range of disturbances.

eess.SY↗

Age of Information in Energy Harvesting Aided Massive Multiple Access Networks

Given the proliferation of the massive machine type communication devices (MTCDs) in beyond 5G (B5G) wireless networks, energy harvesting (EH) aided next generation multiple access (NGMA) systems have drawn substantial attention in the context of energy-efficient data sensing and transmission. However, without adaptive time slot (TS) and power allocation schemes, NGMA systems relying on stochastic sampling instants might lead to tardy actions associated both with high age of information (AoI) as well as high power consumption. For mitigating the energy consumption, we exploit a pair of sleep-scheduling policies, namely the multiple vacation (MV) policy and start-up threshold (ST) policy, which are characterized in the context of three typical multiple access protocols, including time-division multiple access (TDMA), frequency-division multiple access (FDMA) and non-orthogonal multiple access (NOMA). Furthermore, we derive closed-form expressions for the MTCD system's peak AoI, which are formulated as the optimization objective under the constraints of EH power, status update rate and stability conditions. An exact linear search based algorithm is proposed for finding the optimal solution by fixing the status update rate. As a design alternative, a low complexity concave-convex procedure (CCP) is also formulated for finding a near-optimal solution relying on the original problem's transformation into a form represented by the difference of two convex problems. Our simulation results show that the proposed algorithms are beneficial in terms of yielding a lower peak AoI at a low power consumption in the context of the multiple access protocols considered.

cs.IT↗

$L^{p}$-solutions of backward stochastic differential equations with time-delayed generators

This article is devoted to study the class of backward stochastic differential equation with delayed generator. We suppose the terminal value and the generator to be $L^{p}$-integrable with $p>1$. We derive a new type of estimation related to this BSDE. Next, we establish the existence and uniqueness result in two ways. First, an approximation technics used by Briand et al. (Stochastic Process. Appl. 108 (2003) 109-129) and hence the well-know Picard iterative procedure. Using Picard iterative procedure, we revisit the result of Dos Reis et al. (Stochastic Process. Appl. 121 (9) (2011) 2114-2150), simplifying the proof and give an explicit existence and uniqueness condition related to the Lipschitz constant $K$ and the terminal time $T$.

math.PR↗

Stochastic viscosity solutions of reflected stochastic partial differential equations with non-Lipschitz coefficients

This paper, is an attempt to extend the notion of stochastic viscosity solution to reflected semi-linear stochastic partial differential equations (RSPDEs, in short) with non-Lipschitz condition on the coefficients. Our method is fully probabilistic and use the recently developed theory on reflected backward doubly stochastic differential equations (RBDSDEs, in short). Among other, we prove the existence of the stochastic viscosity solution, and further extend the nonlinear Feynman-Kac formula to reflected SPDEs, like one appear in \cite{2}. Indeed, in their recent work, Aman and Mrhardy \cite{2} established a stochastic viscosity solution for semi-linear reflected SPDEs with nonlinear Neumann boundary condition by using its connection with RBDSDEs. However, even Aman and Mrhardy consider a general class of reflected SPDEs, all their coefficients are at least Lipschitz. Therefore, our current work can be thought of as a new generalization of a now well-know Feymann-Kac formula to SPDEs with large class of coefficients, which does not seem to exist in the literature. In other words, our work extends (in non boundary case) Aman and Mrhardy's paper.

math.PR↗

SDN-based Resource Allocation in Edge and Cloud Computing Systems: An Evolutionary Stackelberg Differential Game Approach

Recently, the boosting growth of computation-heavy applications raises great challenges for the Fifth Generation (5G) and future wireless networks. As responding, the hybrid edge and cloud computing (ECC) system has been expected as a promising solution to handle the increasing computational applications with low-latency and on-demand services of computation offloading, which requires new computing resource sharing and access control technology paradigms. This work establishes a software-defined networking (SDN) based architecture for edge/cloud computing services in 5G heterogeneous networks (HetNets), which can support efficient and on-demand computing resource management to optimize resource utilization and satisfy the time-varying computational tasks uploaded by user devices. In addition, resulting from the information incompleteness, we design an evolutionary game based service selection for users, which can model the replicator dynamics of service subscription. Based on this dynamic access model, a Stackelberg differential game based cloud computing resource sharing mechanism is proposed to facilitate the resource trading between the cloud computing service provider (CCP) and different edge computing service providers (ECPs). Then we derive the optimal pricing and allocation strategies of cloud computing resource based on the replicator dynamics of users' service selection. These strategies can promise the maximum integral utilities to all computing service providers (CPs), meanwhile the user distribution can reach the evolutionary stable state at this Stackelberg equilibrium. Furthermore, simulation results validate the performance of the designed resource sharing mechanism, and reveal the convergence and equilibrium states of user selection, and computing resource pricing and allocation.

eess.SY↗

A simple transcendental travelling wave solution and stability study for the thermophoretic motion with variable heat transmission factors on substrate-supported grapheme sheet

Manually tailored wrinkled graphene sheets hold great promise in fabricating smart solid-state devices. In this paper, we employ an energy method to transform the original third-order partial differential equation (pde), i.e. Eq. (1) into the first-order pde, i.e. Eq. (8) for the thermophoretic motion of substrate-supported graphene sheets, which can be solved in terms of semi-group and transcendental solutions. Unlike soliton solutions derived using other more sophisticated techniques [9, 23], the present transcendental solution can be easily solved numerically and provides physical insights. Most importantly, we verify that the formation of various forms for wrinkling wave solutions can be determined by the evolution of equilibrium points for Eq. (1). This sheds a light on modifying the heat sources in order to control the configuration of wrinkle waves that has not been previously addressed.

physics.app-ph↗

Mobile Data Transactions in Device-to-Device Communication Networks: Pricing and Auction

Device-to-Device (D2D) communication is offering smart phone users a choice to share files with each other without communicating with the cellular network. In this paper, we discuss the behaviors of two characters in the D2D data transaction model from an economic point of view: the data buyers who wish to buy a certain quantity of data, as well as the data sellers who wish to sell data through the D2D network. The optimal price and purchasing strategies are analyzed and deduced based on game theory.

cs.NI↗

Aggressive Congestion Control Mechanism for Space Systems

How to implement an impeccable space system-of-systems (SoS) internetworking architecture has been a significant issue in system engineering for years. Reliable data transmission is considered one of the most important technologies of space SoS internetworking systems. Due to the high bit error rate (BER), long time delay and asymmetrical channel in the space communication environment, the congestion control mechanism of classic transport control protocols (TCP) shows unsatisfying performances. With the help of existing TCP modifications, this paper contributes an aggressive congestion control mechanism. The proposed mechanism is characterized with a fast start procedure, as well as the feedback information to analyze network traffic and with a link terminating processing mechanism, which can help to reveal the real reason of packet loss, and maintain the size of congestion window at a high level. Simulation results are shown in the end to verify the proposed scheme.

cs.NI↗

Complex Network Theoretical Analysis on Information Dissemination over Vehicular Networks

How to enhance the communication efficiency and quality on vehicular networks is one critical important issue. While with the larger and larger scale of vehicular networks in dense cities, the real-world datasets show that the vehicular networks essentially belong to the complex network model. Meanwhile, the extensive research on complex networks has shown that the complex network theory can both provide an accurate network illustration model and further make great contributions to the network design, optimization and management. In this paper, we start with analyzing characteristics of a taxi GPS dataset and then establishing the vehicular-to-infrastructure, vehicle-to-vehicle and the hybrid communication model, respectively. Moreover, we propose a clustering algorithm for station selection, a traffic allocation optimization model and an information source selection model based on the communication performances and complex network theory.

cs.NI↗