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,657 papers · 148 categories

Trend · papers per month

3156309441,259 · Jun 202019922001200920172026
48 results for generative classification

We study realizations of Lie algebras by vector fields. A correspondence between classification of transitive local realizations and classification of subalgebras is generalized to the case of regular local realizations. A reasonable classification problem for general realizations is rigorously formulated and an algori…

2017-03-02abs ↗pdf ↗

CNNs improve generalization to unseen audio devices with increased width, not depth.

problem CNNs are sensitive to specific audio recording devices in acoustic scene classification.
method Investigated the relationship between over-parameterization and generalization in CNNs for audio classification.
result Increasing width improves generalization to unseen devices without increasing the number of parameters.

The paper analyzes how overparameterized models can generalize well in multiclass classification.

problem Generalization in multiclass classification with overparameterized models.
method Survival/contamination analysis framework adapted for multiclass classification.
result Multiclass classification can generalize well even with many classes, unlike regression tasks.

The number of possible methods of generalizing binary classification to multi-class classification increases exponentially with the number of class labels. Often, the best method of doing so will be highly problem dependent. Here we present classification software in which the partitioning of multi-class classification…

2014-04-15abs ↗pdf ↗

Proposes a new framework for image generation using classification latent space representations.

problem Combining discriminative and dense representations for image generation and reconstruction.
method Discriminative modeling framework using manipulated supervised latent representations.
result Higher classification accuracy and visually realistic image generation compared to existing models.

It is given the diffeomorphism classification on generic singularities of tangent varieties to curves with arbitrary codimension in a projective space. The generic classifications are performed in terms of certain geometric structures and differential systems on flag manifolds, via several techniques in differentiable …

2012-01-13abs ↗pdf ↗

The study examines generalization bounds for regression and classification tasks on adaptive input domains.

problem Understanding the generalization error in adaptive input domains for regression and classification.
method The analysis considers regression and classification separately, using Lipschitz continuity and 2-norm/0/1 loss for measurement. It also highlights the polynomial relationship between generalization bounds and network parameters.
result Generalization bounds for regression and classification are inversely proportional to a polynomial of the number of parameters, emphasizing the advantages of over-parameterized networks.

Paper proposes fully Bayesian approach for RVM classification, improving accuracy especially in imbalanced data.

problem Difficulty in conducting RVM classification due to lack of closed-form solution for weight parameter posterior.
method Proposes Generic Bayesian and Fully Bayesian approaches with hierarchical hyperprior structure.
result Improves classification performance, especially in imbalanced data.

Simplicial learning improves classification by generating compact sparse representations.

problem Difficulty in distinguishing classes on the same subspace.
method Evolutionary simplicial learning approach to sparse representations.
result Evolutionary simplicial learning outperforms other methods in multi-class classification.

Classifies and computes cohomologies of complex structures on Lie groups.

problem Classifying and computing cohomologies of complex structures on Lie groups.
method Complete classification and computation of invariant cohomologies for left invariant structures.
result Computed invariant cohomologies for various generalized complex and Kähler structures.

Sequence classification is an important data mining task in many real world applications. Over the past few decades, many sequence classification methods have been proposed from different aspects. In particular, the pattern-based method is one of the most important and widely studied sequence classification methods in …

2019-05-17abs ↗pdf ↗

Generative model evaluates text emotion intensity, outperforming classification.

problem Limitations of discrete emotion classification in applied domains.
method Fine-tuning generative language models to output continuous emotion intensity scores.
result Generative model outperforms classification baselines and reveals generalization capabilities.

Optimal downsampling improves GLM performance in imbalanced classification.

problem Improving GLM performance in imbalanced classification.
method Proposed a pseudo maximum likelihood estimator for optimal downsampling.
result The introduced estimator outperforms existing alternatives in both synthetic and empirical data.

Recent metric-based meta-learning approaches, which learn a metric space that generalizes well over combinatorial number of different classification tasks sampled from a task distribution, have been shown to be effective for few-shot classification tasks of unseen classes. They are often trained with episodic training …

2019-08-05abs ↗pdf ↗

Conventional techniques for supervised classification constrain the classification rules considered and use surrogate losses for classification 0-1 loss. Favored families of classification rules are those that enjoy parametric representations suitable for surrogate loss minimization, and low complexity properties suita…

2019-02-02abs ↗pdf ↗

Paper tackles leveraging unlabeled data for PU classification and robust generation.

problem Scarcity of labeled data in machine learning problems.
method Introduces a novel training framework that simultaneously targets PU classification and conditional generation using extra unlabeled data.
result Proves the effectiveness of a Classifier-Noise-Invariant Conditional GAN (CNI-CGAN) that enhances PU classifier performance and leverages extra data.

Study on continuous sequence classification with distribution uncertainty.

problem Classifying continuous sequences with varying distribution uncertainty.
method Proposes distribution-free tests for three test designs: fixed-length, sequential, and two-phase tests.
result Error probabilities decay exponentially fast for all test designs.

We note that a rational 33-tangle diagram is obtained from a combination of four generators. There is an algorithm to distinguish two rational 33-tangle diagrams up to isotopy. However, there is no perfect classification about rational 33-tangle diagrams such as the classification of rational 22-tangle diagrams cor…

2015-02-19abs ↗pdf ↗

We survey the existing parts of a classification of finite groups generated by orthogonal transformations in a finite-dimensional Euclidean space whose fixed point subspace has codimension one or two and extend it to a complete classification. These groups naturally arise in the study of the quotient of a Euclidean spa…

2015-09-23abs ↗pdf ↗

New NHCAs improve multi-category classification efficiency.

problem Efficient multi-category classification for real-world problems.
method Twin SVM (TWSVM), Generalized eigenvalue proximal SVM (GEPSVM), Regularized GEPSVM (RegGEPSVM), and Improved GEPSVM (IGEPSVM) with OAA, BT, and TDS approaches.
result TDS-TWSVM outperforms other methods in classification accuracy.

Establishes a condition for multiclass classification-calibration of Gamma-Phi losses.

problem Ensuring classification-calibration of multiclass Gamma-Phi losses.
method Develops a general sufficient condition for classification-calibration of Gamma-Phi losses.
result Proves the first family of nonconvex multiclass surrogate losses for which classification-calibration has been fully justified.

Neural NCD reveals LLMs don't compress well for classification.

problem The disconnect between compression and classification in neural networks.
method Developed Neural NCD to compare LLMs to classic algorithms, finding classification accuracy not correlated with compression rate.
result Classification accuracy is not predictable by compression rate alone, challenging current understanding.

Sharp bounds on uniform generalization errors in binary linear classification.

problem Understanding the uniform generalization errors in binary linear classification.
method Isoperimetric arguments, Poincaré and log-Sobolev inequalities for joint distributions.
result Sharp concentration bounds on uniform generalization errors, almost sure convergence in broad settings.

This research improves PAC-Bayesian bounds for classification tasks using convexified loss.

problem Deriving generalization bounds for classification tasks with non-convex loss functions.
method Shift focus to misclassification excess risk bounds for PAC-Bayesian classification using convex surrogate loss and leveraging PAC-Bayesian relative bounds in expectation.
result Improved PAC-Bayesian bounds for classification tasks with convex surrogate loss.

Recent advances in large-margin classification of data residing in general metric spaces (rather than Hilbert spaces) enable classification under various natural metrics, such as string edit and earthmover distance. A general framework developed for this purpose by von Luxburg and Bousquet [JMLR, 2004] left open the qu…

2013-06-11abs ↗pdf ↗

We give a local classification of generalized complex structures. About a point, a generalized complex structure is equivalent to a product of a symplectic manifold with a holomorphic Poisson manifold. We use a Nash-Moser type argument in the style of Conn's linearization theorem.

2012-01-23abs ↗pdf ↗

Unified principle LZN unifies generative modeling, representation learning, and classification.

problem Disjoint solutions for generative modeling, representation learning, and classification.
method LZN creates a shared latent space for all tasks, using encoders and decoders for each data type.
result LZN improves FID on CIFAR10 and outperforms existing methods in representation learning and joint generation/classification.

Deep neural networks classify unbounded Gaussian mixture data without dimensionality issues.

problem Binary classification of unbounded Gaussian mixture data.
method Deep ReLU neural networks with non-asymptotic upper bounds and convergence rates.
result Deep ReLU networks can classify unbounded Gaussian mixture data without dimensionality constraints.

This paper improves binary classification methods beyond accuracy, especially in imbalanced datasets.

problem Binary classification performance metrics often fail to reflect real-world consequences, especially in imbalanced datasets.
method Derives a generalized Bayes-optimal classifier from accuracy to any performance metric, removing assumptions and providing finite-sample statistical guarantees.
result Optimal classification performance depends on class imbalance properties, providing new insights and guarantees.