Searcharxiv⌕ Search

arXiv subjects

Jun Wu

Publications and source records attributed to Jun Wu.

At least 163 records · Page 9Linked to original sources

LightFR: Lightweight Federated Recommendation with Privacy-preserving Matrix Factorization

Federated recommender system (FRS), which enables many local devices to train a shared model jointly without transmitting local raw data, has become a prevalent recommendation paradigm with privacy-preserving advantages. However, previous work on FRS performs similarity search via inner product in continuous embedding space, which causes an efficiency bottleneck when the scale of items is extremely large. We argue that such a scheme in federated settings ignores the limited capacities in resource-constrained user devices (i.e., storage space, computational overhead, and communication bandwidth), and makes it harder to be deployed in large-scale recommender systems. Besides, it has been shown that transmitting local gradients in real-valued form between server and clients may leak users' private information. To this end, we propose a lightweight federated recommendation framework with privacy-preserving matrix factorization, LightFR, that is able to generate high-quality binary codes by exploiting learning to hash technique under federated settings, and thus enjoys both fast online inference and economic memory consumption. Moreover, we devise an efficient federated discrete optimization algorithm to collaboratively train model parameters between the server and clients, which can effectively prevent real-valued gradient attacks from malicious parties. Through extensive experiments on four real-world datasets, we show that our LightFR model outperforms several state-of-the-art FRS methods in terms of recommendation accuracy, inference efficiency and data privacy.

cs.IR↗

Device-Bind Key-Storageless Hardware AI Model IP Protection: A PUF and Permute-Diffusion Encryption-Enabled Approach

Machine learning as a service (MLaaS) framework provides intelligent services or well-trained artificial intelligence (AI) models for local devices. However, in the process of model transmission and deployment, there are security issues, i.e. AI model leakage due to the unreliable transmission environments and illegal abuse at local devices without permission. Although existing works study the intellectual property (IP) protection of AI models, they mainly focus on the watermark-based and encryption-based methods and have the following problems: (i) The watermark-based methods only provide passive verification afterward rather than active protection. (ii) Encryption-based methods are low efficiency in computation and low security in key storage. (iii) The existing methods are not device-bind without the ability to avoid illegal abuse of AI models. To deal with these problems, we propose a device-bind and key-storageless hardware AI model IP protection mechanism. First, a physical unclonable function (PUF) and permute-diffusion encryption-based AI model protection framework is proposed, including the PUF-based secret key generation and the geometric-value transformation-based weights encryption. Second, we design a PUF-based key generation protocol, where delay-based Anderson PUF is adopted to generate the derive-bind secret key. Besides, convolutional coding and convolutional interleaving technologies are combined to improve the stability of PUF-based key generation and reconstruction. Third, a permute and diffusion-based intelligent model weights encryption/decryption method is proposed to achieve effective IP protection, where chaos theory is utilized to convert the PUF-based secret key to encryption/decryption keys. Finally, experimental evaluation demonstrates the effectiveness of the proposed intelligent model IP protection mechanism.

cs.CR↗

Aircraft Ground Taxiing Deduction and Conflict Early Warning Method Based on Control Command Information

Aircraft taxiing conflict is a threat to the safety of airport operations, mainly due to the human error in control command infor-mation. In order to solve the problem, The aircraft taxiing deduction and conflict early warning method based on control order information is proposed. This method does not need additional equipment and operating costs, and is completely based on his-torical data and control command information. When the aircraft taxiing command is given, the future route information will be deduced, and the probability of conflict with other taxiing aircraft will be calculated to achieve conflict detection and early warning of different levels. The method is validated by the aircraft taxi data from real airports. The results show that the method can effectively predict the aircraft taxiing process, and can provide early warning of possible conflicts. Due to the advantages of low cost and high accuracy, this method has the potential to be applied to airport operation decision support system.

eess.SY↗

RING++: Roto-translation Invariant Gram for Global Localization on a Sparse Scan Map

Global localization plays a critical role in many robot applications. LiDAR-based global localization draws the community's focus with its robustness against illumination and seasonal changes. To further improve the localization under large viewpoint differences, we propose RING++ which has roto-translation invariant representation for place recognition, and global convergence for both rotation and translation estimation. With the theoretical guarantee, RING++ is able to address the large viewpoint difference using a lightweight map with sparse scans. In addition, we derive sufficient conditions of feature extractors for the representation preserving the roto-translation invariance, making RING++ a framework applicable to generic multi-channel features. To the best of our knowledge, this is the first learning-free framework to address all subtasks of global localization in the sparse scan map. Validations on real-world datasets show that our approach demonstrates better performance than state-of-the-art learning-free methods, and competitive performance with learning-based methods. Finally, we integrate RING++ into a multi-robot/session SLAM system, performing its effectiveness in collaborative applications.

cs.RO↗

Intrinsic motivation, Need for cognition, Grit, Growth Mindset and Academic Achievement in High School Students: Latent Profiles and Its Predictive Effects

Recent efforts to identify non-cognitive predictors of academic achievement have especially focused on self-constructs, whose measurement is concerned with a specific domain (e.g., mathematics). However, other important factors, such as character and motivation, have received less attention. Additionally, the predictive accuracy of non-cognitive factors lacks evidence from subjects including English and Science. In this study, we take a person-centered approach and focus on students' intrinsic motivation, need for cognition, grit, and growth mindset. We mainly focus on how these factors predict students' mathematics, English, and science grades between 9th grade and 12th grade. 2,308 samples from high school students in Boston (Female = 1,237; aged from 13 to 17). The research results indicated that: (1) four latent profiles of students emerged: High in grit students (n = 997, 43.2%, higher scores of grit); Moderate students (n = 905, 38.3%, moderate in all scores); High in intrinsic motivation students (n = 252, 11.8%, higher scores of intrinsic motivation); Low in grit students (n = 154, 6.7%, lower scores of grit); (2) students' gender, race, maternal education level, and social-economic ranking predicted the profiles; and (3) four profiles of students had a significant predictive effect on Mathematics, Science and English scores in both 9th grade and 12th grade. We discussed the importance of character education for adolescents and motivation for learning in high school.

physics.ed-ph↗

Adversarial Robustness through Bias Variance Decomposition: A New Perspective for Federated Learning

Federated learning learns a neural network model by aggregating the knowledge from a group of distributed clients under the privacy-preserving constraint. In this work, we show that this paradigm might inherit the adversarial vulnerability of the centralized neural network, i.e., it has deteriorated performance on adversarial examples when the model is deployed. This is even more alarming when federated learning paradigm is designed to approximate the updating behavior of a centralized neural network. To solve this problem, we propose an adversarially robust federated learning framework, named Fed_BVA, with improved server and client update mechanisms. This is motivated by our observation that the generalization error in federated learning can be naturally decomposed into the bias and variance triggered by multiple clients' predictions. Thus, we propose to generate the adversarial examples via maximizing the bias and variance during server update, and learn the adversarially robust model updates with those examples during client update. As a result, an adversarially robust neural network can be aggregated from these improved local clients' model updates. The experiments are conducted on multiple benchmark data sets using several prevalent neural network models, and the empirical results show that our framework is robust against white-box and black-box adversarial corruptions under both IID and non-IID settings.

cs.LG↗

Cost-effective Network Disintegration through Targeted Enumeration

Finding an optimal subset of nodes or links to disintegrate harmful networks is a fundamental problem in network science, with potential applications to anti-terrorism, epidemic control, and many other fields of study. The challenge of the network disintegration problem is to balance the effectiveness and efficiency of strategies. In this paper, we propose a cost-effective targeted enumeration method for network disintegration. The proposed approach includes two stages: searching for candidate objects and identifying an optimal solution. In the first stage, we use rank aggregation to generate a comprehensive ranking of node importance, upon which we identify a small-scale candidate set of nodes to remove. In the second stage, we use an enumeration method to find an optimal combination among the candidate nodes. Extensive experimental results on synthetic and real-world networks demonstrate that the proposed method achieves a satisfying trade-off between effectiveness and efficiency. The introduced two-stage targeted enumeration framework can also be applied to other computationally intractable combinational optimization problems, from team assembly via portfolio investment to drug design.

cs.SI↗

A Streamline-guided De-Homogenization Approach for Structural Design

We present a novel de-homogenization approach for efficient design of high-resolution load-bearing structures. The proposed approach builds upon a streamline-based parametrization of the design domain, using a set of space-filling and evenly-spaced streamlines in the two mutually orthogonal direction fields that are obtained from homogenization-based topology optimization. Streamlines in these fields are converted into a graph, which is then used to construct a quad-dominant mesh whose edges follow the direction fields. In addition, the edge width is adjusted according to the density and anisotropy of the optimized orthotropic cells. In a number of numerical examples, we demonstrate the mechanical performance and regular appearance of the resulting structural designs, and compare them with those from classic and contemporary approaches.

cs.CE↗

A Unified Meta-Learning Framework for Dynamic Transfer Learning

Transfer learning refers to the transfer of knowledge or information from a relevant source task to a target task. However, most existing works assume both tasks are sampled from a stationary task distribution, thereby leading to the sub-optimal performance for dynamic tasks drawn from a non-stationary task distribution in real scenarios. To bridge this gap, in this paper, we study a more realistic and challenging transfer learning setting with dynamic tasks, i.e., source and target tasks are continuously evolving over time. We theoretically show that the expected error on the dynamic target task can be tightly bounded in terms of source knowledge and consecutive distribution discrepancy across tasks. This result motivates us to propose a generic meta-learning framework L2E for modeling the knowledge transferability on dynamic tasks. It is centered around a task-guided meta-learning problem with a group of meta-pairs of tasks, based on which we are able to learn the prior model initialization for fast adaptation on the newest target task. L2E enjoys the following properties: (1) effective knowledge transferability across dynamic tasks; (2) fast adaptation to the new target task; (3) mitigation of catastrophic forgetting on historical target tasks; and (4) flexibility in incorporating any existing static transfer learning algorithms. Extensive experiments on various image data sets demonstrate the effectiveness of the proposed L2E framework.

cs.LG↗

Towards Two-view 6D Object Pose Estimation: A Comparative Study on Fusion Strategy

Current RGB-based 6D object pose estimation methods have achieved noticeable performance on datasets and real world applications. However, predicting 6D pose from single 2D image features is susceptible to disturbance from changing of environment and textureless or resemblant object surfaces. Hence, RGB-based methods generally achieve less competitive results than RGBD-based methods, which deploy both image features and 3D structure features. To narrow down this performance gap, this paper proposes a framework for 6D object pose estimation that learns implicit 3D information from 2 RGB images. Combining the learned 3D information and 2D image features, we establish more stable correspondence between the scene and the object models. To seek for the methods best utilizing 3D information from RGB inputs, we conduct an investigation on three different approaches, including Early- Fusion, Mid-Fusion, and Late-Fusion. We ascertain the Mid- Fusion approach is the best approach to restore the most precise 3D keypoints useful for object pose estimation. The experiments show that our method outperforms state-of-the-art RGB-based methods, and achieves comparable results with RGBD-based methods.

cs.CV↗

OpenFish: Biomimetic Design of a Soft Robotic Fish for High Speed Locomotion

We present OpenFish: an open source soft robotic fish which is optimized for speed and efficiency. The soft robotic fish uses a combination of an active and passive tail segment to accurately mimic the thunniform swimming mode. Through the implementation of a novel propulsion system that is capable of achieving higher oscillation frequencies with a more sinusoidal waveform, the open source soft robotic fish achieves a top speed of $0.85~\mathrm{m/s}$. Hereby, it outperforms the previously reported fastest soft robotic fish by $27\%$. Besides the propulsion system, the optimization of the fish morphology played a crucial role in achieving this speed. In this work, a detailed description of the design, construction and customization of the soft robotic fish is presented. Hereby, we hope this open source design will accelerate future research and developments in soft robotic fish.

cs.RO↗

Light-induced dimension crossover in 1T-TiSe$_2$ dictated by excitonic correlations

In low-dimensional systems with strong electronic correlations, the application of an ultrashort laser pulse often yields novel phases that are otherwise inaccessible. The central challenge in understanding such phenomena is to determine how dimensionality and many-body correlations together govern the pathway of a non-adiabatic transition. To this end, we examine a layered compound, 1T-TiSe$_2$, whose three-dimensional charge-density-wave (3D CDW) state also features exciton condensation due to strong electron-hole interactions. We find that photoexcitation suppresses the equilibrium 3D CDW while creating a nonequilibrium 2D CDW. Remarkably, the dimension reduction does not occur unless bound electron-hole pairs are broken. This relation suggests that excitonic correlations maintain the out-of-plane CDW coherence, settling a long-standing debate over their role in the CDW transition. Our findings demonstrate how optical manipulation of electronic interaction enables one to control the dimensionality of a broken-symmetry order, paving the way for realizing other emergent states in strongly correlated systems.

cond-mat.str-el↗

LiDAR-Inertial 3D SLAM with Plane Constraint for Multi-story Building

The ubiquitous planes and structural consistency are the most apparent features of indoor multi-story Buildings compared with outdoor environments. In this paper, we propose a tightly coupled LiDAR-Inertial 3D SLAM framework with plane features for the multi-story building. The framework we proposed is mainly composed of three parts: tightly coupled LiDAR-Inertial odometry, extraction of representative planes of the structure, and factor graph optimization. By building a local map and inertial measurement unit (IMU) pre-integration, we get LiDAR scan-to-local-map matching and IMU measurements, respectively. Minimize the joint cost function to obtain the LiDAR-Inertial odometry information. Once a new keyframe is added to the graph, all the planes of this keyframe that can represent structural features are extracted to find the constraint between different poses and stories. A keyframe-based factor graph is conducted with the constraint of planes, and LiDAR-Inertial odometry for keyframe poses refinement. The experimental results show that our algorithm has outstanding performance in accuracy compared with the state-of-the-art algorithms.

cs.RO↗

Location Information Assisted Beamforming Design for Reconfigurable Intelligent Surface Aided Communication Systems

In reconfigurable intelligent surface (RIS) aided millimeter-wave (mmWave) communication systems, in order to overcome the limitation of the conventional channel state information (CSI) acquisition techniques, this paper proposes a location information assisted beamforming design without the requirement of the conventional channel training process. First, we establish the geometrical relation between the channel model and the user location, based on which we derive an approximate CSI error bound based on the user location error by means of Taylor approximation, triangle and power mean inequalities, and semidefinite relaxation (SDR). Second, for combating the uncertainty of the location error, we formulate a worst-case robust beamforming optimization problem. To solve the problem efficiently, we develop a novel iterative algorithm by utilizing various optimization tools such as Lagrange multiplier, matrix inversion lemma, SDR, as well as branch-and-bound (BnB). Additionally, we provide sufficient conditions for the SDR to output rank-one solutions, and modify the BnB algorithm to acquire the phase shift solution under an arbitrary constraint of possible phase shift values. Finally, we analyse the algorithm convergence and complexity, and carry out simulations to validate the theoretical derivation of the CSI error bound and the robustness of the proposed algorithm. Compared with the existing non-robust approach and the robust beamforming techniques based on S-procedure and penalty convex-concave procedure (CCP), our method can converge more quickly and achieve better performance in terms of the worst-case signal-to-noise ratio (SNR) at the receiver.

cs.IT↗

3D-TSV: The 3D Trajectory-based Stress Visualizer

We present the 3D Trajectory-based Stress Visualizer (3D-TSV), a visual analysis tool for the exploration of the principal stress directions in 3D solids under load. 3D-TSV provides a modular and generic implementation of key algorithms required for a trajectory-based visual analysis of principal stress directions, including the automatic seeding of space-filling stress lines, their extraction using numerical schemes, their mapping to an effective renderable representation, and rendering options to convey structures with special mechanical properties. In the design of 3D-TSV, several perceptual challenges have been addressed when simultaneously visualizing three mutually orthogonal stress directions via lines. We present a novel algorithm for generating a space-filling and evenly spaced set of mutually orthogonal lines. The algorithm further considers the locations of lines to obtain a more regular appearance, and enables the extraction of a level-of-detail representation with adjustable sparseness of the trajectories along a certain stress direction. To convey ambiguities in the orientation of the principal stress directions, the user can select a combined visualization of two principal directions via oriented ribbons. Additional depth cues improve the perception of the spatial relationships between trajectories. 3D-TSV is accessible to end users via a C++- and OpenGL-based rendering frontend that is seamlessly connected to a MatLab-based extraction backend. The code (BSD license) of 3D-TSV as well as scripts to make ANSYS and ABAQUS simulation results accessible to the 3D-TSV backend are publicly available.

cs.GR↗

Adaptive Transfer Learning for Plant Phenotyping

Plant phenotyping (Guo et al. 2021; Pieruschka et al. 2019) focuses on studying the diverse traits of plants related to the plants' growth. To be more specific, by accurately measuring the plant's anatomical, ontogenetical, physiological and biochemical properties, it allows identifying the crucial factors of plants' growth in different environments. One commonly used approach is to predict the plant's traits using hyperspectral reflectance (Yendrek et al. 2017; Wang et al. 2021). However, the data distributions of the hyperspectral reflectance data in plant phenotyping might vary in different environments for different plants. That is, it would be computationally expansive to learn the machine learning models separately for one plant in different environments. To solve this problem, we focus on studying the knowledge transferability of modern machine learning models in plant phenotyping. More specifically, this work aims to answer the following questions. (1) How is the performance of conventional machine learning models, e.g., partial least squares regression (PLSR), Gaussian process regression (GPR) and multi-layer perceptron (MLP), affected by the number of annotated samples for plant phenotyping? (2) Whether could the neural network based transfer learning models improve the performance of plant phenotyping? (3) Could the neural network based transfer learning be improved by using infinite-width hidden layers for plant phenotyping?

cs.LG↗

Near-complete violation of Kirchhoff s law in thermal radiation in ultrathin magnetic Weyl semimetal films

The ability to break Kirchhoff s law is of fundamental importance in thermal radiation. Various nonreciprocal emitters have been proposed to break the balance between absorption and emission. However, the thicknesses of the nonreciprocal materials are usually larger than 1/10 times of the wavelength. Besides, the previous proposed nonreciprocal emitters are complex, thus they can hardly be fabricated in experiment to verify the Kirchhoff s law for nonreciprocal materials. In this paper, we investigate the nonreciprocal thermal radiation of the magnetic Weyl semimetal (MWSM) film atop of the metal substrate. It is found that the strong nonreciprocal radiation at the wavelength of 9.15 μm can be achieved when the thickness of the MWSM film is 100 nm. The enhanced nonreciprocity is attributed to the Fabry-Perot resonances. The results indicate that the MWSM film is the promising candidate to engineer the ultrathin and simple nonreciprocal thermal emitters. What is perhaps most intriguing here is that the proposed structure can be more easily fabricated in experiment to verify the Kirchhoff s law for nonreciprocal materials.

cond-mat.mes-hall↗

Learning Stereopsis from Geometric Synthesis for 6D Object Pose Estimation

Current monocular-based 6D object pose estimation methods generally achieve less competitive results than RGBD-based methods, mostly due to the lack of 3D information. To make up this gap, this paper proposes a 3D geometric volume based pose estimation method with a short baseline two-view setting. By constructing a geometric volume in the 3D space, we combine the features from two adjacent images to the same 3D space. Then a network is trained to learn the distribution of the position of object keypoints in the volume, and a robust soft RANSAC solver is deployed to solve the pose in closed form. To balance accuracy and cost, we propose a coarse-to-fine framework to improve the performance in an iterative way. The experiments show that our method outperforms state-of-the-art monocular-based methods, and is robust in different objects and scenes, especially in serious occlusion situations.

cs.CV↗