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.

169,291 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Sep 199219922001200920182026
48 results for dependence detection

Enhances social spam detection using multi-level dependency of relational sequences.

problem Social spam detection in multi-relation social networks.
method Developed the Multi-level Dependency Model (MDM) to exploit long-term and short-term dependencies in user relational sequences.
result MDM improves social spam detection accuracy on a real-world multi-relational social network.

TADA detects anomalies in time series using topological data analysis.

problem Detecting global changes in dependency structure between channels in multivariate time series.
method Topological Data Analysis for detecting anomalies in multivariate time series.
result The approach is more suitable for detecting global changes of correlation structures than existing methods.

Paper introduces CIM for detecting dependence and monotonicity between stochastic signals.

problem Detecting the strength and monotonicity structure of dependence between stochastic signals.
method Nonparametric copula-based index (CIM) that satisfies desirable properties of measures of association.
result CIM shows favorable performance in detecting monotonicity and dependence in real-world data.

Paper introduces an unsupervised tensor-based anomaly detection method for spatiotemporal data.

problem Challenges in detecting anomalies in spatiotemporal data, especially in urban traffic monitoring and medical imaging.
method Formulates anomaly detection as a regularized robust low-rank + sparse tensor decomposition, incorporating spatiotemporal smoothness and local dependencies.
result Demonstrates improved anomaly detection performance on both synthetic and real data.

EHBOS enhances HBOS by capturing feature interactions, improving anomaly detection.

problem Limited ability of HBOS to detect anomalies in datasets with feature interactions.
method Incorporates two-dimensional histograms to capture feature pair dependencies.
result EHBOS outperforms HBOS on datasets with critical feature interactions, achieving notable improvements in ROC AUC.

New rules control false discoveries in online anomaly detection for time series data.

problem Controlling false discoveries in anomaly detection for time series data.
method Novel online false discovery rate control (FDRC) rules for time series anomaly detection.
result Ensures high power in detecting anomalies even when the alternative is rare and test statistics are serially dependent.

CDDN tackles visual relationship detection with context-dependent diffusion networks.

problem Combustion of combinatorial explosion in relation triplets detection.
method CDDN framework using semantic and visual scene graphs for adaptive information aggregation.
result CDDN achieves state-of-the-art performance on visual relationship detection datasets.

New measure detects direct causal influences and captures strong dependencies.

problem Shortcomings of existing dependency measures in detecting direct causal influences and group selection.
method Inspired by Dobrushin's coefficients, the measure uses conditional distribution properties.
result Advantages over related measures in detecting dependencies and causal influences.

This short note suggests a heuristic method for detecting the dependence of random time series that can be used in the case when this dependence is relatively weak and such that the traditional methods are not effective. The method requires to compare some special functionals on the sample characteristic functions with…

2010-10-13abs ↗pdf ↗

Unsupervised two-view learning, or detection of dependencies between two paired data sets, is typically done by some variant of canonical correlation analysis (CCA). CCA searches for a linear projection for each view, such that the correlations between the projections are maximized. The solution is invariant to any lin…

2011-01-31abs ↗pdf ↗

New method aggregates Gaussian experts by detecting conditional independence violations.

problem Aggregation of dependent Gaussian experts leads to sub-optimal solutions.
method Uses Gaussian graphical model to detect and correct conditional independence violations.
result Improves aggregation of Gaussian experts, outperforming SOTA DGP approaches.

A new framework combines CNN and GRU for better structural damage detection.

problem Improving damage detection in structural engineering using machine learning.
method Hierarchical CNN and Gated Recurrent Unit (GRU) framework to model spatial and temporal relations.
result The proposed HCG framework significantly outperforms existing methods for structural damage detection.

IDK improves anomaly detection for points and groups without explicit learning.

problem Anomaly detection for points and groups using kernel methods.
method Isolation Distributional Kernel (IDK) addresses data independence and intractable dimensionality issues.
result IDK outperforms existing methods for both point and group anomaly detection.

Paper models graph edge dependencies using latent variables for community detection.

problem Graphs' edge dependencies not fully explained by community membership.
method Introduces auxiliary latent variables to model edge dependencies and analyzes conditions for exact recovery.
result Exact recovery possible by semidefinite programming down to maximum likelihood threshold.

Proposes a model to detect changes in multivariate time series data.

problem Detect abrupt changes in multivariate time series data considering dependencies and correlations.
method Integrates graph neural networks into an encoder-decoder framework to model correlation structures and dynamics.
result Advantageous performance on CPD tasks over strong baselines, classifying changes as correlation or independent.

A new method detects interactions in machine learning models.

problem Interpreting non-linear and interaction effects in machine learning models.
method Regional effect plots with implicit interaction detection.
result The method quantifies and interprets feature effects reliably, less confounded by interactions.

BAM model learns graph structure from data with robustness across linear and non-linear dependencies.

problem Detecting dependencies in datasets for graph structure learning.
method Proposes BAM, a neural network model using structural equation models and Chebyshev polynomials for training, with bilinear attention mechanism.
result Demonstrates robust generalizability and superior performance in graph estimation.

Paper proposes method to detect dependencies in large, sparse datasets.

problem Detecting true predictive relationships in large, sparse datasets with missing values.
method Combines probabilistic programming, information theory, and non-parametric Bayes.
result Shows improved sensitivity and specificity over baselines from statistics and machine learning.

Better signal detection in undersampled data using joint and cross covariances.

problem Detecting shared signals in high-dimensional data with limited samples.
method Analysis of three covariance matrices: individual, cross, and joint.
result Joint and cross covariance matrices detect signals earlier than individual covariances.

Deep learning generates efficient change-point detection methods.

problem Detecting change-points in data with various types of change and data behavior.
method Train a neural network to automatically generate detection methods.
result Neural network-based methods are competitive and outperform standard methods in various noise conditions.

Detects and explains anomalies in non-i.i.d data with latent-class dependencies.

problem Detecting and explaining anomalies in data with latent-class dependencies.
method Derives SVDD method to handle latent-class dependency structure, provides probabilistic interpretation.
result Demonstrates effectiveness on real-world offshore data.

New framework improves text watermark detection under imperfect pseudorandomness.

problem Structured dependence in generated text from language models causes Type I error control issues.
method Hierarchical two-layer partition, minimal units, non-asymptotic efficiency measure, minimax hypothesis testing.
result Closed-form optimal rules for watermark detection under imperfect pseudorandomness.

This work improves independence tests for high-dimensional data.

problem Detecting subtle dependencies between high-dimensional random variables with complex distributions.
method Develops two approaches to learn powerful independence tests using variational mutual information and HSIC.
result Optimized HSIC tests generally outperform other approaches on detecting structured dependence.

New algorithm detects tensor dependence structure alterations efficiently.

problem Detecting alterations in tensor dependence structures.
method Tensor-normal distributions, decorrelation, centralization, SERA (Sparsity-Exploited Reranking Algorithm).
result The proposed SERA algorithm controls false discovery rates effectively.

Exact recovery method for community detection in Gaussian mixtures with dependent noise.

problem Community detection in Gaussian mixtures with dependent and heterogeneous noise.
method Maximum likelihood estimator (MLE) for constrained quadratic optimization problem, using ΣΣ-whitened separation and local inequalities.
result Sharp exact-recovery threshold and no-gap mechanism in the unknown-size setting.

C-PP-COAD detects anomalies with limited real data, reducing dependency on real calibration data.

problem Limited real calibration data for online anomaly detection.
method Context-aware prediction-powered conformal online anomaly detection (C-PP-COAD).
result Significantly reduces dependency on real calibration data without compromising FDR control.

The paper proposes a method to detect relevant model degradations without over-alerting.

problem Detecting meaningful changes in machine learning model performance over time.
method Sequential monitoring scheme accounting for temporal dependence and multiple testing issues.
result The proposed method outperforms benchmark methods in detecting relevant changes in model quality.

The paper argues that normalized mutual information is biased in clustering and community detection.

problem Bias in normalized mutual information for clustering and community detection.
method Introducing a modified version of mutual information to correct for information content and spurious dependence.
result The modified mutual information leads to different conclusions about which algorithms are best for community detection.

We proposed a new statistical dependency measure called Copula Dependency Coefficient(CDC) for two sets of variables based on copula. It is robust to outliers, easy to implement, powerful and appropriate to high-dimensional variables. These properties are important in many applications. Experimental results show that C…

2013-10-06abs ↗pdf ↗

Study on limits of community detection in various network models.

problem Limits of community detection in network models.
method Analysis of several network models including Stochastic Block Model, Exponential Random Graph Model, Latent Space Model, Directed Preferential Attachment Model, and Directed Small-world Model.
result Information-theoretic limits for recovery of node labels in network models.

PDD detects concept drift using explainable AI, improving model performance in dynamic environments.

problem Detecting and adapting to concept drift in predictive models.
method Profile Drift Detection (PDD) using Partial Dependence Profiles (PDPs).
result PDD outperforms existing methods in detecting concept drift and maintaining high predictive performance.