arXiv subjects

Jun Wang

Publications and source records attributed to Jun Wang.

At least 811 records · Page 45Linked to original sources

arXiv2022

UTOPIC: Uncertainty-aware Overlap Prediction Network for Partial Point Cloud Registration

High-confidence overlap prediction and accurate correspondences are critical for cutting-edge models to align paired point clouds in a partial-to-partial manner. However, there inherently exists uncertainty between the overlapping and non-overlapping regions, which has always been neglected and significantly affects the registration performance. Beyond the current wisdom, we propose a novel uncertainty-aware overlap prediction network, dubbed UTOPIC, to tackle the ambiguous overlap prediction problem; to our knowledge, this is the first to explicitly introduce overlap uncertainty to point cloud registration. Moreover, we induce the feature extractor to implicitly perceive the shape knowledge through a completion decoder, and present a geometric relation embedding for Transformer to obtain transformation-invariant geometry-aware feature representations. With the merits of more reliable overlap scores and more precise dense correspondences, UTOPIC can achieve stable and accurate registration results, even for the inputs with limited overlapping areas. Extensive quantitative and qualitative experiments on synthetic and real benchmarks demonstrate the superiority of our approach over state-of-the-art methods.

cs.CV↗

arXiv2022

MODNet: Multi-offset Point Cloud Denoising Network Customized for Multi-scale Patches

The intricacy of 3D surfaces often results cutting-edge point cloud denoising (PCD) models in surface degradation including remnant noise, wrongly-removed geometric details. Although using multi-scale patches to encode the geometry of a point has become the common wisdom in PCD, we find that simple aggregation of extracted multi-scale features can not adaptively utilize the appropriate scale information according to the geometric information around noisy points. It leads to surface degradation, especially for points close to edges and points on complex curved surfaces. We raise an intriguing question -- if employing multi-scale geometric perception information to guide the network to utilize multi-scale information, can eliminate the severe surface degradation problem? To answer it, we propose a Multi-offset Denoising Network (MODNet) customized for multi-scale patches. First, we extract the low-level feature of three scales patches by patch feature encoders. Second, a multi-scale perception module is designed to embed multi-scale geometric information for each scale feature and regress multi-scale weights to guide a multi-offset denoising displacement. Third, a multi-offset decoder regresses three scale offsets, which are guided by the multi-scale weights to predict the final displacement by weighting them adaptively. Experiments demonstrate that our method achieves new state-of-the-art performance on both synthetic and real-scanned datasets.

cs.CV↗

arXiv2022

Joint Optimization of Resource Allocation, Phase Shift and UAV Trajectory for Energy-Efficient RIS-Assisted UAV-Enabled MEC Systems

The unmanned aerial vehicle (UAV) enabled mobile edge computing (MEC) has been deemed a promising paradigm to provide ubiquitous communication and computing services for the Internet of Things (IoT). Besides, by intelligently reflecting the received signals, the reconfigurable intelligent surface (RIS) can significantly improve the propagation environment and further enhance the service quality of the UAV-enabled MEC. Motivated by this vision, in this paper, we consider both the amount of completed task bits and the energy consumption to maximize the energy efficiency of the RIS-assisted UAV-enabled MEC systems, where the bit allocation, transmit power, phase shift, and UAV trajectory are jointly optimized by an iterative algorithm with a double-loop structure based on the Dinkelbach's method and block coordinate decent (BCD) technique. Simulation results demonstrate that: 1) with the deployment of RIS, our proposed algorithm can achieve higher energy efficiency than baseline schemes while satisfying the task tolerance latency; 2) the energy efficiency first increases and then decreases with the increase of the mission period and the total amount of task-input bits of IoT devices; 3) when the CPU cycles required for computing 1-bit of task-input data becomes larger, more task bits will be offloaded to the UAV while the energy efficiency will be decreased.

eess.SY↗

arXiv2022

A Comprehensive Survey on Aerial Mobile Edge Computing: Challenges, State-of-the-Art, and Future Directions

Driven by the visions of Internet of Things (IoT), there is an ever-increasing demand for computation resources of IoT users to support diverse applications. Mobile edge computing (MEC) has been deemed a promising solution to settle the conflict between the resource-hungry mobile applications and the resource-constrained IoT users. On the other hand, in order to provide ubiquitous and reliable connectivity in wireless networks, unmanned aerial vehicles (UAVs) can be leveraged as efficient aerial platforms by exploiting their inherent attributes, such as the on-demand deployment, high cruising altitude, and controllable maneuverability in three-dimensional (3D) space. Thus, the UAV-enabled aerial MEC is believed as a win-win solution to facilitate cost-effective and energy-saving communication and computation services in various environments. In this paper, we provide a comprehensive survey on the UAV-enabled aerial MEC. Firstly, the related advantages and research challenges for aerial MEC are discussed. Then, we provide a comprehensive review of the recent research advances, which is categorized by different domains, including the joint optimization of UAV trajectory, computation offloading and resource allocation, UAV deployment, task scheduling and load balancing, interplay between aerial MEC and other technologies, as well as the machine-learning (ML)-driven optimization. Finally, some important research directions deserved more efforts in future work are summarized.

eess.SY↗

arXiv2022

Joint Resource Allocation and Configuration Design for STAR-RIS-Enhanced Wireless-Powered MEC

In this paper, a novel concept called simultaneously transmitting and reflecting RIS (STAR-RIS) is introduced into the wireless-powered mobile edge computing (MEC) systems to improve the efficiency of energy transfer and task offloading. Compared with traditional reflecting-only RIS, STAR-RIS extends the half-space coverage to full-space coverage by simultaneously transmitting and reflecting incident signals, and also provides new degrees-of-freedom (DoFs) for manipulating signal propagation. We aim to maximize the total computation rate of all users, where the energy transfer time, transmit power and CPU frequencies of users, and the configuration design of STAR-RIS are jointly optimized. Considering the characteristics of STAR-RIS, three operating protocols, namely energy splitting (ES), mode switching (MS), and time splitting (TS) are studied, respectively. For the ES protocol, based on the penalty method, successive convex approximation (SCA), and the linear search method, an iterative algorithm is proposed to solve the formulated non-convex problem. Then, the proposed algorithm for ES protocol is extended to solve the MS and TS problems. Simulation results illustrate that the STAR-RIS outperforms traditional reflecting/transmitting-only RIS. More importantly, the TS protocol can achieve the largest computation rate among the three operating protocols of STAR-RIS.

cs.IT↗

arXiv2022

CandidateDrug4Cancer: An Open Molecular Graph Learning Benchmark on Drug Discovery for Cancer

Anti-cancer drug discoveries have been serendipitous, we sought to present the Open Molecular Graph Learning Benchmark, named CandidateDrug4Cancer, a challenging and realistic benchmark dataset to facilitate scalable, robust, and reproducible graph machine learning research for anti-cancer drug discovery. CandidateDrug4Cancer dataset encompasses multiple most-mentioned 29 targets for cancer, covering 54869 cancer-related drug molecules which are ranged from pre-clinical, clinical and FDA-approved. Besides building the datasets, we also perform benchmark experiments with effective Drug Target Interaction (DTI) prediction baselines using descriptors and expressive graph neural networks. Experimental results suggest that CandidateDrug4Cancer presents significant challenges for learning molecular graphs and targets in practical application, indicating opportunities for future researches on developing candidate drugs for treating cancers.

cs.LG↗

arXiv2022

AA-Forecast: Anomaly-Aware Forecast for Extreme Events

Time series models often deal with extreme events and anomalies, both prevalent in real-world datasets. Such models often need to provide careful probabilistic forecasting, which is vital in risk management for extreme events such as hurricanes and pandemics. However, it is challenging to automatically detect and learn to use extreme events and anomalies for large-scale datasets, which often require manual effort. Hence, we propose an anomaly-aware forecast framework that leverages the previously seen effects of anomalies to improve its prediction accuracy during and after the presence of extreme events. Specifically, the framework automatically extracts anomalies and incorporates them through an attention mechanism to increase its accuracy for future extreme events. Moreover, the framework employs a dynamic uncertainty optimization algorithm that reduces the uncertainty of forecasts in an online manner. The proposed framework demonstrated consistent superior accuracy with less uncertainty on three datasets with different varieties of anomalies over the current prediction models.

stat.ML↗

arXiv2022

Empirical or Invariant Risk Minimization? A Sample Complexity Perspective

Recently, invariant risk minimization (IRM) was proposed as a promising solution to address out-of-distribution (OOD) generalization. However, it is unclear when IRM should be preferred over the widely-employed empirical risk minimization (ERM) framework. In this work, we analyze both these frameworks from the perspective of sample complexity, thus taking a firm step towards answering this important question. We find that depending on the type of data generation mechanism, the two approaches might have very different finite sample and asymptotic behavior. For example, in the covariate shift setting we see that the two approaches not only arrive at the same asymptotic solution, but also have similar finite sample behavior with no clear winner. For other distribution shifts such as those involving confounders or anti-causal variables, however, the two approaches arrive at different asymptotic solutions where IRM is guaranteed to be close to the desired OOD solutions in the finite sample regime, while ERM is biased even asymptotically. We further investigate how different factors -- the number of environments, complexity of the model, and IRM penalty weight -- impact the sample complexity of IRM in relation to its distance from the OOD solutions

cs.LG↗

arXiv2022

Check on the features of potted 20-inch PMTs with 1F3 electronics prototype at Pan-Asia

The Jiangmen underground neutrino observatory (JUNO) is a neutrino project with a 20-kton liquid scintillator detector located at 700-m underground. The large 20-inch PMTs are one of the crucial components of the JUNO experiment aiming to precision neutrino measurements with better than 3% energy resolution at 1 MeV. The excellent energy resolution and a large fiducial volume provide many exciting opportunities for addressing important topics in neutrino and astro-particle physics. With the container #D at JUNO Pan-Asia PMT testing and potting station, the features of waterproof potted 20-inch PMTs were measured with JUNO 1F3 electronics prototype in waveform and charge, which are valuable for better understanding on the performance of the waterproof potted PMTs and the JUNO 1F3 electronics. In this paper, basic features of JUNO 1F3 electronics prototype run at Pan-Asia will be introduced, followed by an analysis of the waterproof potted 20-inch PMTs and a comparison with the results from commercial electronics used by the container #A and #B.

physics.ins-det↗

arXiv2022

Cross Attention-guided Dense Network for Images Fusion

In recent years, various applications in computer vision have achieved substantial progress based on deep learning, which has been widely used for image fusion and shown to achieve adequate performance. However, suffering from limited ability in modeling the spatial correspondence of different source images, it still remains a great challenge for existing unsupervised image fusion models to extract appropriate feature and achieves adaptive and balanced fusion. In this paper, we propose a novel cross-attention-guided image fusion network, which is a unified and unsupervised framework for multi-modal image fusion, multi-exposure image fusion, and multi-focus image fusion. Different from the existing self-attention module, our cross-attention module focus on modeling the cross-correlation between different source images. Using the proposed cross attention module as a core block, a densely connected cross attention-guided network is built to dynamically learn the spatial correspondence to derive better alignment of important details from different input images. Meanwhile, an auxiliary branch is also designed to model the long-range information, and a merging network is attached to finally reconstruct the fusion image. Extensive experiments have been carried out on publicly available datasets, and the results demonstrate that the proposed model outperforms the state-of-the-art quantitatively and qualitatively.

cs.CV↗

arXiv2022

Level compatibility in Sharifi's conjecture

Sharifi has constructed a map from the first homology of the modular curve $X_1(M)$ to the $K$-group $K_2(\mathbf{Z}[ζ_M, \frac{1}{M}])$, where $ζ_M$ is a primitive $M$th root of unity. We study how these maps relate when $M$ varies. Our method relies on the techniques developed by Sharifi and Venkatesh.

math.NT↗

arXiv2022

Deterministic Identification over Channels without CSI

Identification capacities of randomized and deterministic identification were proved to exceed channel capacity for Gaussian channels \emph{with} channel side information (CSI). In this work, we extend deterministic identification to the block fading channels without CSI by applying identification codes for both channel estimation and user identification. We prove that identification capacity is asymptotically higher than transmission capacity even in the absence of CSI. And we also analyze the finite-length performance theoretically and numerically. The simulation results verify the feasibility of the proposed blind deterministic identification in finite blocklength regime.

cs.IT↗

arXiv2022

Multi-View Pre-Trained Model for Code Vulnerability Identification

Vulnerability identification is crucial for cyber security in the software-related industry. Early identification methods require significant manual efforts in crafting features or annotating vulnerable code. Although the recent pre-trained models alleviate this issue, they overlook the multiple rich structural information contained in the code itself. In this paper, we propose a novel Multi-View Pre-Trained Model (MV-PTM) that encodes both sequential and multi-type structural information of the source code and uses contrastive learning to enhance code representations. The experiments conducted on two public datasets demonstrate the superiority of MV-PTM. In particular, MV-PTM improves GraphCodeBERT by 3.36\% on average in terms of F1 score.

cs.SE↗

arXiv2022

On Iwasawa invariants of modular forms with reducible and non-$p$-distinguished residual Galois representations

In the present paper, we study the $p$-adic $L$-functions and the (strict) Selmer groups over $\mathbb{Q}_{\infty}$, the cyclotomic $\mathbb{Z}_p$-extension of $\mathbb{Q}$, of the $p$-adic weight one cusp forms $f$, obtained via the $p$-stabilization of weight one Eisenstein series, under the assumption that a certain Eisenstein component of the $p$-ordinary universal cuspidal Hecke algebra is Gorenstein. As an application, we compute the Iwasawa invariants of ordinary modular forms of weight $k\geq 2$ with the same residual Galois representations as the one of $f$, which in our setting, is reducible and non-$p$-distinguished. Combining this with a result of Kato \cite[Theorem~17.4.2]{kato04}, we prove the Iwasawa main conjecture for these forms. Also, we give numerical examples that satisfy the Gorenstein hypothesis. The crucial point on the analytic counter part is that under the Gorenstein hypothesis, we are able to define, following Greenberg--Vatsal, the $p$-adic $L$-functions of $p$-adic weight one forms $f$ as an element in the one-dimensional Iwasawa algebra by using Mazur--Kitagawa two-variable $p$-adic $L$-function and then, to compute them explicitly via local explicit reciprocity law. On the algebraic counter part, we compute the (strict) Selmer groups of $f$ over $\mathbb{Q}_{\infty}$ via the knowledge of the Galois representations of $f$ studied in \cite{BDP}.

math.NT↗

arXiv2022

Heterogeneous-Agent Mirror Learning: A Continuum of Solutions to Cooperative MARL

The necessity for cooperation among intelligent machines has popularised cooperative multi-agent reinforcement learning (MARL) in the artificial intelligence (AI) research community. However, many research endeavors have been focused on developing practical MARL algorithms whose effectiveness has been studied only empirically, thereby lacking theoretical guarantees. As recent studies have revealed, MARL methods often achieve performance that is unstable in terms of reward monotonicity or suboptimal at convergence. To resolve these issues, in this paper, we introduce a novel framework named Heterogeneous-Agent Mirror Learning (HAML) that provides a general template for MARL algorithmic designs. We prove that algorithms derived from the HAML template satisfy the desired properties of the monotonic improvement of the joint reward and the convergence to Nash equilibrium. We verify the practicality of HAML by proving that the current state-of-the-art cooperative MARL algorithms, HATRPO and HAPPO, are in fact HAML instances. Next, as a natural outcome of our theory, we propose HAML extensions of two well-known RL algorithms, HAA2C (for A2C) and HADDPG (for DDPG), and demonstrate their effectiveness against strong baselines on StarCraftII and Multi-Agent MuJoCo tasks.

cs.MA↗

arXiv2022

Demonstration of room-temperature continuous-wave operation of InGaAs/AlGaAs quantum well lasers directly grown on on-axis silicon (001)

Room-temperature continuous-wave operation of InGaAs/AlGaAs quantum well lasers directly grown on on-axis silicon (001) has been demonstrated. A 420 nm thick GaAs epilayer completely free of antiphase domains was initially grown on the silicon substrate in a metal-organic chemical vapor deposition system and the other epilayers including four sets of five-period strained-layer superlattices and the laser-structural layers were successively grown in a molecular beam epitaxy system. The lasers were prepared as broad-stripe Fabry-Perot ones with a stripe width of 21.5 um and a cavity length of 1 mm. Typically, the threshold current and the corresponding threshold current density are 186.4 mA and 867 A/cm2, respectively. The lasing wavelength is around 980 nm and the slope efficiency is 0.097 W/A with a single-facet output power of 22.5 mW at an injection current of 400 mA. This advancement makes the silicon-based monolithic optoelectronic integration relevant to quantum well lasers more promising with an enhanced feasibility.

physics.optics↗

arXiv2022

Branch Ranking for Efficient Mixed-Integer Programming via Offline Ranking-based Policy Learning

Deriving a good variable selection strategy in branch-and-bound is essential for the efficiency of modern mixed-integer programming (MIP) solvers. With MIP branching data collected during the previous solution process, learning to branch methods have recently become superior over heuristics. As branch-and-bound is naturally a sequential decision making task, one should learn to optimize the utility of the whole MIP solving process instead of being myopic on each step. In this work, we formulate learning to branch as an offline reinforcement learning (RL) problem, and propose a long-sighted hybrid search scheme to construct the offline MIP dataset, which values the long-term utilities of branching decisions. During the policy training phase, we deploy a ranking-based reward assignment scheme to distinguish the promising samples from the long-term or short-term view, and train the branching model named Branch Ranking via offline policy learning. Experiments on synthetic MIP benchmarks and real-world tasks demonstrate that Branch Rankink is more efficient and robust, and can better generalize to large scales of MIP instances compared to the widely used heuristics and state-of-the-art learning-based branching models.

cs.LG↗

arXiv2022

A simple normalization technique using window statistics to improve the out-of-distribution generalization on medical images

Since data scarcity and data heterogeneity are prevailing for medical images, well-trained Convolutional Neural Networks (CNNs) using previous normalization methods may perform poorly when deployed to a new site. However, a reliable model for real-world clinical applications should be able to generalize well both on in-distribution (IND) and out-of-distribution (OOD) data (e.g., the new site data). In this study, we present a novel normalization technique called window normalization (WIN) to improve the model generalization on heterogeneous medical images, which is a simple yet effective alternative to existing normalization methods. Specifically, WIN perturbs the normalizing statistics with the local statistics computed on the window of features. This feature-level augmentation technique regularizes the models well and improves their OOD generalization significantly. Taking its advantage, we propose a novel self-distillation method called WIN-WIN for classification tasks. WIN-WIN is easily implemented with twice forward passes and a consistency constraint, which can be a simple extension for existing methods. Extensive experimental results on various tasks (6 tasks) and datasets (24 datasets) demonstrate the generality and effectiveness of our methods.

cs.CV↗