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

Trend · papers per month

116231347462 · Jun 202019922001200920172026
48 results for dynamic classifiers

Dynamic classifier chains with XGBoost reduces multi-label classification costs and improves label dependency handling.

problem Static label ordering in multi-label classification limits model performance.
method Combining dynamic classifier chains with XGBoost for efficient multi-label prediction.
result Dynamic label ordering improves model performance and reduces training costs.

We give a survey of the approaches to classifying foliations, starting with the Haefliger classifying spaces and the various results and examples about the secondary classes of foliations. Various dynamical properties of foliations are introduced and discussed, including expansion rate, local entropy, and orbit growth …

2008-04-08abs ↗pdf ↗

Dynamic ensemble selection systems work by estimating the level of competence of each classifier from a pool of classifiers. Only the most competent ones are selected to classify a given test sample. This is achieved by defining a criterion to measure the level of competence of a base classifier, such as, its accuracy …

2018-09-30abs ↗pdf ↗

In this paper, we deal with the task of building a dynamic ensemble of chain classifiers for multi-label classification. To do so, we proposed two concepts of classifier chains algorithms that are able to change label order of the chain without rebuilding the entire model. Such modes allows anticipating the instance-sp…

2017-10-20abs ↗pdf ↗

A new classifier improves one-class predictions on unevenly sampled data.

problem Non-uniformly sampled data affects one-class classifier performance.
method Dynamic decision boundary based on minimum spanning tree.
result Proves effectiveness and robustness compared to state-of-the-art classifiers.

In this paper, we propose a novel dynamic ensemble selection framework using meta-learning. The framework is divided into three steps. In the first step, the pool of classifiers is generated from the training data. The second phase is responsible to extract the meta-features and train the meta-classifier. Five distinct…

2018-11-01abs ↗pdf ↗

Proposes dynamic model type recommendation for OLP technique.

problem Limited local competence of base-classifiers in uneven data distributions.
method Builds a multi-label meta-classifier to recommend model types based on local data complexity.
result Statistically similar performance to original OLP with fixed base-classifier model.

Realizations of stochastic process are often observed temporal data or functional data. There are growing interests in classification of dynamic or functional data. The basic feature of functional data is that the functional data have infinite dimensions and are highly correlated. An essential issue for classifying dyn…

2014-10-26abs ↗pdf ↗

A novel one-class classifier fusion method for robust anomaly detection.

problem Fundamental challenges in ensemble-based anomaly detection.
method Locally adaptive learning with dynamic ℓp-norm constraints and interior-point optimization.
result Significantly improved computational efficiency and superior performance across diverse anomaly types.

A dynamical analog of the prime ideals for simple non-commutative rings is introduced. We prove a factorization theorem for the dynamical ideals. The result is used to classify the surface knots and links in the smooth 4-dimensional manifolds.

2019-12-05abs ↗pdf ↗

A new method for reinforcement learning that adapts to different domains using auxiliary classifiers.

problem Training reinforcement learning agents to perform well in different domains with varying dynamics.
method Learning auxiliary classifiers to distinguish source-domain from target-domain transitions and modifying the reward function accordingly.
result The approach improves transfer performance in reinforcement learning tasks with varying dynamics.

The paper addresses fairness issues in screening classifiers, proposing within-group monotonicity to avoid unfair treatment of qualified candidates.

problem Within-group unfairness in screening classifiers using calibrated models.
method Introducing within-group monotonicity as a property to avoid unfair treatment and developing an efficient post-processing algorithm based on dynamic programming.
result Within-group monotonicity can be achieved efficiently and often at a small cost, improving fairness without significantly compromising prediction accuracy.

We use standard deep neural networks to classify univariate time series generated by discrete and continuous dynamical systems based on their chaotic or non-chaotic behaviour. Our approach to circumvent the lack of precise models for some of the most challenging real-life applications is to train different neural netwo…

2019-07-26abs ↗pdf ↗

Dynamic econometric models improve trading signals in momentum strategies.

problem Static momentum strategies are inefficient; dynamic models enhance accuracy.
method Dynamic binary classifier model to learn time-varying momentum importance.
result Dynamic classifier outperforms traditional naive time series momentum strategy.

We demonstrate the possibility of classifying causal systems into kinds that share a common structure without first constructing an explicit dynamical model or using prior knowledge of the system dynamics. The algorithmic ability to determine whether arbitrary systems are governed by causal relations of the same form o…

2016-12-15abs ↗pdf ↗

Paper combines RL with classifiers to improve financial trading strategies.

problem Enhancing risk-return trade-offs in trading strategies.
method Combining Reinforcement Learning (RL) models with traditional classifiers like SVM, Decision Trees, and Logistic Regression.
result Ensemble methods often outperform base models in risk-adjusted returns.

Deep nets trained with MSE loss exhibit Neural Collapse, collapsing features and classifiers to class means.

problem Understanding Neural Collapse in MSE-trained deep nets.
method Developed a new MSE loss decomposition and introduced the central path concept.
result Exact dynamics of Neural Collapse along the central path can be predicted.

We show the existence of a family of manifolds on which all (pointwise or absolutely) partially hyperbolic systems are dynamically coherent. This family is the set of 3-manifolds with nilpotent, non-abelian fundamental group. We further classify the partially hyperbolic systems on these manifolds up to leaf conjugacy. …

2013-02-03abs ↗pdf ↗

A novel model-selection method for dynamic networks using synthetic data.

problem Classifying and understanding the growth mechanisms of dynamic networks.
method Training a classifier on synthetic network data generated by nine random graph models, using dynamic features that count new links.
result Achieves near-perfect classification of synthetic networks, outperforming state-of-the-art methods.

DIVA clusters dynamic data without needing cluster count, outperforming baselines.

problem Clustering complex, dynamic data without prior knowledge of cluster count.
method Nonparametric Dirichlet Process Mixtures with memoized online variational inference.
result DIVA outperforms state-of-the-art in classifying complex data with changing features.

We present a general framework for classifying partially observed dynamical systems based on the idea of learning in the model space. In contrast to the existing approaches using model point estimates to represent individual data items, we employ posterior distributions over models, thus taking into account in a princi…

2016-07-07abs ↗pdf ↗

Study classifies stock price jumps as exogenous or endogenous using news data.

problem Differentiating between exogenous and endogenous price jumps.
method Synchronized news data with order book data to analyze stock price movements.
result Exogenous jumps are abrupt and follow a decaying power-law, while endogenous jumps are progressively accelerating.

The purpose of this paper is to establish a connection between various subjects such as dynamical r-matrices, Lie bialgebroids, and Lagrangian subalgebras. Our method relies on the theory of Dirac structures developed in dg-ga/9508013 and dg-ga/9611001. In particular, we give a new method of classifying dynamical r-mat…

1999-03-19abs ↗pdf ↗

DiwE uses regional distribution changes to create diverse ensemble classifiers for concept drift.

problem Handling concept drift in evolving data streams.
method DiwE measures diversity based on regional distribution disagreement and uses it to weight instances and select classifiers.
result DiwE outperforms other algorithms on various synthetic and real-world data stream benchmarks.

The dynamic time warping (dtw) distance fails to satisfy the triangle inequality and the identity of indiscernibles. As a consequence, the dtw-distance is not warping-invariant, which in turn results in peculiarities in data mining applications. This article converts the dtw-distance to a semi-metric and shows that its…

2018-08-29abs ↗pdf ↗

We propose and systematically evaluate three strategies for training dynamically-routed artificial neural networks: graphs of learned transformations through which different input signals may take different paths. Though some approaches have advantages over others, the resulting networks are often qualitatively similar…

2017-03-17abs ↗pdf ↗

Scaling feature values is an important step in numerous machine learning tasks. Different features can have different value ranges and some form of a feature scaling is often required in order to learn an accurate classifier. However, feature scaling is conducted as a preprocessing task prior to learning. This is probl…

2014-07-28abs ↗pdf ↗

The recently proposed Minimal Complexity Machine (MCM) finds a hyperplane classifier by minimizing an exact bound on the Vapnik-Chervonenkis (VC) dimension. The VC dimension measures the capacity of a learning machine, and a smaller VC dimension leads to improved generalization. On many benchmark datasets, the MCM gene…

2015-03-11abs ↗pdf ↗

This work introduces two strategies for training network classifiers with heterogeneous agents. One strategy promotes global smoothing over the graph and a second strategy promotes local smoothing over neighbourhoods. It is assumed that the feature sizes can vary from one agent to another, with some agents observing in…

2019-10-30abs ↗pdf ↗

A method uses non-autonomous equations to classify time signals efficiently.

problem Time signal classification with minimal parameters and high accuracy.
method Develops a framework using non-autonomous dynamical equations to classify time signals.
result The method achieves comparable accuracy with fewer parameters than existing methods.

Dynamic Ensemble Selection (DES) techniques aim to select locally competent classifiers for the classification of each new test sample. Most DES techniques estimate the competence of classifiers using a given criterion over the region of competence of the test sample (its the nearest neighbors in the validation set). T…

2018-04-18abs ↗pdf ↗

In this paper, we put the issue of dynamic equivalence of control systems in the context of pullbacks of coframings on infinite jet bundles over the state manifolds. While much attention has been given to differentially flat systems, i.e. systems dynamically equivalent to linear control systems, the advantage of this a…

2011-06-27abs ↗pdf ↗