Searcharxiv⌕ Search

arXiv subjects

Jian Song

Publications and source records attributed to Jian Song.

At least 145 records · Page 8Linked to original sources

Optimization on Multi-User Physical Layer Security of Intelligent Reflecting Surface-Aided VLC

This letter investigates physical layer security in intelligent reflecting surface (IRS)-aided visible light communication (VLC). Under the point source assumption, we first elaborate the system model in the scenario with multiple legitimate users and one eavesdropper, where the secrecy rate maximization problem is transformed into an assignment problem by objective function approximation. Then, an iterative Kuhn-Munkres algorithm is proposed to optimize the transformed problem, and its computational complexity is in the second-order form of the numbers of IRS units and transmitters. Moreover, numerical simulations are carried out to verify the approximation performance and the VLC secrecy rate improvement by IRS.

cs.IT↗

Solving the hyperbolic Anderson model 1: Skorohod setting

This paper is concerned with a wave equation in dimension $d\in \{1,2, 3\}$, with a multiplicative space-time Gaussian noise which is fractional in time and homogeneous in space. We provide necessary and sufficient conditions on the space-time covariance of the Gaussian noise, allowing the existence and uniqueness of a mild Skorohod solution.

math.PR↗

Simple Contrastive Representation Adversarial Learning for NLP Tasks

Self-supervised learning approach like contrastive learning is attached great attention in natural language processing. It uses pairs of training data augmentations to build a classification task for an encoder with well representation ability. However, the construction of learning pairs over contrastive learning is much harder in NLP tasks. Previous works generate word-level changes to form pairs, but small transforms may cause notable changes on the meaning of sentences as the discrete and sparse nature of natural language. In this paper, adversarial training is performed to generate challenging and harder learning adversarial examples over the embedding space of NLP as learning pairs. Using contrastive learning improves the generalization ability of adversarial training because contrastive loss can uniform the sample distribution. And at the same time, adversarial training also enhances the robustness of contrastive learning. Two novel frameworks, supervised contrastive adversarial learning (SCAL) and unsupervised SCAL (USCAL), are proposed, which yields learning pairs by utilizing the adversarial training for contrastive learning. The label-based loss of supervised tasks is exploited to generate adversarial examples while unsupervised tasks bring contrastive loss. To validate the effectiveness of the proposed framework, we employ it to Transformer-based models for natural language understanding, sentence semantic textual similarity and adversarial learning tasks. Experimental results on GLUE benchmark tasks show that our fine-tuned supervised method outperforms BERT$_{base}$ over 1.75\%. We also evaluate our unsupervised method on semantic textual similarity (STS) tasks, and our method gets 77.29\% with BERT$_{base}$. The robustness of our approach conducts state-of-the-art results under multiple adversarial datasets on NLI tasks.

cs.CL↗

Recent advances on eigenvalues of matrix-valued stochastic processes

Since the introduction of Dyson's Brownian motion in early 1960's, there have been a lot of developments in the investigation of stochastic processes on the space of Hermitian matrices. Their properties, especially, the properties of their eigenvalues have been studied in great details. In particular, the limiting behaviors of the eigenvalues are found when the dimension of the matrix space tends to infinity, which connects with random matrix theory. This survey reviews a selection of results on the eigenvalues of stochastic processes from the literature of the past three decades. For most recent variations of such processes, such as matrix-valued processes driven by fractional Brownian motion or Brownian sheet, the eigenvalues of them are also discussed in this survey. In the end, some open problems in the area are also proposed.

math.PR↗

Stochastic maximum principle for systems driven by local martingales with spatial parameters

We consider the stochastic optimal control problem for the dynamical system of the stochastic differential equation driven by a local martingale with a spatial parameter. Assuming the convexity of the control domain, we obtain the stochastic maximum principle as the necessary condition for an optimal control, and we also prove its sufficiency under proper conditions. The stochastic linear quadratic problem in this setting is also discussed.

math.PR↗

Triple-Structured Compressive Sensing-based Channel Estimation for RIS-aided MU-MIMO Systems

Reconfigurable intelligent surface (RIS) has been recognized as a potential technology for 5G beyond and attracted tremendous research attention. However, channel estimation in RIS-aided system is still a critical challenge due to the excessive amount of parameters in cascaded channel. The existing compressive sensing (CS)-based RIS estimation schemes only adopt incomplete sparsity, which induces redundant pilot consumption. In this paper, we exploit the specific triple-structured sparsity of the cascaded channel, i.e., the common column sparsity, structured row sparsity after offset compensation and the common offsets among all users. Then a novel multi-user joint estimation algorithm is proposed. Simulation results show that our approach can significantly reduce pilot overhead in both ULA and UPA scenarios.

cs.IT↗

Joint Link Rate Selection and Channel State Change Detection in Block-Fading Channels

In this work, we consider the problem of transmission rate selection for a discrete time point-to-point block fading wireless communication link. The wireless channel remains constant within the channel coherence time but can change rapidly across blocks. The goal is to design a link rate selection strategy that can identify the best transmission rate quickly and adaptively in quasi-static channels. This problem can be cast into the stochastic bandit framework, and the unawareness of time-stamps where channel changes necessitates running change-point detection simultaneously with stochastic bandit algorithms to improve adaptivity. We present a joint channel change-point detection and link rate selection algorithm based on Thompson Sampling (CD-TS) and show it can achieve a sublinear regret with respect to the number of time steps $T$ when the channel coherence time is larger than a threshold. We then improve the CD-TS algorithm by considering the fact that higher transmission rate has higher packet-loss probability. Finally, we validate the performance of the proposed algorithms through numerical simulations.

cs.NI↗

An Internal Arc Fixation Channel and Automatic Planning Algorithm for Pelvic Fracture

Fixating fractured pelvis fragments with the sacroiliac screw is a common treatment for unstable pelvis fracture. Due to the complex shape of the pelvis, sometimes a suitable straight screw fixation channel cannot be found using traditional methods, which increases the difficulty of pelvic fracture fixation. Therefore, there is an urgent need to find a new screw fixation method to improve the feasibility of pelvic fracture fixation. In this study, a new method of arc nail fixation is proposed to treat the pelvic fracture. An algorithm is proposed to verify the feasibility of the internal arc fixation channel (IAFC) in the pelvis, and the algorithm can calculate a relatively optimal IAFC in the pelvis. Furthermore, we compared the advantages and disadvantages of arc channel and straight channel through experiments. This study verified the feasibility of the IAFC, and the comparison of experimental results shows that the adaptability and safety of the arc channel fixation is better than the traditional straight sacroiliac screw.

cs.RO↗

Multi-resolution CSI Feedback with deep learning in Massive MIMO System

In massive multiple-input multiple-output (MIMO) system, user equipment (UE) needs to send downlink channel state information (CSI) back to base station (BS). However, the feedback becomes expensive with the growing complexity of CSI in massive MIMO system. Recently, deep learning (DL) approaches are used to improve the reconstruction efficiency of CSI feedback. In this paper, a novel feedback network named CRNet is proposed to achieve better performance via extracting CSI features on multiple resolutions. An advanced training scheme that further boosts the network performance is also introduced. Simulation results show that the proposed CRNet outperforms the state-of-the-art CsiNet under the same computational complexity without any extra information. The open source codes are available at https://github.com/Kylin9511/CRNet

cs.IT↗

Aggregated Network for Massive MIMO CSI Feedback

In frequency division duplexing (FDD) mode, it is necessary to send the channel state information (CSI) from user equipment to base station. The downlink CSI is essential for the massive multiple-input multiple-output (MIMO) system to acquire the potential gain. Recently, deep learning is widely adopted to massive MIMO CSI feedback task and proved to be effective compared with traditional compressed sensing methods. In this paper, a novel network named ACRNet is designed to boost the feedback performance with network aggregation and parametric RuLU activation. Moreover, valid approach to expand the network architecture in exchange of better performance is first discussed in CSI feedback task. Experiments show that ACRNet outperforms loads of previous state-of-the-art feedback networks without any extra information.

cs.IT↗

Binarized Aggregated Network with Quantization: Flexible Deep Learning Deployment for CSI Feedback in Massive MIMO System

Massive multiple-input multiple-output (MIMO) is one of the key techniques to achieve better spectrum and energy efficiency in 5G system. The channel state information (CSI) needs to be fed back from the user equipment to the base station in frequency division duplexing (FDD) mode. However, the overhead of the direct feedback is unacceptable due to the large antenna array in massive MIMO system. Recently, deep learning is widely adopted to the compressed CSI feedback task and proved to be effective. In this paper, a novel network named aggregated channel reconstruction network (ACRNet) is designed to boost the feedback performance with network aggregation and parametric rectified linear unit (PReLU) activation. The practical deployment of the feedback network in the communication system is also considered. Specifically, the elastic feedback scheme is proposed to flexibly adapt the network to meet different resource limitations. Besides, the network binarization technique is combined with the feature quantization for lightweight and practical deployment. Experiments show that the proposed ACRNet outperforms loads of previous state-of-the-art networks, providing a neat feedback solution with high performance, low cost and impressive flexibility.

cs.IT↗

Scaling limit of a directed polymer among a Poisson field of independent walks

We consider a directed polymer model in dimension $1+1$, where the disorder is given by the occupation field of a Poisson system of independent random walks on $\mathbb Z$. In a suitable continuum and weak disorder limit, we show that the family of quenched partition functions of the directed polymer converges to the Stratonovich solution of a multiplicative stochastic heat equation (SHE) with a Gaussian noise, whose space-time covariance is given by the heat kernel. In contrast to the case with space-time white noise where the solution of the SHE admits a Wiener-Itô chaos expansion, we establish an $L^1$-convergent chaos expansions of iterated integrals generated by Picard iterations. Using this expansion and its discrete counterpart for the polymer partition functions, the convergence of the terms in the expansion is proved via functional analytic arguments and heat kernel estimates. The Poisson random walk system is amenable to careful moment analysis, which is an important input to our arguments.

math.PR↗

On eigenvalues of the Brownian sheet matrix

We derive a system of stochastic partial differential equations satisfied by the eigenvalues of the symmetric matrix whose entries are the Brownian sheets. We prove that the sequence $\left\{L_{d}(s,t), (s,t)\in[0,S]\times [0,T]\right\}_{d\in\mathbb N}$ of empirical spectral measures of the rescaled matrices is tight on $C([0,S]\times [0,T], \mathcal P(\mathbb R))$ and hence is convergent as $d$ goes to infinity by Wigner's semicircle law. We also obtain PDEs which are satisfied by the high-dimensional limiting measure.

math.PR↗

Skorohod and Stratonovich integrals for controlled processes

Given a continuous Gaussian process $x$ which gives rise to a $p$-geometric rough path for $p\in (2,3)$, and a general continuous process $y$ controlled by $x$, under proper conditions we establish the relationship between the Skorohod integral $\int_0^t y_s {\mathrm{d}}^\diamond x_s$ and the Stratonovich integral $\int_0^t y_s {\mathrm{d}} {\mathbf x}_s$. Our strategy is to employ the tools from rough paths theory and Malliavin calculus to analyze discrete sums of the integrals.

math.PR↗

Diameter and Ricci curvature estimates for long-time solutions of the Kahler-Ricci flow

It is well known that the Kähler-Ricci flow on a Kähler manifold $X$ admits a long-time solution if and only if $X$ is a minimal model, i.e., the canonical line bundle $K_X$ is nef. The abundance conjecture in algebraic geometry predicts that $K_X$ must be semi-ample when $X$ is a projective minimal model. We prove that if $K_X$ is semi-ample, then the diameter is uniformly bounded for long-time solutions of the normalized Kähler-Ricci flow. Our diameter estimate combined with the scalar curvature estimate in [34] for long-time solutions of the Kähler-Ricci flow are natural extensions of Perelman's diameter and scalar curvature estimates for short-time solutions on Fano manifolds. We further prove that along the normalized Kähler-Ricci flow, the Ricci curvature is uniformly bounded away from singular fibres of $X$ over its unique algebraic canonical model $X_{can}$ if the Kodaira dimension of $X$ is one. As an application, the normalized Kähler-Ricci flow on a minimal threefold $X$ always converges sequentially in Gromov-Hausdorff topology to a compact metric space homeomorphic to its canonical model $X_{can}$, with uniformly bounded Ricci curvature away from the critical set of the pluricanonical map from $X$ to $X_{can}$.

math.DG↗

Nakai-Moishezon criterions for complex Hessian equations

The $J$-equation proposed by Donaldson is a complex Hessian quotient equation on Kähler manifolds. The solvability of the $J$-equation is proved by Song-Weinkove to be equivalent to the existence of a subsolution. It is also conjectured by Lejmi-Szekelyhidi to be equivalent to a stability condition in terms of holomorphic intersection numbers as an analogue of the Nakai-Moishezon criterion in algebraic geometry. The conjecture is recently proved by Chen under a stronger uniform stability condition. In this paper, we establish a Nakai-Moishezon type criterion for pairs of Kähler classes on analytic Kähler varieties. As a consequence, we prove Lejmi-Szekelyhidi's original conjecture for the $J$-equation. We also apply such a criterion to obtain a family of constant scalar curvature Kähler metrics on smooth minimal models.

math.DG↗

Binary Neural Network Aided CSI Feedback in Massive MIMO System

In massive multiple-input multiple-output (MIMO) system, channel state information (CSI) is essential for the base station to achieve high performance gain. Recently, deep learning is widely used in CSI compression to fight against the growing feedback overhead brought by massive MIMO in frequency division duplexing system. However, applying neural network brings extra memory and computation cost, which is non-negligible especially for the resource limited user equipment (UE). In this paper, a novel binarization aided feedback network named BCsiNet is introduced. Moreover, BCsiNet variants are designed to boost the performance under customized training and inference schemes. Experiments shows that BCsiNet offers over 30$\times$ memory saving and around 2$\times$ inference acceleration for encoder at UE compared with CsiNet. Furthermore, the feedback performance of BCsiNet is comparable with original CsiNet. The key results can be reproduced with https://github.com/Kylin9511/BCsiNet.

cs.IT↗

Metric rigidity of Kahler manifolds with lower Ricci bounds and almost maximal volume

In this short note we prove that a Kahler manifold with lower Ricci curvature bound and almost maximal volume is Gromov-Hausdorff close to the projective space with the Fubini-Study metric. This is done by combining the recent results of Kewei Zhang and Yuchen Liu on holomorphic rigidity of such Kahler manifolds with the structure theorem of Tian-Wang for almost Einstein manifolds. This can be regarded as the complex analog of the result on Colding on the shape of Riemannian manifolds with almost maximal volume

math.DG↗