arXiv research

Deep learning models detect and classify log anomalies.

The paper proposes a SeqGAN model to generate balanced log messages for anomaly detection.

New method detects anomalies in computing centers' logs.

Logsy detects anomalies in logs using a novel classification-based approach.

We give a generalization of toric symplectic geometry to Poisson manifolds which are symplectic away from a collection of hypersurfaces forming a normal crossing configuration. We introduce the tropical momentum map, which takes values in a generalization of affine space called a log affine manifold. Using this momentu…

Paper studies multiclass classifiers from binary classifiers, proving methods and demonstrating advantages.

Several classification methods assume that the underlying distributions follow tree-structured graphical models. Indeed, trees capture statistical dependencies between pairs of variables, which may be crucial to attain low classification errors. The resulting classifier is linear in the log-transformed univariate and b…

Motivated by the study of Fano type varieties we define a new class of log pairs that we call asymptotically log Fano varieties and strongly asymptotically log Fano varieties. We study their properties in dimension two under an additional assumption of log smoothness, and give a complete classification of two dimension…

Given a compact oriented surface, we classify log Poisson bi-vectors whose degeneracy loci are locally modeled by a finite set of lines in the plane intersecting at a point. Further, we compute the Poisson cohomology of such structures and discuss the relationship between our classification and the second Poisson cohom…

In deep neural network, the cross-entropy loss function is commonly used for classification. Minimizing cross-entropy is equivalent to maximizing likelihood under assumptions of uniform feature and class distributions. It belongs to generative training criteria which does not directly discriminate correct class from co…

Acoustic scene classification is the task of identifying the scene from which the audio signal is recorded. Convolutional neural network (CNN) models are widely adopted with proven successes in acoustic scene classification. However, there is little insight on how an audio scene is perceived in CNN, as what have been d…

We leverage a streaming architecture based on ELK, Spark and Hadoop in order to collect, store, and analyse database connection logs in near real-time. The proposed system investigates outliers using unsupervised learning; widely adopted clustering and classification algorithms for log data, highlighting the subtle var…

PACMAN provides bounds for classification tasks considering accuracy vs. negative log-loss mismatch.

Corrected graph convolutions improve node classification on graphs.

Quantum annealer speeds up RBM training for image classification.

Continual learning is the ability to sequentially learn over time by accommodating knowledge while retaining previously learned experiences. Neural networks can learn multiple tasks when trained on them jointly, but cannot maintain performance on previously learned tasks when tasks are presented one at a time. This pro…

Smart Bayes integrates generative and discriminative features for improved classification.

We present $α$-loss, $α\in [1,\infty]$, a tunable loss function for binary classification that bridges log-loss ($α=1$) and $0$-$1$ loss ($α= \infty$). We prove that $α$-loss has an equivalent margin-based form and is classification-calibrated, two desirable properties for a good surrogate loss function for the ideal y…

Prevalidated ridge regression simplifies logistic regression for high-dimensional data.

In the paper, we focus on complexity of C5.0 algorithm for constructing decision tree classifier that is the models for the classification problem from machine learning. In classical case the decision tree is constructed in $O(hd(NM+N \log N))$ running time, where $M$ is a number of classes, $N$ is the size of a traini…

Sharp bounds on uniform generalization errors in binary linear classification.

Semi-supervised GANs with log-signatures improve credit card fraud detection.

Improved mistake bound for group linear separable cases in online multiclass linear classification.

Self-directed learners can minimize mistakes in online classification.

The high computational complexity associated with training deep neural networks limits online and real-time training on edge devices. This paper proposed an end-to-end training and inference scheme that eliminates multiplications by approximate operations in the log-domain which has the potential to significantly reduc…

In this paper, we classify the class of constant weighted curvature curves in the plane with a log-linear density, or in other words, classify all traveling curved fronts with a constant forcing term in $\Bbb R^2.$ The classification gives some interesting phenomena and consequences including: the family of curves conv…

New method improves transductive learning predictions with multiplicative oracle inequalities.

New algorithm improves multiclass classification regret bound.

Proposes MCLLO for assessing and recalibrating multiclass probability predictions.

We introduce a tunable loss function called $α$-loss, parameterized by $α\in (0,\infty]$, which interpolates between the exponential loss ($α= 1/2$), the log-loss ($α= 1$), and the 0-1 loss ($α= \infty$), for the machine learning setting of classification. Theoretically, we illustrate a fundamental connection between $…

This paper improves SNN training by using multiple sample compartments.

Improved PAC learning algorithm for multiclass classification with bandit feedback.

New Orlicz Brunn-Minkowski inequalities are established for rigid motion compatible Minkowski valuations of arbitrary degree. These extend classical log-concavity properties of intrinsic volumes and generalize seminal results of Lutwak and others. Two different approaches which refine previously employed techniques are…

Despite being the standard loss function to train multi-class neural networks, the log-softmax has two potential limitations. First, it involves computations that scale linearly with the number of output classes, which can restrict the size of problems we are able to tackle with current hardware. Second, it remains unc…

Let $\cF$ be a set of $M$ classification procedures with values in $[-1,1]$. Given a loss function, we want to construct a procedure which mimics at the best possible rate the best procedure in $\cF$. This fastest rate is called optimal rate of aggregation. Considering a continuous scale of loss functions with various …

Gradient boosting adapted for vector inputs.

Study compares various calibration methods for binary classification tasks.

Support vector machines (SVMs) have been recognized as a potential tool for supervised classification analyses in different domains of research. In essence, SVM is a binary classifier. Therefore, in case of a multiclass problem, the problem is divided into a series of binary problems which are solved by binary classifi…

SPRT-TANDEM improves sequential classification accuracy with fewer samples.

In a multi-class classification problem, it is standard to model the output of a neural network as a categorical distribution conditioned on the inputs. The output must therefore be positive and sum to one, which is traditionally enforced by a softmax. This probabilistic mapping allows to use the maximum likelihood pri…

McCullagh and Yang (2006) suggest a family of classification algorithms based on Cox processes. We further investigate the log Gaussian variant which has a number of appealing properties. Conditioned on the covariates, the distribution over labels is given by a type of conditional Markov random field. In the supervised…

The global log canonical threshold (or Tian's alpha-invariant) plays an important role in the geometry of Fano varieties. Tian showed that Fano manifolds with big alpha-invariant can be equipped with a Kahler-Einstein metric. In recent years Donaldson drafted a programme to determine when a smooth Fano variety X admits…

In order to improve mobile data transparency, a number of network-based approaches have been proposed to inspect packets generated by mobile devices and detect personally identifiable information (PII), ad requests, or other activities. State-of-the-art approaches train classifiers based on features extracted from HTTP…

Proposes a new deep ordinal classification model enforcing label uni-modality.

We consider the problem of classifying business process instances based on structural features derived from event logs. The main motivation is to provide machine learning based techniques with quick response times for interactive computer assisted root cause analysis. In particular, we create structural features from p…

DisCoveR efficiently discovers declarative process models from event logs.

Clustering, or unsupervised classification, is a task often plagued by outliers. Yet there is a paucity of work on handling outliers in clustering. Outlier identification algorithms tend to fall into three broad categories: outlier inclusion, outlier trimming, and post hoc outlier identification methods, with the forme…

Proposes a neural network for EMG classification that handles skewness and kurtosis.