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

107214320427 · Jun 202019922001200920172026
48 results for classifying theory

The paper classifies virtual knot polynomials and trivalent graph invariants using skein theory.

problem Classifying virtual knot polynomials and trivalent graph invariants with specific conditions.
method Skein-theoretic techniques applied to classify invariants with smallness conditions.
result Classification of all non-trivial invariants of trivalent graphs and skein theories of virtual tangles.

Paper introduces SPADE method to protect classifiers from OOD and adversarial samples.

problem Protecting classifiers from out-of-distribution and adversarial samples.
method SPADE method based on GEV model in latent space.
result Provable protection against OOD and adversarial samples.

In this paper we study n-composition series of affine manifolds. One composition series are classified using gerbe theory. It is natural to think that n-composition series must be classified using n-gerbe theory. In the last section of this, we propose a notion of abelian n-gerbe theory

2001-05-24abs ↗pdf ↗

Study fractional structures on bundle gerbe modules using rational homotopy theory.

problem Understanding twisted Chern classes of torsion bundle gerbe modules.
method Sullivan's rational homotopy theory to realize twisted Chern classes at the level of classifying spaces.
result Introduction of fractional U-structures as a universal framework.

Classifies colored links and spatial graphs up to colored link-homotopy.

problem Classifying colored links and spatial graphs up to colored link-homotopy.
method Using Habegger-Lin theory for colored string links, and extending to colored links and spatial graphs.
result Classification of colored links and spatial graphs up to colored link-homotopy.

Rule-based classifiers quantify uncertainty using Bernoulli random variables.

problem Quantifying the uncertainty of precision estimates for rule-based text classifiers.
method Treat partitions of sub-strings as Bernoulli random variables, compare means using statistical tests, and combine classifiers using Dempster-Shafer theory.
result The approach can be used to combine binary classifiers into a multi-label classifier.

Machine Learning has become very famous currently which assist in identifying the patterns from the raw data. Technological advancement has led to substantial improvement in Machine Learning which, thus helping to improve prediction. Current Machine Learning models are based on Classical Theory, which can be replaced b…

2018-10-10abs ↗pdf ↗

We compare and contrast two approaches to validating a trained classifier while using all in-sample data for training. One is simultaneous validation over an organized set of hypotheses (SVOOSH), the well-known method that began with VC theory. The other is withhold and gap (WAG). WAG withholds a validation set, trains…

2015-10-09abs ↗pdf ↗

In this article, we propose a novel probabilistic framework to improve the accuracy of a weighted majority voting algorithm. In order to assign higher weights to the classifiers which can correctly classify hard-to-classify instances, we introduce the Item Response Theory (IRT) framework to evaluate the samples' diffic…

2019-11-11abs ↗pdf ↗

Unified classification of equivariant principal bundles using higher homotopy theory.

problem Unified classification of equivariant principal bundles.
method Smooth Oka principle, singular-cohesive homotopy theory, internally describing principal bundles.
result Unified classification results for equivariant principal bundles.

A qualgebra GG is a set having two binary operations that satisfy compatibility conditions which are modeled upon a group under conjugation and multiplication. We develop a homology theory for qualgebras and describe a classifying space for it. This space is constructed from GG-colored prisms (products of simplices) …

2017-11-16abs ↗pdf ↗

Machine Learning (ML) helps us to recognize patterns from raw data. ML is used in numerous domains i.e. biomedical, agricultural, food technology, etc. Despite recent technological advancements, there is still room for substantial improvement in prediction. Current ML models are based on classical theories of probabili…

2019-03-04abs ↗pdf ↗

The paper tackles Neyman-Pearson classification control issues.

problem Neyman-Pearson classification's control constraint is hard to satisfy in finite samples.
method Developed refined learning procedures under two accuracy control strategies.
result Proposed methods achieve desired control levels in finite samples.

Classifies tight contact structures on specific Seifert fibered manifolds.

problem Classifying tight contact structures on Seifert fibered manifolds.
method Constructed contact structures using Legendrian surgery and used convex surface theory for the upper bound.
result Found the lower and upper bounds for tight contact structures.

In this article, we introduce a new cohomology theory associated to a Lie 2-algebras. This cohomology theory is shown to extend the classical cohomology theory of Lie algebras; in particular, we show that the second cohomology group classifies an appropriate type of extensions.

2018-11-09abs ↗pdf ↗

We propose a novel combination of optimization tools with learning theory bounds in order to analyze the sample complexity of optimal kernel sum classifiers. This contrasts the typical learning theoretic results which hold for all (potentially suboptimal) classifiers. Our work also justifies assumptions made in prior w…

2019-01-25abs ↗pdf ↗

Throwing away data can improve worst-group error in imbalanced datasets.

problem Improving worst-group accuracy in imbalanced datasets.
method Leveraging extreme value theory to analyze the tails of data distributions and their impact on classifier performance.
result Throwing away data restores geometric symmetry in classifiers, improving worst-group generalization.

We give another definition of two-dimensional extended homotopy field theories (E-HFTs) with aspherical targets and classify them. When the target of E-HFT is chosen to be a K(G,1)K(G,1)-space, we classify E-HFTs taking values in the symmetric monoidal bicategory of algebras, bimodules, and bimodule maps by certain Frobeni…

2019-09-09abs ↗pdf ↗

Novel M-theory approach classifies topological phases of matter.

problem Classifying and understanding topological phases of matter.
method Establishing a correspondence between (2+1)d topological field theories and non-hyperbolic 3-manifolds, identifying topological phases from internal wrapped 3-manifolds.
result Paves a new route toward the classification of topological phases of matter, including fermionic and non-unitary phases.

Paper proposes a new method to compare classifiers across multiple datasets.

problem Comparing classifiers over multiple datasets with multiple criteria.
method Adopting decision theory, the paper introduces generalized stochastic dominance for ranking classifiers.
result Generalized stochastic dominance can be used to rank classifiers and statistically tested.

We construct a version of differential KK-theory based on smooth Banach manifold models for the homotopy types BU×ZB \mathrm U\times Z and U\mathrm U that appear in the topological KK-theory spectrum. These manifolds carry natural differential forms that refine the topological universal Chern character, together with …

2019-05-08abs ↗pdf ↗

This paper proposes an efficient method for calculating Shapley values in Naive Bayes classifiers.

problem The need for explaining machine learning model decisions.
method An exact analytic expression of Shapley values for Naive Bayes classifiers.
result The proposed Shapley values provide informative results with low complexity and low computation time.

Machine learning predicts properties of number fields with high accuracy.

problem Predicting properties of algebraic number fields.
method Training machine learning algorithms on various coefficients or polynomials of number fields.
result Machine learning can distinguish between real quadratic fields with high precision and predict properties of Galois extensions.

We classify hyperbolic monopoles with continuous symmetries and construct new examples.

problem Classifying and constructing hyperbolic monopoles with continuous symmetries.
method Developed a Structure Theorem and used representation theory to simplify the problem.
result Found constraints on structure groups and constructed novel spherically symmetric Sp(n)\mathrm{Sp}(n) hyperbolic monopoles.

Study of curves in dual space with constant curvature and torsion.

problem Classifying curves in dual space with specific geometric properties.
method Defined curvature and torsion for curves in dual space, classified curves with constant properties, and proved existence theorems.
result Established fundamental theorem of existence for dual curves with prescribed curvature and torsion.

This is a survey paper based on my talk at the Workshop on Orbifolds and String Theory, the goal of which was to explain the role of groupoids and their classifying spaces as a foundation for the theory of orbifolds.

2002-03-11abs ↗pdf ↗

Numbers and numerical vectors account for a large portion of data. However, recently the amount of string data generated has increased dramatically. Consequently, classifying string data is a common problem in many fields. The most widely used approach to this problem is to convert strings into numerical vectors using …

2014-06-03abs ↗pdf ↗

We study the computational capacity of a model neuron, the Tempotron, which classifies sequences of spikes by linear-threshold operations. We use statistical mechanics and extreme value theory to derive the capacity of the system in random classification tasks. In contrast to its static analog, the Perceptron, the Temp…

2010-10-26abs ↗pdf ↗