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

3672107143 · Jun 202019922001200920172026
48 results for clustering failure

Study predicts heart failure patient survival using stacked ensemble ML.

problem Predicting survival of heart failure patients.
method Collect and analyze patient data, apply SMOTE, use K-Means, Fuzzy C-Means clustering, Random Forest, XGBoost, Decision Tree, and propose a stacked ensemble model.
result Supervised ML algorithms outperform unsupervised models, achieving high accuracy and F1 score.

Error-robust multi-view clustering tackles noisy data across multiple sources.

problem Error in multi-view data degrades clustering performance.
method Blind clustering without error consideration is ineffective. Various approaches like sparsity, graph, subspace, and deep learning are reviewed.
result Error-robust multi-view clustering improves clustering accuracy even with corrupted data.

Framework predicts remaining useful life of DSH subsystems under unknown failure modes.

problem Predicting remaining useful life of DSH subsystems with unknown failure modes.
method Unsupervised framework using mixture of Gaussian regressions and Expectation-Maximization algorithm.
result Improved prediction accuracy and interpretability of RUL.

Improves DPGMM sampler by better initializing subclusters for more effective clustering.

problem Poor initialization of subclusters leads to ineffective sampling and clustering.
method Proposed heuristic and deep learning-based methods to improve subcluster initialization.
result Better splits lead to improved performance, results, and stability.

A new machine learning method calculates failure probability efficiently and accurately.

problem Computing the probability of failure for complex systems.
method Penalized Profile Support Vector Machine with adaptive sampling and clustering.
result The method minimizes model evaluations while preserving decision boundary geometry.

We develop a model to cluster time-series data with interval censoring, improving disease phenotyping.

problem Noise and interval censoring hinder clustering in disease phenotyping.
method Deep generative, continuous-time model that clusters time-series data while correcting for censorship.
result Our model corrects for interval censoring and recovers known clinical subtypes.

This paper focuses on obtaining clustering information about a distribution from its i.i.d. samples. We develop theoretical results to understand and use clustering information contained in the eigenvectors of data adjacency matrices based on a radial kernel function with a sufficiently fast tail decay. In particular, …

2008-07-23abs ↗pdf ↗

This paper uses the relationship between graph conductance and spectral clustering to study (i) the failures of spectral clustering and (ii) the benefits of regularization. The explanation is simple. Sparse and stochastic graphs create a lot of small trees that are connected to the core of the graph by only one edge. G…

2018-06-05abs ↗pdf ↗

The paper breaks down AUC into cluster-level components for better model diagnostics.

problem Global AUC masks weaknesses in specific subpopulations, leading to financial or operational risks.
method Formal decomposition of AUC into intra- and inter-cluster components, comparing with other performance metrics.
result Allows practitioners to evaluate and diagnose model performance within and across clusters.

DIVI clusters noisy high-dimensional data with stable feature gating.

problem Challenging clustering in high-dimensional noisy data.
method Data-informed variational clustering framework combining global feature gating and adaptive structure growth.
result DIVI performs competitively under severe feature noise and remains computationally feasible.

CSTS benchmarks time series clustering by evaluating correlation structures.

problem Lack of validated ground truth for objectively assessing clustering quality.
method Synthetic benchmark CSTS for evaluating correlation structures in multivariate time series data.
result CSTS enables precise diagnosis of methodological limitations in correlation-based time series clustering.

Cryptocurrency markets show similar returns but different volatility responses to infrastructure and regulatory shocks.

problem Understanding how cryptocurrency markets differentiate between infrastructure and regulatory shocks.
method Event-level block bootstrap inference on 31 cryptocurrency events across Bitcoin, Ethereum, Solana, and Cardano (2019-2025).
result No statistically significant difference in cumulative abnormal returns between infrastructure failures and regulatory enforcement.

This study examines non-retail trading on Polymarket, revealing unique behavior patterns and structural limitations.

problem Lack of address-level quote-lifecycle data in Polymarket prediction markets.
method Empirical analysis of 13 million order-filled events using DBSCAN clustering on a six-feature fill-side vector.
result Non-retail behavior is uni-modal, contradicting previous archetypal hypotheses.

We study large deviations and rare default clustering events in a dynamic large heterogeneous portfolio of interconnected components. Defaults come as Poisson events and the default intensities of the different components in the system interact through the empirical default rate and via systematic effects that are comm…

2013-11-03abs ↗pdf ↗

Factor analysis or sometimes referred to as variable analysis has been extensively used in classification problems for identifying specific factors that are significant to particular classes. This type of analysis has been widely used in application such as customer segmentation, medical research, network traffic, imag…

2019-04-30abs ↗pdf ↗

Economics tool predicts failure times in reliability systems.

problem Predicting optimal failure times in weighted k-out-of-n reliability systems with heterogeneous component failure.
method Using rational expectations to analyze and predict failure times in reliability systems with heterogeneous component failure.
result Different measures are optimal for predicting system failure depending on component failure distributions.

Unified model predicts multi-mode failure with multi-sensor data.

problem Independent failure mode and RUL prediction ignores inherent relationship.
method Hierarchical Bayesian framework with Cox model, Gaussian process, and multinomial distributions.
result Robust uncertainty quantification and accurate prediction of multi-mode failure.

CalNF models rare failures with limited data, improving safety in autonomous systems.

problem Challenges in modeling and debugging rare safety-critical failures due to limited data.
method CalNF, a self-regularized framework for posterior learning from limited data.
result Achieves state-of-the-art performance on data-limited failure modeling and inverse problems.

Prognostics and Health Management (PHM) is an emerging engineering discipline which is concerned with the analysis and prediction of equipment health and performance. One of the key challenges in PHM is to accurately predict impending failures in the equipment. In recent years, solutions for failure prediction have evo…

2019-10-04abs ↗pdf ↗

This work improves safety validation of autonomous vehicles by finding interpretable failures.

problem Finding interpretable failures of autonomous systems in simulation.
method Signal temporal logic expressions optimized for high likelihood and human interpretability.
result Our methodology finds more interpretable failures with higher likelihood compared to baseline approaches.

The paper calculates the likelihood of a financial market failure involving multiple major banks.

problem Estimating the probability of a market failure involving multiple globally important banks.
method Multivariate Cox process across G-SIBs, deriving various theorems on market failure probabilities.
result The probability of a market failure increases with the number of G-SIBs and is inevitable if there are too many.

Paper proposes a method to predict disk failures using multi-layer domain adaptive learning.

problem Traditional machine learning models struggle to predict disk failures due to limited data.
method Multi-layer domain adaptive learning with source and target domains.
result The proposed method improves failure prediction accuracy on disk data with few failure samples.

We aim to predict and explain service failures in supply-chain networks, more precisely among last-mile pickup and delivery services to customers. We analyze a dataset of 500,000 services using (1) supervised classification with Random Forests, and (2) Association Rules. Our classifier reaches an average sensitivity of…

2018-10-20abs ↗pdf ↗

New framework learns complex AI attitudes from heterogeneous data.

problem Heterogeneous ordinal structure in AI attitudes, poorly captured by existing methods.
method Monotone Gaussian score embedding, BNP complexity discovery, confirmatory fixed-K estimation.
result Reduced holdout MSE by 25.8% over single-graph baseline.

New method identifies shared topics in LLM inputs and outputs for better detection of hallucinations.

problem Detecting semantic drift in LLM responses from context.
method Transformed Deterministic Information Bottleneck (DIB) into UDIB for high-dimensional data.
result UDIB generates more informative topic representations for SDM, improving hallucination detection.

New method avoids failures in physics-constrained systems using active learning.

problem Handling fatal failures in systems governed by physics constraints.
method Develops a novel active learning method that considers implicit physics constraints.
result Achieves zero-failure in composite fuselage assembly process without explicit failure regions.

In the last two years, more than 200 papers have been written on how machine learning (ML) systems can fail because of adversarial attacks on the algorithms and data; this number balloons if we were to incorporate papers covering non-adversarial failure modes. The spate of papers has made it difficult for ML practition…

2019-11-25abs ↗pdf ↗

New method finds failures in high-fidelity simulators with fewer steps.

problem Finding failures in high-fidelity simulators is expensive and impractical.
method Adaptive stress testing with backward algorithm adaptation from low-fidelity to high-fidelity.
result Significantly fewer high-fidelity simulation steps needed to find failures.

Entropy-based GP adaptive design improves failure probability estimation.

problem Limited accuracy in failure probability estimation due to model evaluation costs.
method Entropy-based Gaussian process (GP) adaptive design combined with multifidelity importance sampling (MFIS).
result More accurate failure probability estimates and higher confidence.

Brain uses synaptic failure to sample from posterior distributions.

problem Bayesian inference in the brain's probabilistic computations.
method Adapting synaptic failure to sample posterior predictive distributions.
result Synaptic failure enables sampling of complete posterior predictive distributions.

Study constructs balanced datasets for seismic failure prediction.

problem Imbalanced datasets limit machine learning performance in seismic failure prediction.
method Framework with three steps: GMF identification, probability density estimation, and sample transformation.
result Framework improves machine learning performance in seismic failure mode prediction.

Proposes a deep neural network for early disk drive failure prediction.

problem Early prediction of disk drive failure using multivariate time series sensor data.
method Enriched features derived from sensor data through transformations, combined with ensemble learning and deep neural network architecture.
result Significantly improved classification accuracy in predicting disk drive failure.

Improves FI-PINNs by combining re-sampling and subset simulation for better failure probability estimation.

problem Estimating failure probability in physics-informed neural networks (PINNs).
method Adaptive sampling with re-sampling and subset simulation, using cosine-annealing for uniform to adaptive transition.
result Significant improvement in estimating failure probability and generating new training points in the failure region.