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

154308462616 · Jun 202019922001200920172026
48 results for class dependency

Paper tackles robust classification under class-dependent domain shift.

problem Class-dependent domain shift in machine learning.
method Defined a simple optimization problem with an information theoretic constraint and solved it using neural networks.
result Demonstrated that the proposed method can learn robust classifiers that generalize well to unseen domains.

Study reveals class-dependent effects in perturbation-based feature attribution metrics for time series classification.

problem Varying effectiveness of perturbation-based metrics across different classes in time series models.
method Systematic empirical analysis across multiple datasets, model architectures, and perturbation strategies.
result Perturbation-based metrics show varying effectiveness across classes, with some metrics performing better for certain classes.

Characterizes symmetric Bernoulli distributions with minimal convex sums.

problem Understanding minimal dependence among Bernoulli random vectors.
method Geometric and algebraic representations of multivariate symmetric Bernoulli distributions.
result Characterizes extremal negative dependence and builds minimal dependence copulas.

We develop the distance dependent Chinese restaurant process (CRP), a flexible class of distributions over partitions that allows for non-exchangeability. This class can be used to model many kinds of dependencies between data in infinite clustering models, including dependencies across time or space. We examine the pr…

2009-10-06abs ↗pdf ↗

Study expands multiclass classification models with new rates and partial concept classes.

problem Multiclass classification with a bounded number of labels under various conditions.
method Extends traditional PAC model to distribution-dependent and data-dependent learning rates, characterizes optimal rates for universal and partial concept classes.
result Characterizes three types of learning rates (exponential, linear, arbitrarily slow) for fixed distributions and complexity measures for partial concept classes.

Regularization and data augmentation can be class-dependent, leading to poor performance on some classes.

problem Class-dependent effects of regularization and data augmentation.
method Evaluation of regularization and data augmentation techniques on Imagenet and INaturalist datasets.
result Regularization and data augmentation can lead to significant performance drops on some classes.

ETGP improves multi-class classification efficiency.

problem Efficiently handling non-stationary, dependent multi-class classification problems.
method ETGP uses transformed Gaussian processes with efficient sparse variational inference.
result ETGPs outperform state-of-the-art methods in multi-class classification tasks.

Adversarial training is a useful approach to promote the learning of transferable representations across the source and target domains, which has been widely applied for domain adaptation (DA) tasks based on deep neural networks. Until very recently, existing adversarial domain adaptation (ADA) methods ignore the usefu…

2019-05-28abs ↗pdf ↗

This paper attempts to investigate the space of various characteristic classes for smooth manifold bundles with local system on the total space inducing a finite holonomy covering. These classes are known as twisted higher torsion classes. We will give a system of axioms that we require these cohomology classes to sati…

2012-11-16abs ↗pdf ↗

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…

2011-11-26abs ↗pdf ↗

A canonically defined mod 2 linear dependency current is associated to each collection of m sections of a real rank n vector bundle. This current is supported on the linear dependency set of the collection of sections. It is defined whenever the collection satisfies a weak measure theoretic condition called "atomicity"…

1996-09-17abs ↗pdf ↗

Paper tackles instance-dependent label noise by approximating it with part-dependent noise.

problem Learning with instance-dependent label noise is challenging.
method Approximate instance-dependent label noise with part-dependent noise. Use transition matrices for parts to model noise.
result Method outperforms state-of-the-art approaches for instance-dependent label noise.

The paper extends logistic regression for unbounded majority classes and derives asymptotic properties.

problem Infinitely imbalanced logistic regression inference.
method Derive a second order expansion for slope parameter under unbounded majority class.
result The second order term converges to a normal distribution with a variance depending only on the minority class's mean.

CopulaSMOTE addresses class imbalance in diabetes prediction models.

problem Class imbalance in diabetes prediction models, especially with fewer confirmed cases.
method Copula-based oversampling approach that models joint dependence structure.
result CopulaSMOTE improves minority-class recovery in larger diabetes datasets.

The paper develops a deep neural network estimator for weakly dependent processes with various loss functions.

problem Learning weakly dependent processes with a broad class of loss functions.
method Sparse-penalized deep neural networks with ψψ-weak dependence structure and θθ_\infty-coefficients.
result Oracle inequalities for the excess risk of the sparse-penalized deep neural networks estimators.

New empirical process bounds reveal trade-off between dependence and complexity in nonparametric learning.

problem Understanding generalization in nonparametric learning with temporal dependencies.
method Developed bounds on expected supremum of empirical processes under β/ρβ/ρ-mixing assumptions.
result Achieved rates similar to i.i.d. setting under long-range dependence with complex function classes.

New bounds explain modern machine learning algorithms' generalization.

problem Explaining generalization behavior of modern machine learning algorithms.
method Proposes a new complexity measure based on empirical Rademacher complexity of an algorithm- and data-dependent hypothesis class.
result Obtains novel bounds with finite fractal dimension, simplifies proofs, and recovers known results.

We introduce a new functional measure of tail dependence for weakly dependent (asymptotically independent) random vectors, termed weak tail dependence function. The new measure is defined at the level of copulas and we compute it for several copula families such as the Gaussian copula, copulas of a class of Gaussian mi…

2014-02-19abs ↗pdf ↗

Topological twists for 4d N=2 theories depend on spacetime type, gerbe connections, and generalized spin-c structures.

problem Defining topologically twisted partition functions for 4d N=2 theories.
method Topological twisting for general 4d N=2 theories, introducing generalized spin-c structures.
result Topological partition functions depend on spacetime type, gerbe connections, and generalized spin-c structures.

A new SSL method uses instance-dependent thresholds to improve accuracy.

problem Improving semi-supervised learning by better selecting confident unlabeled instances.
method Proposes instance-dependent thresholds that vary based on the ambiguity and error rates of pseudo-labels for each unlabeled instance.
result Demonstrates that instance-dependent thresholds provide a probabilistic guarantee for correct pseudo-labels.

We study types of mapping classes which arise as a product of a given mapping class and powers of certain pure mapping classes. We derive an explicit constant depending only on a surface such that almost all above pure mapping classes give rise to pseudo-Anosov type whenever their powers are larger than the constant. F…

2016-11-16abs ↗pdf ↗

Tautological classes, or generalised Miller-Morita-Mumford classes, are basic characteristic classes of smooth fibre bundles, and have recently been used to describe the rational cohomology of classifying spaces of diffeomorphism groups for several types of manifolds. We show that rationally tautological classes depend…

2017-05-17abs ↗pdf ↗

New control theory for self-path-dependent problems solves unique constraints.

problem Optimal control with self-path-dependent constraints in stochastic systems.
method Introduces new HJB equations for variational inequalities with historical maximum controls.
result Value functions are viscosity solutions to HJB equations under Lipschitz conditions.

The paper improves transformer generalization bounds using rank-dependent covering number bounds.

problem Improving generalization bounds for transformers.
method Introducing rank-dependent covering number bounds for linear function classes and applying them to transformers.
result Generalization error bounds for transformers decay as O(1/n)O(1/\sqrt{n}) and O(logrw)O(\log r_w), improving existing bounds.

A morph between two Riemannian nn-manifolds is an isotopy between them together with the set of all intermediate manifolds equipped with Riemannian metrics. We propose measures of the distortion produced by some classes of morphs and diffeomorphisms between two isotopic Riemannian nn-manifolds and, with respect to th…

2008-10-23abs ↗pdf ↗

The paper tackles robust control for insurance contracts under uncertain transition rates.

problem Maximizing utility in insurance contracts with uncertain transition rates.
method Novel robust utility maximization problem under bounded cumulative transition rate uncertainty, using worst-case scenario analysis.
result Existence and uniqueness of worst-case and best-case reserves for insurance contracts.

In this paper, we propose a new framework to study the generalization property of classifier chains trained over observations associated with multiple and interdependent class labels. The results are based on large deviation inequalities for Lipschitz functions of weakly dependent sequences proposed by Rio in 2000. We …

2018-07-26abs ↗pdf ↗

We investigate the ergodic problem of growth-rate maximization under a class of risk constraints in the context of incomplete, Itô-process models of financial markets with random ergodic coefficients. Including {\em value-at-risk} (VaR), {\em tail-value-at-risk} (TVaR), and {\em limited expected loss} (LEL), these cons…

2007-06-04abs ↗pdf ↗

We present a general construction for dependent random measures based on thinning Poisson processes on an augmented space. The framework is not restricted to dependent versions of a specific nonparametric model, but can be applied to all models that can be represented using completely random measures. Several existing …

2012-11-20abs ↗pdf ↗

Probabilistic linear discriminant analysis (PLDA) is a method used for biometric problems like speaker or face recognition that models the variability of the samples using two latent variables, one that depends on the class of the sample and another one that is assumed independent across samples and models the within-c…

2018-03-28abs ↗pdf ↗

The paper evaluates joint life insurance risk under dependence uncertainty using copulas and convex risk measures.

problem Evaluating risk of joint life insurance products under uncertainty in dependence structure.
method Monotonicity of risk evaluation with concordance order, linear programming for bounds, and numerical analysis.
result Bounds for mean, Value-at-Risk, and Expected Shortfall computed using linear programs.

Improves TTS accuracy by correcting context-dependent units.

problem Improves text-to-speech accuracy through speaker adaptation.
method Statistical model predicting context-dependent phonetic unit classes and their mean error values.
result Corrected boundaries of units improve TTS accuracy compared to HMM segmentation.

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 ↗

New model classes for function approximation by neural networks defined on domains.

problem Defining novel model classes for function approximation on bounded domains.
method Introducing weighted variation spaces to define new model classes on domains.
result New model classes are strictly larger than classical ones but maintain the same NNA rates.