new

Get trending papers in your email inbox!

Subscribe

Daily Papers

byAK and the research community

Oct 16

Safety of dynamical SUSY breaking and gaugino condensation in models of spontaneous CP violation

Solving the strong CP problem with spontaneous CP violation (SCPV) in SUSY requires that the constant term of the superpotential and the SUSY-breaking F-term be real to high accuracy. When both are generated dynamically, by gaugino condensation and by dynamical SUSY breaking (DSB), their phases need not vanish even if every theta-angle vanishes and every coupling is real; e.g., the multivalued non-perturbative superpotential may sit on a branch with a complex phase. In fact, gaugino condensation, in pure SUSY Yang-Mills theory and in its Affleck-Dine-Seiberg generalization, is safe only for N_c - N_f in {1,2} (N_c = 2 for pure SYM); otherwise the phase of the constant term reaches the gluino mass through anomaly mediation. The SUSY-breaking F-term is the main source of the MSSM soft masses, including the gluino mass, so its phase reaches theta-bar as well. In the framework of global SUSY, the 3-2 model introduces no phase. The ISS model is safe for non-degenerate quark masses in that sector; in the degenerate (or nearly degenerate) limit, however, a complex vacuum orientation can generate an O(1) phase. The IYIT model can generate a purely imaginary F-term: for roughly half of the real Yukawa parameter space, the meson VEV is purely imaginary and CP is spontaneously broken. In all three, the vacuum of the field coupled to the messengers is aligned with the constant term, so a complex constant term generates a strong CP phase through a second route, separate from anomaly mediation.

  • 1 authors
·
Oct 5

I-ViT: Integer-only Quantization for Efficient Vision Transformer Inference

Vision Transformers (ViTs) have achieved state-of-the-art performance on various computer vision applications. However, these models have considerable storage and computational overheads, making their deployment and efficient inference on edge devices challenging. Quantization is a promising approach to reducing model complexity, and the dyadic arithmetic pipeline can allow the quantized models to perform efficient integer-only inference. Unfortunately, dyadic arithmetic is based on the homogeneity condition in convolutional neural networks, which is not applicable to the non-linear components in ViTs, making integer-only inference of ViTs an open issue. In this paper, we propose I-ViT, an integer-only quantization scheme for ViTs, to enable ViTs to perform the entire computational graph of inference with integer arithmetic and bit-shifting, and without any floating-point arithmetic. In I-ViT, linear operations (e.g., MatMul and Dense) follow the integer-only pipeline with dyadic arithmetic, and non-linear operations (e.g., Softmax, GELU, and LayerNorm) are approximated by the proposed light-weight integer-only arithmetic methods. More specifically, I-ViT applies the proposed Shiftmax and ShiftGELU, which are designed to use integer bit-shifting to approximate the corresponding floating-point operations. We evaluate I-ViT on various benchmark models and the results show that integer-only INT8 quantization achieves comparable (or even slightly higher) accuracy to the full-precision (FP) baseline. Furthermore, we utilize TVM for practical hardware deployment on the GPU's integer arithmetic units, achieving 3.72sim4.11times inference speedup compared to the FP model. Code of both Pytorch and TVM is released at https://github.com/zkkli/I-ViT.

  • 2 authors
·
Jul 4, 2022