Search arXiv⌕ Search

arXiv subjects

Bohan Li

Publications and source records attributed to Bohan Li.

At least 127 records · Page 7Linked to original sources

On the equivalence between squeezing and entanglement potential for two-mode Gaussian states

The maximum amount of entanglement achievable under passive transformations by continuous-variable states is called the entanglement potential. Recent work has demonstrated that the entanglement potential is upper-bounded by a simple function of the squeezing of formation, and that certain classes of two-mode Gaussian states can indeed saturate this bound, though saturability in the general case remains an open problem. In this study, we introduce a larger class of states that we prove saturates the bound, and we conjecture that all two-mode Gaussian states can be passively transformed into this class, meaning that for all two-mode Gaussian states, entanglement potential is equivalent to squeezing of formation. We provide an explicit algorithm for the passive transformations and perform extensive numerical testing of our claim, which seeks to unite the resource theories of two characteristic quantum properties of continuous-variable systems.

quant-ph↗

EMoG: Synthesizing Emotive Co-speech 3D Gesture with Diffusion Model

Although previous co-speech gesture generation methods are able to synthesize motions in line with speech content, it is still not enough to handle diverse and complicated motion distribution. The key challenges are: 1) the one-to-many nature between the speech content and gestures; 2) the correlation modeling between the body joints. In this paper, we present a novel framework (EMoG) to tackle the above challenges with denoising diffusion models: 1) To alleviate the one-to-many problem, we incorporate emotion clues to guide the generation process, making the generation much easier; 2) To model joint correlation, we propose to decompose the difficult gesture generation into two sub-problems: joint correlation modeling and temporal dynamics modeling. Then, the two sub-problems are explicitly tackled with our proposed Joint Correlation-aware transFormer (JCFormer). Through extensive evaluations, we demonstrate that our proposed method surpasses previous state-of-the-art approaches, offering substantial superiority in gesture synthesis.

cs.CV↗

High-coherence hybrid-integrated 780 nm source by self-injection-locked second-harmonic generation in a high-Q silicon-nitride resonator

By self-injection-locking a 1560 nm distributed feedback semiconductor laser to a high-$Q$ silicon nitride resonator, a high-coherence 780 nm second harmonic signal is generated via the photogalvanic-induced second-order nonlinearity. A record-low frequency noise floor of 4 Hz$^2$/Hz is achieved for the 780 nm emission. The approach can be generalized for signal generation over a wide range of visible and near-visible bands.

physics.optics↗

ICDAR 2023 Competition on Structured Text Extraction from Visually-Rich Document Images

Structured text extraction is one of the most valuable and challenging application directions in the field of Document AI. However, the scenarios of past benchmarks are limited, and the corresponding evaluation protocols usually focus on the submodules of the structured text extraction scheme. In order to eliminate these problems, we organized the ICDAR 2023 competition on Structured text extraction from Visually-Rich Document images (SVRD). We set up two tracks for SVRD including Track 1: HUST-CELL and Track 2: Baidu-FEST, where HUST-CELL aims to evaluate the end-to-end performance of Complex Entity Linking and Labeling, and Baidu-FEST focuses on evaluating the performance and generalization of Zero-shot / Few-shot Structured Text extraction from an end-to-end perspective. Compared to the current document benchmarks, our two tracks of competition benchmark enriches the scenarios greatly and contains more than 50 types of visually-rich document images (mainly from the actual enterprise applications). The competition opened on 30th December, 2022 and closed on 24th March, 2023. There are 35 participants and 91 valid submissions received for Track 1, and 15 participants and 26 valid submissions received for Track 2. In this report we will presents the motivation, competition datasets, task definition, evaluation protocol, and submission summaries. According to the performance of the submissions, we believe there is still a large gap on the expected information extraction performance for complex and zero-shot scenarios. It is hoped that this competition will attract many researchers in the field of CV and NLP, and bring some new thoughts to the field of Document AI.

cs.CV↗

Local Search For Satisfiability Modulo Integer Arithmetic Theories

Satisfiability Modulo Theories (SMT) refers to the problem of deciding the satisfiability of a formula with respect to certain background first order theories. In this paper, we focus on Satisfiablity Modulo Integer Arithmetic, which is referred to as SMT(IA), including both linear and non-linear integer arithmetic theories. Dominant approaches to SMT rely on calling a CDCL-based SAT solver, either in a lazy or eager favor. Local search, a competitive approach to solving combinatorial problems including SAT, however, has not been well studied for SMT. We develop the first local search algorithm for SMT(IA) by directly operating on variables, breaking through the traditional framework. We propose a local search framework by considering the distinctions between Boolean and integer variables. Moreover, we design a novel operator and scoring functions tailored for integer arithmetic, as well as a two-level operation selection heuristic. Putting these together, we develop a local search SMT(IA) solver called LS-IA. Experiments are carried out to evaluate LS-IA on benchmarks from SMTLIB. The results show that LS-IA is competitive and complementary with state-of-the-art SMT solvers, and performs particularly well on those formulae with only integer variables. A simple sequential portfolio with Z3 improves the state-of-the-art on satisfiable benchmark sets from SMT-LIB.

cs.LO↗

Superconformal indices of $\mathcal{N}=4$ Chern-Simons matter theories

Gaiotto and Witten found that one can construct 3d $\mathcal{N}=4$ Chern-Simons matter theories by using $\mathcal{N}=4$ SCFT whose momentum map of global symmetries satisfy special condition. Usually, one uses free hypermultiplet and twisted hypermultiplet, and more recently it was found that strongly coupled theory such as 3d version of $T_N$ theory and Argyres-Douglas matter can also be used. In this paper, we compute superconformal index of these $\mathcal{N}=4$ theories and derive the Coulomb/Higgs limit. Our results determine the moduli space of vacua, which is used to check various interesting mirror symmetry involving CSM theory and usual $\mathcal{N}=4$ gauge theory.

hep-th↗

MDD-Enabled Two-Tier Terahertz Fronthaul in Indoor Industrial Cell-Free Massive MIMO

To make indoor industrial cell-free massive multiple-input multiple-output (CF-mMIMO) networks free from wired fronthaul, this paper studies a multicarrier-division duplex (MDD)-enabled two-tier terahertz (THz) fronthaul scheme. More specifically, two layers of fronthaul links rely on the mutually orthogonal subcarreir sets in the same THz band, while access links are implemented over sub-6G band. The proposed scheme leads to a complicated mixed-integer nonconvex optimization problem incorporating access point (AP) clustering, device selection, the assignment of subcarrier sets between two fronthaul links and the resource allocation at both the central processing unit (CPU) and APs. In order to address the formulated problem, we first resort to the low-complexity but efficient heuristic methods thereby relaxing the binary variables. Then, the overall end-to-end rate is obtained by iteratively optimizing the assignment of subcarrier sets and the number of AP clusters. Furthermore, an advanced MDD frame structure consisting of three parallel data streams is tailored for the proposed scheme. Simulation results demonstrate the effectiveness of the proposed dynamic AP clustering approach in dealing with the varying sizes of networks. Moreover, benefiting from the well-designed frame structure, MDD is capable of outperforming TDD in the two-tier fronthaul networks. Additionally, the effect of the THz bandwidth on system performance is analyzed, and it is shown that with sufficient frequency resources, our proposed two-tier fully-wireless fronthaul scheme can achieve a comparable performance to the fiber-optic based systems. Finally, the superiority of the proposed MDD-enabled fronthaul scheme is verified in a practical scenario with realistic ray-tracing simulations.

cs.IT↗

Knowledge Enhancement for Contrastive Multi-Behavior Recommendation

A well-designed recommender system can accurately capture the attributes of users and items, reflecting the unique preferences of individuals. Traditional recommendation techniques usually focus on modeling the singular type of behaviors between users and items. However, in many practical recommendation scenarios (e.g., social media, e-commerce), there exist multi-typed interactive behaviors in user-item relationships, such as click, tag-as-favorite, and purchase in online shopping platforms. Thus, how to make full use of multi-behavior information for recommendation is of great importance to the existing system, which presents challenges in two aspects that need to be explored: (1) Utilizing users' personalized preferences to capture multi-behavioral dependencies; (2) Dealing with the insufficient recommendation caused by sparse supervision signal for target behavior. In this work, we propose a Knowledge Enhancement Multi-Behavior Contrastive Learning Recommendation (KMCLR) framework, including two Contrastive Learning tasks and three functional modules to tackle the above challenges, respectively. In particular, we design the multi-behavior learning module to extract users' personalized behavior information for user-embedding enhancement, and utilize knowledge graph in the knowledge enhancement module to derive more robust knowledge-aware representations for items. In addition, in the optimization stage, we model the coarse-grained commonalities and the fine-grained differences between multi-behavior of users to further improve the recommendation effect. Extensive experiments and ablation tests on the three real-world datasets indicate our KMCLR outperforms various state-of-the-art recommendation methods and verify the effectiveness of our method.

cs.IR↗

Multi-rate adaptive transform coding for video compression

Contemporary lossy image and video coding standards rely on transform coding, the process through which pixels are mapped to an alternative representation to facilitate efficient data compression. Despite impressive performance of end-to-end optimized compression with deep neural networks, the high computational and space demands of these models has prevented them from superseding the relatively simple transform coding found in conventional video codecs. In this study, we propose learned transforms and entropy coding that may either serve as (non)linear drop-in replacements, or enhancements for linear transforms in existing codecs. These transforms can be multi-rate, allowing a single model to operate along the entire rate-distortion curve. To demonstrate the utility of our framework, we augmented the DCT with learned quantization matrices and adaptive entropy coding to compress intra-frame AV1 block prediction residuals. We report substantial BD-rate and perceptual quality improvements over more complex nonlinear transforms at a fraction of the computational cost.

eess.IV↗

MetaPrompting: Learning to Learn Better Prompts

Prompting method is regarded as one of the crucial progress for few-shot nature language processing. Recent research on prompting moves from discrete tokens based ``hard prompts'' to continuous ``soft prompts'', which employ learnable vectors as pseudo prompt tokens and achieve better performance. Though showing promising prospects, these soft-prompting methods are observed to rely heavily on good initialization to take effect. Unfortunately, obtaining a perfect initialization for soft prompts requires understanding of inner language models working and elaborate design, which is no easy task and has to restart from scratch for each new task. To remedy this, we propose a generalized soft prompting method called MetaPrompting, which adopts the well-recognized model-agnostic meta-learning algorithm to automatically find better prompt initialization that facilitates fast adaptation to new prompting tasks.Extensive experiments show MetaPrompting tackles soft prompt initialization problem and brings significant improvement on four different datasets (over 6 points improvement in accuracy for 1-shot setting), achieving new state-of-the-art performance.

cs.CL↗

Engineered zero-dispersion microcombs using CMOS-ready photonics

Normal group velocity dispersion (GVD) microcombs offer high comb line power and high pumping efficiency compared to bright pulse microcombs. The recent demonstration of normal GVD microcombs using CMOS-foundry-produced microresonators is an important step towards scalable production. However, the chromatic dispersion of CMOS devices is large and impairs generation of broadband microcombs. Here, we report the development of a microresonator in which GVD is reduced due to a couple-ring resonator configuration. Operating in the turnkey self-injection-locking mode, the resonator is hybridly integrated with a semiconductor laser pump to produce high-power-efficiency combs spanning a bandwidth of 9.9 nm (1.22 THz) centered at 1560 nm, corresponding to 62 comb lines. Fast, linear optical sampling of the comb waveform is used to observe the rich set of near-zero GVD comb behaviors, including soliton molecules, switching waves (platicons) and their hybrids. Tuning of the 20 GHz repetition rate by electrical actuation enables servo locking to a microwave reference, which simultaneously stabilizes the comb repetition rate, offset frequency and temporal waveform. This hybridly integrated system could be used in coherent communications or for ultra-stable microwave signal generation by two-point optical frequency division.

physics.optics↗

On low rank 4d $\mathcal{N}=2$ SCFTs

There are two major ways of constructing 4d $\mathcal{N}=2$ superconformal field theories (SCFTs): the first one is putting a 6d $(2,0)$ theory on a punctured Riemann surface (class-S theory), and the second one is putting type IIB string theory on a 3d canonical singularity. As there are interests on low rank theories, we search all the possibilities from above two constructions. Most of those theories are engineered by class-S theory with irregular singularities, and we find a universal formula for the rank of theory so that a complete search is possible. We then compute various physical quantities of those theories, such as the central charges, flavor symmetry, associated vertex operator algebra and Higgs branch, etc. One of interesting consequence of our results are the prediction of many new isomorphism of 2d vertex operator algebra.

hep-th↗

Optimal investment and reinsurance policies for the Cram{é}r-Lundberg risk model under monotone mean-variance preference

In this paper, an optimization problem for the monotone mean-variance(MMV) criterion is considered in the perspective of the insurance company. The MMV criterion is an amended version of the classical mean-variance(MV) criterion which guarantees the monotonicity of the utility function. With this criterion we study the optimal investment and reinsurance problem which is formulated as a zero-sum game between the insurance company and an imaginary player. We apply the dynamic programming principle to obtain the corresponding Hamilton-Jacobi-Bellman-Isaacs(HJBI) equation. As the main conclusion of this paper, by solving the HJBI equation explicitly, the closed forms of the optimal strategy and the value function are obtained. Moreover, the MMV efficient frontier is also provided. At the end of the paper, a numerical example is presented.

math.OC↗

Spectral-Efficiency of Cell-Free Massive MIMO with Multicarrier-Division Duplex

A multicarrier-division duplex (MDD)-based cell-free (CF) scheme, namely MDD-CF, is proposed, which enables downlink (DL) data and uplink (UL) data or pilots to be concurrently transmitted on mutually orthogonal subcarriers in distributed CF massive MIMO (mMIMO) systems. To demonstrate the advantages of MDD-CF, we firstly study the spectral-efficiency (SE) performance in terms of one coherence interval (CT) associated with access point (AP)-selection, power- and subcarrier-allocation. Since the formulated SE optimization is a mixed-integer non-convex problem that is NP-hard to solve, we leverage the inherent association between involved variables to transform it into a continuous-integer convex-concave problem. Then, a quadratic transform (QT)-assisted iterative algorithm is proposed to achieve SE maximization. Next, we extend our study to the case of one radio frame consisting of several CT intervals. In this regard, a novel two-phase CT interval (TPCT) scheme is designed to not only improve the SE in radio frame but also provide consistent data transmissions over fast time-varying channels. Correspondingly, to facilitate the optimization, we propose a two-step iterative algorithm by building the connections between two phases in TPCT through an iteration factor. Simulation results show that, MDD-CF can significantly outperform in-band full duplex (IBFD)-CF due to the efficient interference management. Furthermore, compared with time-division duplex (TDD)-CF, MDD-CF is more robust to high-mobility scenarios and achieves better SE performance.

cs.IT↗

Heterogeneous graph neural network for power allocation in multicarrier-division duplex cell-free massive MIMO systems

In-band full duplex cell-free (CF) systems suffer from severe self-interference and cross-link interference, especially when CF systems are operated in distributed way. To this end, we propose the multicarrier-division duplex as an enabler for achieving full-duplex operation in the distributed CF massive MIMO systems, where downlink and uplink transmissions occur simultaneously in the same frequency band but on the mutually orthogonal subcarriers. To maximize the spectral-efficiency (SE), we introduce a heterogeneous graph neural network (HGNN) specific for CF systems, referred to as CF-HGNN, to optimize the power-allocation (PA). We design the adaptive node embedding layer for CF-HGNN to be scalable to the various numbers of access points (APs), mobile stations (MSs) and subcarriers. The attention mechanism of CF-HGNN enables individual AP/MS nodes to aggregate information from the interfering and communication paths with different priorities. For comparison, we propose a quadratic transform and successive convex approximation (QT-SCA) algorithm to solve the PA problem in classic way. Numerical results show that CF-HGNN is capable of achieving 99\% of the SE achievable by QT-SCA but using only $10^{-4}$ times of its operation time. CF-HGNN significantly outperforms the traditional greedy unfair method in terms of SE performance. Furthermore, CF-HGNN exhibits good scalability to the CF networks with various numbers of nodes and subcarriers, and also to the large-scale CF networks when assisted by user clustering.

eess.SP↗

When Counting Meets HMER: Counting-Aware Network for Handwritten Mathematical Expression Recognition

Recently, most handwritten mathematical expression recognition (HMER) methods adopt the encoder-decoder networks, which directly predict the markup sequences from formula images with the attention mechanism. However, such methods may fail to accurately read formulas with complicated structure or generate long markup sequences, as the attention results are often inaccurate due to the large variance of writing styles or spatial layouts. To alleviate this problem, we propose an unconventional network for HMER named Counting-Aware Network (CAN), which jointly optimizes two tasks: HMER and symbol counting. Specifically, we design a weakly-supervised counting module that can predict the number of each symbol class without the symbol-level position annotations, and then plug it into a typical attention-based encoder-decoder model for HMER. Experiments on the benchmark datasets for HMER validate that both joint optimization and counting results are beneficial for correcting the prediction errors of encoder-decoder models, and CAN consistently outperforms the state-of-the-art methods. In particular, compared with an encoder-decoder model for HMER, the extra time cost caused by the proposed counting module is marginal. The source code is available at https://github.com/LBH1024/CAN.

cs.CV↗

Self-injection-locked second-harmonic integrated source

High coherence visible and near-visible laser sources are centrally important to the operation of advanced position/navigation/timing systems as well as classical/quantum sensing systems. However, the complexity and size of these bench-top lasers is an impediment to their transitioning beyond the laboratory. Here, a system-on-a-chip that emits high-coherence visible and near-visible lightwaves is demonstrated. The devices rely upon a new approach wherein wavelength conversion and coherence increase by self-injection-locking are combined within in a single nonlinear resonator. This simplified approach is demonstrated in a hybridly-integrated device and provides a short-term linewidth around 10-30 kHz. On-chip, converted optical power over 2 mW is also obtained. Moreover, measurements show that heterogeneous integration can result in conversion efficiency higher than 25% with output power over 11 mW. Because the approach uses mature III-V pump lasers in combination with thin-film lithium niobate, it can be scaled for low-cost manufacturing of high-coherence visible emitters. Also, the coherence generation process can be transferred to other frequency conversion processes including optical parametric oscillation, sum/difference frequency generation, and third-harmonic generation.

physics.optics↗

Data Augmentation Approaches in Natural Language Processing: A Survey

As an effective strategy, data augmentation (DA) alleviates data scarcity scenarios where deep learning techniques may fail. It is widely applied in computer vision then introduced to natural language processing and achieves improvements in many tasks. One of the main focuses of the DA methods is to improve the diversity of training data, thereby helping the model to better generalize to unseen testing data. In this survey, we frame DA methods into three categories based on the diversity of augmented data, including paraphrasing, noising, and sampling. Our paper sets out to analyze DA methods in detail according to the above categories. Further, we also introduce their applications in NLP tasks as well as the challenges. Some helpful resources are provided in the appendix.

cs.CL↗