Search arXiv⌕ Search

arXiv subjects

Di Wu

Publications and source records attributed to Di Wu.

At least 505 records · Page 28Linked to original sources

Dual Class-Aware Contrastive Federated Semi-Supervised Learning

Federated semi-supervised learning (FSSL), facilitates labeled clients and unlabeled clients jointly training a global model without sharing private data. Existing FSSL methods predominantly employ pseudo-labeling and consistency regularization to exploit the knowledge of unlabeled data, achieving notable success in raw data utilization. However, these training processes are hindered by large deviations between uploaded local models of labeled and unlabeled clients, as well as confirmation bias introduced by noisy pseudo-labels, both of which negatively affect the global model's performance. In this paper, we present a novel FSSL method called Dual Class-aware Contrastive Federated Semi-Supervised Learning (DCCFSSL). This method accounts for both the local class-aware distribution of each client's data and the global class-aware distribution of all clients' data within the feature space. By implementing a dual class-aware contrastive module, DCCFSSL establishes a unified training objective for different clients to tackle large deviations and incorporates contrastive information in the feature space to mitigate confirmation bias. Moreover, DCCFSSL introduces an authentication-reweighted aggregation technique to improve the server's aggregation robustness. Our comprehensive experiments show that DCCFSSL outperforms current state-of-the-art methods on three benchmark datasets and surpasses the FedAvg with relabeled unlabeled clients on CIFAR-10, CIFAR-100, and STL-10 datasets. To our knowledge, we are the first to present an FSSL method that utilizes only 10\% labeled clients, while still achieving superior performance compared to standard federated supervised learning, which uses all clients with labeled data.

cs.LG↗

Rearrangement inequalities of the one-dimensional maximal functions associated with general measures

We prove a rearrangement inequality for the uncentered Hardy-Littlewood maximal function $M_μ$ associate to general measure $μ$ on $\mathbb{R}$. This inequality is analogous to the Stein's result $cf^{**}(t)\leq(Mf)^{*}(t)\leq C f^{**}(t)$, where $f^*$ is the symmetric decreasing rearrangement function of $f$ and $f^{**}(t)=\int_0^tf^*(x)dx$. Moreover, we compute the best constant of $M_μ$ on $L^{p,\infty}(\mathbb{R},dμ)$.

math.CA↗

Prescribing Chern scalar curvatures on noncompact manifolds

In this paper, we investigate the noncompact prescribed Chern scalar curvature problem which reduces to solve a Kazdan-Warner type equation on noncompact non-Kähler manifolds. By introducing an analytic condition on noncompact manifolds, we establish related existence results. As its another application, we further give a new proof of a classical multiplicity theorem of W.M. Ni.

math.DG↗

Classifying topology of consistent thermodynamics of the four-dimensional neutral Lorentzian NUT-charged spacetimes

In this paper, via employing the uniformly modified form of the generalized off-shell Helmholtz free energy, we investigate the topological numbers for the four-dimensional neutral Lorentzian Taub-NUT, Taub-NUT-AdS and Kerr-NUT spacetimes, and find that these solutions can also be classified into one of three types of those well-known black hole solutions, which implies that these spacetimes should be viewed as generic black holes from the viewpoint of the thermodynamic topological approach.

gr-qc↗

Observation of colossal topological Hall effect in noncoplanar ferromagnet Cr5Te6 thin films

The topological Hall effect (THE) is critical to the exploration of the spin chirality generated by the real-space Berry curvature, which has attracted worldwide attention for its prospective applications in spintronic devices. However, the prominent THE remains elusive at room temperature, which severely restricts the practical integration of chiral spin textures. Here, we show a colossal intrinsic THE in large-area ferromagnet Cr5Te6 thin films epitaxially grown by pulsed laser deposition. Such a THE can be maintained until 270 K, which is attributed to the field-stimulated noncoplanar spin textures induced by the interaction of the in-plane ferromagnet and antiferromagnet infrastructures. Our first-principles calculations further verify the considerable Dzyaloshinskii-Moriya interaction in Cr5Te6. This work not only paves the way for robust chiral spin textures near room temperature in large-area low-dimensional ferromagnetic films for practical applications, but also facilitates the development of high-density and dissipationless spintronic devices.

cond-mat.mtrl-sci↗

Harmonic metrics and semi-simpleness

Given a flat vector bundle over a compact Riemannian manifold, Corlette and Donaldson proved that it admits harmonic metrics if and only if it is semi-simple. In this paper, we extend this equivalence to arbitrary vector bundles without any additional hypothesis, the result can be viewed as a Riemannian Hitchin-Kobayashi correspondence. Furthermore, we also prove an equivalence of categories in Sasakian geometry, relating the category of projective flat complex vector bundles to the category of Higgs bundles.

math.DG↗

Topological classes of thermodynamics of rotating AdS black holes

In this paper, we extend our previous work [Phys. Rev. D 107, 024024 (2023)] to the more general cases with a negative cosmological constant, and investigate the topological numbers for the singly rotating Kerr-AdS black holes in all dimensions and the four-dimensional Kerr-Newman-AdS black hole as well as the three-dimensional Bañados-Teitelboim-Zanelli black hole. We find that the topological numbers of black holes are remarkably influenced by the cosmological constant. In addition, we also demonstrate that the dimension of spacetimes has an important effect on the topological number for rotating AdS black holes. Furthermore, it is interesting to observe that the difference between the topological number of the AdS black hole and that of its corresponding asymptotically flat black hole is always unity. This new observation leads us to conjure that it might be valid also for other black holes. Of course, this novel conjecture needs to be further verified by examining the topological numbers of many other black holes and their AdS counterparts in the future work.

hep-th↗

Edge-Based Video Analytics: A Survey

Edge computing has been getting a momentum with ever-increasing data at the edge of the network. In particular, huge amounts of video data and their real-time processing requirements have been increasingly hindering the traditional cloud computing approach due to high bandwidth consumption and high latency. Edge computing in essence aims to overcome this hindrance by processing most video data making use of edge servers, such as small-scale on-premises server clusters, server-grade computing resources at mobile base stations and even mobile devices like smartphones and tablets; hence, the term edge-based video analytics. However, the actual realization of such analytics requires more than the simple, collective use of edge servers. In this paper, we survey state-of-the-art works on edge-based video analytics with respect to applications, architectures, techniques, resource management, security and privacy. We provide a comprehensive and detailed review on what works, what doesn't work and why. These findings give insights and suggestions for next generation edge-based video analytics. We also identify open issues and research directions.

cs.DC↗

Mixed-Variable PSO with Fairness on Multi-Objective Field Data Replication in Wireless Networks

Digital twins have shown a great potential in supporting the development of wireless networks. They are virtual representations of 5G/6G systems enabling the design of machine learning and optimization-based techniques. Field data replication is one of the critical aspects of building a simulation-based twin, where the objective is to calibrate the simulation to match field performance measurements. Since wireless networks involve a variety of key performance indicators (KPIs), the replication process becomes a multi-objective optimization problem in which the purpose is to minimize the error between the simulated and field data KPIs. Unlike previous works, we focus on designing a data-driven search method to calibrate the simulator and achieve accurate and reliable reproduction of field performance. This work proposes a search-based algorithm based on mixedvariable particle swarm optimization (PSO) to find the optimal simulation parameters. Furthermore, we extend this solution to account for potential conflicts between the KPIs using α-fairness concept to adjust the importance attributed to each KPI during the search. Experiments on field data showcase the effectiveness of our approach to (i) improve the accuracy of the replication, (ii) enhance the fairness between the different KPIs, and (iii) guarantee faster convergence compared to other methods.

cs.NI↗

Policy Reuse for Communication Load Balancing in Unseen Traffic Scenarios

With the continuous growth in communication network complexity and traffic volume, communication load balancing solutions are receiving increasing attention. Specifically, reinforcement learning (RL)-based methods have shown impressive performance compared with traditional rule-based methods. However, standard RL methods generally require an enormous amount of data to train, and generalize poorly to scenarios that are not encountered during training. We propose a policy reuse framework in which a policy selector chooses the most suitable pre-trained RL policy to execute based on the current traffic condition. Our method hinges on a policy bank composed of policies trained on a diverse set of traffic scenarios. When deploying to an unknown traffic scenario, we select a policy from the policy bank based on the similarity between the previous-day traffic of the current scenario and the traffic observed during training. Experiments demonstrate that this framework can outperform classical and adaptive rule-based methods by a large margin.

cs.NI↗

Communication Load Balancing via Efficient Inverse Reinforcement Learning

Communication load balancing aims to balance the load between different available resources, and thus improve the quality of service for network systems. After formulating the load balancing (LB) as a Markov decision process problem, reinforcement learning (RL) has recently proven effective in addressing the LB problem. To leverage the benefits of classical RL for load balancing, however, we need an explicit reward definition. Engineering this reward function is challenging, because it involves the need for expert knowledge and there lacks a general consensus on the form of an optimal reward function. In this work, we tackle the communication load balancing problem from an inverse reinforcement learning (IRL) approach. To the best of our knowledge, this is the first time IRL has been successfully applied in the field of communication load balancing. Specifically, first, we infer a reward function from a set of demonstrations, and then learn a reinforcement learning load balancing policy with the inferred reward function. Compared to classical RL-based solution, the proposed solution can be more general and more suitable for real-world scenarios. Experimental evaluations implemented on different simulated traffic scenarios have shown our method to be effective and better than other baselines by a considerable margin.

cs.NI↗

Multi-agent Attention Actor-Critic Algorithm for Load Balancing in Cellular Networks

In cellular networks, User Equipment (UE) handoff from one Base Station (BS) to another, giving rise to the load balancing problem among the BSs. To address this problem, BSs can work collaboratively to deliver a smooth migration (or handoff) and satisfy the UEs' service requirements. This paper formulates the load balancing problem as a Markov game and proposes a Robust Multi-agent Attention Actor-Critic (Robust-MA3C) algorithm that can facilitate collaboration among the BSs (i.e., agents). In particular, to solve the Markov game and find a Nash equilibrium policy, we embrace the idea of adopting a nature agent to model the system uncertainty. Moreover, we utilize the self-attention mechanism, which encourages high-performance BSs to assist low-performance BSs. In addition, we consider two types of schemes, which can facilitate load balancing for both active UEs and idle UEs. We carry out extensive evaluations by simulations, and simulation results illustrate that, compared to the state-of-the-art MARL methods, Robust-\ours~scheme can improve the overall performance by up to 45%.

cs.AI↗

Anomaly Detection with Ensemble of Encoder and Decoder

Hacking and false data injection from adversaries can threaten power grids' everyday operations and cause significant economic loss. Anomaly detection in power grids aims to detect and discriminate anomalies caused by cyber attacks against the power system, which is essential for keeping power grids working correctly and efficiently. Different methods have been applied for anomaly detection, such as statistical methods and machine learning-based methods. Usually, machine learning-based methods need to model the normal data distribution. In this work, we propose a novel anomaly detection method by modeling the data distribution of normal samples via multiple encoders and decoders. Specifically, the proposed method maps input samples into a latent space and then reconstructs output samples from latent vectors. The extra encoder finally maps reconstructed samples to latent representations. During the training phase, we optimize parameters by minimizing the reconstruction loss and encoding loss. Training samples are re-weighted to focus more on missed correlations between features of normal data. Furthermore, we employ the long short-term memory model as encoders and decoders to test its effectiveness. We also investigate a meta-learning-based framework for hyper-parameter tuning of our approach. Experiment results on network intrusion and power system datasets demonstrate the effectiveness of our proposed method, where our models consistently outperform all baselines.

cs.LG↗

Meta-Learning Based Early Fault Detection for Rolling Bearings via Few-Shot Anomaly Detection

Early fault detection (EFD) of rolling bearings can recognize slight deviation of the health states and contribute to the stability of mechanical systems. In practice, very limited target bearing data are available to conduct EFD, which makes it hard to adapt to the EFD task of new bearings. To address this problem, many transfer learning based EFD methods utilize historical data to learn transferable domain knowledge and conduct early fault detection on new target bearings. However, most existing methods only consider the distribution drift across different working conditions but ignore the difference between bearings under the same working condition, which is called Unit-to-Unit Variability (UtUV). The setting of EFD with limited target data considering UtUV can be formulated as a Few-shot Anomaly Detection task. Therefore, this paper proposes a novel EFD method based on meta-learning considering UtUV. The proposed method can learn a generic metric based on Relation Network (RN) to measure the similarity between normal data and the new arrival target bearing data. Besides, the proposed method utilizes a health state embedding strategy to decrease false alarms. The performance of proposed method is tested on two bearing datasets. The results show that the proposed method can detect incipient faults earlier than the baselines with lower false alarms.

cs.LG↗

An Early Fault Detection Method of Rotating Machines Based on Multiple Feature Fusion with Stacking Architecture

Early fault detection (EFD) of rotating machines is important to decrease the maintenance cost and improve the mechanical system stability. One of the key points of EFD is developing a generic model to extract robust and discriminative features from different equipment for early fault detection. Most existing EFD methods focus on learning fault representation by one type of feature. However, a combination of multiple features can capture a more comprehensive representation of system state. In this paper, we propose an EFD method based on multiple feature fusion with stacking architecture (M2FSA). The proposed method can extract generic and discriminiative features to detect early faults by combining time domain (TD), frequency domain (FD), and time-frequency domain (TFD) features. In order to unify the dimensions of the different domain features, Stacked Denoising Autoencoder (SDAE) is utilized to learn deep features in three domains. The architecture of the proposed M2FSA consists of two layers. The first layer contains three base models, whose corresponding inputs are different deep features. The outputs of the first layer are concatenated to generate the input to the second layer, which consists of a meta model. The proposed method is tested on three bearing datasets. The results demonstrate that the proposed method is better than existing methods both in sensibility and reliability.

cs.LG↗

Negative electrocaloric effect in nonpolar phases of perovskite over wide range of temperature

The electrocaloric effect (ECE) offers a promising alternative to the traditional gas compressing refrigeration due to its high efficiency and environmental friendliness. The unusual negative electrocaloric effect refers to the adiabatic temperature drops due to application of electric field, in contrast with the normal (positive) ECE, and provides ways to improve the electrocaloric efficiency in refrigeration cycles. However, negative ECE is unusual and requires a clear understanding of microscopic mechanisms. Here, we found unexpected and extensive negative ECE in nonpolar orthorhombic, tetragonal, and cubic phases of halide and oxide perovskite at wide range of temperature by means of first-principle-based large scale Monte Carlo methods. Such unexpected negative ECE originates from the octahedral tilting related entropy change rather than the polarization entropy change under the application of electric field. Furthermore, a giant negative ECE with temperature change of 8.6 K is found at room temperature. This giant and extensive negative ECE in perovskite opens up new horizon in the research of caloric effects and broadens the electrocaloric refrigeration ways with high efficiency.

cond-mat.mtrl-sci↗

A Modified Sequence-to-point HVAC Load Disaggregation Algorithm

This paper presents a modified sequence-to-point (S2P) algorithm for disaggregating the heat, ventilation, and air conditioning (HVAC) load from the total building electricity consumption. The original S2P model is convolutional neural network (CNN) based, which uses load profiles as inputs. We propose three modifications. First, the input convolution layer is changed from 1D to 2D so that normalized temperature profiles are also used as inputs to the S2P model. Second, a drop-out layer is added to improve adaptability and generalizability so that the model trained in one area can be transferred to other geographical areas without labelled HVAC data. Third, a fine-tuning process is proposed for areas with a small amount of labelled HVAC data so that the pre-trained S2P model can be fine-tuned to achieve higher disaggregation accuracy (i.e., better transferability) in other areas. The model is first trained and tested using smart meter and sub-metered HVAC data collected in Austin, Texas. Then, the trained model is tested on two other areas: Boulder, Colorado and San Diego, California. Simulation results show that the proposed modified S2P algorithm outperforms the original S2P model and the support-vector machine based approach in accuracy, adaptability, and transferability.

eess.SY↗

Online Sparse Streaming Feature Selection Using Adapted Classification

Traditional feature selections need to know the feature space before learning, and online streaming feature selection (OSFS) is proposed to process streaming features on the fly. Existing methods divide features into relevance or irrelevance without missing data, and deleting irrelevant features may lead to in-formation loss. Motivated by this, we focus on completing the streaming feature matrix and division of feature correlation and propose online sparse streaming feature selection based on adapted classification (OS2FS-AC). This study uses Latent Factor Analysis (LFA) to pre-estimate missed data. Besides, we use the adaptive method to obtain the threshold, divide the features into strongly relevant, weakly relevant, and irrelevant features, and then divide weak relevance with more information. Experimental results on ten real-world data sets demonstrate that OS2FS-AC performs better than state-of-the-art algo-rithms.

cs.LG↗