Adaptive stopping in MCMC using classifier-based dynamics
problem Sampling from complex, unnormalized probability densities
method Training state-dependent neural classifiers
result Significant reduction in average trajectory lengths
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,657 papers · 148 categories
Trend · papers per month
48 results for “classifier-based dynamics”
Fault detection problem for closed loop uncertain dynamical systems, is investigated in this paper, using different deep learning based methods. Traditional classifier based method does not perform well, because of the inherent difficulty of detecting system level faults for closed loop dynamical system. Specifically, …
Image classifiers based on convolutional neural networks are defined, and the rate of convergence of the misclassification risk of the estimates towards the optimal misclassification risk is analyzed. Under suitable assumptions on the smoothness and structure of the aposteriori probability a rate of convergence is show…
Although deep learning has shown great success in recent years, researchers have discovered a critical flaw where small, imperceptible changes in the input to the system can drastically change the output classification. These attacks are exploitable in nearly all of the existing deep learning classification frameworks.…
A new classifier improves one-class predictions on unevenly sampled data.
problem Non-uniformly sampled data affects one-class classifier performance.
method Dynamic decision boundary based on minimum spanning tree.
result Proves effectiveness and robustness compared to state-of-the-art classifiers.
Topological data analysis aims to extract topological quantities from data, which tend to focus on the broader global structure of the data rather than local information. The Mapper method, specifically, generalizes clustering methods to identify significant global mathematical structures, which are out of reach of man…
Deep learning classifiers are known to be vulnerable to adversarial examples. A recent paper presented at ICML 2019 proposed a statistical test detection method based on the observation that logits of noisy adversarial examples are biased toward the true class. The method is evaluated on CIFAR-10 dataset and is shown t…
The non-stationary nature of electroencephalography (EEG) signals makes an EEG-based brain-computer interface (BCI) a dynamic system, thus improving its performance is a challenging task. In addition, it is well-known that due to non-stationarity based covariate shifts, the input data distributions of EEG-based BCI sys…
The presence of noisy instances in mobile phone data is a fundamental issue for classifying user phone call behavior (i.e., accept, reject, missed and outgoing), with many potential negative consequences. The classification accuracy may decrease and the complexity of the classifiers may increase due to the number of re…
Distinguishing between classes of time series sampled from dynamic systems is a common challenge in systems and control engineering, for example in the context of health monitoring, fault detection, and quality control. The challenge is increased when no underlying model of a system is known, measurement noise is prese…
Whole MILC learns brain disorder dynamics from unlabeled data.
problem Learning spatio-temporal brain disorder dynamics from unlabeled data.
method Self-supervised pre-training of whole MILC on unlabeled healthy control data.
result Whole MILC outperforms existing methods and provides diagnostic insights.
An inductive probabilistic classification rule must generally obey the principles of Bayesian predictive inference, such that all observed and unobserved stochastic quantities are jointly modeled and the parameter uncertainty is fully acknowledged through the posterior predictive distribution. Several such rules have b…
We propose a new formulation of Multiple-Instance Learning (MIL). In typical MIL settings, a unit of data is given as a set of instances called a bag and the goal is to find a good classifier of bags based on similarity from a single or finitely many "shapelets" (or patterns), where the similarity of the bag from a sha…
This thesis explores supervised classification methods using Bayesian and exchangeability theories.
problem Assigning objects into predefined classes using training data and auxiliary information.
method Bayesian inductive theories and exchangeabilities (de Finetti and partition exchangeability).
result Optimal classifiers for different scenarios of object features and categories.
The nearest-centroid classifier is a simple linear-time classifier based on computing the centroids of the data classes in the training phase, and then assigning a new datum to the class corresponding to its nearest centroid. Thanks to its very low computational cost, the nearest-centroid classifier is still widely use…
Defines explanations for classifier outcomes using causal concepts.
problem Understanding classifier outcomes in a causal context.
method Proposes a new definition of explanation based on causality, compares it with existing notions, and evaluates it experimentally.
result Experimental evaluation shows the new definition's effectiveness on financial datasets.
Neyman-Pearson testing improves goodness of fit in detecting new physics.
problem Detecting small anomalies in data distributions.
method Employing Neyman-Pearson strategy with a rich parametrized family of models.
result Neyman-Pearson testing is more sensitive to small departures and unbiased towards specific anomalies.
Learning Selectively Conditioned Forest Structures with Applications to DBNs and Classificationcs.LG
Dealing with uncertainty in Bayesian Network structures using maximum a posteriori (MAP) estimation or Bayesian Model Averaging (BMA) is often intractable due to the superexponential number of possible directed, acyclic graphs. When the prior is decomposable, two classes of graphs where efficient learning can take plac…
In this paper, we present an algorithm for minimizing the difference between two submodular functions using a variational framework which is based on (an extension of) the concave-convex procedure [17]. Because several commonly used metrics in machine learning, like mutual information and conditional mutual information…
We consider the binary classification problem in a setup that preserves the privacy of the original sample. We provide a privacy mechanism that is locally differentially private and then construct a classifier based on the private sample that is universally consistent in Euclidean spaces. Under stronger assumptions, we…
PolyGraph Discrepancy improves graph generative model evaluation.
problem Inability of existing metrics to provide an absolute performance measure and comparability across different graph descriptors.
method Approximates Jensen-Shannon distance using binary classifiers trained to distinguish between real and generated graphs.
result PGD provides a more robust and insightful evaluation compared to MMD metrics.
Convolutional neural network (CNN)-based feature learning has become state of the art, since given sufficient training data, CNN can significantly outperform traditional methods for various classification tasks. However, feature learning becomes more difficult if some training labels are noisy. With traditional regular…
Spherical quadrilaterals classified based on geometric properties.
problem Classifying spherical quadrilaterals up to isometry.
method Developing map and condition of genericity.
result Space of quadrilaterals with prescribed angles consists of finitely many open curves.
32 knot projections classified based on forbidden Reidemeister moves.
problem Classifying knot projections based on allowed Reidemeister moves.
method 32 homotopy classifications based on forbidden Reidemeister moves.
result 20 non-trivial cases of knot projections are mutually different.
Classifiers based on sparse representations have recently been shown to provide excellent results in many visual recognition and classification tasks. However, the high cost of computing sparse representations at test time is a major obstacle that limits the applicability of these methods in large-scale problems, or in…
A widespread approach in machine learning to evaluate the quality of a classifier is to cross -- classify predicted and actual decision classes in a confusion matrix, also called error matrix. A classification tool which does not assume distributional parameters but only information contained in the data is based on th…
We consider the two-group classification problem and propose a kernel classifier based on the optimal scoring framework. Unlike previous approaches, we provide theoretical guarantees on the expected risk consistency of the method. We also allow for feature selection by imposing structured sparsity using weighted kernel…
Chi-Square Test Neural Network: A New Binary Classifier based on Backpropagation Neural Networkcs.LG
We introduce the chi-square test neural network: a single hidden layer backpropagation neural network using chi-square test theorem to redefine the cost function and the error function. The weights and thresholds are modified using standard backpropagation algorithm. The proposed approach has the advantage of making co…
Chirped sinosoids and interferometric phase plots are functions that are not periodic, but are the composition of a smooth function and a periodic function. These functions functions factor into a pair of maps: from their domain to a circle, and from a circle to their codomain. One can easily imagine replacing the circ…
We consider a standard binary classification problem. The performance of any binary classifier based on the training data is characterized by the excess risk. We study Bahadur's type exponential bounds on the minimax accuracy confidence function based on the excess risk. We study how this quantity depends on the comple…
Motivated by social balance theory, we develop a theory of link classification in signed networks using the correlation clustering index as measure of label regularity. We derive learning bounds in terms of correlation clustering within three fundamental transductive learning settings: online, batch and active. Our mai…
An intrinsic problem of classifiers based on machine learning (ML) methods is that their learning time grows as the size and complexity of the training dataset increases. For this reason, it is important to have efficient computational methods and algorithms that can be applied on large datasets, such that it is still …
CANDI solves the gap between continuous and discrete diffusion models for text generation.
problem Underperformance of continuous diffusion models in discrete data domains.
method Introduces token identifiability and a hybrid framework (CANDI) to decouple discrete and continuous corruption.
result CANDI successfully avoids temporal dissonance, enabling continuous diffusion benefits for discrete spaces.
Flexible classifier using Mahalanobis distances for non-elliptical distributions.
problem Classifying non-elliptical and multimodal distributions.
method Semiparametric classifier based on Mahalanobis distances and generalized additive models.
result The proposed classifiers outperform traditional methods in high-dimensional, low-sample-size scenarios.
New method uses CDMs to improve CI testing without distributional assumptions.
problem Testing conditional independence when the conditional distribution is unknown.
method Uses conditional diffusion models (CDMs) to approximate and a classifier-based CMI estimator.
result Proposed method performs better than GAN-based CI tests and controls type I and II errors.
We employ random geometric digraphs to construct semi-parametric classifiers. These data-random digraphs are from parametrized random digraph families called proximity catch digraphs (PCDs). A related geometric digraph family, class cover catch digraph (CCCD), has been used to solve the class cover problem by using its…
Automatic Construction of a Recurrent Neural Network based Classifier for Vehicle Passage Detectioncs.CV
Recurrent Neural Networks (RNNs) are extensively used for time-series modeling and prediction. We propose an approach for automatic construction of a binary classifier based on Long Short-Term Memory RNNs (LSTM-RNNs) for detection of a vehicle passage through a checkpoint. As an input to the classifier we use multidime…
TSSC images enhance chaotic signal classification using ConvNets.
problem Classifying chaotic signals accurately and robustly.
method Triad State Space Construction (TSSC) for image encoding, Convolutional Neural Network (ConvNet) for classification.
result TSSC-ConvNet achieves high accuracy and robustness in chaotic signal classification.
Classifier-based AI safety gates fail in self-improvement, even with advanced verification methods.
problem Maintaining reliable oversight of AI systems as they improve over iterations.
method Comprehensive empirical testing on neural controllers and MuJoCo benchmarks, using various classifiers and verification methods.
result Classifier-based safety gates fail in maintaining reliable oversight, even with advanced verification methods.
Top-k Multiclass SVMstat.ML
Class ambiguity is typical in image classification problems with a large number of classes. When classes are difficult to discriminate, it makes sense to allow k guesses and evaluate classifiers based on the top-k error instead of the standard zero-one loss. We propose top-k multiclass SVM as a direct method to optimiz…
To identify and classify toxic online commentary, the modern tools of data science transform raw text into key features from which either thresholding or learning algorithms can make predictions for monitoring offensive conversations. We systematically evaluate 62 classifiers representing 19 major algorithmic families …
Paper classifies movie genres using multimodal data.
problem Challenging task of multi-label movie genre classification.
method Created dataset from video clips, subtitles, synopses, and posters. Extracted features using various descriptors. Evaluated using different classifiers and late fusion strategy.
result Best F-Score result of 0.628 achieved by combining LSTM on synopses and CNN on movie trailer frames.
New classifier combines locally linear kernels for fast and accurate non-linear classification.
problem Developing a fast and accurate non-linear classifier.
method Combines locally linear classifiers using a Multiple Kernel Learning (MKL) problem with scalable MKL training for streaming kernels.
result The resulting classifier achieves high accuracy with fast inference time.
The classification of multivariate functional data is an important task in scientific research. Unlike point-wise data, functional data are usually classified by their shapes rather than by their scales. We define an outlyingness matrix by extending directional outlyingness, an effective measure of the shape variation …
One-class classifiers are trained with target class only samples. Intuitively, their conservative modelling of the class description may benefit classical classification tasks where classes are difficult to separate due to overlapping and data imbalance. In this work, three methods are proposed which leverage on the co…
Kernel testing compares cell states in single-cell data.
problem Comparing non-linear cell states in single-cell data.
method Kernel-based testing framework for non-linear distribution comparison.
result Identifies subtle population variations in cell states.
Training machine learning models that are robust against adversarial inputs poses seemingly insurmountable challenges. To better understand adversarial robustness, we consider the underlying problem of learning robust representations. We develop a notion of representation vulnerability that captures the maximum change …
In this paper, we empirically evaluate algorithms for learning four types of Bayesian network (BN) classifiers - Naive-Bayes, tree augmented Naive-Bayes, BN augmented Naive-Bayes and general BNs, where the latter two are learned using two variants of a conditional-independence (CI) based BN-learning algorithm. Experime…