Searcharxiv⌕ Search

arXiv subjects

Bo Yang

Publications and source records attributed to Bo Yang.

At least 487 records · Page 27Linked to original sources

Learning Object Bounding Boxes for 3D Instance Segmentation on Point Clouds

We propose a novel, conceptually simple and general framework for instance segmentation on 3D point clouds. Our method, called 3D-BoNet, follows the simple design philosophy of per-point multilayer perceptrons (MLPs). The framework directly regresses 3D bounding boxes for all instances in a point cloud, while simultaneously predicting a point-level mask for each instance. It consists of a backbone network followed by two parallel network branches for 1) bounding box regression and 2) point mask prediction. 3D-BoNet is single-stage, anchor-free and end-to-end trainable. Moreover, it is remarkably computationally efficient as, unlike existing approaches, it does not require any post-processing steps such as non-maximum suppression, feature sampling, clustering or voting. Extensive experiments show that our approach surpasses existing work on both ScanNet and S3DIS datasets while being approximately 10x more computationally efficient. Comprehensive ablation studies demonstrate the effectiveness of our design.

cs.CV↗

Robust Attentional Aggregation of Deep Feature Sets for Multi-view 3D Reconstruction

We study the problem of recovering an underlying 3D shape from a set of images. Existing learning based approaches usually resort to recurrent neural nets, e.g., GRU, or intuitive pooling operations, e.g., max/mean poolings, to fuse multiple deep features encoded from input images. However, GRU based approaches are unable to consistently estimate 3D shapes given different permutations of the same set of input images as the recurrent unit is permutation variant. It is also unlikely to refine the 3D shape given more images due to the long-term memory loss of GRU. Commonly used pooling approaches are limited to capturing partial information, e.g., max/mean values, ignoring other valuable features. In this paper, we present a new feed-forward neural module, named AttSets, together with a dedicated training algorithm, named FASet, to attentively aggregate an arbitrarily sized deep feature set for multi-view 3D reconstruction. The AttSets module is permutation invariant, computationally efficient and flexible to implement, while the FASet algorithm enables the AttSets based network to be remarkably robust and generalize to an arbitrary number of input images. We thoroughly evaluate FASet and the properties of AttSets on multiple large public datasets. Extensive experiments show that AttSets together with FASet algorithm significantly outperforms existing aggregation approaches.

cs.CV↗

General rogue waves in the Boussinesq equation

We derive general rogue wave solutions of arbitrary orders in the Boussinesq equation by the bilinear Kadomtsev-Petviashvili (KP) reduction method. These rogue solutions are given as Gram determinants with $2N-2$ free irreducible real parameters, where $N$ is the order of the rogue wave. Tuning these free parameters, rogue waves of various patterns are obtained, many of which have not been seen before. Compared to rogue waves in other integrable equations, a new feature of rogue waves in the Boussinesq equation is that the rogue wave of maximum amplitude at each order is generally asymmetric in space. On the technical aspect, our contribution to the bilinear KP-reduction method for rogue waves is a new judicious choice of differential operators in the procedure, which drastically simplifies the dimension reduction calculation as well as the analytical expressions of rogue wave solutions.

nlin.SI↗

SNAP: Finding Approximate Second-Order Stationary Solutions Efficiently for Non-convex Linearly Constrained Problems

This paper proposes low-complexity algorithms for finding approximate second-order stationary points (SOSPs) of problems with smooth non-convex objective and linear constraints. While finding (approximate) SOSPs is computationally intractable, we first show that generic instances of the problem can be solved efficiently. More specifically, for a generic problem instance, certain strict complementarity (SC) condition holds for all Karush-Kuhn-Tucker (KKT) solutions (with probability one). The SC condition is then used to establish an equivalence relationship between two different notions of SOSPs, one of which is computationally easy to verify. Based on this particular notion of SOSP, we design an algorithm named the Successive Negative-curvature grAdient Projection (SNAP), which successively performs either conventional gradient projection or some negative curvature based projection steps to find SOSPs. SNAP and its first-order extension SNAP$^+$, require $\mathcal{O}(1/ε^{2.5})$ iterations to compute an $(ε, \sqrtε)$-SOSP, and their per-iteration computational complexities are polynomial in the number of constraints and problem dimension. To our knowledge, this is the first time that first-order algorithms with polynomial per-iteration complexity and global sublinear rate have been designed to find SOSPs of the important class of non-convex problems with linear constraints.

math.OC↗

Deep Bayesian Optimization on Attributed Graphs

Attributed graphs, which contain rich contextual features beyond just network structure, are ubiquitous and have been observed to benefit various network analytics applications. Graph structure optimization, aiming to find the optimal graphs in terms of some specific measures, has become an effective computational tool in complex network analysis. However, traditional model-free methods suffer from the expensive computational cost of evaluating graphs; existing vectorial Bayesian optimization methods cannot be directly applied to attributed graphs and have the scalability issue due to the use of Gaussian processes (GPs). To bridge the gap, in this paper, we propose a novel scalable Deep Graph Bayesian Optimization (DGBO) method on attributed graphs. The proposed DGBO prevents the cubical complexity of the GPs by adopting a deep graph neural network to surrogate black-box functions, and can scale linearly with the number of observations. Intensive experiments are conducted on both artificial and real-world problems, including molecular discovery and urban road network design, and demonstrate the effectiveness of the DGBO compared with the state-of-the-art.

cs.LG↗

Learning Optimal Data Augmentation Policies via Bayesian Optimization for Image Classification Tasks

In recent years, deep learning has achieved remarkable achievements in many fields, including computer vision, natural language processing, speech recognition and others. Adequate training data is the key to ensure the effectiveness of the deep models. However, obtaining valid data requires a lot of time and labor resources. Data augmentation (DA) is an effective alternative approach, which can generate new labeled data based on existing data using label-preserving transformations. Although we can benefit a lot from DA, designing appropriate DA policies requires a lot of expert experience and time consumption, and the evaluation of searching the optimal policies is costly. So we raise a new question in this paper: how to achieve automated data augmentation at as low cost as possible? We propose a method named BO-Aug for automating the process by finding the optimal DA policies using the Bayesian optimization approach. Our method can find the optimal policies at a relatively low search cost, and the searched policies based on a specific dataset are transferable across different neural network architectures or even different datasets. We validate the BO-Aug on three widely used image classification datasets, including CIFAR-10, CIFAR-100 and SVHN. Experimental results show that the proposed method can achieve state-of-the-art or near advanced classification accuracy. Code to reproduce our experiments is available at https://github.com/zhangxiaozao/BO-Aug.

cs.LG↗

Deep Neural Architecture Search with Deep Graph Bayesian Optimization

Bayesian optimization (BO) is an effective method of finding the global optima of black-box functions. Recently BO has been applied to neural architecture search and shows better performance than pure evolutionary strategies. All these methods adopt Gaussian processes (GPs) as surrogate function, with the handcraft similarity metrics as input. In this work, we propose a Bayesian graph neural network as a new surrogate, which can automatically extract features from deep neural architectures, and use such learned features to fit and characterize black-box objectives and their uncertainty. Based on the new surrogate, we then develop a graph Bayesian optimization framework to address the challenging task of deep neural architecture search. Experiment results show our method significantly outperforms the comparative methods on benchmark tasks.

cs.LG↗

Tracing Magnetic Field with Synchrotron Polarization Gradients: Parameter Study

We employ synthetic observations obtained with MHD simulations to study how to trace the distribution of turbulent magnetic fields using the synchrotron polarization gradient techniques suggested by Lazarian \& Yuen (2018). Both synchrotron polarization gradients and its derivative gradients with regard to the squared wavelength $λ^2$ are used to explore the probing ability of the technique in magnetic fields from sub- to super-Alfv{é}nic turbulence. We focus on studies that involve multi-frequency measurements in the presence of strong Faraday rotation and show the ways of how to recover the projected mean magnetic fields in the plane of the sky and the local magnetic fields within a tomographic slice. We conclude that the new techniques can successfully reconstruct the 3D magnetic field within our Milky Way and other galaxies. This paper opens an avenue for applying our new techniques to a large number of data cubes such as those from the Low Frequency Array for Radio astronomy and the Square Kilometer Array.

astro-ph.HE↗

Electron and positron spectra in the three dimensional spatial-dependent propagation model

The spatial-dependent propagation model has been successfully used to explain diverse observational phenomena, including the spectral hardening of cosmic-ray nuclei above $200$ GV, the large-scale dipole anisotropy and the diffusive gamma distribution. In this work, we further apply the spatial-dependent propagation model to both electrons and positrons. To account for the excess of positrons above $10$ GeV, an additional local source is introduced. And we also consider a more realistic spiral distribution of background sources. We find that due to the gradual hardening above $10$ GeV, the hardening of electron spectrum above tens of GeV can be explained in the SDP model and both positron and electron spectra less than TeV energies could be naturally described. The spatial-dependent propagation with spiral-distributed sources could conforms with the total electron spectrum in the whole energy. Meanwhile compared with the conventional model, the spatial-dependent propagation with spiral-distributed sources could produce larger background positron flux, so that the multiplier of background positron flux is $1.42$, which is much smaller than the required value by the conventional model. Thus the shortage of background positron flux could be solved. Furthermore we compute the anisotropy of electron under spatial-dependent propagation model, which is well below the observational limit of Fermi-LAT experiment.

astro-ph.HE↗

Edge Induced Topological Phase Transition of the Quantum Hall state at Half Filling

We show that in quantum Hall systems at half-filling, edge potentials alone can drive transitions between the Pfaffian and anti-Pfaffian topological phases. We conjecture this is true in realistic systems even in the presence of weak bulk interactions that break the particle-hole symmetry. The strong effects of edge potentials could be understood from different topological shifts of competing phases, manifested on the disk geometry as the variation of orbital numbers at fixed number of particles. In particular, we show analytically particle-hole conjugation of Hamiltonians on the disk is equivalent to the tuning of edge potentials, which allows us to explicitly demonstrate the phase transition numerically. The importance of edge potentials in various experimental contexts, including the recently discovered particle-hole symmetric phase is also discussed.

cond-mat.str-el↗

Energy Storage Management via Deep Q-Networks

Energy storage devices represent environmentally friendly candidates to cope with volatile renewable energy generation. Motivated by the increase in privately owned storage systems, this paper studies the problem of real-time control of a storage unit co-located with a renewable energy generator and an inelastic load. Unlike many approaches in the literature, no distributional assumptions are being made on the renewable energy generation or the real-time prices. Building on the deep Q-networks algorithm, a reinforcement learning approach utilizing a neural network is devised where the storage unit operational constraints are respected. The neural network approximates the action-value function which dictates what action (charging, discharging, etc.) to take. Simulations indicate that near-optimal performance can be attained with the proposed learning-based control policy for the storage units.

math.OC↗

On general rogue waves in the parity-time-symmetric nonlinear Schrodinger equation

This article addresses the question of general rogue-wave solutions in the nonlocal parity-time-symmetric nonlinear Schrodinger equation. By generalizing the previous bilinear Kadomtsev-Petviashvili reduction method, large classes of rogue waves are derived as Gram determinants with Schur polynomial elements. It is shown that these rogue waves contain previously reported ones as special cases. More importantly, they contain many new rogue wave families. It is conjectured that the rogue waves derived in this article are all rogue-wave solutions in the parity-time-symmetric nonlinear Schrodinger equation.

nlin.SI↗

Observation of a reversal of breakout reconnection preceding a jet: evidence of oscillatory magnetic reconnection?

Recent studies have revealed that solar jets involving minifilament eruptions may be initiated under the well-known magnetic-breakout mechanism. Before or just at the onset of those jets, there should be a current sheet, where breakout magnetic reconnection takes place, between open fields and the outside of the jet-base arcade carrying minifilament in its core. In this paper we present a jet produced by eruption of two minifilaments lying at the jet base. A current sheet is directly detected near the jet base before the onset of the eruption, suggesting the magnetic-breakout mechanism. However, we further find that the current sheet undergoes a transition. The current sheet first shortens to zero in length, but then lengthens towards an orthogonal direction relative to its initial orientation. The change of the current sheet gives rise to a reversal of the breakout reconnection, as the inflow and outflow regions before the transition become the outflow and inflow regions after the transition, respectively. We therefore propose that this observation provides evidence for the so-called oscillatory reconnection which is defined by a series of reconnection reversals but not yet proved to exist in real plasma environment of the solar atmosphere.

astro-ph.SR↗

Filament Eruption and Its Reformation Caused by Emerging Magnetic Flux

We present observations of the eruption and then reformation of a filament caused by its nearby emerging magnetic flux. Driven by the emerging magnetic flux, the emerged positive fluxes moved toward and cancelled with its nearby negative fluxes, where the negative ends of a filament channel beneath the filament and a bundle of left-skewed coronal loops overlying the filament were anchored. Complemented by the nonlinear force-free field extrapolation, we find that the coronal magnetic field lines associated with the filament channel and the emerging magnetic fields consist of sheared field lines. Prior to the filament eruption, unambiguous observational evidence indicates that multiple interactions occurred between the emerging magnetic fields and the left-skewed coronal loops, implying a tether-weakening reconnection. Specifically, during the final episode of the tether-weakening reconnection, a remarkable sigmoid structure was formed and lifted up together with the filament. Accordingly, we speculate that the tether-weakening reconnection probably destabilized the filament system and triggered its rise. Subsequently, the filament and the sigmoid structure erupted together and produced a CME. After the eruption, the emerging magnetic fields continued to reconnect with the remaining filament channel, leading to the reformation of the filament. This observation strongly supports the idea that emerging magnetic flux plays an important role in triggering the filament to erupt, and the filament is reformed by magnetic reconnection between the emerging magnetic fields and its nearby filament channel.

astro-ph.SR↗

Wireless Charging Lane Deployment in Urban Areas Considering Traffic Light and Regional Energy Supply-Demand Balance

In this paper, to optimize the Wireless Charging Lane (WCL) deployment in urban areas, we focus on installation cost reduction while achieving regional balance of energy supply and demand, as well as vehicle continuous operability issues. In order to explore the characteristics of energy demand in various regions of the city, we first analyze the daily driving trajectory of taxis in different regions and find that the daily energy demand fluctuates to different degrees in different regions. Then, we establish the WCL power supply model to obtain the wireless charging supply situation in line with the real urban traffic condition, which is the first work considering the influence of traffic lights on charging situation. To ensure minimum deployment cost and to coordinate the contradiction between regional energy supply-demand balance and overall supply-demand matching, we formulate optimization problems ensuring the charge-energy consumption ratio of vehicles. In addition, we rank the priority of WCL efficiency to reduce the complexity of solution and solve the Mixed Integer NonLinear Programming (MINLP) problem to determine deployment plan. Compared with the baseline, the proposed method in this paper has significantly improved the effect.

math.OC↗

Post-Keplerian motion in Reissner-Nordström spacetime

We present the analytical post-Newtonian solutions for the test particle's motion in the Reissner-Nordström spacetime. The solutions are formulated in the Wagoner-Will representation, the Epstein-Haugan representation, the Brumberg representation, and the Damour-Deruelle representation, respectively. The relations between the (post-)Keplerian parameters in different representations, as well as their relations to the orbital energy and angular momentum are also provided.

gr-qc↗

Post-Minkowskian solution for the small-deflection motion of test particles in Kerr-Newman spacetime

We derive the second-order post-Minkowskian solution for the small-deflection motion of test particles in the external field of the Kerr-Newman black hole via an iterative method. The analytical results are exhibited in the coordinate system constituted by the particles' initial velocity unit vector, impact vector, and their cross-product. The achieved formulas explicitly give the dependences of the particles' trajectory and velocity on the time once their initial position and velocity are specified, and can be applied not only to a massive particle, but also to a photon as well.

gr-qc↗

Full Downlink Channel Reconstruction using Incomplete Uplink Channel Measurements in Massive MIMO networks

While more and more antennas are integrated into single mobile user equipment to increase communication quality and throughput, the number of antennas used for transmission is commonly restricted due to the concerns on hardware complexity and energy consumption, making it impossible to achieve the maximum channel capacity. This paper investigates the problem of reconstructing the full downlink channel from incomplete uplink channel measurements in Massive MIMO systems. We present ARDI, a scheme that builds a bridge between the radio channel and physical signal propagation environment to link spatial information about the non-transmitting antennas with their radio channels. By inferring locations and orientations of the non-transmitting antennas from an incomplete set of uplink channels, ARDI can reconstruct the downlink channels for non-transmitting antennas. We derive a closed-form solution to reconstruct antenna orientation in both single-path and multi-path propagation environments. The performance of ARDI is evaluated using simulations with realistic human movement. The results demonstrate that ARDI is capable of accurately reconstructing full downlink channels when the signal-to-noise ratio is higher than 15dB, thereby expanding the channel capacity of Massive MIMO networks.

cs.NI↗