Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

112224335447 · Jun 202019922001200920172026
48 results for Face classification

Reduces gender classification bias by learning race-invariant face representations.

problem Societal bias in gender recognition systems.
method Adversarially trained autoencoder model to learn race-invariant face representations.
result Achieved a significant drop of over 40% in racial bias surrogate metric with race invariant representations.

Pixel-wise relevance method shows how CNNs classify faces, varying across datasets and tasks.

problem Interpreting black-box CNN face recognition models.
method Layer-wise relevance propagation (LRP) applied to VGG-16 models trained for face recognition.
result Relevance maps are generally stable across random initializations and tasks, but less so across pretraining datasets.

Face recognition is the important field in machine learning and pattern recognition research area. It has a lot of applications in military, finance, public security, to name a few. In this paper, the combination of the tensor sparse PCA with the nearest-neighbor method (and with the kernel ridge regression method) wil…

2019-04-12abs ↗pdf ↗

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…

2018-11-30abs ↗pdf ↗

Paper proposes angular loss for better face recognition and object classification.

problem Improving intra-class compactness and preventing overfitting in face recognition and object classification.
method Angular loss function to maximize angular gradient, reducing overfitting and requiring only one adjustable constant.
result Our method outperforms other methods in accuracy, discriminative information, and time-efficiency.

XEM improves multivariate time series classification with explainable models.

problem Multivariate time series classification challenges.
method Hybrid ensemble method combining explicit boosting-bagging and implicit divide-and-conquer.
result XEM outperforms state-of-the-art MTS classifiers on public datasets.

This paper reviews deep learning techniques for face recognition and sketch matching.

problem Matching composite sketches to photo images of faces is challenging due to limited details.
method Uses deep learning for feature extraction and classification in face recognition.
result Deep learning improves face recognition accuracy with large datasets.

Image classification has become one of the main tasks in the field of computer vision technologies. In this context, a recent algorithm called CapsNet that implements an approach based on activity vectors and dynamic routing between capsules may overcome some of the limitations of the current state of the art artificia…

2018-05-28abs ↗pdf ↗

Paper proposes a framework to protect user anonymity in emotion recognition.

problem Preserving user anonymity in face-based emotion recognition systems.
method Adversarial learning framework using CNN architecture.
result The proposed approach minimizes identity-specific information and maximizes emotion-dependent information.

Obtaining compact and discriminative features is one of the major challenges in many of the real-world image classification tasks such as face verification and object recognition. One possible approach is to represent input image on the basis of high-level features that carry semantic meaning which humans can understan…

2012-11-13abs ↗pdf ↗

An i-hedrite is a 4-regular plane graph with faces of size 2, 3 and 4. We do a short survey of their known properties and explain some new algorithms that allow their efficient enumeration. Using this we give the symmetry groups of all i-hedrites and the minimal representative for each. We also review the link of 4-hed…

2009-10-28abs ↗pdf ↗

Boosting is a general method of generating many simple classification rules and combining them into a single, highly accurate rule. In this talk, I will review the AdaBoost boosting algorithm and some of its underlying theory, and then look at how this theory has helped us to face some of the challenges of applying Ada…

2012-12-12abs ↗pdf ↗

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

problem High-dimensional data classification and representation.
method Grassmannian Diffusion Maps technique for nonlinear dimensionality reduction.
result GDMaps effectively identifies intrinsic subspace structures in high-dimensional data.

In many machine learning applications, we are faced with incomplete datasets. In the literature, missing data imputation techniques have been mostly concerned with filling missing values. However, the existence of missing values is synonymous with uncertainties not only over the distribution of missing values but also …

2019-05-22abs ↗pdf ↗

MTL method uses unlabeled data with pseudo labels to improve classification with disjoint datasets.

problem Improving classification performance with disjoint labeled datasets using unlabeled data.
method Proposes MTL-SA method to select and augment unlabeled data with confident pseudo labels and close distribution to labeled data.
result Extensive experiments show the effectiveness of MTL-SA method in improving classification performance.

Boosts neural network performance by improving weight separability.

problem Improving the separability of weight vectors in neural networks.
method Proposes a new evaluation metric and feed-backward reconstruction loss to encourage weight separability.
result Improves visual recognition performance across various tasks.

Improves neural network mapping functionality using latent feature generation.

problem Improving neural network performance in visual recognition tasks.
method Reversible learning for generating and learning latent features.
result The proposed method outperforms existing state-of-the-art methods in visual recognition.

Develops a fast non-invasive tool for diagnosing pediatric sleep apnea.

problem Diagnosing pediatric obstructive sleep apnea using an overnight sleep study is often impractical.
method Combines persistent homology, geometric shape analysis, and convolutional neural networks to classify facial images.
result Facial features associated with obstructive sleep apnea can be recognized for diagnosis.

The problem of classifying, upto isometry (or similarity), the orientable spherical, Euclidean and hyperbolic 3-manifolds that arise by identifying the faces of a Platonic solid is formulated in the language of Coxeter groups. In the spherical and hyperbolic cases, this allows us to complete the classification begun by…

2001-04-18abs ↗pdf ↗

In this paper, we propose a Tensor Train Neighborhood Preserving Embedding (TTNPE) to embed multi-dimensional tensor data into low dimensional tensor subspace. Novel approaches to solve the optimization problem in TTNPE are proposed. For this embedding, we evaluate novel trade-off gain among classification, computation…

2017-12-03abs ↗pdf ↗

Machine learning and data mining techniques have been used extensively in order to detect credit card frauds. However purchase behaviour and fraudster strategies may change over time. This phenomenon is named dataset shift or concept drift in the domain of fraud detection. In this paper, we present a method to quantify…

2019-06-17abs ↗pdf ↗

An embedded cubic graph consisting of segments of geodesics such that the angles at any vertex are equal to 2π/32π/3 is a closed local minimal net. This net is regular if all segments of geodesics are equal. The problem of classification of closed local minimal nets on surfaces of constant negative curvature has been for…

1998-07-13abs ↗pdf ↗

Differential privacy (DP) is a popular mechanism for training machine learning models with bounded leakage about the presence of specific points in the training data. The cost of differential privacy is a reduction in the model's accuracy. We demonstrate that in the neural networks trained using differentially private …

2019-05-28abs ↗pdf ↗

Limited annotated data available for the recognition of facial expression and action units embarrasses the training of deep networks, which can learn disentangled invariant features. However, a linear model with just several parameters normally is not demanding in terms of training data. In this paper, we propose an el…

2017-01-11abs ↗pdf ↗

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

problem Impersonation attacks using master faces for face-based identity authentication.
method Evolutionary algorithm in latent space of StyleGAN, neural network to direct search, 2D and 3D face reconstruction.
result Obtains high impersonation rates with fewer master faces for 2D and 3D face verification.

Classification may not be reliable for several reasons: noise in the data, insufficient input information, overlapping distributions and sharp definition of classes. Faced with several possibilities neural network may in such cases still be useful if instead of a classification elimination of improbable classes is done…

2019-01-28abs ↗pdf ↗

Face recognition systems are vulnerable to composite face reconstruction attacks.

problem Vulnerability of face recognition systems to composite face reconstruction attacks.
method Assumed attacker uses composite face parts to reconstruct faces faster and more efficiently.
result Current face recognition systems are extremely vulnerable to random search attacks.

The alternating knots, links and twists projected on the S2S_2 sphere were identified with the phase space of a Hamiltonian dynamic system of one degree of freedom. The saddles of the system correspond to the crossings, the edges correspond to the stable and unstable manifolds connecting the saddles. Each face is then …

2007-12-13abs ↗pdf ↗

Kernel extreme learning machine (KELM) is a novel feedforward neural network, which is widely used in classification problems. To some extent, it solves the existing problems of the invalid nodes and the large computational complexity in ELM. However, the traditional KELM classifier usually has a low test accuracy when…

2019-02-20abs ↗pdf ↗

Dictionary learning algorithms have been successfully used for both reconstructive and discriminative tasks, where an input signal is represented with a sparse linear combination of dictionary atoms. While these methods are mostly developed for single-modality scenarios, recent studies have demonstrated the advantages …

2015-02-04abs ↗pdf ↗

There is no known efficient method for selecting k Gaussian features from n which achieve the lowest Bayesian classification error. We show an example of how greedy algorithms faced with this task are led to give results that are not optimal. This motivates us to propose a more robust approach. We present a Branch and …

2012-10-19abs ↗pdf ↗

Paper proposes ARB-Loss to improve classification precision in imbalanced datasets.

problem Improving classification precision on minor classes in imbalanced datasets.
method Introduces Attraction-Repulsion-Balanced Loss (ARB-Loss) to balance gradients across different classes.
result ARB-Loss achieves state-of-the-art performance with one-stage training.

Given a combinatorial description CC of a polyhedron having EE edges, the space of dihedral angles of all compact hyperbolic polyhedra that realize CC is generally not a convex subset of RE\mathbb{R}^E \cite{DIAZ}. If CC has five or more faces, Andreev's Theorem states that the corresponding space of dihedral angle…

2006-01-07abs ↗pdf ↗