2,119 research outputs found
Transformed Schatten-1 Iterative Thresholding Algorithms for Low Rank Matrix Completion
We study a non-convex low-rank promoting penalty function, the transformed
Schatten-1 (TS1), and its applications in matrix completion. The TS1 penalty,
as a matrix quasi-norm defined on its singular values, interpolates the rank
and the nuclear norm through a nonnegative parameter a. We consider the
unconstrained TS1 regularized low-rank matrix recovery problem and develop a
fixed point representation for its global minimizer. The TS1 thresholding
functions are in closed analytical form for all parameter values. The TS1
threshold values differ in subcritical (supercritical) parameter regime where
the TS1 threshold functions are continuous (discontinuous). We propose TS1
iterative thresholding algorithms and compare them with some state-of-the-art
algorithms on matrix completion test problems. For problems with known rank, a
fully adaptive TS1 iterative thresholding algorithm consistently performs the
best under different conditions with ground truth matrix being multivariate
Gaussian at varying covariance. For problems with unknown rank, TS1 algorithms
with an additional rank estimation procedure approach the level of IRucL-q
which is an iterative reweighted algorithm, non-convex in nature and best in
performance
How the Scientific Community Reacts to Newly Submitted Preprints: Article Downloads, Twitter Mentions, and Citations
We analyze the online response to the preprint publication of a cohort of
4,606 scientific articles submitted to the preprint database arXiv.org between
October 2010 and May 2011. We study three forms of responses to these
preprints: downloads on the arXiv.org site, mentions on the social media site
Twitter, and early citations in the scholarly record. We perform two analyses.
First, we analyze the delay and time span of article downloads and Twitter
mentions following submission, to understand the temporal configuration of
these reactions and whether one precedes or follows the other. Second, we run
regression and correlation tests to investigate the relationship between
Twitter mentions, arXiv downloads and article citations. We find that Twitter
mentions and arXiv downloads of scholarly articles follow two distinct temporal
patterns of activity, with Twitter mentions having shorter delays and narrower
time spans than arXiv downloads. We also find that the volume of Twitter
mentions is statistically correlated with arXiv downloads and early citations
just months after the publication of a preprint, with a possible bias that
favors highly mentioned articles.Comment: 15 pages, 7 Figures, 3 Tables. PLoS One, in pres
Freeze-in Dirac neutrinogenesis: thermal leptonic CP asymmetry
We present a freeze-in realization of the Dirac neutrinogenesis in which the
decaying particle that generates the lepton-number asymmetry is in thermal
equilibrium. As the right-handed Dirac neutrinos are produced non-thermally,
the lepton-number asymmetry is accumulated and partially converted to the
baryon-number asymmetry via the rapid sphaleron transitions. The necessary
CP-violating condition can be fulfilled by a purely thermal kinetic phase from
the wavefunction correction in the lepton-doublet sector, which has been
neglected in most leptogenesis-based setup. Furthermore, this condition
necessitates a preferred flavor basis in which both the charged-lepton and
neutrino Yukawa matrices are non-diagonal. To protect such a proper Yukawa
structure from the basis transformations in flavor space prior to the
electroweak gauge symmetry breaking, we can resort to a plethora of model
buildings aimed at deciphering the non-trivial Yukawa structures.
Interestingly, based on the well-known tri-bimaximal mixing with a minimal
correction from the charged-lepton or neutrino sector, we find that a
simultaneous explanation of the baryon-number asymmetry in the Universe and the
low-energy neutrino oscillation observables can be attributed to the mixing
angle and the CP-violating phase introduced in the minimal correction.Comment: 28 pages and 7 figures; more discussions and one figure added, final
version published in the journa
Hybrid Transceiver Optimization for Multi-Hop Communications
Multi-hop communication with the aid of large-scale antenna arrays will play
a vital role in future emergence communication systems. In this paper, we
investigate amplify-and-forward based and multiple-input multiple-output
assisted multi-hop communication, in which all nodes employ hybrid
transceivers. Moreover, channel errors are taken into account in our hybrid
transceiver design. Based on the matrix-monotonic optimization framework, the
optimal structures of the robust hybrid transceivers are derived. By utilizing
these optimal structures, the optimizations of analog transceivers and digital
transceivers can be separated without loss of optimality. This fact greatly
simplifies the joint optimization of analog and digital transceivers. Since the
optimization of analog transceivers under unit-modulus constraints is
non-convex, a projection type algorithm is proposed for analog transceiver
optimization to overcome this difficulty. Based on the derived analog
transceivers, the optimal digital transceivers can then be derived using
matrix-monotonic optimization. Numeral results obtained demonstrate the
performance advantages of the proposed hybrid transceiver designs over other
existing solutions.Comment: 32 pages, 6 figures. This manuscript has been submitted to IEEE
Journal on Selected Areas in Communications (special issue on Multiple
Antenna Technologies for Beyond 5G
- …