arXiv subjects

Hao Wang

Publications and source records attributed to Hao Wang.

At least 1,261 records · Page 70Linked to original sources

arXiv2022

1st ICLR International Workshop on Privacy, Accountability, Interpretability, Robustness, Reasoning on Structured Data (PAIR^2Struct)

Recent years have seen advances on principles and guidance relating to accountable and ethical use of artificial intelligence (AI) spring up around the globe. Specifically, Data Privacy, Accountability, Interpretability, Robustness, and Reasoning have been broadly recognized as fundamental principles of using machine learning (ML) technologies on decision-critical and/or privacy-sensitive applications. On the other hand, in tremendous real-world applications, data itself can be well represented as various structured formalisms, such as graph-structured data (e.g., networks), grid-structured data (e.g., images), sequential data (e.g., text), etc. By exploiting the inherently structured knowledge, one can design plausible approaches to identify and use more relevant variables to make reliable decisions, thereby facilitating real-world deployments.

stat.ML↗

arXiv2022

MyElas: An automatized tool-kit for high-throughput calculation, post-processing and visualization of elasticity and related properties of solids

Elasticity is one of the most fundamental mechanical properties of solid. In high-throughput design of advanced materials, there is an imperative demand for the capability to quickly calculate and screen a massive pool of candidate structures. A fully automatized pipeline with minimal human intervention is the key to provide high efficiency to achieve the goal. Here, we introduce a tool-kit MyElas that aims to address this problem by forging all pre-processing, elastic constant and other related property calculations, and post-processing into an integrated framework that automatically performs the assigned tasks to drive data flowing through parallelized pipelines from input to output. The core of MyElas is to calculate the second and third order elastic constants of a solid with the energy-strain method from first-principles. MyElas can auto-analyze the elastic constants, to derive other related physical quantities. Furthermore, the tool-kit also integrates a visualization function, which can, for example, plot the spatial anisotropy of elastic modulus and sound velocity of monocrystalline. The validity and efficiency of the toolkit are tested and bench-marked on several typical systems.

cond-mat.mtrl-sci↗

arXiv2022

Lattice dynamics and elastic properties of alpha-U at high-temperature and high-pressure by machine learning potential simulations

Studying the physical properties of materials under high pressure and temperature through experiments is difficult. Theoretical simulations can compensate for this deficiency. Currently, large-scale simulations using machine learning force fields are gaining popularity. As an important nuclear energy material, the evolution of the physical properties of uranium under extreme conditions is still unclear. Herein, we trained an accurate machine learning force field on alpha-U and predicted the lattice dynamics and elastic properties at high pressures and temperatures. The force field agrees well with the ab initio molecular dynamics (AIMD) and experimental results, and it exhibits higher accuracy than classical potentials. Based on the high-temperature lattice dynamics study, we first present the temperature-pressure range in which the Kohn anomalous behavior of the $Σ$4 optical mode exists. Phonon spectral function analysis showed that the phonon anharmonicity of alpha-U is very weak. We predict that the single-crystal elastic constants C44, C55, C66, polycrystalline modulus (E,G), and polycrystalline sound velocity ($C_L$,$C_S$) have strong heating-induced softening. All the elastic moduli exhibited compression-induced hardening behavior. The Poisson's ratio shows that it is difficult to compress alpha-U at high pressures and temperatures. Moreover, we observed that the material becomes substantially more anisotropic at high pressures and temperatures. The accurate predictions of alpha-U demonstrate the reliability of the method. This versatile method facilitates the study of other complex metallic materials.

cond-mat.mtrl-sci↗

arXiv2022

Multi-Grained Angle Representation for Remote Sensing Object Detection

Arbitrary-oriented object detection (AOOD) plays a significant role for image understanding in remote sensing scenarios. The existing AOOD methods face the challenges of ambiguity and high costs in angle representation. To this end, a multi-grained angle representation (MGAR) method, consisting of coarse-grained angle classification (CAC) and fine-grained angle regression (FAR), is proposed. Specifically, the designed CAC avoids the ambiguity of angle prediction by discrete angular encoding (DAE) and reduces complexity by coarsening the granularity of DAE. Based on CAC, FAR is developed to refine the angle prediction with much lower costs than narrowing the granularity of DAE. Furthermore, an Intersection over Union (IoU) aware FAR-Loss (IFL) is designed to improve accuracy of angle prediction using an adaptive re-weighting mechanism guided by IoU. Extensive experiments are performed on several public remote sensing datasets, which demonstrate the effectiveness of the proposed MGAR. Moreover, experiments on embedded devices demonstrate that the proposed MGAR is also friendly for lightweight deployments.

cs.CV↗

arXiv2022

A Taxonomy of Semantic Information in Robot-Assisted Disaster Response

This paper proposes a taxonomy of semantic information in robot-assisted disaster response. Robots are increasingly being used in hazardous environment industries and emergency response teams to perform various tasks. Operational decision-making in such applications requires a complex semantic understanding of environments that are remote from the human operator. Low-level sensory data from the robot is transformed into perception and informative cognition. Currently, such cognition is predominantly performed by a human expert, who monitors remote sensor data such as robot video feeds. This engenders a need for AI-generated semantic understanding capabilities on the robot itself. Current work on semantics and AI lies towards the relatively academic end of the research spectrum, hence relatively removed from the practical realities of first responder teams. We aim for this paper to be a step towards bridging this divide. We first review common robot tasks in disaster response and the types of information such robots must collect. We then organize the types of semantic features and understanding that may be useful in disaster operations into a taxonomy of semantic information. We also briefly review the current state-of-the-art semantic understanding techniques. We highlight potential synergies, but we also identify gaps that need to be bridged to apply these ideas. We aim to stimulate the research that is needed to adapt, robustify, and implement state-of-the-art AI semantics methods in the challenging conditions of disasters and first responder scenarios.

cs.RO↗

arXiv2022

Insurance Contract for High Renewable Energy Integration

The increasing penetration of renewable energy poses significant challenges to power grid reliability. There have been increasing interests in utilizing financial tools, such as insurance, to help end-users hedge the potential risk of lost load due to renewable energy variability. With insurance, a user pays a premium fee to the utility, so that he will get compensated in case his demand is not fully satisfied. A proper insurance design needs to resolve the following two challenges: (i) users' reliability preference is private information; and (ii) the insurance design is tightly coupled with the renewable energy investment decision. To address these challenges, we adopt the contract theory to elicit users' private reliability preferences, and we study how the utility can jointly optimize the insurance contract and the planning of renewable energy. A key analytical challenge is that the joint optimization of the insurance design and the planning of renewables is non-convex. We resolve this difficulty by revealing important structural properties of the optimal solution, using the help of two benchmark problems: the no-insurance benchmark and the social-optimum benchmark. Compared with the no-insurance benchmark, we prove that the social cost and users' total energy cost are always no larger under the optimal contract. Simulation results show that the largest benefit of the insurance contract is achieved at a medium electricity-bill price together with a low type heterogeneity and a high renewable uncertainty.

eess.SY↗

arXiv2022

Model Inversion Attacks against Graph Neural Networks

Many data mining tasks rely on graphs to model relational structures among individuals (nodes). Since relational data are often sensitive, there is an urgent need to evaluate the privacy risks in graph data. One famous privacy attack against data analysis models is the model inversion attack, which aims to infer sensitive data in the training dataset and leads to great privacy concerns. Despite its success in grid-like domains, directly applying model inversion attacks on non-grid domains such as graph leads to poor attack performance. This is mainly due to the failure to consider the unique properties of graphs. To bridge this gap, we conduct a systematic study on model inversion attacks against Graph Neural Networks (GNNs), one of the state-of-the-art graph analysis tools in this paper. Firstly, in the white-box setting where the attacker has full access to the target GNN model, we present GraphMI to infer the private training graph data. Specifically, in GraphMI, a projected gradient module is proposed to tackle the discreteness of graph edges and preserve the sparsity and smoothness of graph features; a graph auto-encoder module is used to efficiently exploit graph topology, node attributes, and target model parameters for edge inference; a random sampling module can finally sample discrete edges. Furthermore, in the hard-label black-box setting where the attacker can only query the GNN API and receive the classification results, we propose two methods based on gradient estimation and reinforcement learning (RL-GraphMI). Our experimental results show that such defenses are not sufficiently effective and call for more advanced defenses against privacy attacks.

cs.LG↗

arXiv2022

LO-Det: Lightweight Oriented Object Detection in Remote Sensing Images

A few lightweight convolutional neural network (CNN) models have been recently designed for remote sensing object detection (RSOD). However, most of them simply replace vanilla convolutions with stacked separable convolutions, which may not be efficient due to a lot of precision losses and may not be able to detect oriented bounding boxes (OBB). Also, the existing OBB detection methods are difficult to constrain the shape of objects predicted by CNNs accurately. In this paper, we propose an effective lightweight oriented object detector (LO-Det). Specifically, a channel separation-aggregation (CSA) structure is designed to simplify the complexity of stacked separable convolutions, and a dynamic receptive field (DRF) mechanism is developed to maintain high accuracy by customizing the convolution kernel and its perception range dynamically when reducing the network complexity. The CSA-DRF component optimizes efficiency while maintaining high accuracy. Then, a diagonal support constraint head (DSC-Head) component is designed to detect OBBs and constrain their shapes more accurately and stably. Extensive experiments on public datasets demonstrate that the proposed LO-Det can run very fast even on embedded devices with the competitive accuracy of detecting oriented objects.

cs.CV↗

arXiv2022

Per-run Algorithm Selection with Warm-starting using Trajectory-based Features

Per-instance algorithm selection seeks to recommend, for a given problem instance and a given performance criterion, one or several suitable algorithms that are expected to perform well for the particular setting. The selection is classically done offline, using openly available information about the problem instance or features that are extracted from the instance during a dedicated feature extraction step. This ignores valuable information that the algorithms accumulate during the optimization process. In this work, we propose an alternative, online algorithm selection scheme which we coin per-run algorithm selection. In our approach, we start the optimization with a default algorithm, and, after a certain number of iterations, extract instance features from the observed trajectory of this initial optimizer to determine whether to switch to another optimizer. We test this approach using the CMA-ES as the default solver, and a portfolio of six different optimizers as potential algorithms to switch to. In contrast to other recent work on online per-run algorithm selection, we warm-start the second optimizer using information accumulated during the first optimization phase. We show that our approach outperforms static per-instance algorithm selection. We also compare two different feature extraction principles, based on exploratory landscape analysis and time series analysis of the internal state variables of the CMA-ES, respectively. We show that a combination of both feature sets provides the most accurate recommendations for our test cases, taken from the BBOB function suite from the COCO platform and the YABBOB suite from the Nevergrad platform.

cs.NE↗

arXiv2022

Full Geometric Control of Hidden Color Information in Diffraction Gratings under Angled White Light Illumination

Under white light illumination, gratings produce an angular distribution of wavelengths dependent on the diffraction order and geometric parameters. However, previous studies of gratings are limited to at least one geometric parameter (height, periodicity, orientation, angle of incidence) kept constant. Here, we vary all geometric parameters in the gratings using a versatile nanofabrication technique, two-photon polymerization lithography, to encode hidden color information through 2 design approaches. The first approach hides color information by decoupling the effects of grating height and periodicity under normal and oblique incidence. The second approach hides multiple sets of color information by arranging gratings in sectors around semi-circular pixels. Different images are revealed with negligible crosstalk under oblique incidence and varying sample rotation angles. Our analysis shows that an angular separation >= 10° between adjacent sectors is required to suppress crosstalk. This work has potential applications in information storage and security watermarks.

physics.optics↗

arXiv2022

Intelligent optoelectronic processor for orbital angular momentum spectrum measurement

Orbital angular momentum (OAM) detection underpins almost all aspects of vortex beams' advances such as communication and quantum analogy. Conventional schemes are frustrated by low speed, complicated system, limited detection range. Here, we devise an intelligent processor composed of photonic and electronic neurons for OAM spectrum measurement in a fast, accurate and direct manner. Specifically, optical layers extract invisible topological charge information from incoming light and a shallow electronic layer predicts the exact spectrum. The integration of optical-computing promises us a compact single-shot system with high speed and energy efficiency, neither necessitating reference wave nor repetitive steps. Importantly, our processor is endowed with salient generalization ability and robustness against diverse structured light and adverse effects. We further raise a universal model interpretation paradigm to reveal the underlying physical mechanisms in the hybrid processor, as distinct from conventional 'black-box' networks. Such interpretation algorithm can improve the detection efficiency. We also complete the theory of optoelectronic network enabling its efficient training. This work not only contributes to the explorations on OAM physics and applications, and also broadly inspires the advanced links between intelligent computing and physical effects.

cs.ET↗

arXiv2022

3D Path Planning and Obstacle Avoidance Algorithms for Obstacle-Overcoming Robots

This article introduces a multimodal motion planning (MMP) algorithm that combines three-dimensional (3-D) path planning and a DWA obstacle avoidance algorithm. The algorithms aim to plan the path and motion of obstacle-overcoming robots in complex unstructured scenes. A novel A-star algorithm is proposed to combine the characteristics of unstructured scenes and a strategy to switch it into a greedy best-first strategy algorithm. Meanwhile, the algorithm of path planning is integrated with the DWA algorithm so that the robot can perform local dynamic obstacle avoidance during the movement along the global planned path. Furthermore, when the proposed global path planning algorithm combines with the local obstacle avoidance algorithm, the robot can correct the path after obstacle avoidance and obstacle overcoming. The simulation experiments in a factory with several complex environments verified the feasibility and robustness of the algorithms. The algorithms can quickly generate a reasonable 3-D path for obstacle-overcoming robots and perform reliable local obstacle avoidance under the premise of considering the characteristics of the scene and motion obstacles.

cs.RO↗

arXiv2022

Testing dark energy after pre-recombination early dark energy

In the studies on pre-recombination early dark energy (EDE), the evolution of Universe after recombination is usually regarded as $ΛCDM$-like, which corresponds that the equation of state of dark energy responsible for current accelerated expansion is $w=-1$. However, in realistic models, $w$ might be evolving. We consider the parametrizations of $w$ with respect to the redshift $z$ in Axion-like EDE and AdS-EDE models, respectively. We performed the Monte Carlo Markov chain analysis with recent cosmological data, and found that the bestfit $w(z)$ is compatible with $w_0=-1,w_a=0$ (the cosmological constant) and the evolution of $w$ is only marginally favored, which so has little effect on lifting the bestfit value of ${H_0}$.

astro-ph.CO↗

arXiv2022

IMCI: Integrate Multi-view Contextual Information for Fact Extraction and Verification

With the rapid development of automatic fake news detection technology, fact extraction and verification (FEVER) has been attracting more attention. The task aims to extract the most related fact evidences from millions of open-domain Wikipedia documents and then verify the credibility of corresponding claims. Although several strong models have been proposed for the task and they have made great progress, we argue that they fail to utilize multi-view contextual information and thus cannot obtain better performance. In this paper, we propose to integrate multi-view contextual information (IMCI) for fact extraction and verification. For each evidence sentence, we define two kinds of context, i.e. intra-document context and inter-document context}. Intra-document context consists of the document title and all the other sentences from the same document. Inter-document context consists of all other evidences which may come from different documents. Then we integrate the multi-view contextual information to encode the evidence sentences to handle the task. Our experimental results on FEVER 1.0 shared task show that our IMCI framework makes great progress on both fact extraction and verification, and achieves state-of-the-art performance with a winning FEVER score of 72.97% and label accuracy of 75.84% on the online blind test set. We also conduct ablation study to detect the impact of multi-view contextual information. Our codes will be released at https://github.com/phoenixsecularbird/IMCI.

cs.CL↗

arXiv2022

Soft MIMO Detection Using Marginal Posterior Probability Statistics

Soft demodulation of received symbols into bit log-likelihood ratios (LLRs) is at the very heart of multiple-input-multiple-output (MIMO) detection. However, the optimal maximum a posteriori (MAP) detector is complicated and infeasible to be used in a practical system. In this paper, we propose a soft MIMO detection algorithm based on marginal posterior probability statistics (MPPS). With the help of optimal transport theory and order statistics theory, we transform the posteriori probability distribution of each layer into a Gaussian distribution. Then the full sampling paths can be implicitly restored from the first- and second-order moment statistics of the transformed distribution. A lightweight network is designed to learn to recovery the log-MAP LLRs from the moment statistics with low complexity. Simulation results show that the proposed algorithm can improve the performance significantly with reduced samples under fading and correlated channels.

eess.SP↗

arXiv2022

Online Learning Based NLOS Ranging Error Mitigation in 5G Positioning

The fifth-generation (5G) wireless communication is useful for positioning due to its large bandwidth and low cost. However, the presence of obstacles that block the line-of-sight (LOS) path between devices would affect localization accuracy severely. In this paper, we propose an online learning approach to mitigate ranging error directly in non-line-of-sight (NLOS) channels. The distribution of NLOS ranging error is learned from received raw signals, where a network with neural processes regressor (NPR) is utilized to learn the environment and range-related information precisely. The network can be implemented for online learning free from retraining the network, which is computationally efficient. Simulation results show that the proposed approach outperforms conventional techniques in terms of NLOS ranging error mitigation.

eess.SP↗

arXiv2022

Energy and Spectrum Efficient Federated Learning via High-Precision Over-the-Air Computation

Federated learning (FL) enables mobile devices to collaboratively learn a shared prediction model while keeping data locally. However, there are two major research challenges to practically deploy FL over mobile devices: (i) frequent wireless updates of huge size gradients v.s. limited spectrum resources, and (ii) energy-hungry FL communication and local computing during training v.s. battery-constrained mobile devices. To address those challenges, in this paper, we propose a novel multi-bit over-the-air computation (M-AirComp) approach for spectrum-efficient aggregation of local model updates in FL and further present an energy-efficient FL design for mobile devices. Specifically, a high-precision digital modulation scheme is designed and incorporated in the M-AirComp, allowing mobile devices to upload model updates at the selected positions simultaneously in the multi-access channel. Moreover, we theoretically analyze the convergence property of our FL algorithm. Guided by FL convergence analysis, we formulate a joint transmission probability and local computing control optimization, aiming to minimize the overall energy consumption (i.e., iterative local computing + multi-round communications) of mobile devices in FL. Extensive simulation results show that our proposed scheme outperforms existing ones in terms of spectrum utilization, energy efficiency, and learning accuracy.

cs.LG↗

arXiv2022

Non-invasive improvement of machining by reversible electrochemical doping: a proof of principle with computational modeling

We propose that the machinability of hard ceramics can be improved by reversible electrochemical doping. On the example of TiO2, we show in a combined density functional theory-molecular dynamics computational study that a small amount of intercalated lithium, which preserves the host structure and can be introduced reversibly, leads to a lowering of the strength of work materials and the cutting force. This is in spite of the fact that there are no significant modifications of the elastic constants at room temperature, i.e. the effect is mostly on plastic properties. This approach is expected to be applicable to a class of ceramics exhibiting similar mechanisms of host-dopant interactions and presents a reversible and non-destructive way of modifying mechanical properties.

cond-mat.mtrl-sci↗