Rotation of the CMB polarisation by foreground lensing
May 29, 2019
| | |
Physics
Cosmology and Nongalactic Astrophysics
General Relativity and Quantum Cosmology
High Energy Physics - Theory
We investigate the weak lensing corrections to the CMB polarization
anisotropies. We concentrate on the effect of rotation and show that the
rotation of polarisation is a true physical effect which has to be taken into
account at second ord...
Comer Schemes, Relation Algebras, and the Flexible Atom Conjecture
May 28, 2019
| |
Mathematics
Logic
Combinatorics
Number Theory
In this paper, we consider relational structures arising from Comer's finite
field construction, where the cosets need not be sum free. These Comer schemes
generalize the notion of a Ramsey scheme and may be of independent interest. As
an a...
On the lattice Hadwiger number of superballs and some other bodies
May 27, 2019
Mathematics
Metric Geometry
Algebraic Geometry
Combinatorics
Number Theory
We show that the lattice Hadwiger number of superballs is exponential in the
dimension. The same is true for some more general convex bodies....
A Geometric Modeling of Occam's Razor in Deep Learning
May 27, 2019
|
Computer Science
Statistics
Machine Learning
Machine Learning
Why do deep neural networks (DNNs) benefit from very high dimensional
parameter spaces? Their huge parameter complexities vs. stunning performances
in practice is all the more intriguing and not explainable using the standard
theory of mode...
Score-Driven Exponential Random Graphs: A New Class of Time-Varying
Parameter Models for Dynamical Networks
May 26, 2019
| |
Statistics
Economics
Quantitative Finance
Applications
Econometrics
General Economics
Economics
Motivated by the increasing abundance of data describing real-world networks
that exhibit dynamical features, we propose an extension of the Exponential
Random Graph Models (ERGMs) that accommodates the time variation of its
parameters. Ins...
On the Evaluation Metric for Hashing
May 26, 2019
| |
Computer Science
Information Retrieval
Due to its low storage cost and fast query speed, hashing has been widely
used for large-scale approximate nearest neighbor (ANN) search. Bucket search,
also called hash lookup, can achieve fast query speed with a sub-linear time
cost based...
Domain Adaptive Attention Learning for Unsupervised Person
Re-Identification
May 25, 2019
| | | | |
Computer Science
Computer Vision and Pattern Recognition
Person re-identification (Re-ID) across multiple datasets is a challenging
task due to two main reasons: the presence of large cross-dataset distinctions
and the absence of annotated target instances. To address these two issues,
this paper...
DISN: Deep Implicit Surface Network for High-quality Single-view 3D
Reconstruction
May 25, 2019
| | | |
Computer Science
Computer Vision and Pattern Recognition
Reconstructing 3D shapes from single-view images has been a long-standing
research problem. In this paper, we present DISN, a Deep Implicit Surface
Network which can generate a high-quality detail-rich 3D mesh from an 2D image
by predicting...
Naive Feature Selection: a Nearly Tight Convex Relaxation for Sparse
Naive Bayes
May 23, 2019
| | | | |
Computer Science
Statistics
Machine Learning
Machine Learning
Machine Learning
Machine Learning
Due to its linear complexity, naive Bayes classification remains an
attractive supervised learning method, especially in very large-scale settings.
We propose a sparse version of naive Bayes, which can be used for feature
selection. This le...
Topological Characterization of Consensus in Distributed Systems
May 23, 2019
| | | | |
Computer Science
Distributed, Parallel, and Cluster Computing
Distributed, Parallel, and Cluster Computing
We provide a complete characterization of both uniform and non-uniform
deterministic consensus solvability in distributed systems with benign process
and communication faults using point-set topology. More specifically, we
non-trivially ext...