Searcharxiv⌕ Search

arXiv subjects

Xiaofan Wang

Publications and source records attributed to Xiaofan Wang.

At least 55 records · Page 3Linked to original sources

Compressed Differentially Private Distributed Optimization with Linear Convergence

This paper addresses the problem of differentially private distributed optimization under limited communication, where each agent aims to keep their cost function private while minimizing the sum of all agents' cost functions. In response, we propose a novel Compressed differentially Private distributed Gradient Tracking algorithm (CPGT). We demonstrate that CPGT achieves linear convergence for smooth and strongly convex cost functions, even with a class of biased but contractive compressors, and achieves the same accuracy as the idealized communication algorithm. Additionally, we rigorously prove that CPGT ensures differential privacy. Simulations are provided to validate the effectiveness of the proposed algorithm.

math.OC↗

Controllability of Networked Sampled-data Systems

The controllability of networked sampled-data systems with zero-order holders on the control and transmission channels is explored, where single- and multi-rate sampling patterns are considered, respectively. The effects of sampling on the controllability of networked systems are analyzed, with some necessary and/or sufficient controllability conditions derived. Different from the sampling control of single systems, the pathological sampling of node systems could be eliminated by an appropriate design of network structure and inner couplings. While for singular topology matrices, the pathological sampling of single nodes will cause the entire system to lose controllability. Moreover, any periodic sampling will not affect the controllability of networked systems with specific node dynamics. All the results indicate that whether a networked system is under pathological sampling or not is jointly determined by mutually coupled factors.

eess.SY↗

Learning Bifunctional Push-grasping Synergistic Strategy for Goal-agnostic and Goal-oriented Tasks

Both goal-agnostic and goal-oriented tasks have practical value for robotic grasping: goal-agnostic tasks target all objects in the workspace, while goal-oriented tasks aim at grasping pre-assigned goal objects. However, most current grasping methods are only better at coping with one task. In this work, we propose a bifunctional push-grasping synergistic strategy for goal-agnostic and goal-oriented grasping tasks. Our method integrates pushing along with grasping to pick up all objects or pre-assigned goal objects with high action efficiency depending on the task requirement. We introduce a bifunctional network, which takes in visual observations and outputs dense pixel-wise maps of Q values for pushing and grasping primitive actions, to increase the available samples in the action space. Then we propose a hierarchical reinforcement learning framework to coordinate the two tasks by considering the goal-agnostic task as a combination of multiple goal-oriented tasks. To reduce the training difficulty of the hierarchical framework, we design a two-stage training method to train the two types of tasks separately. We perform pre-training of the model in simulation, and then transfer the learned model to the real world without any additional real-world fine-tuning. Experimental results show that the proposed approach outperforms existing methods in task completion rate and grasp success rate with less motion number. Supplementary material is available at https: //github.com/DafaRen/Learning_Bifunctional_Push-grasping_Synergistic_Strategy_for_Goal-agnostic_and_Goal-oriented_Tasks

cs.RO↗

Autoregressive GNN-ODE GRU Model for Network Dynamics

Revealing the continuous dynamics on the networks is essential for understanding, predicting, and even controlling complex systems, but it is hard to learn and model the continuous network dynamics because of complex and unknown governing equations, high dimensions of complex systems, and unsatisfactory observations. Moreover, in real cases, observed time-series data are usually non-uniform and sparse, which also causes serious challenges. In this paper, we propose an Autoregressive GNN-ODE GRU Model (AGOG) to learn and capture the continuous network dynamics and realize predictions of node states at an arbitrary time in a data-driven manner. The GNN module is used to model complicated and nonlinear network dynamics. The hidden state of node states is specified by the ODE system, and the augmented ODE system is utilized to map the GNN into the continuous time domain. The hidden state is updated through GRUCell by observations. As prior knowledge, the true observations at the same timestamp are combined with the hidden states for the next prediction. We use the autoregressive model to make a one-step ahead prediction based on observation history. The prediction is achieved by solving an initial-value problem for ODE. To verify the performance of our model, we visualize the learned dynamics and test them in three tasks: interpolation reconstruction, extrapolation prediction, and regular sequences prediction. The results demonstrate that our model can capture the continuous dynamic process of complex systems accurately and make precise predictions of node states with minimal error. Our model can consistently outperform other baselines or achieve comparable performance.

cs.LG↗

The spatial dissemination of COVID-19 and associated socio-economic consequences

The ongoing coronavirus disease 2019 (COVID-19) pandemic has wreaked havoc worldwide with millions of lives claimed, human travel restricted and economic development halted. Leveraging city-level mobility and case data, our analysis shows that the spatial dissemination of COVID-19 can be well explained by a local diffusion process in the mobility network rather than a global diffusion process, indicating the effectiveness of the implemented disease prevention and control measures. Based on the constructed case prediction model, it is estimated that there could be distinct social consequences if the COVID-19 outbreak happened in different areas. During the epidemic control period, human mobility experienced substantial reductions and the mobility network underwent remarkable local and global structural changes toward containing the spread of COVID-19. Our work has important implications for the mitigation of disease and the evaluation of the socio-economic consequences of COVID-19 on society.

physics.soc-ph↗

Go viral or go broadcast? Characterizing the virality and growth of cascades

Quantifying the virality of cascades is an important question across disciplines such as the transmission of disease, the spread of information and the diffusion of innovations. An appropriate virality metric should be able to disambiguate between a shallow, broadcast-like diffusion process and a deep, multi-generational branching process. Although several valuable works have been dedicated to this field, most of them fail to take the position of the diffusion source into consideration, which makes them fall into the trap of graph isomorphism and would result in imprecise estimation of cascade virality inevitably under certain circumstances. In this paper, we propose a root-aware approach to quantifying the virality of cascades with proper consideration of the root node in a diffusion tree. With applications on synthetic and empirical cascades, we show the properties and potential utility of the proposed virality measure. Based on preferential attachment mechanisms, we further introduce a model to mimic the growth of cascades. The proposed model enables the interpolation between broadcast and viral spreading during the growth of cascades. Through numerical simulations, we demonstrate the effectiveness of the proposed model in characterizing the virality of growing cascades. Our work contributes to the understanding of cascade virality and growth, and could offer practical implications in a range of policy domains including viral marketing, infectious disease and information diffusion.

physics.soc-ph↗

The Strength of Structural Diversity in Online Social Networks

Understanding the way individuals are interconnected in social networks is of prime significance to predict their collective outcomes. Leveraging a large-scale dataset from a knowledge-sharing website, this paper presents an exploratory investigation of the way to depict structural diversity in directed networks and how it can be utilized to predict one's online social reputation. To capture the structural diversity of an individual, we first consider the number of weakly and strongly connected components in one's contact neighborhood and further take the coexposure network of social neighbors into consideration. We show empirical evidence that the structural diversity of an individual is able to provide valuable insights to predict personal online social reputation, and the inclusion of a coexposure network provides an additional ingredient to achieve that goal. After synthetically controlling several possible confounding factors through matching experiments, structural diversity still plays a nonnegligible role in the prediction of personal online social reputation. Our work constitutes one of the first attempts to empirically study structural diversity in directed networks and has practical implications for a range of domains, such as social influence and collective intelligence studies.

cs.SI↗

Autonomous Highway Merging in Mixed Traffic Using Reinforcement Learning and Motion Predictive Safety Controller

Deep reinforcement learning (DRL) has a great potential for solving complex decision-making problems in autonomous driving, especially in mixed-traffic scenarios where autonomous vehicles and human-driven vehicles (HDVs) drive together. Safety is a key during both the learning and deploying reinforcement learning (RL) algorithms process. In this paper, we formulate the on-ramp merging as a Markov Decision Process (MDP) problem and solve it with an off-policy RL algorithm, i.e., Soft Actor-Critic for Discrete Action Settings (SAC-Discrete). In addition, a motion predictive safety controller including a motion predictor and an action substitution module, is proposed to ensure driving safety during both training and testing. The motion predictor estimates the trajectories of the ego vehicle and surrounding vehicles from kinematic models, and predicts potential collisions. The action substitution module updates the actions based on safety distance and replaces risky actions, before sending them to the low-level controller. We train, evaluate and test our approach on a gym-like highway simulation with three different levels of traffic modes. The simulation results show that even in harder traffic densities, our proposed method still significantly reduces collision rate while maintaining high efficiency, outperforming several state-of-the-art baselines in the considered on-ramp merging scenarios. The video demo of the evaluation process can be found at: https://www.youtube.com/watch?v=7FvjbAM4oFw

cs.RO↗

Investigating and Modeling the Dynamics of Long Ties

Long ties, the social ties that bridge different communities, are widely believed to play crucial roles in spreading novel information in social networks. However, some existing network theories and prediction models indicate that long ties might dissolve quickly or eventually become redundant, thus putting into question the long-term value of long ties. Our empirical analysis of real-world dynamic networks shows that contrary to such reasoning, long ties are more likely to persist than other social ties, and that many of them constantly function as social bridges without being embedded in local networks. Using a novel cost-benefit analysis model combined with machine learning, we show that long ties are highly beneficial, which instinctively motivates people to expend extra effort to maintain them. This partly explains why long ties are more persistent than what has been suggested by many existing theories and models. Overall, our study suggests the need for social interventions that can promote the formation of long ties, such as mixing people with diverse backgrounds.

cs.SI↗

Controllability of Multilayer Networked Sampled-data Systems

This paper explores the state controllability of multilayer networked sampled-data systems with inter-layer couplings, where zero-order holders (ZOHs) are on the control and transmission channels. The effects of both single- and multi-rate sampling on controllability of multilayer networked linear time-invariant (LTI) systems are analyzed, with some sufficient and/or necessary controllability conditions derived. Under specific conditions, the pathological sampling of single node systems could be eliminated by the network structure and inner couplings among different nodes and different layers. The representative drive-response inter-layer coupling mode is studied, and it reveals that the whole system could be controllable due to the inter-layer couplings even if the response layer is uncontrollable itself. Moreover, simulated examples show that the modification of sampling rate on local channels could lay a positive or negative effect on the controllability of the whole system. All the results indicate that the controllability of the multilayer networked sampled-data system is collectively affected by mutually coupled factors.

eess.SY↗

Fast-Learning Grasping and Pre-Grasping via Clutter Quantization and Q-map Masking

Grasping objects in cluttered scenarios is a challenging task in robotics. Performing pre-grasp actions such as pushing and shifting to scatter objects is a way to reduce clutter. Based on deep reinforcement learning, we propose a Fast-Learning Grasping (FLG) framework, that can integrate pre-grasping actions along with grasping to pick up objects from cluttered scenarios with reduced real-world training time. We associate rewards for performing moving actions with the change of environmental clutter and utilize a hybrid triggering method, leading to data-efficient learning and synergy. Then we use the output of an extended fully convolutional network as the value function of each pixel point of the workspace and establish an accurate estimation of the grasp probability for each action. We also introduce a mask function as prior knowledge to enable the agents to focus on the accurate pose adjustment to improve the effectiveness of collecting training data and, hence, to learn efficiently. We carry out pre-training of the FLG over simulated environment, and then the learnt model is transferred to the real world with minimal fine-tuning for further learning during actions. Experimental results demonstrate a 94% grasp success rate and the ability to generalize to novel objects. Compared to state-of-the-art approaches in the literature, the proposed FLG framework can achieve similar or higher grasp success rate with lesser amount of training in the real world. Supplementary video is available at https://youtu.be/e04uDLsxfDg.

cs.RO↗

Leader-Driven Opinion Dynamics in Signed Social Networks With Asynchronous Trust/Distrust Level Evolution

Trust and distrust are common in the opinion interactions among agents in social networks, and they are described by the edges with positive and negative weights in the signed digraph, respectively. It has been shown in social psychology that although the opinions of most agents (followers) tend to prevail, sometimes one agent (leader) with a firm stand and strong influence can impact or even overthrow the preferences of followers. This paper aims to analyze how the leader influences the formation of followers' opinions in signed social networks. In addition, this paper considers an asynchronous evolution mechanism of trust/distrust level based on opinion difference, in which the trust/distrust level between neighboring agents is portrayed as a nonlinear weight function of their opinion difference, and each agent interacts with the neighbors to update the trust/distrust level and opinion at the times determined by its own will. Based on the related properties of sub-stochastic and super-stochastic matrices, the inequality conditions about positive and negative weights to achieve opinion consensus and polarization are established. Some numerical simulations based on two well-known networks called the ``12 Angry Men" network and the Karate Club network are provided to verify the correctness of the theoretical results.

eess.SY↗

Conspiracy vs science: A large-scale analysis of online discussion cascades

With the emergence and rapid proliferation of social media platforms and social networking sites, recent years have witnessed a surge of misinformation spreading in our daily life. Drawing on a large-scale dataset which covers more than 1.4M posts and 18M comments, we investigate the propagation of two distinct narratives--(i) conspiracy information, whose claims are generally unsubstantiated and thus referred as misinformation to some extent, and (ii) scientific information, whose origins are generally readily identifiable and verifiable--in an online social media platform. We find that conspiracy cascades tend to propagate in a multigenerational branching process while science cascades are more likely to grow in a breadth-first manner. Specifically, conspiracy information triggers larger cascades, involves more users and generations, persists longer, is more viral and bursty than science information. Content analysis reveals that conspiracy cascades contain more negative words and emotional words which convey anger, fear, disgust, surprise and trust. We also find that conspiracy cascades are more concerned with political and controversial topics. After applying machine learning models, we achieve an AUC score of nearly 90% in discriminating conspiracy from science narratives. We find that conspiracy cascades are more likely to be controlled by a broader set of users than science cascades, imposing new challenges on the management of misinformation. Although political affinity is thought to affect the consumption of misinformation, there is very little evidence that political orientation of the information source plays a role during the propagation of conspiracy information. Our study provides complementing evidence to current misinformation research and has practical policy implications to stem the propagation and mitigate the influence of misinformation online.

cs.SI↗

Discovering an Algorithm Actually Learning Restricted Single Occurrence Regular Expression with Interleaving

A recent paper proposed an algorithm iSOIRE, which combines single-occurrence automaton (SOA) and maximum independent set (MIS) to learn a subclass single-occurrence regular expressions with interleaving (SOIREs) and claims the learnt expression is SOIRE, which has unrestricted usage for interleaving. However, in reality, the learnt expression still has many restrictions for using interleaving, even does for Kleene-star or interation, i.e, the learnt expression is not an SOIRE, we prove that by examples. In this paper, for the algorithm iSOIRE, we first give the basic notions, then provide analyses about incorrectness, finally present the correct result learnt by iSOIRE. Our theoretical analyses demonstrate that the result derived by iSOIRE belongs to a subclass of SOIREs.

cs.FL↗

Finite-size scaling of geometric renormalization flows in complex networks

Recently, the concept of geometric renormalization group provides a good approach for studying the structural symmetry and functional invariance of complex networks. Along this line, we systematically investigate the finite-size scaling of structural and dynamical observables in geometric renormalization flows of synthetic and real evolutionary networks. Our results show that these observables can be well characterized by a certain scaling function. Specifically, we show that the critical exponent implied by the scaling function is independent of these observables but only depends on the small-world properties of the network, namely, all networks located in the small-world phase have a uniform scaling exponent, while those located in the non-small-world phase and in their critical regions have another uniform scaling. More importantly, we perform extensive experiments on real evolutionary networks with small-world characteristics, and our results show that these observables also have uniform scaling in their geometric renormalization flows. Therefore, in a sense this exponent can be used as an effective measure for classifying universal small-world and non-small-world network models.

physics.soc-ph↗

Automatic Detection and Correction Algorithms for Magnetic Saturation in the SMFT/HSOS longitudinal Magnetograms

longitudinal magnetic field often suffers the saturation effect in strong magnetic field region when the measurement performs in a single-wavelength point and linear calibration is adopted. In this study, we develop a method that can judge the threshold of saturation in Stokes $V/I$ observed by the Solar Magnetic Field Telescope (SMFT) and correct for it automatically. The procedure is that first perform the second-order polynomial fit to the Stokes $V/I$ \textit{vs} $I/I_{m}$ ($I_{m}$ is the maximum value of Stokes $I$) curve to estimate the threshold of saturation, then reconstruct Stokes $V/I$ in strong field region to correct for saturation. The algorithm is proved to be effective by comparing with the magnetograms obtained by the Helioseismic and Magnetic Imager (HMI). The accurate rate of detection and correction for saturation is $\sim$99.4\% and $\sim$88\% respectively among 175 active regions. The advantages and disadvantages of the algorithm are discussed.

astro-ph.SR↗

Obliquely Incident Laser and Electron Beam Interaction in an Undulator

The angular drift of a laser beam is of particular concern in applications such as seeded free-electron lasers. A systematical study of the obliquely incident laser and electron beam interaction in an undulator is presented in this paper. Theoretical analysis and numerical simulations demonstrate that the interaction would imprint energy and angular modulations on the electron beam simultaneously. Compared with the normally incident pattern, the obliquely incident laser-electron interaction leads to reductions in the bunching factors of HGHG and EEHG. In the meanwhile, proactive applications of this multi-dimensional modulation technique may bring vitality to the field of laser-electron manipulation

physics.acc-ph↗

Standard Magnetic Field Production at Huairou Solar Observing Station

The regular solar observations are operated at Huairou Solar Observing Station (HSOS) since 1987, which make the construction of long-term magnetic field datasets available to understand solar magnetic field and cycles. There exist some inconveniences for solar physicist to use these data, because the data storage medium and format at HSOS experienced some changes. Additionally, the processes of magnetic field calibration are not easy to deal with for who are not familiar with these data. Here shows that the magnetic field of HSOS are further processed toward international standards, in order to explore HSOS observations data for scientific research.

astro-ph.SR↗