Searcharxiv⌕ Search

arXiv subjects

Lin Chen

Publications and source records attributed to Lin Chen.

At least 217 records · Page 12Linked to original sources
arXiv2024

Open-Sora Plan: Open-Source Large Video Generation Model

We introduce Open-Sora Plan, an open-source project that aims to contribute a large generation model for generating desired high-resolution videos with long durations based on various user inputs. Our project comprises multiple components for the entire video generation process, including a Wavelet-Flow Variational Autoencoder, a Joint Image-Video Skiparse Denoiser, and various condition controllers. Moreover, many assistant strategies for efficient training and inference are designed, and a multi-dimensional data curation pipeline is proposed for obtaining desired high-quality data. Benefiting from efficient thoughts, our Open-Sora Plan achieves impressive video generation results in both qualitative and quantitative evaluations. We hope our careful design and practical experience can inspire the video generation research community. All our codes and model weights are publicly available at \url{https://github.com/PKU-YuanGroup/Open-Sora-Plan}.

cs.CV↗
arXiv2024

Entanglement detection length of multipartite quantum states

Multipartite entanglement is a valuable resource for quantum technologies. However, detecting this resource can be challenging: for genuine multipartite entanglement, the detection may require global measurements that are hard to implement experimentally. Here we introduce the concept of entanglement detection length, defined as the minimum number of particles that have to be jointly measured in order to detect genuine multipartite entanglement. For symmetric states, we show that the entanglement detection length can be determined by testing separability of the marginal states. For general states, we provide an upper bound on the entanglement detection length based on semidefinite programming. We show that the entanglement detection length is generally smaller than the minimum observable length needed to uniquely determine a multipartite state, and we provide examples achieving the maximum gap between these two quantities.

quant-ph↗
arXiv2024

Edge AI Empowered Physical Layer Security for 6G NTN: Potential Threats and Future Opportunities

Due to the enormous potential for economic profit offered by artificial intelligence (AI) servers, the field of cybersecurity has the potential to emerge as a prominent arena for competition among corporations and governments on a global scale. One of the prospective applications that stands to gain from the utilization of AI technology is the advancement in the field of cybersecurity. To this end, this paper provides an overview of the possible risks that the physical layer may encounter in the context of 6G Non-Terrestrial Networks (NTN). With the objective of showcasing the effectiveness of cutting-edge AI technologies in bolstering physical layer security, this study reviews the most foreseeable design strategies associated with the integration of edge AI in the realm of 6G NTN. The findings of this paper provide some insights and serve as a foundation for future investigations aimed at enhancing the physical layer security of edge servers/devices in the next generation of trustworthy 6G telecommunication networks.

cs.NI↗
arXiv2024

Multipartite entangling power by von Neumann entropy

Quantifying the entanglement generation of a multipartite unitary operation is a key problem in quantum information processing. We introduce the definition of multipartite entangling, assisted entangling, and disentangling power, which is a natural generalization of the bipartite ones. We show that they are assumed at a specified quantum state. We analytically derive the entangling power of Schmidt-rank-two multi-qubit unitary operations by the minimal convex sum of modulo-one complex numbers. Besides we show the necessary and sufficient condition that the assisted entangling power of Schmidt-rank-two unitary operations reaches the maximum. We further investigate the widely-used multi-qubit gates, for example, the entangling and assisted entangling power of the $n$-qubit Toffoli gate is one ebit. The entangling power of the three-qubit Fredkin gate is two ebits, and that of the four-qubit Fredkin gate is in two to $\log_25$ ebits.

quant-ph↗
arXiv2024

Mobility-Aware Federated Learning: Multi-Armed Bandit Based Selection in Vehicular Network

In this paper, we study a vehicle selection problem for federated learning (FL) over vehicular networks. Specifically, we design a mobility-aware vehicular federated learning (MAVFL) scheme in which vehicles drive through a road segment to perform FL. Some vehicles may drive out of the segment which leads to unsuccessful training. In the proposed scheme, the real-time successful training participation ratio is utilized to implement vehicle selection. We conduct the convergence analysis to indicate the influence of vehicle mobility on training loss. Furthermore, we propose a multi-armed bandit-based vehicle selection algorithm to minimize the utility function considering training loss and delay. The simulation results show that compared with baselines, the proposed algorithm can achieve better training performance with approximately 28\% faster convergence.

cs.LG↗
arXiv2024

TPU as Cryptographic Accelerator

Cryptographic schemes like Fully Homomorphic Encryption (FHE) and Zero-Knowledge Proofs (ZKPs), while offering powerful privacy-preserving capabilities, are often hindered by their computational complexity. Polynomial multiplication, a core operation in these schemes, is a major performance bottleneck. While algorithmic advancements and specialized hardware like GPUs and FPGAs have shown promise in accelerating these computations, the recent surge in AI accelerators (TPUs/NPUs) presents a new opportunity. This paper explores the potential of leveraging TPUs/NPUs to accelerate polynomial multiplication, thereby enhancing the performance of FHE and ZKP schemes. We present techniques to adapt polynomial multiplication to these AI-centric architectures and provide a preliminary evaluation of their effectiveness. We also discuss current limitations and outline future directions for further performance improvements, paving the way for wider adoption of advanced cryptographic tools.

cs.CR↗
arXiv2024

Robust Wideband Channel Estimation for mmWave Massive MIMO Systems With Beam Squint

This paper investigates the robust wideband channel estimation problem in the millimeter-wave (mmWave) massive multiple-input multiple-output (MIMO) systems. In such a scenario, the beam squint effect that the array response vectors vary with different frequencies and the impulsive noise are in existence, which pose great challenges for accurate channel estimation. Directly applying the existing channel estimation methods usually suffers significant performance degradation, since they are proposed based on the assumptions of frequency-invariant array response vectors and Gaussian distributed noise. To address these issues, this paper proposes a novel wideband channel estimation method with robustness to impulsive noise. Specifically, the proposed method incorporates a cyclic refinement step to overcome the estimation inaccuracy caused by the greedy nature of matching-pursuit-esque algorithms. In particular, the generalized $\ell_p$-norm minimization criterion is adopted in Newton's method to improve the performance robustness against the non-Gaussian impulsive noise. Numerical results are provided to verify the superior performance of the proposed method over the existing representative benchmarks.

eess.SP↗
arXiv2024

On the extreme points of sets of absolulely separable and PPT states

The absolutely separable (resp. PPT) states remain separable (resp. positive partial transpose) under any global unitary operation. We present a compact form of the extreme points in the sets of absolutely separable states and PPT states in two-qubit and qubit-qudit systems. The results imply that each extreme point has at most three distinct eigenvalues. We establish a necessary and sufficient condition for determining extreme points of the set of absolutely PPT states in two-qutrit and qutrit-qudit systems, expressed as solvable linear equations. We also demonstrate that any extreme point in qutrit-qudit system has at most seven distinct eigenvalues. We introduce the concept of robustness of nonabsolute separability. It quantifies the minimal amount by which a state needs to mix with other states such that the overall state is absolutely separable. We show that the robustness satisfies positivity, invariance under unitary transformation, monotonicity and convexity, so it is a good measure within the resource theory of nonabsolute separability. Analytical expressions for this measure are given for pure states in arbitrary system and rank-two mixed states in two-qubit system.

quant-ph↗
arXiv2024

The Impact of Implicit Government Guarantee on Credit Rating of Municipal Investment Bonds

One type of bond with the most implicit government guarantee is municipal investment bonds. In recent years, there have been an increasing number of downgrades in the credit ratings of municipal bonds, which has led some people to question whether the implicit government guarantee may affect the objectivity of the bond ratings? This paper uses text mining methods to mine relevant policy documents related to municipal investment bond issuance, and calculates the implicit guarantee strength of municipal investment bonds based on the PMC index model. It further analyzes the impact of the implicit guarantee strength of municipal bonds on their credit evaluation. The study found that the implicit government guarantee on municipal investment bonds does indeed help to raise the credit ratings assigned by credit rating agencies. The study found that, moreover, the government's implicit guarantee has a more pronounced effect in boosting credit ratings in less developed western regions.

q-fin.GN↗
arXiv2024

Implicit Government Guarantee Measurement Based on PMC Index Model

The implicit government guarantee hampers the recognition and management of risks by all stakeholders in the bond market, and it has led to excessive debt for local governments or state-owned enterprises. To prevent the risk of local government debt defaults and reduce investors' expectations of implicit government guarantees, various regulatory departments have issued a series of policy documents related to municipal investment bonds. By employing text mining techniques on policy documents related to municipal investment bond, and utilizing the PMC index model to assess the effectiveness of policy documents. This paper proposes a novel method for quantifying the intensity of implicit governmental guarantees based on PMC index model. The intensity of implicit governmental guarantees is inversely correlated with the PMC index of policies aimed at de-implicitizing governmental guarantees. Then as these policies become more effective, the intensity of implicit governmental guarantees diminishes correspondingly. These findings indicate that recent policies related to municipal investment bond have indeed succeeded in reducing implicit governmental guarantee intensity, and these policies have achieved the goal of risk management. Furthermore, it was showed that the intensity of implicit governmental guarantee affected by diverse aspects of these policies such as effectiveness, clarity, and specificity, as well as incentive and assurance mechanisms.

q-fin.GN↗
arXiv2024

Efficient Privacy-Preserving KAN Inference Using Homomorphic Encryption

The recently proposed Kolmogorov-Arnold Networks (KANs) offer enhanced interpretability and greater model expressiveness. However, KANs also present challenges related to privacy leakage during inference. Homomorphic encryption (HE) facilitates privacy-preserving inference for deep learning models, enabling resource-limited users to benefit from deep learning services while ensuring data security. Yet, the complex structure of KANs, incorporating nonlinear elements like the SiLU activation function and B-spline functions, renders existing privacy-preserving inference techniques inadequate. To address this issue, we propose an accurate and efficient privacy-preserving inference scheme tailored for KANs. Our approach introduces a task-specific polynomial approximation for the SiLU activation function, dynamically adjusting the approximation range to ensure high accuracy on real-world datasets. Additionally, we develop an efficient method for computing B-spline functions within the HE domain, leveraging techniques such as repeat packing, lazy combination, and comparison functions. We evaluate the effectiveness of our privacy-preserving KAN inference scheme on both symbolic formula evaluation and image classification. The experimental results show that our model achieves accuracy comparable to plaintext KANs across various datasets and outperforms plaintext MLPs. Additionally, on the CIFAR-10 dataset, our inference latency achieves over 7 times speedup compared to the naive method.

cs.LG↗
arXiv2024

QD-VMR: Query Debiasing with Contextual Understanding Enhancement for Video Moment Retrieval

Video Moment Retrieval (VMR) aims to retrieve relevant moments of an untrimmed video corresponding to the query. While cross-modal interaction approaches have shown progress in filtering out query-irrelevant information in videos, they assume the precise alignment between the query semantics and the corresponding video moments, potentially overlooking the misunderstanding of the natural language semantics. To address this challenge, we propose a novel model called \textit{QD-VMR}, a query debiasing model with enhanced contextual understanding. Firstly, we leverage a Global Partial Aligner module via video clip and query features alignment and video-query contrastive learning to enhance the cross-modal understanding capabilities of the model. Subsequently, we employ a Query Debiasing Module to obtain debiased query features efficiently, and a Visual Enhancement module to refine the video features related to the query. Finally, we adopt the DETR structure to predict the possible target video moments. Through extensive evaluations of three benchmark datasets, QD-VMR achieves state-of-the-art performance, proving its potential to improve the accuracy of VMR. Further analytical experiments demonstrate the effectiveness of our proposed module. Our code will be released to facilitate future research.

cs.AI↗
arXiv2024

From Entanglement Purification Scheduling to Fidelity-constrained Multi-Flow Routing

Recently emerged as a disruptive networking paradigm, quantum networks rely on the mysterious quantum entanglement to teleport qubits without physically transferring quantum particles. However, the state of quantum systems is extremely fragile due to environment noise. A promising technique to combat against quantum decoherence is entanglement purification. To fully exploit its benefit, two fundamental research questions need to be answered: (1) given an entanglement path, what is the optimal entanglement purification schedule? (2) how to compute min-cost end-to-end entanglement paths subject to fidelity constraint? In this paper, we give algorithmic solutions to both questions. For the first question, we develop an optimal entanglement purification scheduling algorithm for the single-hop case and analyze the \textsc{purify-and-swap} strategy in the multi-hop case by establishing the closed-form condition for its optimality. For the second question, we design a polynomial-time algorithm constructing an $ε$-optimal fidelity-constrained path. The effectiveness of our algorithms are also numerically demonstrated by extensive simulations.

quant-ph↗
arXiv2024

Eigenvalues and eigenvectors of complex Hadamard matrices

Characterizing the $6\times 6$ complex Hadamard matrices (CHMs) is an open problem in linear algebra and quantum information. In this paper, we investigate the eigenvalues and eigenvectors of CHMs. We show that any $n\times n$ CHM with dephased form has two constant eigenvalues $\pm\sqrt{n}$ and has two constant eigenvectors. We obtain the maximum numbers of identical eigenvalues of $6\times 6$ CHMs with dephased form and we extend this result to arbitrary dimension. We also show that there is no $6\times 6$ CHM with four identical eigenvalues. We conjecture that the eigenvalues and eigenvectors of $6\times 6$ CHMs will lead to the complete classification of $6\times 6$ CHMs.

quant-ph↗
arXiv2024

Exact Tensor Completion Powered by Slim Transforms

In this work, a tensor completion problem is studied, which aims to perfectly recover the tensor from partial observations. The existing theoretical guarantee requires the involved transform to be orthogonal, which hinders its applications. In this paper, jumping out of the constraints of isotropy and self-adjointness, the theoretical guarantee of exact tensor completion with arbitrary linear transforms is established by directly operating the tensors in the transform domain. With the enriched choices of transforms, a new analysis obtained by the proof discloses why slim transforms outperform their square counterparts from a theoretical level. Our model and proof greatly enhance the flexibility of tensor completion and extensive experiments validate the superiority of the proposed method.

cs.LG↗
arXiv2024

FreeDrag: Feature Dragging for Reliable Point-based Image Editing

To serve the intricate and varied demands of image editing, precise and flexible manipulation in image content is indispensable. Recently, Drag-based editing methods have gained impressive performance. However, these methods predominantly center on point dragging, resulting in two noteworthy drawbacks, namely "miss tracking", where difficulties arise in accurately tracking the predetermined handle points, and "ambiguous tracking", where tracked points are potentially positioned in wrong regions that closely resemble the handle points. To address the above issues, we propose FreeDrag, a feature dragging methodology designed to free the burden on point tracking. The FreeDrag incorporates two key designs, i.e., template feature via adaptive updating and line search with backtracking, the former improves the stability against drastic content change by elaborately controls feature updating scale after each dragging, while the latter alleviates the misguidance from similar points by actively restricting the search area in a line. These two technologies together contribute to a more stable semantic dragging with higher efficiency. Comprehensive experimental results substantiate that our approach significantly outperforms pre-existing methodologies, offering reliable point-based editing even in various complex scenarios.

cs.CV↗
arXiv2024

Polarization-Controlled Chiral Transport

Handedness-selective chiral transport is an intriguing phenomenon that not only holds significant importance for fundamental research, but it also carries application prospects in fields such as optical communications and sensing. Currently, on-chip chiral transport devices are static, unable to modulate the output modes based on the input modes. This limits both device functionality reconfiguration and information transmission capacity. Here, we propose to use the incident polarization diversity to control the Hamiltonian evolution path, achieving polarization-dependent chiral transport. By mapping the evolution path of TE and TM polarizations onto elaborately engineered double-coupled waveguides, we experimentally demonstrate that different polarizations yield controllable modal outputs. This work combines Multiple-Input Multiple-Output and polarization diversity concepts with chiral transport, and challenges the prevailing notion that the modal outputs are fixed to specific modes in chiral transport, thereby opening pathways for the development of on-chip reconfigurable and high-capacity handedness-selective devices.

physics.optics↗