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

5.2%10.4%15.5%20.7% · May 202619922001200920172026
48 results for consistent detection

CCE improves anomaly detection metrics by measuring both confidence and consistency.

problem Existing anomaly detection metrics lack discriminative power, hyperparameter dependency, and robustness to perturbations.
method CCE uses Bayesian estimation to quantify uncertainty and constructs global and event-level confidence and consistency scores.
result CCE demonstrates strict boundedness, robustness, and linear time complexity.

New algorithms improve community detection in network data with strong consistency.

problem Challenges in effectively adapting spectral clustering techniques and achieving strong consistency in label recovery.
method Proposed Thresholded Cosine Spectral Clustering (TCSC) and one-step Refined TCSC algorithms, with strong consistency proofs.
result One-step Refined TCSC achieves strong consistency in community detection under PABM, correctly recovering all labels with high probability.

Dissertation tackles zero-shot anomaly detection, focusing on consistent anomalies and proposing CoDeGraph framework.

problem Consistent anomalies bias distance-based zero-shot anomaly detection methods.
method Formalized consistent anomalies, identified similarity scaling and neighbor-burnout phenomena, introduced CoDeGraph framework.
result CoDeGraph effectively suppresses consistent anomalies in zero-shot anomaly detection.

Often the challenge associated with tasks like fraud and spam detection[1] is the lack of all likely patterns needed to train suitable supervised learning models. In order to overcome this limitation, such tasks are attempted as outlier or anomaly detection tasks. We also hypothesize that out- liers have behavioral pat…

2017-12-12abs ↗pdf ↗

Enhash detects concept drift in data streams quickly and efficiently.

problem Detecting abrupt, gradual, virtual, or recurring events in data streams.
method Uses projection hash to insert incoming samples and detects concept drift.
result Enhash has competitive performance and moderate resource requirements compared to existing ensemble learners.

New method detects inconsistencies in AHP matrices using triadic preference reversals.

problem Challenges in assessing consistency in AHP pairwise comparison matrices.
method Triadic preference reversals to detect inconsistencies between pairs of elements.
result 97% accuracy in detecting inconsistencies, significantly surpassing traditional methods.

PyChEst detects changes in non-stationary time series without distributional assumptions.

problem Detecting changes in non-stationary time series data.
method Nonparametric algorithms for consistent detection of multiple changepoints in piece-wise stationary processes.
result PyChEst consistently detects changes without distributional assumptions.

Study on detecting hierarchical community structures in networks.

problem Detecting hierarchical community structures in networks.
method Analysis of planted hierarchies of partitions in networks, identifying additional detectability phases.
result There are additional phases in which the presence of multiple consistent partitions can either help or hinder detection of hierarchical structures.

One of the most fundamental problems in network study is community detection. The stochastic block model (SBM) is a widely used model, for which various estimation methods have been developed with their community detection consistency results unveiled. However, the SBM is restricted by the strong assumption that all no…

2018-07-10abs ↗pdf ↗

GEM detects malicious accounts using adaptive embeddings from heterogeneous graphs.

problem Detecting malicious accounts on a leading mobile payment platform.
method Adaptive learning of discriminative embeddings from heterogeneous account-device graphs with attention mechanism for node importance.
result GEM consistently outperforms competitive methods in detecting malicious accounts.

New method detects communities in hypergraphs by embedding them into a vector space.

problem Detecting communities in hypergraphs with multi-way interactions.
method Augmenting non-uniform hypergraphs, embedding into a vector space, using an alternative updating scheme.
result Asymptotic consistencies in community detection and hypergraph estimation established.

Proposes a method to detect anomalies in multi-subgroup normal data.

problem Anomaly detection with limited labeled anomalies and multi-subgroup normal data.
method Learn multi-normal prototypes with deep embedding clustering and contrastive learning. Estimate the likelihood of unlabeled samples being normal during training.
result Superior performance compared to state-of-the-art methods on various datasets.

This paper surveys recent theoretical advances in convex optimization approaches for community detection. We introduce some important theoretical techniques and results for establishing the consistency of convex community detection under various statistical models. In particular, we discuss the basic techniques based o…

2018-09-30abs ↗pdf ↗

Paper proposes a method to detect fair communities in graphs considering demographic attributes.

problem Inconsistent community detection violates fairness constraints for nodes with demographic attributes.
method Develops an 1\ell_1-regularized pseudo-likelihood approach for fair graphical model selection.
result The method ensures demographic groups are fairly represented within detected communities.

Paper describes anomaly detection and explainability for multivariate functional data.

problem Anomaly detection and explainability in multivariate functional data.
method Transform series into features, use Isolation Forest, compute SHAP coefficients, and use supervised decision tree.
result Method performs well on simulated and real industry data.

The A-polynomial of a manifold whose boundary consists of a single torus is generalised to an eigenvalue variety of a manifold whose boundary consists of a finite number of tori, and the set of strongly detected boundary curves is determined by Bergman's logarithmic limit set, which describes the exponential behaviour …

2003-06-03abs ↗pdf ↗

Study detects boundaries in unlabeled noisy images without labels.

problem Detecting boundaries in unlabeled noisy images without labels.
method Proposed a continuous hinge-type surrogate loss for boundary detection, combined with deep neural networks.
result Deep neural network achieves minimax-optimal boundary recovery rate under piecewise smooth boundary model.

Evaluates change point detection algorithms on real-world data.

problem Insufficient evaluation of change point detection algorithms on real-world time series.
method Developed a data set of 37 time series from various domains, annotated by human experts, and evaluated 14 algorithms using consistency metrics.
result Demonstrates the need for better evaluation methods in change point detection.

Spectral clustering achieves strong consistency in the stochastic block model under certain conditions.

problem Achieving strong consistency in spectral clustering for the stochastic block model.
method Entrywise analysis of the Fielder eigenvector of graph Laplacians.
result Spectral clustering achieves exact recovery of hidden communities under matching information-theoretic limits.

Community detection is a central problem of network data analysis. Given a network, the goal of community detection is to partition the network nodes into a small number of clusters, which could often help reveal interesting structures. The present paper studies community detection in Degree-Corrected Block Models (DCB…

2016-07-24abs ↗pdf ↗

We present local ensembles, a method for detecting underspecification -- when many possible predictors are consistent with the training data and model class -- at test time in a pre-trained model. Our method uses local second-order information to approximate the variance of predictions across an ensemble of models from…

2019-10-21abs ↗pdf ↗

ARMS automates fraud detection rules to improve efficiency and accuracy.

problem Maintaining effective fraud detection rules over time and reducing manual review.
method ARMS uses heuristic search and a user-defined loss-function to optimize and manage rules.
result ARMS can maintain original systems' performance with only a fraction of the rules.

Many methods have been proposed for community detection in networks, but most of them do not take into account additional information on the nodes that is often available in practice. In this paper, we propose a new joint community detection criterion that uses both the network edge information and the node features to…

2015-09-03abs ↗pdf ↗

Method detects jumps in high-frequency order prices using local minima.

problem Detecting jumps in high-frequency order prices with noisy data.
method Developed methods to estimate, locate and test for jumps using local minima of best ask quotes.
result Consistently estimated jump sizes and times, established asymptotic properties of tests, and demonstrated faster convergence rates.

Out-of-distribution (OoD) detection is a natural downstream task for deep generative models, due to their ability to learn the input probability distribution. There are mainly two classes of approaches for OoD detection using deep generative models, viz., based on likelihood measure and the reconstruction loss. However…

2019-07-10abs ↗pdf ↗