We study the well-posedness of a unified system of coupled forward-backward stochastic differential equations (FB-SDEs) with Levy jumps and double completely-S skew reflections. Owing to the reflections, the solution to an embedded Skorohod problem may be not unique, i.e., bifurcations may occur at reflection boundaries, the well-known contraction mapping approach can not be extended directly to solve our problem. Thus, we develop a weak convergence method to prove the well-posedness of an adapted 6-tuple weak solution in the sense of distribution to the unified system. The proof heavily depends on newly established Malliavin calculus for vector-valued Levy processes together with a generalized linear growth and Lipschitz condition that guarantees the well-posedness of the unified system even under a random environment. Nevertheless, if a more strict boundary condition is imposed, i.e., the spectral radii in certain sense for the reflections are strictly less than the unity, a unique adapted 6-tuple strong solution in the sense of sample pathwise is concerned. In addition, as applications and economical studies of our unified system, we also develop new techniques including deriving a generalized mutual information formula for signal processing over possible non-Gaussian channels with multi-input multi-output (MIMO) antennas and dynamics driven by Levy processes.

We present LBW-Net, an efficient optimization based method for quantization and training of the low bit-width convolutional neural networks (CNNs). Specifically, we quantize the weights to zero or powers of two by minimizing the Euclidean distance between full-precision weights and quantized weights during backpropagation. We characterize the combinatorial nature of the low bit-width quantization problem. For 2-bit (ternary) CNNs, the quantization of N weights can be done by an exact formula in O(N log N ) complexity. When the bit-width is three and above, we further propose a semi-analytical thresholding scheme with a single free parameter for quantization that is computationally inexpensive. The free parameter is further determined by network retraining and object detection tests. LBW-Net has several desirable advantages over full-precision CNNs, including considerable memory savings, energy efficiency, and faster deployment. Our experiments on PASCAL VOC dataset show that compared with its 32-bit floating-point counterpart, the performance of the 6-bit LBW-Net is nearly lossless in the object detection tasks, and can even do better in some real world visual scenes, while empirically enjoying more than 4× faster deployment.

In this paper, we show that every $(2^{n-1}+1)$-vertex induced subgraph of the $n$-dimensional cube graph has maximum degree at least $\sqrt{n}$. This result is best possible, and improves a logarithmic lower bound shown by Chung, F\"uredi, Graham and Seymour in 1988. As a direct consequence, we prove that the sensitivity and degree of a boolean function are polynomially related, solving an outstanding foundational problem in theoretical computer science, the Sensitivity Conjecture of Nisan and Szegedy.