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

3773110146 · Jun 202019922001200920172026
48 results for qualitative clustering

A new method clusters qualitative data with mixed variables, improving interpretability.

problem Clustering qualitative data with context and high-dimensional mixed datasets.
method Hierarchical Qualitative Clustering (HQC) using Maximum Mean Discrepancy.
result HQC maintains interpretability of qualitative information and clusters effectively.

This paper introduces a new method to cluster qualitative attribute data using tree structures.

problem Clustering qualitative attribute data, especially when values are not in Euclidean space.
method Developed a joint learning mechanism to iteratively learn trees representing qualitative values' order relationships.
result The joint learning mechanism successfully clusters qualitative attribute data, yielding accurate results.

We present an accelerated algorithm for hierarchical density based clustering. Our new algorithm improves upon HDBSCAN*, which itself provided a significant qualitative improvement over the popular DBSCAN algorithm. The accelerated HDBSCAN* algorithm provides comparable performance to DBSCAN, while supporting variable …

2017-05-20abs ↗pdf ↗

Ridge regression shows different behaviors in binary classification with noisy labels.

problem Binary classification with noisy labels and anisotropic cluster distributions.
method Investigation of ridge regression behavior in overparameterized settings with label noise.
result Ridge regression exhibits qualitatively different behavior based on the scale of cluster mean vectors and covariance matrices.

Meta-causal states group equivalent qualitative causal dynamics, useful for analyzing system changes.

problem Qualitative changes in causal relationships due to agent actions or environmental tipping points.
method Propose meta-causal states to group causal models based on equivalent qualitative behavior and parameterize specific mechanisms.
result Meta-causal states can be inferred from observed agent behavior and disentangled from unlabeled data.

GCML preserves geometric structure in manifold clustering for diverse data types.

problem Loss functions in manifold clustering can corrupt latent space structure.
method GCML framework with isometric and ranking losses for geometric structure preservation.
result GCML outperforms other methods in latent space structure preservation and performance metrics.

GMMSEQ clusters AE data streams, identifying cluster onsets and growth.

problem Clustering unlabeled AE data with onsets and growth information.
method Modified Gaussian Mixture Models (GMM) with an objective function for AE timestamps.
result GMMSEQ provides better cluster characterization than standard methods.

DETECT clusters mobility behaviors from trajectories using deep learning.

problem Clustering similar mobility behaviors in large, complex trajectory data.
method DETECT uses deep learning to cluster mobility behaviors from trajectories, transforming and summarizing them to identify similar behaviors.
result DETECT effectively clusters mobility behaviors from real-world datasets.

We map stock market interactions to spin models to recover their hierarchical structure using a simulated annealing based Super-Paramagnetic Clustering (SPC) algorithm. This is directly compared to a modified implementation of a maximum likelihood approach we call Fast Super-Paramagnetic Clustering (f-SPC). The methods…

2018-10-05abs ↗pdf ↗

Stationarity is a very general, qualitative assumption, that can be assessed on the basis of application specifics. It is thus a rather attractive assumption to base statistical analysis on, especially for problems for which less general qualitative assumptions, such as independence or finite memory, clearly fail. Howe…

2019-03-30abs ↗pdf ↗

AUC used as a measure of clustering quality in unsupervised learning.

problem Using AUC to evaluate clustering quality in unsupervised learning.
method Developed AUCC as a measure of clustering quality, derived theoretical expected values, and compared with Gamma criterion.
result AUCC has a consistent expected value under random clustering, making it a reliable measure.

Clustering samples according to an effective metric and/or vector space representation is a challenging unsupervised learning task with a wide spectrum of applications. Among several clustering algorithms, k-means and its kernelized version have still a wide audience because of their conceptual simplicity and efficacy.…

2017-10-09abs ↗pdf ↗

Derives a pricing formula for VIX options using a new stochastic volatility model.

problem Pricing VIX options under a new stochastic volatility model with volatility clustering.
method Derives a semi-analytical pricing formula using the Heston-Hawkes model with an independent compound Hawkes process.
result Derives an explicit expression for VIX^2 as a linear combination of variance and Hawkes intensity.

We introduce an algorithmic method for population anomaly detection based on gaussianization through an adversarial autoencoder. This method is applicable to detection of `soft' anomalies in arbitrarily distributed highly-dimensional data. A soft, or population, anomaly is characterized by a shift in the distribution o…

2018-05-05abs ↗pdf ↗

A new geometrically-motivated algorithm for nonnegative matrix factorization is developed and applied to the discovery of latent "topics" for text and image "document" corpora. The algorithm is based on robustly finding and clustering extreme points of empirical cross-document word-frequencies that correspond to novel …

2013-01-05abs ↗pdf ↗

The paper improves precision matrix estimation by SLOPE, especially in high-dimensional settings.

problem Estimating precision matrices with structured edge patterns.
method Graphical SLOPE, focusing on sparsity and cluster recovery.
result The method converges to the optimal solution and accurately identifies cluster structures.

Learning image representations to capture fine-grained semantics has been a challenging and important task enabling many applications such as image search and clustering. In this paper, we present Graph-Regularized Image Semantic Embedding (Graph-RISE), a large-scale neural graph learning framework that allows us to tr…

2019-02-14abs ↗pdf ↗

Unsupervised model generates distinct intonation codes for speech synthesis.

problem Lack of understanding of what prosodic variations are controlled in speech synthesis.
method Phrase-level variational autoencoder with multi-modal prior, using mode centres as intonation codes.
result Generated intonation codes are perceptually distinct and carry various affect-related styles.

We formulate and study a novel multi-armed bandit problem called the qualitative dueling bandit (QDB) problem, where an agent observes not numeric but qualitative feedback by pulling each arm. We employ the same regret as the dueling bandit (DB) problem where the duel is carried out by comparing the qualitative feedbac…

2018-09-14abs ↗pdf ↗

Bayesian entity resolution merges together multiple, noisy databases and returns the minimal collection of unique individuals represented, together with their true, latent record values. Bayesian methods allow flexible generative models that share power across databases as well as principled quantification of uncertain…

2014-10-17abs ↗pdf ↗

We present a theoretical and empirical study of the gradient dynamics of overparameterized shallow ReLU networks with one-dimensional input, solving least-squares interpolation. We show that the gradient dynamics of such networks are determined by the gradient flow in a non-redundant parameterization of the network fun…

2019-06-18abs ↗pdf ↗

The study examines how model predictions hold up under model extensions.

problem Model predictions may not be robust under model extensions, limiting their applicability.
method The study uses causal ordering to assess robustness of qualitative model predictions and characterizes model extensions that preserve predictions.
result Conditions and techniques are provided to assess robustness of model predictions under model extensions.

With the advent of Web 2.0, various types of data are being produced every day. This has led to the revolution of big data. Huge amount of structured and unstructured data are produced in financial markets. Processing these data could help an investor to make an informed investment decision. In this paper, a framework …

2018-11-17abs ↗pdf ↗

Support vector machines have attracted much attention in theoretical and in applied statistics. Main topics of recent interest are consistency, learning rates and robustness. In this article, it is shown that support vector machines are qualitatively robust. Since support vector machines can be represented by a functio…

2009-12-04abs ↗pdf ↗

LMGPs extend GPs to handle mixed data, offering better accuracy and interpretability.

problem Handling mixed data types (quantitative and qualitative) in metamodeling.
method Introduce LMGPs that learn a latent manifold for qualitative inputs, using a low-rank linear map.
result LMGPs outperform existing methods in accuracy and versatility.

Modeling financial market dynamics with noise and fundamentalist agents.

problem Understanding opinion formation and market behavior in financial markets.
method Agent-based model with Erdös-Rényi random graph structure, incorporating anxiety parameter.
result Model accurately reproduces key market features like fat-tailed returns and volatility clustering.

Develops fully Bayesian LVGP for better uncertainty quantification.

problem Uncertainty in qualitative inputs for GP models.
method Maps qualitative inputs to latent variables, uses standard GP over LVs, estimates LVs through ML, develops fully Bayesian approach.
result Significant improvements in prediction accuracy and uncertainty quantification over plug-in approach.

New method prevents class collapse in metric learning with margin-based losses.

problem Class collapse in metric learning due to diverse intra-class samples.
method Proposed a sampling method to select nearest same-class samples as positive elements in tuple.
result Demonstrated clear benefits on various fine-grained image retrieval datasets.

GPs' decisions can vary significantly with different kernels, even if kernels are qualitatively similar.

problem Robustness of GP decisions to kernel choice.
method Solved a constrained optimization problem over a finite-dimensional space to identify changes in GP decisions.
result Decisions made with a GP can be non-robust to kernel choice, even with qualitatively similar kernels.