arXiv research

The paper studies quaternionic structures on GKM graphs and their relation to torus actions on quaternionic projective spaces.

Optimizes master faces for 2D and 3D face verification using evolutionary algorithms and neural networks.

A zigzag in a plane graph is a circuit of edges, such that any two, but no three, consecutive edges belong to the same face. A railroad in a plane graph is a circuit of hexagonal faces, such that any hexagon is adjacent to its neighbors on opposite edges. A graph without a railroad is called tight. We consider the zigz…

Face recall is a basic human cognitive process performed routinely, e.g., when meeting someone and determining if we have met that person before. Assisting a subject during face recall by suggesting candidate faces can be challenging. One of the reasons is that the search space - the face space - is quite large and lac…

The paper studies invariant convex sets in representations with nontrivial copolarity.

The face pairing graph of a 3-manifold triangulation is a 4-valent graph denoting which tetrahedron faces are identified with which others. We present a series of properties that must be satisfied by the face pairing graph of a closed minimal P^2-irreducible triangulation. In addition we present constraints upon the co…

We study polar orbitopes, i.e. convex hulls of orbits of a polar representation of a compact Lie group. The face structure is studied by means of the gradient momentum map and it is shown that every face is exposed and is again a polar orbitope. Up to conjugation the faces are completely determined by the momentum poly…

Analyzes convex structures in Teichmüller space unit tangent spheres.

New combinatorial structures for Teichmüller spaces with Thurston's metric are explored.

A Coxeter $n$-orbifold is an $n$-dimensional orbifold based on a polytope with silvered boundary facets. Each pair of adjacent facets meet on a ridge of some order $m$, whose neighborhood is locally modeled on ${\mathbb R}^n$ modulo the dihedral group of order $2m$ generated by two reflections. For $n \geq 3$, we study…

In this paper we address the following question, given a face representation, how many identities can it resolve? In other words, what is the capacity of the face representation? A scientific basis for estimating the capacity of a given face representation will not only benefit the evaluation and comparison of differen…

The state-of-the-art performance of deep learning algorithms has led to a considerable increase in the utilization of machine learning in security-sensitive and critical applications. However, it has recently been shown that a small and carefully crafted perturbation in the input space can completely fool a deep model.…

The paper connects knot theory and cluster algebras via dimer face polynomials.

Study normal curves in sub-Finsler Lie groups with specific norms, focusing on branching and face stability.

We present an unsupervised approach for learning to estimate three dimensional (3D) facial structure from a single image while also predicting 3D viewpoint transformations that match a desired pose and facial geometry. We achieve this by inferring the depth of facial keypoints of an input image in an unsupervised manne…

Face recognition systems are vulnerable to composite face reconstruction attacks.

Recent work shows unequal performance of commercial face classification services in the gender classification task across intersectional groups defined by skin type and gender. Accuracy on dark-skinned females is significantly worse than on any other group. In this paper, we conduct several analyses to try to uncover t…

We study a compact invariant convex set $E$ in a polar representation of a compact Lie group. Polar rapresentations are given by the adjoint action of $K$ on $\mathfrak{p}$, where $K$ is a maximal compact subgroup of a real semisimple Lie group $G$ with Lie algebra $\mathfrak{g} = \mathfrak{k} \oplus \mathfrak{p}$. If …

Let F be the fundamental group of S, where S is a compact, connected, oriented surface with negative Euler characteristic and nonempty boundary. (1) The projective class of the chain \partial S in B_1(F) intersects the interior of a codimension one face of the unit ball in the stable commutator length pseudo-norm. (2) …

In this paper we prove some classification theorems of real hypersur- faces in Mn(c) satisfying certain conditions on the covariant derivative of the structure Jacobi operator. We also prove the non-existence of real hypersurfaces with Codazzi type structure Jacobi operator in Mn(c).

Introduces joint exclusivity (JE), a new form of negative dependence.

Some recent studies have suggested using GANs for numeric data generation such as to generate data for completing the imbalanced numeric data. Considering the significant difference between the dimensions of the numeric data and images, as well as the strong correlations between features of numeric data, the convention…

For a compact manifold with boundary $X$ we introduce the $n$-fold scattering stretched product $X^n_{\text{sc}}$ which is a compact manifold with corners for each $n,$ coinciding with the previously known cases for $n=2,3.$ It is constructed by iterated blow up of boundary faces and boundary faces of multi-diagonals i…

Humans are able to imagine a person's voice from the person's appearance and imagine the person's appearance from his/her voice. In this paper, we make the first attempt to develop a method that can convert speech into a voice that matches an input face image and generate a face image that matches the voice of the inpu…

We consider universal adversarial patches for faces -- small visual elements whose addition to a face image reliably destroys the performance of face detectors. Unlike previous work that mostly focused on the algorithmic design of adversarial examples in terms of improving the success rate as an attacker, in this work …

Despite the remarkable progress in face recognition related technologies, reliably recognizing faces across ages still remains a big challenge. The appearance of a human face changes substantially over time, resulting in significant intra-class variations. As opposed to current techniques for age-invariant face recogni…

We present a generative autoencoder that provides fast encoding, faithful reconstructions (eg. retaining the identity of a face), sharp generated/reconstructed samples in high resolutions, and a well-structured latent space that supports semantic manipulation of the inputs. There are no current autoencoder or GAN model…

This work generates synthetic 3D thermal facial data using 2D facial data and deep learning.

We present a framework for translating unlabeled images from one domain into analog images in another domain. We employ a progressively growing skip-connected encoder-generator structure and train it with a GAN loss for realistic output, a cycle consistency loss for maintaining same-domain translation identity, and a s…

Faces of quasi-arithmetic Coxeter polytopes are also quasi-arithmetic.

In this paper, we study face vectors of simplicial posets that are the face posets of cell decompositions of topological manifolds without boundary. We characterize all possible face vectors of simplicial posets whose geometric realizations are homeomorphic to the product of spheres. As a corollary, we obtain the chara…

We are interested in attribute-guided face generation: given a low-res face input image, an attribute vector that can be extracted from a high-res image (attribute image), our new method generates a high-res face image for the low-res input that satisfies the given attributes. To address this problem, we condition the …

Study on critical faces convergence in a Poisson point process.

We describe compactifications of the moduli spaces of SU(2) monopoles on R3 as manifolds with corners, with respect to which the hyperKaehler metrics admit asymptotic expansions up to each boundary face. The boundary faces encode monopoles of charge k decomposing into widely separated monopoles of lower charge, and the…

Bayesian optimization generates personalized face stimuli for cognitive neuroscience.

The Frank-Wolfe method and its extensions are well-suited for delivering solutions with desirable structural properties, such as sparsity or low-rank structure. We introduce a new variant of the Frank-Wolfe method that combines Frank-Wolfe steps and steepest descent steps, as well as a novel modification of the "Frank-…

Consider a platform that wants to learn a personalized policy for each user, but the platform faces the risk of a user abandoning the platform if she is dissatisfied with the actions of the platform. For example, a platform is interested in personalizing the number of newsletters it sends, but faces the risk that the u…

The set of maximal non-integrable structures $(SU(2)\times SU(2),B,I)$, where $B$ is Killing-Cartan metric is described as subset of $\mathbb{CP}^3$. The visualization of complex projective space $\mathbb{CP}^3$ as tetrahedron which edges and faces are $\mathbb{CP}^1$ and $\mathbb{CP}^2$ is used.

Motivated principally by the low-rank matrix completion problem, we present an extension of the Frank-Wolfe method that is designed to induce near-optimal solutions on low-dimensional faces of the feasible region. This is accomplished by a new approach to generating ``in-face" directions at each iteration, as well as t…

The paper is motivated by the study of graded representations of Takiff algebras, cominuscule parabolics, and their generalizations. We study certain special subsets of the set of weights (and of their convex hull) of the generalized Verma modules (or GVM's) of a semisimple Lie algebra $\lie g$. In particular, we exten…

Shellable tilings on simplicial complexes help understand their structure.

New algorithm reduces regret in graphical bilinear bandits.

Formula for manifold Euler characteristic using even faces.

New flows represent Thurston norm ball faces, differing by veering mutations.

A semisimplicial set has face maps but not degeneracies. A basic fact, due to Rourke and Sanderson, is that a semisimplicial set satisfying the Kan condition can be given a simplicial structure. The present paper gives a combinatorial proof of this fact and a generalization to multisemisimplicial sets.

The multivariable Conway function is generalized to oriented framed trivalent graphs equipped with additional structure (coloring). This is done via refinements of Reshetikhin-Turaev functors based on irreducible representations of quantized gl(1|1) and sl(2). The corresponding face state sum models for the generalized…

GDMaps reduces high-dimensional data to lower dimensions for better classification.

Enhances 2D face recognition with 3D features using active illumination.