arXiv subjects

Xin Sun

Publications and source records attributed to Xin Sun.

At least 163 records · Page 9Linked to original sources

arXiv2022

Mating of trees for critical Liouville quantum gravity

In a groundbreaking work, Duplantier, Miller and Sheffield showed that subcritical Liouville quantum gravity (LQG) coupled with Schramm-Loewner evolutions (SLE) can be described by the mating of two continuum random trees. In this paper, we consider the counterpart of their result for critical LQG and SLE, i.e., for the case when $γ^2=κ=16/κ=4$. We prove that as one sends $κ\downarrow 4$ in the subcritical setting, the space-filling SLE$_κ$ in a disk degenerates to the CLE$_4$ exploration introduced by Werner and Wu, along with a collection of i.i.d.\ coin tosses indexed by the branch points of the exploration. Furthermore, in the $κ=16/γ^2\downarrow 4$ limit, the pair of continuum random trees collapse into a single continuum random tree, and we observe that upon applying an appropriate affine transform to the encoding Brownian motions before taking the limit, we get convergence to a pair of independent Brownian motions $(A,B)$. The Brownian motion $A$ encodes the LQG distance from the CLE loops to the boundary of the disk, while the Brownian motion $B$ encodes the boundary lengths of the CLE$_4$ loops. In contrast to the subcritical setting, $(A,B)$ does not determine the CLE-decorated LQG surface.

math.PR↗

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

Lossless Acceleration for Seq2seq Generation with Aggressive Decoding

We study lossless acceleration for seq2seq generation with a novel decoding algorithm -- Aggressive Decoding. Unlike the previous efforts (e.g., non-autoregressive decoding) speeding up seq2seq generation at the cost of quality loss, our approach aims to yield the identical (or better) generation compared with autoregressive decoding but in a significant speedup, achieved by innovative cooperation of aggressive decoding and verification that are both efficient due to parallel computing. We propose two Aggressive Decoding paradigms for 2 kinds of seq2seq tasks: 1) For the seq2seq tasks whose inputs and outputs are highly similar (e.g., Grammatical Error Correction), we propose Input-guided Aggressive Decoding (IAD) that aggressively copies from the input sentence as drafted decoded tokens to verify in parallel; 2) For other general seq2seq tasks (e.g., Machine Translation), we propose Generalized Aggressive Decoding (GAD) that first employs an additional non-autoregressive decoding model for aggressive decoding and then verifies in parallel in the autoregressive manner. We test Aggressive Decoding on the most popular 6-layer Transformer model on GPU in multiple seq2seq tasks: 1) For IAD, we show that it can introduce a 7x-9x speedup for the Transformer in Grammatical Error Correction and Text Simplification tasks with the identical results as greedy decoding; 2) For GAD, we observe a 3x-5x speedup with the identical or even better quality in two important seq2seq tasks: Machine Translation and Abstractive Summarization. Moreover, Aggressive Decoding can benefit even more from stronger computing devices that are better at parallel computing. Given the lossless quality as well as significant and promising speedup, we believe Aggressive Decoding may potentially evolve into a de facto standard for efficient and lossless seq2seq generation in the near future.

cs.CL↗

arXiv2022

RiCS: A 2D Self-Occlusion Map for Harmonizing Volumetric Objects

There have been remarkable successes in computer vision with deep learning. While such breakthroughs show robust performance, there have still been many challenges in learning in-depth knowledge, like occlusion or predicting physical interactions. Although some recent works show the potential of 3D data in serving such context, it is unclear how we efficiently provide 3D input to the 2D models due to the misalignment in dimensionality between 2D and 3D. To leverage the successes of 2D models in predicting self-occlusions, we design Ray-marching in Camera Space (RiCS), a new method to represent the self-occlusions of foreground objects in 3D into a 2D self-occlusion map. We test the effectiveness of our representation on the human image harmonization task by predicting shading that is coherent with a given background image. Our experiments demonstrate that our representation map not only allows us to enhance the image quality but also to model temporally coherent complex shadow effects compared with the simulation-to-real and harmonization methods, both quantitatively and qualitatively. We further show that we can significantly improve the performance of human parts segmentation networks trained on existing synthetic datasets by enhancing the harmonization quality with our method.

cs.CV↗

arXiv2022

Relational Triple Extraction: One Step is Enough

Extracting relational triples from unstructured text is an essential task in natural language processing and knowledge graph construction. Existing approaches usually contain two fundamental steps: (1) finding the boundary positions of head and tail entities; (2) concatenating specific tokens to form triples. However, nearly all previous methods suffer from the problem of error accumulation, i.e., the boundary recognition error of each entity in step (1) will be accumulated into the final combined triples. To solve the problem, in this paper, we introduce a fresh perspective to revisit the triple extraction task, and propose a simple but effective model, named DirectRel. Specifically, the proposed model first generates candidate entities through enumerating token sequences in a sentence, and then transforms the triple extraction task into a linking problem on a "head $\rightarrow$ tail" bipartite graph. By doing so, all triples can be directly extracted in only one step. Extensive experimental results on two widely used datasets demonstrate that the proposed model performs better than the state-of-the-art baselines.

cs.CL↗

arXiv2022

Integrability of SLE via conformal welding of random surfaces

We demonstrate how to obtain integrable results for the Schramm-Loewner evolution (SLE) from Liouville conformal field theory (LCFT) and the mating-of-trees framework for Liouville quantum gravity (LQG). In particular, we prove an exact formula for the law of a conformal derivative of a classical variant of SLE called $\mathrm{SLE}_κ(ρ_-;ρ_+)$. Our proof is built on two connections between SLE, LCFT, and mating-of-trees. Firstly, LCFT and mating-of-trees provide equivalent but complementary methods to describe natural random surfaces in LQG. Using a novel tool that we call the uniform embedding of an LQG surface, we extend earlier equivalence results by allowing fewer marked points and more generic singularities. Secondly, the conformal welding of these random surfaces produces SLE curves as their interfaces. In particular, we rely on the conformal welding results proved in our companion paper [AHS20]. Our paper is an essential part of a program proving integrability results for SLE, LCFT, and mating-of-trees based on these two connections.

math.PR↗

arXiv2022

Maximizing Modular plus Non-monotone Submodular Functions

The research problem in this work is the relaxation of maximizing non-negative submodular plus modular with the entire real number domain as its value range over a family of down-closed sets. We seek a feasible point $\mathbf{x}^*$ in the polytope of the given constraint such that $\mathbf{x}^*\in\arg\max_{\mathbf{x}\in\mathcal{P}\subseteq[0,1]^n}F(\mathbf{x})+L(\mathbf{x})$, where $F$, $L$ denote the extensions of the underlying submodular function $f$ and modular function $\ell$. We provide an approximation algorithm named \textsc{Measured Continuous Greedy with Adaptive Weights}, which yields a guarantee $F(\mathbf{x})+L(\mathbf{x})\geq \left(1/e-\mathcal{O}(ε)\right)\cdot f(OPT)+\left(\frac{β-e}{e(β-1)}-\mathcal{O}(ε)\right)\cdot\ell(OPT)$ under the assumption that the ratio of non-negative part within $\ell(OPT)$ to the absolute value of its negative part is demonstrated by a parameter $β\in[0, \infty]$, where $OPT$ is the optimal integral solution for the discrete problem. It is obvious that the factor of $\ell(OPT)$ is $1$ when $β=0$, which means the negative part is completely dominant at this time; otherwise the factor is closed to $1/e$ whe $β\rightarrow\infty$. Our work first breaks the restriction on the specific value range of the modular function without assuming non-positivity or non-negativity as previous results and quantifies the relative variation of the approximation guarantee for optimal solutions with arbitrary structure. Moreover, we also give an analysis for the inapproximability of the problem we consider. We show a hardness result that there exists no polynomial algorithm whose output $S$ satisfies $f(S)+\ell(S)\geq0.478\cdot f(OPT)+\ell(OPT)$.

cs.DS↗

arXiv2022

Incorporating Hierarchy into Text Encoder: a Contrastive Learning Approach for Hierarchical Text Classification

Hierarchical text classification is a challenging subtask of multi-label classification due to its complex label hierarchy. Existing methods encode text and label hierarchy separately and mix their representations for classification, where the hierarchy remains unchanged for all input text. Instead of modeling them separately, in this work, we propose Hierarchy-guided Contrastive Learning (HGCLR) to directly embed the hierarchy into a text encoder. During training, HGCLR constructs positive samples for input text under the guidance of the label hierarchy. By pulling together the input text and its positive sample, the text encoder can learn to generate the hierarchy-aware text representation independently. Therefore, after training, the HGCLR enhanced text encoder can dispense with the redundant hierarchy. Extensive experiments on three benchmark datasets verify the effectiveness of HGCLR.

cs.CL↗

arXiv2022

Distributed Quantum Vote Based on Quantum Logical Operators, a New Battlefield of the Second Quantum Revolution

We designed two rules of binary quantum computed vote: Quantum Logical Veto (QLV) and Quantum Logical Nomination (QLN). The conjunction and disjunction from quantum computational logic are used to define QLV and QLN, respectively. Compared to classical vote, quantum computed vote is fairer, more democratic and has stronger expressive power. Since the advantage of quantum computed vote is neither the speed of computing nor the security of communication, we believe it opens a new battlefield in the second quantum revolution. Compared to other rules of quantum computed vote, QLV and QLN have better scalability. Both QLV and QLN can be implemented by the current technology and the difficulty of implementation does not grow with the increase of the number of voters.

quant-ph↗

arXiv2022

A Unified Strategy for Multilingual Grammatical Error Correction with Pre-trained Cross-Lingual Language Model

Synthetic data construction of Grammatical Error Correction (GEC) for non-English languages relies heavily on human-designed and language-specific rules, which produce limited error-corrected patterns. In this paper, we propose a generic and language-independent strategy for multilingual GEC, which can train a GEC system effectively for a new non-English language with only two easy-to-access resources: 1) a pretrained cross-lingual language model (PXLM) and 2) parallel translation data between English and the language. Our approach creates diverse parallel GEC data without any language-specific operations by taking the non-autoregressive translation generated by PXLM and the gold translation as error-corrected sentence pairs. Then, we reuse PXLM to initialize the GEC model and pretrain it with the synthetic data generated by itself, which yields further improvement. We evaluate our approach on three public benchmarks of GEC in different languages. It achieves the state-of-the-art results on the NLPCC 2018 Task 2 dataset (Chinese) and obtains competitive performance on Falko-Merlin (German) and RULEC-GEC (Russian). Further analysis demonstrates that our data construction method is complementary to rule-based approaches.

cs.CL↗

arXiv2022

Instant Reality: Gaze-Contingent Perceptual Optimization for 3D Virtual Reality Streaming

Media streaming has been adopted for a variety of applications such as entertainment, visualization, and design. Unlike video/audio streaming where the content is usually consumed sequentially, 3D applications such as gaming require streaming 3D assets to facilitate client-side interactions such as object manipulation and viewpoint movement. Compared to audio and video streaming, 3D streaming often requires larger data sizes and yet lower latency to ensure sufficient rendering quality, resolution, and latency for perceptual comfort. Thus, streaming 3D assets can be even more challenging than streaming audios/videos, and existing solutions often suffer from long loading time or limited quality. To address this critical and timely issue, we propose a perceptually-optimized progressive 3D streaming method for spatial quality and temporal consistency in immersive interactions. Based on the human visual mechanisms in the frequency domain, our model selects and schedules the streaming dataset for optimal spatial-temporal quality. We also train a neural network for our model to accelerate this decision process for real-time client-server applications. We evaluate our method via subjective studies and objective analysis under varying network conditions (from 3G to 5G) and client devices (HMD and traditional displays), and demonstrate better visual quality and temporal consistency than alternative solutions.

cs.HC↗

arXiv2021

Relation-aware Video Reading Comprehension for Temporal Language Grounding

Temporal language grounding in videos aims to localize the temporal span relevant to the given query sentence. Previous methods treat it either as a boundary regression task or a span extraction task. This paper will formulate temporal language grounding into video reading comprehension and propose a Relation-aware Network (RaNet) to address it. This framework aims to select a video moment choice from the predefined answer set with the aid of coarse-and-fine choice-query interaction and choice-choice relation construction. A choice-query interactor is proposed to match the visual and textual information simultaneously in sentence-moment and token-moment levels, leading to a coarse-and-fine cross-modal interaction. Moreover, a novel multi-choice relation constructor is introduced by leveraging graph convolution to capture the dependencies among video moment choices for the best choice selection. Extensive experiments on ActivityNet-Captions, TACoS, and Charades-STA demonstrate the effectiveness of our solution. Codes have been available.

cs.CV↗

arXiv2021

Dynamics of charged particles moving around Kerr black hole with inductive charge and external magnetic field

We mainly focus on the effects of small changes of parameters on the dynamics of charged particles around the Kerr black hole surrounded by an external magnetic field, which can be considered as a tidal environment. The radial motions of charged particles on the equatorial plane are studied via an effective potential. It is found that the particle energies at the local maxima values of the effective potentials increase with an increase of the black hole spin and the particle angular momenta, but decrease with an increase of one of the inductive charge parameter and magnetic field parameter. The radii of stable circular orbits on the equatorial plane also increase, whereas those of the innermost stable circular orbits decrease. On the other hand, the effects of small variations of the parameters on the orbital regular and chaotic dynamics of charged particles on the non-equatorial plane are traced by means of a time-transformed explicit symplectic integrator, Poincaré sections and fast Lyapunov indicators. It is shown that the dynamics sensitively depends on small variations of the inductive charge parameter, magnetic field parameter, energy and angular momentum. Chaos occurs easily as each of the dynamical parameters increases. When the dragging effects of the spacetime increase, the chaotic properties are not always weakened under some circumstances.

gr-qc↗

arXiv2021

SurroundNet: Towards Effective Low-Light Image Enhancement

Although Convolution Neural Networks (CNNs) has made substantial progress in the low-light image enhancement task, one critical problem of CNNs is the paradox of model complexity and performance. This paper presents a novel SurroundNet which only involves less than 150$K$ parameters (about 80-98 percent size reduction compared to SOTAs) and achieves very competitive performance. The proposed network comprises several Adaptive Retinex Blocks (ARBlock), which can be viewed as a novel extension of Single Scale Retinex in feature space. The core of our ARBlock is an efficient illumination estimation function called Adaptive Surround Function (ASF). It can be regarded as a general form of surround functions and be implemented by convolution layers. In addition, we also introduce a Low-Exposure Denoiser (LED) to smooth the low-light image before the enhancement. We evaluate the proposed method on the real-world low-light dataset. Experimental results demonstrate that the superiority of our submitted SurroundNet in both performance and network parameters against State-of-the-Art low-light image enhancement methods. Code is available at https: github.com/ouc-ocean-group/SurroundNet.

cs.CV↗

arXiv2021

Dual Discriminator Adversarial Distillation for Data-free Model Compression

Knowledge distillation has been widely used to produce portable and efficient neural networks which can be well applied on edge devices for computer vision tasks. However, almost all top-performing knowledge distillation methods need to access the original training data, which usually has a huge size and is often unavailable. To tackle this problem, we propose a novel data-free approach in this paper, named Dual Discriminator Adversarial Distillation (DDAD) to distill a neural network without any training data or meta-data. To be specific, we use a generator to create samples through dual discriminator adversarial distillation, which mimics the original training data. The generator not only uses the pre-trained teacher's intrinsic statistics in existing batch normalization layers but also obtains the maximum discrepancy from the student model. Then the generated samples are used to train the compact student network under the supervision of the teacher. The proposed method obtains an efficient student network which closely approximates its teacher network, despite using no original training data. Extensive experiments are conducted to to demonstrate the effectiveness of the proposed approach on CIFAR-10, CIFAR-100 and Caltech101 datasets for classification tasks. Moreover, we extend our method to semantic segmentation tasks on several public datasets such as CamVid and NYUv2. All experiments show that our method outperforms all baselines for data-free knowledge distillation.

cs.CV↗

arXiv2021

A Joint Design for STAR-RIS enhanced NOMA-CoMP Networks: A Simultaneous-Signal-Enhancement-and-Cancellation-based (SSECB) Design

In this correspondence, a novel simultaneous transmitting and reflecting (STAR) reconfigurable intelligent surfaces (RISs) design is proposed in a non-orthogonal multiple access (NOMA) enhanced coordinated multi-point transmission (CoMP) network. Based on the insights of signal-enhancement-based (SEB) and signal-cancellation-based (SCB) designs, we propose a novel simultaneous-signal-enhancement-and-cancellation-based (SSECB) design, where the inter-cell interferences and desired signals can be simultaneously eliminated and boosted. Our simulation results demonstrate that: i) the inter-cell interference can be perfectly eliminated, and the desired signals can be enhanced simultaneously with the aid of a large number of RIS elements; ii) the proposed SSECB design is capable of outperforming the conventional SEB and SCB designs.

cs.IT↗