Researcher profile

Li Chen

Li Chen contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author

98works

0followers

49topics

4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

preprint2026arXiv

Doping induced itinerant ferromagnetism and enhanced ferroelectricity in BL-InSe

The microscopic coexistence of ferroelectricity and ferromagnetism in solids remains a fundamental challenge in condensed matter physics, with far-reaching implications for multifunctional materials and next-generation electronic devices. Using first-principles calculations, we predict emergent sliding ferroelectricity and doping-mediated ferromagnetism in bilayer (BL) InSe. The energetically favored AB stacked BL-InSe spontaneously breaks the out-of-plane mirror symmetry, resulting in a switchable polarization with a saturated component of 0.089 pC/m and a low transition barrier of 28.8 meV per unit cell. Strikingly, low-concentration electrostatic doping enhances rather than suppresses the ferroelectric polarization due to the abnormal layer-dependent electronic occupation in BL-InSe, in contrast to the conventional screening paradigm. In addition, the characteristic Mexican-hat-shaped valence band enables doping-induced itinerant half-metallic ferromagnetism, where the interlayer spin density difference scales linearly with doping concentration and can be reversed by switching the polarization direction. These results demonstrate the coexistence of ferroelectric and ferromagnetic orders in BL-InSe and establish a viable platform for realizing voltage-tunable multiferroicity through stacking and carrier doping in otherwise nonpolar and nonmagnetic semiconductors.

preprint2026arXiv

Engineering Ideal 2D Type-II Nodal Line Semimetals via Stacking and Intercalation of van der Waals Layers

Two-dimensional type-II topological semimetals (TSMs), characterized by strongly tilted Dirac cones, have attracted intense interest for their unconventional electronic properties and exotic transport behaviors. However, rational design remains challenging due to the sensitivity of band tilting to lattice geometry, atomic coordination, and symmetry constraints. Here, we present a bottom-up approach to engineer ideal type-II nodal line semimetals (NLSMs) in van der Waals bilayers via atomic intercalation. Using monolayer $h$-AlN as a prototype, we show that fluorine-intercalated bilayer AlN (F@BL-AlN) hosts a symmetry-protected type-II nodal loop precisely at the Fermi level, enabled by preserved mirror symmetry ($\mathcal{M}_z$) and tailored interlayer hybridization. First-principles calculations reveal that fluorine not only tunes interlayer coupling but also aligns the Fermi energy with the nodal line, stabilizing the type-II NLSM phase. The system exhibits tunable electronic properties under external electric and strain fields and features a van Hove singularity that induces spontaneous ferromagnetism, realizing a ferromagnetic topological semimetal state. This work provides a versatile platform for designing type-II NLSMs and offers practical guidance for their experimental realization.

preprint2026arXiv

InsightTok: Improving Text and Face Fidelity in Discrete Tokenization for Autoregressive Image Generation

Text and faces are among the most perceptually salient and practically important patterns in visual generation, yet they remain challenging for autoregressive generators built on discrete tokenization. A central bottleneck is the tokenizer: aggressive downsampling and quantization often discard the fine-grained structures needed to preserve readable glyphs and distinctive facial features. We attribute this gap to standard discrete-tokenizer objectives being weakly aligned with text legibility and facial fidelity, as these objectives typically optimize generic reconstruction while compressing diverse content uniformly. To address this, we propose InsightTok, a simple yet effective discrete visual tokenization framework that enhances text and face fidelity through localized, content-aware perceptual losses. With a compact 16k codebook and a 16x downsampling rate, InsightTok significantly outperforms prior tokenizers in text and face reconstruction without compromising general reconstruction quality. These gains consistently transfer to autoregressive image generation in InsightAR, producing images with clearer text and more faithful facial details. Overall, our results highlight the potential of specialized supervision in tokenizer training for advancing discrete image generation.

preprint2026arXiv

Interpretable Machine Learning for Quantum-Informed Property Predictions in Artificial Sensing Materials

Digital sensing faces challenges in developing sustainable methods to extend the applicability of customized e-noses to complex body odor volatilome (BOV). To address this challenge, we developed MORE-ML, a computational framework that integrates quantum-mechanical (QM) property data of e-nose molecular building blocks with machine learning (ML) methods to predict sensing-relevant properties. Within this framework, we expanded our previous dataset, MORE-Q, to MORE-QX by sampling a larger conformational space of interactions between BOV molecules and mucin-derived receptors. This dataset provides extensive electronic binding features (BFs) computed upon BOV adsorption. Analysis of MORE-QX property space revealed weak correlations between QM properties of building blocks and resulting BFs. Leveraging this observation, we defined electronic descriptors of building blocks as inputs for tree-based ML models to predict BFs. Benchmarking showed CatBoost models outperform alternatives, especially in transferability to unseen compounds. Explainable AI methods further highlighted which QM properties most influence BF predictions. Collectively, MORE-ML combines QM insights with ML to provide mechanistic understanding and rational design principles for molecular receptors in BOV sensing. This approach establishes a foundation for advancing artificial sensing materials capable of analyzing complex odor mixtures, bridging the gap between molecular-level computations and practical e-nose applications.

preprint2026arXiv

Normalized Solutions for Schrödinger-Bopp-Podolsky Systems with Critical Choquard-Type Nonlinearity on Bounded Domains

In this paper, we study normalized solutions for the following critical Schrödinger-Bopp-Podolsky system: $$-Δu + q(x)ϕu = λu + |u|^{p-2}u + \bigl(I_α* |u|^{3+α}\bigr)|u|^{1+α}u,\quad \text{in } Ω_r,$$ $$-Δϕ+ Δ^2ϕ= q(x)u^2, \ \qquad\qquad\qquad\qquad\qquad\qquad\qquad\ \text{ in } Ω_r,$$ where $Ω_r \subset \mathbb R^3$ is a smooth bounded domain, $p \in \left(2, \frac{8}{3}\right)$, $q(x) \in C(\barΩ_r) \backslash \{0\}$ and $λ\in \mathbb R$ is the Lagrange multiplier associated with the constraint $\int_{Ω_r} |u|^2\, \mathrm d x = b^2$ for some $b > 0$. Here $α> 0$, $I_α$ denotes the Riesz potential, and the domain parameter $r$ reflects the size of $Ω_r$ whose precise definition will be given in Section 3. By applying a special minimax principle together with a truncation technique, we prove that there exists $b^* > 0$ such that the system admits multiple normalized solutions whenever $b \in (0, b^*)$ under Navier boundary conditions.

preprint2026arXiv

RecGPT-Mobile: On-Device Large Language Models for User Intent Understanding in Taobao Feed Recommendation

Predicting a user's next search query from recent interaction behaviors is a critical problem in modern e-commerce systems, particularly in scenarios where user intent evolves rapidly. Large Language Models (LLMs) offer strong semantic reasoning capabilities and have recently been adopted to enhance training data construction for next-query prediction. However, due to resource constraints on mobile devices, existing applications are deployed on cloud servers, resulting in high inference costs. In this paper, we propose RecGPT-Mobile, a framework that designs a lightweight LLM-based intent understanding agent to improve recommendation quality in mobile e-commerce scenarios. By deploying LLMs directly on mobile devices, our approach can capture evolving interests of users more quickly and adjust the recommendation results in real time. Extensive offline analyses and online experiments demonstrate that our method significantly improves the accuracy of recommendation results, laying a practical path for LLM deployment in production-scale recommendation systems on mobile devices, as well as a scalable solution for integrating LLMs into real-world next-query prediction systems.

preprint2026arXiv

Thompson Sampling for Repeated Newsvendor

In this paper, we investigate the performance of Thompson Sampling (TS) for online learning with censored feedback, focusing primarily on the classic repeated newsvendor model--a foundational framework in inventory management--and demonstrating how our techniques can be naturally extended to a broader class of problems. We first model demand using a Weibull distribution and initialize TS with a Gamma prior to dynamically adjust order quantities. Our analysis establishes optimal (up to logarithmic factors) frequentist regret bounds for TS without imposing restrictive prior assumptions. More importantly, it yields novel and highly interpretable insights on how TS addresses the exploration-exploitation trade-off in the repeated newsvendor setting. Specifically, our results show that when past order quantities are sufficiently large to overcome censoring, TS accurately estimates the unknown demand parameters, leading to near-optimal ordering decisions. Conversely, when past orders are relatively small, TS automatically increases future order quantities to gather additional demand information. Then, we extend our analysis to general parametric distribution family and provide proof for Bayesian regret. Extensive numerical simulations further demonstrate that TS outperforms more conservative and widely-used approaches such as online convex optimization, upper confidence bounds, and myopic Bayesian dynamic programming.

preprint2025arXiv

Jailbreak-Zero: A Path to Pareto Optimal Red Teaming for Large Language Models

This paper introduces Jailbreak-Zero, a novel red teaming methodology that shifts the paradigm of Large Language Model (LLM) safety evaluation from a constrained example-based approach to a more expansive and effective policy-based framework. By leveraging an attack LLM to generate a high volume of diverse adversarial prompts and then fine-tuning this attack model with a preference dataset, Jailbreak-Zero achieves Pareto optimality across the crucial objectives of policy coverage, attack strategy diversity, and prompt fidelity to real user inputs. The empirical evidence demonstrates the superiority of this method, showcasing significantly higher attack success rates against both open-source and proprietary models like GPT-40 and Claude 3.5 when compared to existing state-of-the-art techniques. Crucially, Jailbreak-Zero accomplishes this while producing human-readable and effective adversarial prompts with minimal need for human intervention, thereby presenting a more scalable and comprehensive solution for identifying and mitigating the safety vulnerabilities of LLMs.

preprint2024arXiv

Integrating Secondary Structures Information into Triangular Spatial Relationships (TSR) for Advanced Protein Classification

Protein structures represent the key to deciphering biological functions. The more detailed form of similarity among these proteins is sometimes overlooked by the conventional structural comparison methods. In contrast, further advanced methods, such as Triangular Spatial Relationship (TSR), have been demonstrated to make finer differentiations. Still, the classical implementation of TSR does not provide for the integration of secondary structure information, which is important for a more detailed understanding of the folding pattern of a protein. To overcome these limitations, we developed the SSE-TSR approach. The proposed method integrates secondary structure elements (SSEs) into TSR-based protein representations. This allows an enriched representation of protein structures by considering 18 different combinations of helix, strand, and coil arrangements. Our results show that using SSEs improves the accuracy and reliability of protein classification to varying degrees. We worked with two large protein datasets of 9.2K and 7.8K samples, respectively. We applied the SSE-TSR approach and used a neural network model for classification. Interestingly, introducing SSEs improved performance statistics for Dataset 1, with accuracy moving from 96.0% to 98.3%. For Dataset 2, where the performance statistics were already good, further small improvements were found with the introduction of SSE, giving an accuracy of 99.5% compared to 99.4%. These results show that SSE integration can dramatically improve TSR key discrimination, with significant benefits in datasets with low initial accuracies and only incremental gains in those with high baseline performance. Thus, SSE-TSR is a powerful bioinformatics tool that improves protein classification and understanding of protein function and interaction.

preprint2024arXiv

Joint Channel Estimation and Data Recovery for Millimeter Massive MIMO: Using Pilot to Capture Principal Components

Channel state information (CSI) is important to reap the full benefits of millimeter wave (mmWave) massive multiple-input multiple-output (MIMO) systems. The traditional channel estimation methods using pilot frames (PF) lead to excessive overhead. To reduce the demand for PF, data frames (DF) can be adopted for joint channel estimation and data recovery. However, the computational complexity of the DF-based methods is prohibitively high. To reduce the computational complexity, we propose a joint channel estimation and data recovery (JCD) method assisted by a small number of PF for mmWave massive MIMO systems. The proposed method has two stages. In Stage 1, differing from the traditional PF-based methods, the proposed PF-assisted method is utilized to capture the angle of arrival (AoA) of principal components (PC) of channels. In Stage 2, JCD is designed for parallel implementation based on the multi-user decoupling strategy. The theoretical analysis demonstrates that the PF-assisted JCD method can achieve equivalent performance to the Bayesian-optimal DF-based method, while greatly reducing the computational complexity. Simulation results are also presented to validate the analytical results.

preprint2024arXiv

LaneSegNet: Map Learning with Lane Segment Perception for Autonomous Driving

A map, as crucial information for downstream applications of an autonomous driving system, is usually represented in lanelines or centerlines. However, existing literature on map learning primarily focuses on either detecting geometry-based lanelines or perceiving topology relationships of centerlines. Both of these methods ignore the intrinsic relationship of lanelines and centerlines, that lanelines bind centerlines. While simply predicting both types of lane in one model is mutually excluded in learning objective, we advocate lane segment as a new representation that seamlessly incorporates both geometry and topology information. Thus, we introduce LaneSegNet, the first end-to-end mapping network generating lane segments to obtain a complete representation of the road structure. Our algorithm features two key modifications. One is a lane attention module to capture pivotal region details within the long-range feature space. Another is an identical initialization strategy for reference points, which enhances the learning of positional priors for lane attention. On the OpenLane-V2 dataset, LaneSegNet outperforms previous counterparts by a substantial gain across three tasks, \textit{i.e.}, map element detection (+4.8 mAP), centerline perception (+6.9 DET$_l$), and the newly defined one, lane segment perception (+5.6 mAP). Furthermore, it obtains a real-time inference speed of 14.7 FPS. Code is accessible at https://github.com/OpenDriveLab/LaneSegNet.

preprint2024arXiv

Parabolic Anderson model in bounded domains of recurrent metric measure spaces

A metric measure space equipped with a Dirichlet form is called recurrent if its Hausdorff dimension is less than its walk dimension. In bounded domains of such spaces we study the parabolic Anderson models \[ \partial_{t} u(t,x) = Δu(t,x) + βu(t,x) \, \dot{W}_α(t,x) \] where the noise $W_α$ is white in time and colored in space when $α>0$ while for $α=0$ it is also white in space. Both Dirichlet and Neumann boundary conditions are considered. Besides proving existence and uniqueness in the Itô sense we also get precise $L^p$ estimates for the moments and intermittency properties of the solution as a consequence. Our study reveals new exponents which are intrinsically associated to the geometry of the underlying space and the results for instance apply in metric graphs or fractals like the Sierpiński gasket for which we prove scaling invariance properties of the models.

preprint2023arXiv

Personalized Prompt Learning for Explainable Recommendation

Providing user-understandable explanations to justify recommendations could help users better understand the recommended items, increase the system's ease of use, and gain users' trust. A typical approach to realize it is natural language generation. However, previous works mostly adopt recurrent neural networks to meet the ends, leaving the potentially more effective pre-trained Transformer models under-explored. In fact, user and item IDs, as important identifiers in recommender systems, are inherently in different semantic space as words that pre-trained models were already trained on. Thus, how to effectively fuse IDs into such models becomes a critical issue. Inspired by recent advancement in prompt learning, we come up with two solutions: find alternative words to represent IDs (called discrete prompt learning), and directly input ID vectors to a pre-trained model (termed continuous prompt learning). In the latter case, ID vectors are randomly initialized but the model is trained in advance on large corpora, so they are actually in different learning stages. To bridge the gap, we further propose two training strategies: sequential tuning and recommendation as regularization. Extensive experiments show that our continuous prompt learning approach equipped with the training strategies consistently outperforms strong baselines on three datasets of explainable recommendation.

preprint2023arXiv

Reversible Attack based on Local Visual Adversarial Perturbation

Adding perturbations to images can mislead classification models to produce incorrect results. Recently, researchers exploited adversarial perturbations to protect image privacy from retrieval by intelligent models. However, adding adversarial perturbations to images destroys the original data, making images useless in digital forensics and other fields. To prevent illegal or unauthorized access to sensitive image data such as human faces without impeding legitimate users, the use of reversible adversarial attack techniques is increasing. The original image can be recovered from its reversible adversarial examples. However, existing reversible adversarial attack methods are designed for traditional imperceptible adversarial perturbations and ignore the local visible adversarial perturbation. In this paper, we propose a new method for generating reversible adversarial examples based on local visible adversarial perturbation. The information needed for image recovery is embedded into the area beyond the adversarial patch by the reversible data hiding technique. To reduce image distortion, lossless compression and the B-R-G (bluered-green) embedding principle are adopted. Experiments on CIFAR-10 and ImageNet datasets show that the proposed method can restore the original images error-free while ensuring good attack performance.

preprint2023arXiv

Rigorous Derivation of the Degenerate Parabolic-Elliptic Keller-Segel System from a Moderately Interacting Stochastic Particle System. Part I Partial Differential Equation

The aim of this paper is to provide the analysis result for the partial differential equations arising from the rigorous derivation of the degenerate parabolic-elliptic Keller-Segel system from a moderately interacting stochastic particle system. The rigorous derivation is divided into two articles. In this paper, we establish the solution theory of the degenerate parabolic-elliptic Keller-Segel problem and its non-local version, which will be used in the second paper for the discussion of the mean-field limit. A parabolic regularized system is introduced to bridge the stochastic particle model and the degenerate Keller-Segel system. We derive the existence of the solution to this regularized system by constructing approximate solutions, giving uniform estimates and taking the limits, where a crucial step is to obtain the L infty Bernstein type estimate for the gradient of the approximate solution. Based on this, we obtain the well-posedness of the corresponding non-local equation through perturbation method. Finally, the weak solution of the degenerate Keller-Segel system is obtained by using a nonlinear version of Aubin-Lions lemma.

preprint2023arXiv

Visual Point Cloud Forecasting enables Scalable Autonomous Driving

In contrast to extensive studies on general vision, pre-training for scalable visual autonomous driving remains seldom explored. Visual autonomous driving applications require features encompassing semantics, 3D geometry, and temporal information simultaneously for joint perception, prediction, and planning, posing dramatic challenges for pre-training. To resolve this, we bring up a new pre-training task termed as visual point cloud forecasting - predicting future point clouds from historical visual input. The key merit of this task captures the synergic learning of semantics, 3D structures, and temporal dynamics. Hence it shows superiority in various downstream tasks. To cope with this new problem, we present ViDAR, a general model to pre-train downstream visual encoders. It first extracts historical embeddings by the encoder. These representations are then transformed to 3D geometric space via a novel Latent Rendering operator for future point cloud prediction. Experiments show significant gain in downstream tasks, e.g., 3.1% NDS on 3D detection, ~10% error reduction on motion forecasting, and ~15% less collision rate on planning.

preprint2022arXiv

A Data-driven Adversarial Examples Recognition Framework via Adversarial Feature Genome

Adversarial examples pose many security threats to convolutional neural networks (CNNs). Most defense algorithms prevent these threats by finding differences between the original images and adversarial examples. However, the found differences do not contain features about the classes, so these defense algorithms can only detect adversarial examples without recovering the correct labels. In this regard, we propose the Adversarial Feature Genome (AFG), a novel type of data that contains both the differences and features about classes. This method is inspired by an observed phenomenon, namely the Adversarial Feature Separability (AFS), where the difference between the feature maps of the original images and adversarial examples becomes larger with deeper layers. On top of that, we further develop an adversarial example recognition framework that detects adversarial examples and can recover the correct labels. In the experiments, the detection and classification of adversarial examples by AFGs has an accuracy of more than 90.01\% in various attack scenarios. To the best of our knowledge, our method is the first method that focuses on both attack detecting and recovering. AFG gives a new data-driven perspective to improve the robustness of CNNs. The source code is available at https://github.com/GeoX-Lab/Adv_Fea_Genome.

preprint2022arXiv

A Survey of Surface Defect Detection of Industrial Products Based on A Small Number of Labeled Data

The surface defect detection method based on visual perception has been widely used in industrial quality inspection. Because defect data are not easy to obtain and the annotation of a large number of defect data will waste a lot of manpower and material resources. Therefore, this paper reviews the methods of surface defect detection of industrial products based on a small number of labeled data, and this method is divided into traditional image processing-based industrial product surface defect detection methods and deep learning-based industrial product surface defect detection methods suitable for a small number of labeled data. The traditional image processing-based industrial product surface defect detection methods are divided into statistical methods, spectral methods and model methods. Deep learning-based industrial product surface defect detection methods suitable for a small number of labeled data are divided into based on data augmentation, based on transfer learning, model-based fine-tuning, semi-supervised, weak supervised and unsupervised.

preprint2022arXiv

An Efficient Cervical Whole Slide Image Analysis Framework Based on Multi-scale Semantic and Location Deep Features

Digital gigapixel whole slide image (WSI) is widely used in clinical diagnosis, and automated WSI analysis is key for computer-aided diagnosis. Currently, analyzing the integrated descriptor of probabilities or feature maps from massive local patches encoded by ResNet classifier is the main manner for WSI-level prediction. Feature representations of the sparse and tiny lesion cells in cervical slides, however, are still challenging, while the unused location representations are available to supply the semantics classification. This study designs a novel and efficient framework with a new module InCNet constructed lightweight model YOLCO (You Only Look Cytology Once). It directly extracts feature inside the single cell (cluster) instead of the traditional way that from image tile with a fixed size. The InCNet (Inline Connection Network) enriches the multi-scale connectivity without efficiency loss. The proposal allows the input size enlarged to megapixel that can stitch the WSI by the average repeats decreased from $10^3\sim10^4$ to $10^1\sim10^2$ for collecting features and predictions at two scales. Based on Transformer for classifying the integrated multi-scale multi-task WSI features, the experimental results appear $0.872$ AUC score better than the best conventional model on our dataset ($n$=2,019) from four scanners. The code is available at https://github.com/Chrisa142857/You-Only-Look-Cytopathology-Once , where the deployment version has the speed $\sim$70 s/WSI.

preprint2022arXiv

Besov class via heat semigroup on Dirichlet spaces III: BV functions and sub-Gaussian heat kernel estimates

With a view toward fractal spaces, by using a Korevaar-Schoen space approach, we introduce the class of bounded variation (BV) functions in a general framework of strongly local Dirichlet spaces with a heat kernel satisfying sub-Gaussian estimates. Under a weak Bakry-Émery curvature type condition, which is new in this setting, this BV class is identified with a heat semigroup based Besov class. As a consequence of this identification, properties of BV functions and associated BV measures are studied in detail. In particular, we prove co-area formulas, global $L^1$ Sobolev embeddings and isoperimetric inequalities. It is shown that for nested fractals or their direct products the BV class we define is dense in $L^1$. The examples of the unbounded Vicsek set, unbounded Sierpinski gasket and unbounded Sierpinski carpet are discussed.

preprint2022arXiv

C^0 estimates for Hessian quotient equations on HKT manifolds

We show the $C^0$ estimate for solutions to Hessian quotient equations on hyperKähler with torsion manifolds without any additional assumption on its hypercomplex structure by a clever use of the cone condition directly.

preprint2022arXiv

Combined mean-field and semiclassical limits of large fermionic systems

We study the time dependent Schrödinger equation for large spinless fermions with the semiclassical scale $\hbar = N^{-1/3}$ in three dimensions. By using the Husimi measure defined by coherent states, we rewrite the Schrödinger equation into a BBGKY type of hierarchy for the k particle Husimi measure. Further estimates are derived to obtain the weak compactness of the Husimi measure, and in addition uniform estimates for the remainder terms in the hierarchy are derived in order to show that in the semiclassical regime the weak limit of the Husimi measure is exactly the solution of the Vlasov equation.

preprint2022arXiv

Conversational Recommendation: A Grand AI Challenge

Animated avatars, which look and talk like humans, are iconic visions of the future of AI-powered systems. Through many sci-fi movies we are acquainted with the idea of speaking to such virtual personalities as if they were humans. Today, we talk more and more to machines like Apple's Siri, e.g., to ask them for the weather forecast. However, when asked for recommendations, e.g., for a restaurant to go to, the limitations of such devices quickly become obvious. They do not engage in a conversation to find out what we might prefer, they often do not provide explanations for what they recommend, and they may have difficulties remembering what was said one minute earlier. Conversational recommender systems promise to address these limitations. In this paper, we review existing approaches to build such systems, which developments we observe today, which challenges are still open and why the development of conversational recommenders represents one of the next grand challenges of AI.

preprint2022arXiv

Decentralized Federated Learning: Balancing Communication and Computing Costs

Decentralized stochastic gradient descent (SGD) is a driving engine for decentralized federated learning (DFL). The performance of decentralized SGD is jointly influenced by inter-node communications and local updates. In this paper, we propose a general DFL framework, which implements both multiple local updates and multiple inter-node communications periodically, to strike a balance between communication efficiency and model consensus. It can provide a general decentralized SGD analytical framework. We establish strong convergence guarantees for the proposed DFL algorithm without the assumption of convex objectives. The convergence rate of DFL can be optimized to achieve the balance of communication and computing costs under constrained resources. For improving communication efficiency of DFL, compressed communication is further introduced to the proposed DFL as a new scheme, named DFL with compressed communication (C-DFL). The proposed C-DFL exhibits linear convergence for strongly convex objectives. Experiment results based on MNIST and CIFAR-10 datasets illustrate the superiority of DFL over traditional decentralized SGD methods and show that C-DFL further enhances communication efficiency.

preprint2022arXiv

Deep Learning with Label Noise: A Hierarchical Approach

Deep neural networks are susceptible to label noise. Existing methods to improve robustness, such as meta-learning and regularization, usually require significant change to the network architecture or careful tuning of the optimization procedure. In this work, we propose a simple hierarchical approach that incorporates a label hierarchy when training the deep learning models. Our approach requires no change of the network architecture or the optimization procedure. We investigate our hierarchical network through a wide range of simulated and real datasets and various label noise types. Our hierarchical approach improves upon regular deep neural networks in learning with label noise. Combining our hierarchical approach with pre-trained models achieves state-of-the-art performance in real-world noisy datasets.

preprint2022arXiv

Design of Coded Caching Schemes with Linear Subpacketizations Based on Injective Arc Coloring of Regular Digraphs

Coded caching is an effective technique to decongest the amount of traffic in the backhaul link. In such a scheme, each file hosted in the server is divided into a number of packets to pursue a low transmission rate based on the delicate design of contents cached into users and broadcast messages. However, the implementation complexity of this scheme increases with the number of packets. It is desirable to design a scheme with a small subpacketization level and a relatively low transmission rate. Recently, placement delivery array (PDA) was proposed to address the subpacketization bottleneck of coded caching. This paper investigates the design PDA from a new perspective, i.e., the injective arc coloring of regular digraphs. It is shown that the injective arc coloring of a regular digraph can yield a PDA with the same number of rows and columns. Based on this, a new class of regular digraphs are defined and the upper bounds on the injective chromatic index of such digraphs are derived. Consequently, some new coded caching schemes with a linear subpacketization level and a small transmission rate are proposed, one of which generalizes the existing scheme for the scenario with a more flexible number of users.

preprint2022arXiv

Design of Placement Delivery Arrays for Coded Caching with Small Subpacketizations and Flexible Memory Sizes

Coded caching is an emerging technique to reduce the data transmission load during the peak-traffic times. In such a scheme, each file in the data center or library is usually divided into a number of packets to pursue a low broadcasting rate based on the designed placements at each user's cache. However, the implementation complexity of this scheme increases as the number of packets increases. It is crucial to design a scheme with a small subpacketization level, while maintaining a relatively low transmission rate. It is known that the design of caches in users (i.e., the placement phase) and broadcasting (i.e., the delivery phase) can be unified in one matrix, namely the placement delivery array (PDA). This paper proposes a novel PDA construction by selecting proper orthogonal arrays (POAs), which generalizes some known constructions but with a more flexible memory size. Based on the proposed PDA construction, an effective transformation is further proposed to enable a coded caching scheme to have a smaller subpacketization level. Moreover, two new coded caching schemes with the coded placement are considered. It is shown that the proposed schemes yield a lower subpacketization level and transmission rate over some existing schemes.

preprint2022arXiv

Discovery of extended structure around open cluster COIN-Gaia 13 based on Gaia EDR3

COIN-Gaia 13 is a newly discovered open cluster revealed by Gaia DR2 data. It is a nearby open cluster with a distance of about 513 pc. Combined with the five-dimensional astrometric data of Gaia EDR3 with higher accuracy, we use the membership assignment algorithm (pyUPMASK) to determine the membership of COIN-Gaia 13 in a large extended spatial region. The cluster has found 478 candidate members. After obtaining reliable cluster members, we further study its basic properties and spatial distribution. Our results show that there is an obvious extended structure of the cluster in the X-Y plane. This elongated structure is distributed along the spiral arm, and the whole length is about 270 pc. The cluster age is 250 Myr, the total mass is about 439 M$_\odot$, and the tidal radius of the cluster is about 11 pc. Since more than half of the member stars (352 stars) are located outside twice the tidal radius, it is suspected that this cluster is undergoing the dynamic dissolution process. Furthermore, the spatial distribution and kinematic analysis indicate that the extended structure in COIN-Gaia 13 is more likely to be caused by the differential rotation of the Galaxy.

preprint2022arXiv

Enhanced Deep Animation Video Interpolation

Existing learning-based frame interpolation algorithms extract consecutive frames from high-speed natural videos to train the model. Compared to natural videos, cartoon videos are usually in a low frame rate. Besides, the motion between consecutive cartoon frames is typically nonlinear, which breaks the linear motion assumption of interpolation algorithms. Thus, it is unsuitable for generating a training set directly from cartoon videos. For better adapting frame interpolation algorithms from nature video to animation video, we present AutoFI, a simple and effective method to automatically render training data for deep animation video interpolation. AutoFI takes a layered architecture to render synthetic data, which ensures the assumption of linear motion. Experimental results show that AutoFI performs favorably in training both DAIN and ANIN. However, most frame interpolation algorithms will still fail in error-prone areas, such as fast motion or large occlusion. Besides AutoFI, we also propose a plug-and-play sketch-based post-processing module, named SktFI, to refine the final results using user-provided sketches manually. With AutoFI and SktFI, the interpolated animation frames show high perceptual quality.

preprint2022arXiv

ERNIE-SPARSE: Learning Hierarchical Efficient Transformer Through Regularized Self-Attention

Sparse Transformer has recently attracted a lot of attention since the ability for reducing the quadratic dependency on the sequence length. We argue that two factors, information bottleneck sensitivity and inconsistency between different attention topologies, could affect the performance of the Sparse Transformer. This paper proposes a well-designed model named ERNIE-Sparse. It consists of two distinctive parts: (i) Hierarchical Sparse Transformer (HST) to sequentially unify local and global information. (ii) Self-Attention Regularization (SAR) method, a novel regularization designed to minimize the distance for transformers with different attention topologies. To evaluate the effectiveness of ERNIE-Sparse, we perform extensive evaluations. Firstly, we perform experiments on a multi-modal long sequence modeling task benchmark, Long Range Arena (LRA). Experimental results demonstrate that ERNIE-Sparse significantly outperforms a variety of strong baseline methods including the dense attention and other efficient sparse attention methods and achieves improvements by 2.77% (57.78% vs. 55.01%). Secondly, to further show the effectiveness of our method, we pretrain ERNIE-Sparse and verified it on 3 text classification and 2 QA downstream tasks, achieve improvements on classification benchmark by 0.83% (92.46% vs. 91.63%), on QA benchmark by 3.24% (74.67% vs. 71.43%). Experimental results continue to demonstrate its superior performance.

preprint2022arXiv

Finding Optimal Tangent Points for Reducing Distortions of Hard-label Attacks

One major problem in black-box adversarial attacks is the high query complexity in the hard-label attack setting, where only the top-1 predicted label is available. In this paper, we propose a novel geometric-based approach called Tangent Attack (TA), which identifies an optimal tangent point of a virtual hemisphere located on the decision boundary to reduce the distortion of the attack. Assuming the decision boundary is locally flat, we theoretically prove that the minimum $\ell_2$ distortion can be obtained by reaching the decision boundary along the tangent line passing through such tangent point in each iteration. To improve the robustness of our method, we further propose a generalized method which replaces the hemisphere with a semi-ellipsoid to adapt to curved decision boundaries. Our approach is free of pre-training. Extensive experiments conducted on the ImageNet and CIFAR-10 datasets demonstrate that our approach can consume only a small number of queries to achieve the low-magnitude distortion. The implementation source code is released online at https://github.com/machanic/TangentAttack.

preprint2022arXiv

Global weak solutions to the Vlasov-Poisson-Fokker-Planck-Navier-Stokes system

We consider the compressible Vlasov-Poisson-Fokker-Planck-Navier-Stokes system in a three dimensional bounded domain with nonhomogeneous Dirichlet boundary conditions. The system describes the evolution of charged particles ensemble dispersed in an isentropic fluid. For the adiabatic coefficient $γ>3/2$, we establish the global existence of weak solutions to this system with arbitrary large initial and boundary data.

preprint2022arXiv

Impacts of Personal Characteristics on User Trust in Conversational Recommender Systems

Conversational recommender systems (CRSs) imitate human advisors to assist users in finding items through conversations and have recently gained increasing attention in domains such as media and e-commerce. Like in human communication, building trust in human-agent communication is essential given its significant influence on user behavior. However, inspiring user trust in CRSs with a "one-size-fits-all" design is difficult, as individual users may have their own expectations for conversational interactions (e.g., who, user or system, takes the initiative), which are potentially related to their personal characteristics. In this study, we investigated the impacts of three personal characteristics, namely personality traits, trust propensity, and domain knowledge, on user trust in two types of text-based CRSs, i.e., user-initiative and mixed-initiative. Our between-subjects user study (N=148) revealed that users' trust propensity and domain knowledge positively influenced their trust in CRSs, and that users with high conscientiousness tended to trust the mixed-initiative system.

preprint2022arXiv

Learning quantum dissipation by the neural ordinary differential equation

Quantum dissipation arises from the unavoidable coupling between a quantum system and its surrounding environment, which is known as a major obstacle in the quantum processing of information. Apart from its existence, how to trace the dissipation from observational data is a crucial topic that may stimulate manners to suppress the dissipation. In this paper, we propose to learn the quantum dissipation from dynamical observations using the neural ordinary differential equation, and then demonstrate this method concretely on two open quantum-spin systems -- a large spin system and a spin-1/2 chain. We also investigate the learning efficiency of the dataset, which provides useful guidance for data acquisition in experiments. Our work promisingly facilitates effective modeling and decoherence suppression in open quantum systems.

preprint2022arXiv

Level 2 Autonomous Driving on a Single Device: Diving into the Devils of Openpilot

Equipped with a wide span of sensors, predominant autonomous driving solutions are becoming more modular-oriented for safe system design. Though these sensors have laid a solid foundation, most massive-production solutions up to date still fall into L2 phase. Among these, Comma.ai comes to our sight, claiming one $999 aftermarket device mounted with a single camera and board inside owns the ability to handle L2 scenarios. Together with open-sourced software of the entire system released by Comma.ai, the project is named Openpilot. Is it possible? If so, how is it made possible? With curiosity in mind, we deep-dive into Openpilot and conclude that its key to success is the end-to-end system design instead of a conventional modular framework. The model is briefed as Supercombo, and it can predict the ego vehicle's future trajectory and other road semantics on the fly from monocular input. Unfortunately, the training process and massive amount of data to make all these work are not publicly available. To achieve an intensive investigation, we try to reimplement the training details and test the pipeline on public benchmarks. The refactored network proposed in this work is referred to as OP-Deepdive. For a fair comparison of our version to the original Supercombo, we introduce a dual-model deployment scheme to test the driving performance in the real world. Experimental results on nuScenes, Comma2k19, CARLA, and in-house realistic scenarios verify that a low-cost device can indeed achieve most L2 functionalities and be on par with the original Supercombo model. In this report, we would like to share our latest findings, shed some light on the new perspective of end-to-end autonomous driving from an industrial product-level side, and potentially inspire the community to continue improving the performance. Our code, benchmarks are at https://github.com/OpenPerceptionX/Openpilot-Deepdive.

preprint2022arXiv

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time

We give an algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with $m$ edges and polynomially bounded integral demands, costs, and capacities in $m^{1+o(1)}$ time. Our algorithm builds the flow through a sequence of $m^{1+o(1)}$ approximate undirected minimum-ratio cycles, each of which is computed and processed in amortized $m^{o(1)}$ time using a new dynamic graph data structure. Our framework extends to algorithms running in $m^{1+o(1)}$ time for computing flows that minimize general edge-separable convex functions to high accuracy. This gives almost-linear time algorithms for several problems including entropy-regularized optimal transport, matrix scaling, $p$-norm flows, and $p$-norm isotonic regression on arbitrary directed acyclic graphs.

preprint2022arXiv

Minimum Coverage Instrumentation

Modern compilers leverage block coverage profile data to carry out downstream profile-guided optimizations to improve the runtime performance and the size of a binary. Given a control-flow graph $G=(V, E)$ of a function in the binary, where nodes in $V$ correspond to basic blocks (sequences of instructions that are always executed sequentially) and edges in $E$ represent jumps in the control flow, the goal is to know for each block $u \in V$ whether $u$ was executed during a session. To this end, extra instrumentation code that records when a block is executed needs to be added to the binary. This extra code creates a time and space overhead, which one would like to minimize as much as possible. Motivated by this application, we study the Minimum Coverage Instrumentation problem, where the goal is to find a minimum size subset of blocks to instrument such that the coverage of the remaining blocks in the graph can be inferred from the coverage status of the instrumented subset. Our main result is an algorithm to find an optimal instrumentation strategy and to carry out the inference in $O(|E|)$ time. We also study variants of this basic problem in which we are interested in learning the coverage of edges instead of the nodes, or when we are only allowed to instrument edges instead of the nodes.

preprint2022arXiv

New insights into the structure of open clusters in the Gaia era

With the help of Gaia data, it is noted that in addition to the core components, there are low-density outer halo components in the extended region of open clusters. To study the extended structure beyond the core radius of the cluster ($\sim$ 10 pc), based on Gaia EDR3 data, taking up to 50 pc as the searching radius, we use the pyUPMASK algorithm to re-determine the member stars of the open cluster within 1-2 kpc. We obtain the member stars of 256 open clusters, especially those located in the outer halo region of open clusters. Furthermore, we find that most open clusters' radial density profile in the outer region deviates from the King's profile. To better describe the internal and external structural characteristics of open clusters, we propose a double components model for description: core components with King model distribution and outer halo components with logarithmic Gaussian distribution, and then suggest using four radii ( $r_c$, $r_t$, $r_o$, $r_e$) for describing the structure and distribution profile of star clusters, where $r_t$ and $r_e$ represent the boundaries of core components and outer halo components respectively. Finally, we provide a catalog of 256 clusters with structural parameters. In addition, our study shows the sizes of these radii are statistically linear related, which indicates that the inner and outer regions of the cluster are interrelated and follow similar evolutionary processes. Further, we show that the structure of two components can be used to better trace the cluster evolution properties in different stages.

preprint2022arXiv

New Open Cluster candidates Found in Galactic Disk Using Gaia DR2/EDR3 Data

We report 541 new open cluster candidates in Gaia EDR3 through revisiting the cluster results from an earlier analysis of the Gaia DR2, which revealed nearly a thousand open cluster candidates in the solar neighborhood (mostly d < 3 kpc) resideing at Galactic latitudes |b| < 20 degrees. A subsequent comparison with lists of known clusters shows a large increases of the cluster samples within 2 kpc from the Sun. We assign membership probabilities to the stars through the open source pyUPMASK algorithm, and also estimate the physical parameters through isochrone fitting for each candidate. Most of the new candidates show small total proper motion dispersions and clear features in the color-magnitude diagrams. Besides, the metallicity gradient of the new candidates is consistent with those found in the literature. The cluster parameters and member stars are available at CDS via anonymous ftp to cdsarc.u-strasbg.fr(130.79.128.5) or via https://cdsarc.unistra.fr/viz-bin/cat/J/ApJS. The discovery of these new objects shows that the open cluster samples in Gaia data is still not complete, and more discoveries are expected in the future researches.

preprint2022arXiv

Pascal algebra of matrices and Pascal map on jet bundles

We identify and study a matrix algebra consisting of Pascal-type matrices. The generator of the matrix algebra is shown to well define a canonical bundle map, called the Pascal map on jet bundles, and we use it to give an intrinsic definition of point-wise contact between Hermitian vector bundles in terms of unitary equivalence of the Pascal maps.

preprint2022arXiv

PersFormer: 3D Lane Detection via Perspective Transformer and the OpenLane Benchmark

Methods for 3D lane detection have been recently proposed to address the issue of inaccurate lane layouts in many autonomous driving scenarios (uphill/downhill, bump, etc.). Previous work struggled in complex cases due to their simple designs of the spatial transformation between front view and bird's eye view (BEV) and the lack of a realistic dataset. Towards these issues, we present PersFormer: an end-to-end monocular 3D lane detector with a novel Transformer-based spatial feature transformation module. Our model generates BEV features by attending to related front-view local regions with camera parameters as a reference. PersFormer adopts a unified 2D/3D anchor design and an auxiliary task to detect 2D/3D lanes simultaneously, enhancing the feature consistency and sharing the benefits of multi-task learning. Moreover, we release one of the first large-scale real-world 3D lane datasets: OpenLane, with high-quality annotation and scenario diversity. OpenLane contains 200,000 frames, over 880,000 instance-level lanes, 14 lane categories, along with scene tags and the closed-in-path object annotations to encourage the development of lane detection and more industrial-related autonomous driving methods. We show that PersFormer significantly outperforms competitive baselines in the 3D lane detection task on our new OpenLane dataset as well as Apollo 3D Lane Synthetic dataset, and is also on par with state-of-the-art algorithms in the 2D task on OpenLane. The project page is available at https://github.com/OpenPerceptionX/PersFormer_3DLane and OpenLane dataset is provided at https://github.com/OpenPerceptionX/OpenLane.

preprint2022arXiv

Quasi-periodic oscillations of the X-ray burst from the magnetar SGR J1935+2154 and associated with the fast radio burst FRB 200428

The origin(s) and mechanism(s) of fast radio bursts (FRBs), which are short radio pulses from cosmological distances, have remained a major puzzle since their discovery. We report a strong Quasi-Periodic Oscillation(QPO) of 40 Hz in the X-ray burst from the magnetar SGR J1935+2154 and associated with FRB 200428, significantly detected with the Hard X-ray Modulation Telescope (Insight-HXMT) and also hinted by the Konus-Wind data. QPOs from magnetar bursts have only been rarely detected; our 3.4 sigma (p-value is 2.9e-4) detection of the QPO reported here reveals the strongest QPO signal observed from magnetars (except in some very rare giant flares), making this X-ray burst unique among magnetar bursts. The two X-ray spikes coinciding with the two FRB pulses are also among the peaks of the QPO. Our results suggest that at least some FRBs are related to strong oscillation processes of neutron stars. We also show that we may overestimate the significance of the QPO signal and underestimate the errors of QPO parameters if QPO exists only in a fraction of the time series of a X-ray burst which we use to calculate the Leahy-normalized periodogram.

preprint2022arXiv

Robust Landmark-based Stent Tracking in X-ray Fluoroscopy

In clinical procedures of angioplasty (i.e., open clogged coronary arteries), devices such as balloons and stents need to be placed and expanded in arteries under the guidance of X-ray fluoroscopy. Due to the limitation of X-ray dose, the resulting images are often noisy. To check the correct placement of these devices, typically multiple motion-compensated frames are averaged to enhance the view. Therefore, device tracking is a necessary procedure for this purpose. Even though angioplasty devices are designed to have radiopaque markers for the ease of tracking, current methods struggle to deliver satisfactory results due to the small marker size and complex scenes in angioplasty. In this paper, we propose an end-to-end deep learning framework for single stent tracking, which consists of three hierarchical modules: U-Net based landmark detection, ResNet based stent proposal and feature extraction, and graph convolutional neural network (GCN) based stent tracking that temporally aggregates both spatial information and appearance features. The experiments show that our method performs significantly better in detection compared with the state-of-the-art point-based tracking models. In addition, its fast inference speed satisfies clinical requirements.

preprint2022arXiv

ST-P3: End-to-end Vision-based Autonomous Driving via Spatial-Temporal Feature Learning

Many existing autonomous driving paradigms involve a multi-stage discrete pipeline of tasks. To better predict the control signals and enhance user safety, an end-to-end approach that benefits from joint spatial-temporal feature learning is desirable. While there are some pioneering works on LiDAR-based input or implicit design, in this paper we formulate the problem in an interpretable vision-based setting. In particular, we propose a spatial-temporal feature learning scheme towards a set of more representative features for perception, prediction and planning tasks simultaneously, which is called ST-P3. Specifically, an egocentric-aligned accumulation technique is proposed to preserve geometry information in 3D space before the bird's eye view transformation for perception; a dual pathway modeling is devised to take past motion variations into account for future prediction; a temporal-based refinement unit is introduced to compensate for recognizing vision-based elements for planning. To the best of our knowledge, we are the first to systematically investigate each part of an interpretable end-to-end vision-based autonomous driving system. We benchmark our approach against previous state-of-the-arts on both open-loop nuScenes dataset as well as closed-loop CARLA simulation. The results show the effectiveness of our method. Source code, model and protocol details are made publicly available at https://github.com/OpenPerceptionX/ST-P3.

preprint2022arXiv

Tail Quantile Estimation for Non-preemptive Priority Queues

Motivated by applications in computing and telecommunication systems, we investigate the problem of estimating p-quantile of steady-state sojourn times in a single-server multi-class queueing system with non-preemptive priorities for p close to 1. The main challenge in this problem lies in efficient sampling from the tail event. To address this issue, we develop a regenerative simulation algorithm with importance sampling. In addition, we establish a central limit theorem for the estimator to construct the confidence interval. Numerical experiments show that our algorithm outperforms benchmark simulation methods. Our result contributes to the literature on rare event simulation for queueing systems.

preprint2022arXiv

Time-constrained Dynamic Mechanisms for College Admissions

Recent literature shows that dynamic matching mechanisms may outperform the standard mechanisms to deliver desirable results. We highlight an under-explored design dimension, the time constraints that students face under such a dynamic mechanism. First, we theoretically explore the effect of time constraints and show that the outcome can be worse than the outcome produced by the student-proposing deferred acceptance mechanism. Second, we present evidence from the Inner Mongolian university admissions that time constraints can prevent dynamic mechanisms from achieving stable outcomes, creating losers and winners among students.

preprint2021arXiv

BU-Trace: A Permissionless Mobile System for Privacy-Preserving Intelligent Contact Tracing

The coronavirus disease 2019 (COVID-19) pandemic has caused an unprecedented health crisis for the global. Digital contact tracing, as a transmission intervention measure, has shown its effectiveness on pandemic control. Despite intensive research on digital contact tracing, existing solutions can hardly meet users' requirements on privacy and convenience. In this paper, we propose BU-Trace, a novel permissionless mobile system for privacy-preserving intelligent contact tracing based on QR code and NFC technologies. First, a user study is conducted to investigate and quantify the user acceptance of a mobile contact tracing system. Second, a decentralized system is proposed to enable contact tracing while protecting user privacy. Third, an intelligent behavior detection algorithm is designed to ease the use of our system. We implement BU-Trace and conduct extensive experiments in several real-world scenarios. The experimental results show that BU-Trace achieves a privacy-preserving and intelligent mobile system for contact tracing without requesting location or other privacy-related permissions.

preprint2021arXiv

Dynamical reciprocity in interacting games: numerical results and mechanism analysis

We study the evolution of two mutually interacting games with both pairwise games as well as the public goods game on different topologies. On 2d square lattices, we reveal that the game-game interaction can promote the cooperation prevalence in all cases, and the cooperation-defection phase transitions even become absent and fairly high cooperation is expected when the interaction goes to be very strong. A mean-field theory is developed that points out new dynamical routes arising therein. Detailed analysis shows indeed that there are rich categories of interactions in either individual or bulk scenario: invasion, neutral, and catalyzed types; their combination puts cooperators at a persistent advantage position, which boosts the cooperation. The robustness of the revealed reciprocity is strengthened by the studies of model variants, including asymmetrical or time-varying interactions, games of different types, games with time-scale separation, different updating rules etc. The structural complexities of the underlying population, such as Newman--Watts small world networks, Erdős--Rényi random networks, and Barabási--Albert networks, also do not alter the working of the dynamical reciprocity. In particular, as the number of games engaged increases, the cooperation level continuously improves in general. Our work thus uncovers a new class of cooperation mechanism and indicates the great potential for human cooperation where concurrent issues are so often seen in the real world.

preprint2021arXiv

Neumann problem for a class of fully nonlinear equations

In this paper, we establish a priori estimates for a class of fully nonlinear equations with Neumann boundary conditions. By the continuity method, we have obtained the existence theorem for the Neumann problem.

preprint2021arXiv

Social hierarchy promotes the cooperation prevalence

Social hierarchy is important that can not be ignored in human socioeconomic activities and in the animal world. Here we incorporate this factor into the evolutionary game to see what impact it could have on the cooperation outcome. The probabilistic strategy adoption between two players is then not only determined by their payoffs, but also by their hierarchy difference -- players in the high rank are more likely to reproduce their strategies than the peers in the low rank. Through simulating the evolution of Prisoners' dilemma game with three hierarchical distributions, we find that the levels of cooperation are enhanced in all cases, and the enhancement is optimal in the uniform case. The enhancement is due to the fact that the presence of hierarchy facilitates the formation of cooperation clusters with high-rank players acting as the nucleation cores. This mechanism remains valid on Barabási-Albert scale-free networks, in particular the cooperation enhancement is maximal when the hubs are of higher social ranks. We also study a two-hierarchy model, where similar cooperation promotion is revealed and some theoretical analyses are provided. Our finding may partially explain why the social hierarchy is so ubiquitous on this planet.

preprint2021arXiv

Specht's invariant and localization of operator tuples

We introduce a set of operator-valued invariants for localization of operator tuples in the Cowen-Douglas class, with which a Specht-type criterion for unitary equivalence is obtained.

preprint2021arXiv

Speech enhancement with weakly labelled data from AudioSet

Speech enhancement is a task to improve the intelligibility and perceptual quality of degraded speech signal. Recently, neural networks based methods have been applied to speech enhancement. However, many neural network based methods require noisy and clean speech pairs for training. We propose a speech enhancement framework that can be trained with large-scale weakly labelled AudioSet dataset. Weakly labelled data only contain audio tags of audio clips, but not the onset or offset times of speech. We first apply pretrained audio neural networks (PANNs) to detect anchor segments that contain speech or sound events in audio clips. Then, we randomly mix two detected anchor segments containing speech and sound events as a mixture, and build a conditional source separation network using PANNs predictions as soft conditions for speech enhancement. In inference, we input a noisy speech signal with the one-hot encoding of "Speech" as a condition to the trained system to predict enhanced speech. Our system achieves a PESQ of 2.28 and an SSNR of 8.75 dB on the VoiceBank-DEMAND dataset, outperforming the previous SEGAN system of 2.16 and 7.73 dB respectively.

Li Chen

Quick read

Decide how to stay connected

How to connect with this researcher

Open a focused conversation when the fit is right

See the researcher in context

Building this graph slice

98 published item(s)

Doping induced itinerant ferromagnetism and enhanced ferroelectricity in BL-InSe

Engineering Ideal 2D Type-II Nodal Line Semimetals via Stacking and Intercalation of van der Waals Layers

InsightTok: Improving Text and Face Fidelity in Discrete Tokenization for Autoregressive Image Generation

Interpretable Machine Learning for Quantum-Informed Property Predictions in Artificial Sensing Materials

Normalized Solutions for Schrödinger-Bopp-Podolsky Systems with Critical Choquard-Type Nonlinearity on Bounded Domains

RecGPT-Mobile: On-Device Large Language Models for User Intent Understanding in Taobao Feed Recommendation

Thompson Sampling for Repeated Newsvendor

Jailbreak-Zero: A Path to Pareto Optimal Red Teaming for Large Language Models

Integrating Secondary Structures Information into Triangular Spatial Relationships (TSR) for Advanced Protein Classification

Joint Channel Estimation and Data Recovery for Millimeter Massive MIMO: Using Pilot to Capture Principal Components

LaneSegNet: Map Learning with Lane Segment Perception for Autonomous Driving

Parabolic Anderson model in bounded domains of recurrent metric measure spaces

Personalized Prompt Learning for Explainable Recommendation

Reversible Attack based on Local Visual Adversarial Perturbation

Rigorous Derivation of the Degenerate Parabolic-Elliptic Keller-Segel System from a Moderately Interacting Stochastic Particle System. Part I Partial Differential Equation

Visual Point Cloud Forecasting enables Scalable Autonomous Driving

A Data-driven Adversarial Examples Recognition Framework via Adversarial Feature Genome

A Survey of Surface Defect Detection of Industrial Products Based on A Small Number of Labeled Data

An Efficient Cervical Whole Slide Image Analysis Framework Based on Multi-scale Semantic and Location Deep Features

Besov class via heat semigroup on Dirichlet spaces III: BV functions and sub-Gaussian heat kernel estimates

C^0 estimates for Hessian quotient equations on HKT manifolds

Combined mean-field and semiclassical limits of large fermionic systems

Conversational Recommendation: A Grand AI Challenge

Decentralized Federated Learning: Balancing Communication and Computing Costs

Deep Learning with Label Noise: A Hierarchical Approach

Design of Coded Caching Schemes with Linear Subpacketizations Based on Injective Arc Coloring of Regular Digraphs

Design of Placement Delivery Arrays for Coded Caching with Small Subpacketizations and Flexible Memory Sizes

Discovery of extended structure around open cluster COIN-Gaia 13 based on Gaia EDR3

Enhanced Deep Animation Video Interpolation

ERNIE-SPARSE: Learning Hierarchical Efficient Transformer Through Regularized Self-Attention

Finding Optimal Tangent Points for Reducing Distortions of Hard-label Attacks

Global weak solutions to the Vlasov-Poisson-Fokker-Planck-Navier-Stokes system

Impacts of Personal Characteristics on User Trust in Conversational Recommender Systems

Learning quantum dissipation by the neural ordinary differential equation

Level 2 Autonomous Driving on a Single Device: Diving into the Devils of Openpilot

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time

Minimum Coverage Instrumentation

New insights into the structure of open clusters in the Gaia era

New Open Cluster candidates Found in Galactic Disk Using Gaia DR2/EDR3 Data

Pascal algebra of matrices and Pascal map on jet bundles

PersFormer: 3D Lane Detection via Perspective Transformer and the OpenLane Benchmark

Quasi-periodic oscillations of the X-ray burst from the magnetar SGR J1935+2154 and associated with the fast radio burst FRB 200428

Robust Landmark-based Stent Tracking in X-ray Fluoroscopy

ST-P3: End-to-end Vision-based Autonomous Driving via Spatial-Temporal Feature Learning

Tail Quantile Estimation for Non-preemptive Priority Queues

Time-constrained Dynamic Mechanisms for College Admissions

BU-Trace: A Permissionless Mobile System for Privacy-Preserving Intelligent Contact Tracing

Dynamical reciprocity in interacting games: numerical results and mechanism analysis

Neumann problem for a class of fully nonlinear equations

Social hierarchy promotes the cooperation prevalence

Specht&#39;s invariant and localization of operator tuples

Speech enhancement with weakly labelled data from AudioSet

A Concise Proof of Discrete Jordan Curve Theorem

A curvature flow approach to Lp-Christoffel-Minkowski problem for p>1

A Discrete Proof of The General Jordan-Schoenflies Theorem

A note on second order Riesz transforms in 3-dimensional Lie groups

A Systematic Analysis of the Phase Lags Associated with the Type-C Quasi-periodic Oscillation in GRS 1915+105

Adversarial Example in Remote Sensing Image Recognition

Algorithms for Deforming and Contracting Simply Connected Discrete Closed Manifolds (III)

An Integrated Quadratic Reconstruction for Finite Volume Schemes to Scalar Conservation Laws in Multiple Dimensions

Automated Intracranial Artery Labeling using a Graph Neural Network and Hierarchical Refinement

Besov class via heat semigroup on Dirichlet spaces I: Sobolev type inequalities

Besov class via heat semigroup on Dirichlet spaces II: BV functions and Gaussian heat kernel estimates

Blurry Video Frame Interpolation

Composite Signalling for DFRC: Dedicated Probing Signal or Not?

Construction of a series of new $ν=2/5$ fractional quantum Hall wave functions by conformal field theory

Content Adaptive and Error Propagation Aware Deep Video Compression

Convolution Neural Network Architecture Learning for Remote Sensing Scene Classification

Discovery of oscillations above 200 keV in a black hole X-ray binary with Insight-HXMT

Existence of smooth even solutions to the dual Orlicz-Minkowski problem

Exploring open cluster properties with Gaia and LAMOST

Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers

Specht's invariant and localization of operator tuples