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

Trend · papers per month

117233350466 · Jun 202019922001200920172026
48 results for nonlinear classification

In this investigation, symmetry properties of the nonlinear heat conductivity equations of general form ut=[E(x,u)ux]x+H(x,u)u_t = [E(x, u)u_x]_x + H(x, u) are studied. The point symmetry analysis of these equations is considered as well as an equivalence classification which admits an extension by one dimension of the principal Lie alge…

2009-09-21abs ↗pdf ↗

The paper classifies solutions to a Liouville equation on a half-space with a specific boundary condition.

problem Classifying solutions to a Liouville equation with a nonlinear Neumann boundary condition.
method Analyzing the nn-Laplacian Liouville equation on the half-space R+n\mathbb{R}^{n}_{+} with positive nonlinear Neumann boundary condition.
result The classification of solutions extends previous results for n=2n=2 and p=np=n.

In this paper, a symmetry classification of a (2+1)(2+1)-nonlinear wave equation uttf(u)(uxx+uyy)=0u_{tt}-f(u)(u_{xx}+u_{yy})=0 where f(u)f(u) is a smooth function on uu, using Lie group method, is given. The basic infinitesimal method for calculating symmetry groups is presented, and used to determine the general symmetry group of this $…

2009-07-28abs ↗pdf ↗

A preliminary group classification of the class 2D nonlinear heat equations ut=f(x,y,u,ux,uy)(uxx+uyy)u_t=f(x,y,u,u_x,u_y)(u_{xx}+u_{yy}), where ff is arbitrary smooth function of the variables x,y,u,uxx,y,u,u_x and uyu_y using Lie method, is given. The paper is one of the few applications of an algebraic approach to the problem of group classific…

2009-08-26abs ↗pdf ↗

NKI integrates obfuscated datasets using nonlinear kernels for improved data collaboration.

problem Privacy-preserving data collaboration with reduced reconstruction risk.
method Formulates linear kernel integration, kernelizes it, and introduces graph regularization and centering constraints.
result NKI improves classification accuracy over existing linear integration methods under nonlinear dimensionality reduction.

The paper analyzes and proposes an algorithm for multi-modal nonlinear embeddings with theoretical performance bounds.

problem Generalizability of multi-modal nonlinear embeddings to unseen data.
method Theoretical analysis and a multi-modal nonlinear representation learning algorithm motivated by performance bounds.
result The proposed algorithm yields promising performance in multi-modal image classification and cross-modal image-text retrieval applications.

Manifold methods improve amino acid classification in LIBS spectra.

problem Improving classification accuracy of amino acids in LIBS spectra.
method Developed an information theoretic method for measuring LIBS energy spectra, implemented manifold methods for nonlinear dimensionality reduction.
result Nonlinear methods lead to increased classification accuracy in amino acid classification.

In this paper we investigate for further symmetry properties of the nonlinear fin equations of the general form ut=(E(u)ux)x+h(x)uu_t=(E(u)u_x)_x + h(x)u rather than recent works on these equations. At first, we study the projective (fiber-preserving) symmetry to show that equations of the above class can not be reduced to linear equa…

2009-08-26abs ↗pdf ↗

Dimensionality reduction (DR) is often used as a preprocessing step in classification, but usually one first fixes the DR mapping, possibly using label information, and then learns a classifier (a filter approach). Best performance would be obtained by optimizing the classification error jointly over DR mapping and cla…

2014-05-26abs ↗pdf ↗

Kernel discriminant analysis uses nonlinear embeddings to improve classification.

problem Limited effectiveness of linear discriminant analysis in capturing nonlinear features.
method Study of nonlinear embeddings in kernel discriminant analysis using polynomial and Gaussian kernels, solving generalized eigenvalue problems.
result Polynomial and Gaussian discriminants capture class differences through population moments and randomized projections.

We propose a method for maximizing a partial area under a receiver operating characteristic (ROC) curve (pAUC) for binary classification tasks. In binary classification tasks, accuracy is the most commonly used as a measure of classifier performance. In some applications such as anomaly detection and diagnostic testing…

2018-06-13abs ↗pdf ↗

A novel feature selection method for SVM improves model accuracy and interpretability.

problem Feature selection in nonlinear SVM classification problems.
method Embedded min-max optimization problem, leveraging duality theory.
result Improves model accuracy and interpretability on benchmark data sets.

Proposes FunNoL for better curve classification and reconstruction in multivariate functional data.

problem Linear methods fail to capture nonlinear structures in multivariate functional data.
method Functional nonlinear learning (FunNoL) method using nonlinear mapping.
result FunNoL outperforms FPCA in curve classification and reconstruction, especially in multivariate settings.

Develops MGQDA for multi-group classification with theoretical guarantees and practical applications.

problem Complex multi-group classification problems with nonlinear decision boundaries and group-specific covariance patterns.
method MGQDA, a method based on quadratic discriminant analysis that projects predictors onto a lower-dimensional subspace.
result MGQDA achieves competitive or improved predictive performance compared to existing methods.

INGB improves oversampling for noisy imbalanced datasets.

problem Imbalanced, noisy, and complex datasets in classification problems.
method INGB uses granular balls to simulate spatial distribution and informed entropy for optimization, followed by nonlinear oversampling.
result INGB outperforms traditional linear sampling frameworks and algorithms on complex datasets.

Classifies ancient solutions to curvature flows, finding two main types.

problem Classifying ancient solutions to fully nonlinear curvature flows.
method Natural conditions on speed, convexity, noncollapsing, uniform two-convexity.
result Exactly two possibilities: self-similarly shrinking cylinder or rotationally symmetric translating soliton.

Paper connects contrastive learning to MI maximization and establishes robust methods for nonlinear ICA and subspace estimation.

problem Understanding and improving unsupervised representation learning and density ratio estimation.
method The paper connects contrastive learning to MI maximization, establishes new recovery conditions for nonlinear ICA, and proposes a practical outlier-robust method for nonlinear subspace estimation.
result The proposed methods can be seen as maximizing MI, performing nonlinear ICA, or estimating nonlinear subspaces, and are robust to outliers.

Paper proposes S2S^2ConvSCN for robust subspace clustering and classification.

problem Insufficient handling of nonlinear manifolds, data corruptions, and out-of-sample data.
method Self-supervised convolutional subspace clustering network (S2S^2ConvSCN) with FC layer, CIM for robustness, and BD regularization.
result Robust S2S^2ConvSCN outperforms baseline on unseen data.

Neural networks learn task-specific features, influenced by nonlinearity.

problem Understanding the nature of task-dependent feature learning in neural networks.
method Investigation of fully-connected, wide neural networks using Bayesian framework.
result The nature of internal representations depends on neuronal nonlinearity, leading to analog, redundant, or sparse coding schemes.

Gaussian processes (GPs) are versatile tools that have been successfully employed to solve nonlinear estimation problems in machine learning, but that are rarely used in signal processing. In this tutorial, we present GPs for regression as a natural nonlinear extension to optimal Wiener filtering. After establishing th…

2013-03-12abs ↗pdf ↗

A neural network for online NP classification with reduced complexity.

problem Online nonlinear Neyman-Pearson classification.
method Single hidden layer feedforward neural network (SLFN) initialized with random Fourier features (RFFs). Uses stochastic gradient descent for sequential learning.
result Expedited online adaptation and powerful nonlinear Neyman-Pearson modeling.

We introduce the truncated Gaussian graphical model (TGGM) as a novel framework for designing statistical models for nonlinear learning. A TGGM is a Gaussian graphical model (GGM) with a subset of variables truncated to be nonnegative. The truncated variables are assumed latent and integrated out to induce a marginal m…

2016-06-02abs ↗pdf ↗

We extend manifold capacity to nonlinear neural representations with contextual information.

problem Efficient processing of information through neural representations.
method Theoretical framework leveraging latent directions in input space related to contextual information.
result Derivation of an exact formula for context-dependent manifold capacity.

Study of eigenvalues in nonlinear kernels for classification of separable data.

problem Understanding the applicability of linear equivalents in nonlinearly separable data classification.
method Analysis of conjugate kernels and their quadratic equivalents for a canonical nonlinearly separable dataset (XOR problem).
result Identification of regimes where nonlinear kernels deviate from linear equivalents, leading to label-aligned eigenspaces.

Investigation of human brain states through electroencephalograph (EEG) signals is a crucial step in human-machine communications. However, classifying and analyzing EEG signals are challenging due to their noisy, nonlinear and nonstationary nature. Current methodologies for analyzing these signals often fall short bec…

2019-12-18abs ↗pdf ↗

The term "CoRE kernel" stands for correlation-resemblance kernel. In many applications (e.g., vision), the data are often high-dimensional, sparse, and non-binary. We propose two types of (nonlinear) CoRE kernels for non-binary sparse data and demonstrate the effectiveness of the new kernels through a classification ex…

2014-04-24abs ↗pdf ↗

Kernel approximation via nonlinear random feature maps is widely used in speeding up kernel machines. There are two main challenges for the conventional kernel approximation methods. First, before performing kernel approximation, a good kernel has to be chosen. Picking a good kernel is a very challenging problem in its…

2015-03-12abs ↗pdf ↗

In this article we will analyse how to compute the contribution of each input value to its aggregate output in some nonlinear models. Regression and classification applications, together with related algorithms for deep neural networks are presented. The proposed approach merges two methods currently present in the lit…

2019-04-21abs ↗pdf ↗

In this paper, a genetic algorithm-based frequency-domain feature search (GAFDS) method is proposed for the electroencephalogram (EEG) analysis of epilepsy. In this method, frequency-domain features are first searched and then combined with nonlinear features. Subsequently, these features are selected and optimized to …

2017-01-22abs ↗pdf ↗

Develops a new minimax probability machine for imbalanced classification tasks.

problem Imbalanced classification tasks with non-decomposable performance measures.
method Derives an equivalent form of the MPMF model for solving linear and nonlinear classifiers.
result Demonstrates the effectiveness of the new model on real-world datasets.