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

150300450600 · Jun 202019922001200920172026
48 results for multiple classes

The study proves a generic multiplicity one theorem for GG-invariant minimal hypersurfaces.

problem Proving a generic multiplicity one theorem for GG-invariant minimal hypersurfaces.
method Equivariant min-max theory and analysis of GG-homology classes.
result Shows a generic multiplicity one theorem for GG-invariant minimal hypersurfaces.

The paper proposes a novel MKL approach for OCC using p\ell_p-norm constraints.

problem Addressing the MKL problem for one-class classification.
method A min-max saddle point Lagrangian optimisation problem is formulated and solved efficiently.
result The proposed method outperforms baselines and other algorithms on various data sets.

On any compact manifold of dimension n3n\geq3 with boundary, we prescibe any finite part of the Steklov spectrum whithin a given conformal class. In particular, we prescribe the multiplicity of the first eigenvalues. On a compact surface with boundary, we show that the multiplicity of the kk-th eigenvalue is bounded i…

2012-09-20abs ↗pdf ↗

Improved covariance matrix estimation for multiple classes with limited data.

problem Estimating covariance matrices for multiple classes with scarce data.
method Coupled regularized sample covariance matrix estimator (RSCM) that combines pooled SCM and scaled identity matrix for regularization.
result The coupled RSCM estimators outperform cross-validation in classification tasks with comparable accuracy but faster computation.

The one-class kernel spectral regression (OC-KSR), the regression-based formulation of the kernel null-space approach has been found to be an effective Fisher criterion-based methodology for one-class classification (OCC), achieving state-of-the-art performance in one-class classification while providing relatively hig…

2019-05-22abs ↗pdf ↗

We define a concept which we call multiplicity. First, multiplicity of a morphism is defined. Then the multiplicity of an object over another object is defined to be the minimum of the multiplicities of all morphisms from one to another. Based on this multiplicity, we define a pseudo distance on the class of objects. W…

2011-01-10abs ↗pdf ↗

A new teacher-class network method compresses DNNs by distributing knowledge to multiple student networks.

problem Overwhelming size of Deep Neural Networks (DNNs).
method Single teacher with multiple student networks, transferring knowledge to each student.
result The combined knowledge of the class of students achieves better performance and reduces parameters.

LIMEtree offers faithful explanations for multiple classes in predictive models.

problem Generating explanations for several classes can be difficult due to conflicting evidence.
method LIMEtree uses multi-output regression trees for consistent and faithful explanations of multiple classes.
result LIMEtree provides diverse explanation types and outperforms LIME in evaluations.

This paper provides fast estimates for complex option types.

problem Estimating prices for constrained multiple exercise American options.
method Lookahead search for lower estimates and nearest-neighbor martingale for upper estimates.
result Probabilistic convergence guarantees for the algorithms.

Herein, we present a system for hyperspectral image segmentation that utilizes multiple class--based denoising autoencoders which are efficiently trained. Moreover, we present a novel hyperspectral data augmentation method for labelled HSI data using linear mixtures of pixels from each class, which helps the system wit…

2018-07-11abs ↗pdf ↗

Federated learning (FL) is a privacy-preserving paradigm for training collective machine learning models with locally stored data from multiple participants. Vertical federated learning (VFL) deals with the case where participants sharing the same sample ID space but having different feature spaces, while label informa…

2020-01-30abs ↗pdf ↗

New bounds on learning from multiple distributions for VC classes.

problem Understanding the sample complexity of learning from multiple data distributions.
method Analyzing the gap between known upper and lower bounds for PAC-learnable classes.
result Recent progress on sample complexity for VC dimension d classes on k distributions.

We formulate a new class of conditional generative models based on probability flows. Trained with maximum likelihood, it provides efficient inference and sampling from class-conditionals or the joint distribution, and does not require a priori knowledge of the number of classes or the relationships between classes. Th…

2019-02-05abs ↗pdf ↗

Latent force models are a class of hybrid models for dynamic systems, combining simple mechanistic models with flexible Gaussian process (GP) perturbations. An extension of this framework to include multiplicative interactions between the state and GP terms allows strong a priori control of the model geometry at the ex…

2018-12-31abs ↗pdf ↗

Designs an MLP from LDA for multi-Gaussian class classification.

problem Classifying inputs with multiple Gaussian distributions.
method Interprets MLP as generalized LDA, using LDAs for half-space partitioning, neurons for subspace isolation, and merging for class-wise representation.
result Automatic feedforward design for MLP architecture and weights.

System learns to combine multiple model components for personalized text generation.

problem Adapting and biasing language models for personal preferences.
method Combines model-defined components, learns activation and probability combination from unlabeled text.
result Directly generates text with personalized components from unlabeled data.

Paper presents an efficient algorithm for learning minimax risk classifiers with large-scale data.

problem Efficient learning of minimax risk classifiers for large-scale data with multiple classes.
method Combination of constraint and column generation for efficient learning.
result 10x speedup for general large-scale data and 100x speedup with many classes.

Goldman (Invent. Math. 85(2) (1986) 263) and Turaev (Ann. Sci. Ecole Norm. Sup. (4) 24 (6)(1991) 635) found a Lie bialgebra structure on the vector space generated by non-trivial free homotopy classes of loops on an orientable surface. Chas (Combinatorial Lie bialgebras of curves on surfaces, Topology 43 (2004) 543), b…

2005-10-30abs ↗pdf ↗

Proves simplicity of Lyapunov exponents for specific Anosov flows.

problem Proving all Lyapunov exponents have multiplicity 1 for certain Anosov flows.
method Perturbative results for flows, modification of eigenvalues, Markov partition, and simplicity criterion.
result In a C1C^1-open and CkC^k-dense set of Anosov flows, all Lyapunov exponents have multiplicity 1.

We express the coefficients of the Hirzebruch L-polynomials in terms of certain alternating multiple zeta values. In particular, we show that every monomial in the Pontryagin classes appears with a non-zero coefficient, with the expected sign. Similar results hold for the polynomials associated to the A-hat genus.

2017-08-18abs ↗pdf ↗

This paper examines momentum spillover across multiple asset classes using only pricing data.

problem Challenges in studying momentum spillover across diverse asset classes due to lack of common characteristics.
method Utilised a linear and interpretable graph learning model to reveal momentum spillover network.
result Network momentum strategy yields a Sharpe ratio of 1.5 and an annual return of 22%.

We consider a continuous map f:MNf :M\to N between two manifolds and try to estimate its multiplicity from below, i.e. find a qq-tuple of pairwise distinct points x1,...,xqMx_1,..., x_q\in M such that f(x1)=f(x2)=...=f(xq)f(x_1) = f(x_2) = ... = f(x_q). We show that there are certain characteristic classes of vector bundle fTNTMf^*TN-TM that guarant…

2010-02-03abs ↗pdf ↗

Despite the advancement of supervised image recognition algorithms, their dependence on the availability of labeled data and the rapid expansion of image categories raise the significant challenge of zero-shot learning. Zero-shot learning (ZSL) aims to transfer knowledge from labeled classes into unlabeled classes to r…

2018-05-18abs ↗pdf ↗

Multiple conventions have been adopted for denoting Interval Exchange Transformations (IETs). The "non-labeled" convention was the original, while the "labeled" convention has proven convenient when investigating Flat Surfaces as described by IETs. We establish the relationship between Extended Rauzy Classes, an equiva…

2014-08-03abs ↗pdf ↗

In multi-instance (MI) learning, each object (bag) consists of multiple feature vectors (instances), and is most commonly regarded as a set of points in a multidimensional space. A different viewpoint is that the instances are realisations of random vectors with corresponding probability distribution, and that a bag is…

2018-03-07abs ↗pdf ↗

Let E(1)_p denote the rational elliptic surface with a single multiple fiber f_p of multiplicity p. We construct an infinite family of homologous non-isotopic symplectic tori representing the primitive class [f_p] in E(1)_p when p>1. As a consequence, we get infinitely many non-isotopic symplectic tori in the fiber cla…

2003-08-28abs ↗pdf ↗

We study a multiclass multiple instance learning (MIL) problem where the labels only suggest whether any instance of a class exists or does not exist in a training sample or example. No further information, e.g., the number of instances of each class, relative locations or orders of all instances in a training sample, …

2018-11-29abs ↗pdf ↗

Paper proposes GEG to enhance fairness in binary and multi-class classification.

problem Fairness in multi-class classification tasks is under-explored.
method Formulates multi-objective problem between effectiveness and fairness constraints, proposes GEG algorithm.
result GEG improves fairness up to 92% and decreases accuracy up to 14%.

Matrix multiplication is a fundamental building block for large scale computations arising in various applications, including machine learning. There has been significant recent interest in using coding to speed up distributed matrix multiplication, that are robust to stragglers (i.e., machines that may perform slower …

2019-05-16abs ↗pdf ↗