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

Trend · papers per month

25.0%50.0%75.0%100.0% · Jun 199319922001200920172026
48 results for variant detection

Optimization approach for efficient sampling in optical mapping for structural variant detection.

problem Efficient sampling strategy for structural variant detection using optical mapping.
method Developed an optimization approach using a hyper-geometric distribution and probabilistic concentration inequalities.
result Optimal sampling strategy requires sampling most chromosomal fragments to detect variants at high confidence with little biological material.

Paper presents a new method to detect process differences at the trace level using mutual fingerprints.

problem Low-level granularity in process variant analysis leads to many false differences.
method Develops a mutual fingerprint technique to encode entire process traces for comparison.
result Mutual fingerprint method reveals significant differences not detected by existing techniques.

Proposes a novel anomaly detection method for echocardiogram videos.

problem Anomaly detection in echocardiogram videos.
method Dynamic Variational Trajectory Models (TVAE-C, TVAE-R, TVAE-S) trained on healthy infant echocardiogram videos.
result Superior performance in detecting congenital heart defects and pulmonary hypertension.

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 ↗

The paper classifies links with low rank knot Floer and Khovanov homologies.

problem Detecting and classifying links with low rank knot Floer and Khovanov homologies.
method Generalized link Floer homology, used to obtain rank bounds and classify links.
result Knot Floer homology detects T(2,8)T(2,8) and T(2,10)T(2,10).

Variant of Seiberg-Witten equations for multiple-spinors connects to stability of holomorphic bundles.

problem Detecting stability of holomorphic vector bundles using Seiberg-Witten equations.
method Abelian gauge-theoretic variant of Seiberg-Witten equations for multiple-spinors.
result Constructs a numerical invariant related to φφ-stability of SU(n)SU(n)-holomorphic vector bundles.

The paper analyzes DeepWalk and node2vec for community detection in stochastic blockmodels.

problem Theoretical understanding of community detection in stochastic blockmodels.
method Matrix factorization perspective on DeepWalk and node2vec.
result Node2vec and DeepWalk can perfectly recover community memberships in sparse graphs.

Using an intuitive concept of what constitutes a meaningful community, a novel metric is formulated for detecting non-overlapping communities in undirected, weighted heterogeneous networks. This metric, modularity density, is shown to be superior to the versions of modularity density in present literature. Compared to …

2019-08-22abs ↗pdf ↗

The study formalizes temporal precision and recall for anomaly detection in sequences.

problem Insufficient understanding of precision and recall in sequential anomaly detection.
method Formalized temporal precision and recall measures, developed time-tolerant confusion matrices, and demonstrated statistical significance.
result Precision and recall may overestimate performance with temporal tolerance.

Improves community detection in directed networks with theoretical guarantees.

problem Degree heterogeneity affects community detection in directed networks.
method Introduced D-SCORE algorithm and established theoretical guarantees for Directed-DCBM.
result Established theoretical guarantees and provided improvements for D-SCORE.

Local network community detection aims to find a single community in a large network, while inspecting only a small part of that network around a given seed node. This is much cheaper than finding all communities in a network. Most methods for local community detection are formulated as ad-hoc optimization problems. In…

2018-04-12abs ↗pdf ↗

Online algorithm detects community structure in dynamic event streams.

problem Community detection in networks with temporal event streams.
method Continuous-time point process latent network models with fast online variational inference.
result Online inference achieves comparable community recovery to non-online methods but with computational gains.

Open category detection is the problem of detecting "alien" test instances that belong to categories or classes that were not present in the training data. In many applications, reliably detecting such aliens is central to ensuring the safety and accuracy of test set predictions. Unfortunately, there are no algorithms …

2018-08-01abs ↗pdf ↗

Real-world networks usually have community structure, that is, nodes are grouped into densely connected communities. Community detection is one of the most popular and best-studied research topics in network science and has attracted attention in many different fields, including computer science, statistics, social sci…

2018-08-26abs ↗pdf ↗

New algorithm detects changes quickly without knowing parameters, near optimally.

problem Quickest change detection with unknown parameters.
method Leverages theoretical asymptotic properties to derive a scalable approximate algorithm with near optimal performance.
result Detects changes in constant complexity with near optimal performance.

Anomaly detection is an important problem that has been well-studied within diverse research areas and application domains. The aim of this survey is two-fold, firstly we present a structured and comprehensive overview of research methods in deep learning-based anomaly detection. Furthermore, we review the adoption of …

2019-01-10abs ↗pdf ↗

Detection of rare variants by resequencing is important for the identification of individuals carrying disease variants. Rapid sequencing by new technologies enables low-cost resequencing of target regions, although it is still prohibitive to test more than a few individuals. In order to improve cost trade-offs, it has…

2009-09-02abs ↗pdf ↗

A new method for detecting anomalies in large, high-dimensional data streams using probabilistic forest models.

problem Challenges in detecting anomalies in large, high-dimensional data.
method Probabilistic Mondrian Pólya Forests for summarizing data and estimating underlying probability density.
result State-of-the-art performance with interpretable anomaly scores.

Outlier detection methods have become increasingly relevant in recent years due to increased security concerns and because of its vast application to different fields. Recently, Pauwels and Lasserre (2016) noticed that the sublevel sets of the inverse Christoffel function accurately depict the shape of a cloud of data …

2018-06-18abs ↗pdf ↗

Locally private methods detect changes in time series data.

problem Detecting distributional changes in time series data under local differential privacy.
method Proposed locally differentially private algorithms based on randomized response and binary mechanisms.
result Theoretical performance bounds and empirical validation of detection accuracy.

Adaptive algorithm for outlier detection by balancing arm exploration and threshold estimation.

problem Identifying outliers in a set of rewards where the threshold is a function of all rewards.
method Adaptively updated confidence interval for the threshold based on previous rounds' estimates, balancing exploration of individual arms and the outlier threshold.
result Efficient algorithm with reduced sample complexity for outlier detection.

FCDD explains deep anomaly detection by mapping anomalies away and providing heatmap explanations.

problem Deep one-class classification's non-linear transformation makes it hard to interpret.
method FCDD learns a mapping that concentrates nominal samples, maps anomalies away, and provides heatmap explanations.
result FCDD sets a new state of the art in unsupervised anomaly detection on MVTec-AD.

This paper proposes the adaptation of Support Vector Data Description (SVDD) to the multiple kernel case (MK-SVDD), based on SimpleMKL. It also introduces a variant called Slim-MK-SVDD that is able to produce a tighter frontier around the data. For the sake of comparison, the equivalent methods are also developed for O…

2017-12-07abs ↗pdf ↗

SONAR improves outlier detection for streaming data with strong theoretical guarantees.

problem Outlier detection for non-stationary streaming data with high Type I/II errors.
method SONAR is an efficient SGD-based OCSVM solver with strong convex regularization and lifelong learning guarantees.
result SONAR outperforms traditional OCSVM in Type I/II error rates under non-stationary data.

MPT improves CNN and energy-based models' OOD detection and generalization.

problem Challenging out-of-distribution detection in computer vision.
method Applying Maximum Probability Theorem as a regularization scheme in CNN and energy-based models.
result MPT-based regularization strategy stabilizes and improves generalization and robustness of base models.

A new method detects anomalies in trajectory data using normalizing flows.

problem Detecting anomalous patterns in high-dimensional, varying-length spatial data.
method Probability density estimation via normalizing flows for each trajectory segment, aggregating likelihoods.
result The proposed method, GRADINGS, effectively identifies anomalies in real-world trajectory data.

Optimizes quickest detection of drift in Brownian motion with false negatives.

problem Quickest detection of drift in Brownian motion with false negatives.
method Formulated as an optimal multiple stopping problem, then equivalent to a recursive optimal stopping problem, solved using free boundary methods.
result Explicit formulae for expected cost and optimal strategy found.

The repeated community-wide reuse of test sets in popular benchmark problems raises doubts about the credibility of reported test-error rates. Verifying whether a learned model is overfitted to a test set is challenging as independent test sets drawn from the same data distribution are usually unavailable, while other …

2019-03-06abs ↗pdf ↗

Optimizes latency and false alarm probability in change detection problems.

problem Balancing latency and false alarms in non-stationary environments.
method Develops order-optimal change detectors under specified latency and false alarm levels.
result Derives a universal lower bound on latency and develops order-optimal detectors.

Paper detects anomalies in wheat and rapeseed crops using satellite data.

problem Detecting anomalies in crop development at parcel-level.
method Unsupervised outlier detection using SAR and multispectral features.
result Best performance with a 10% outlier ratio, achieving 94.1% true positives for rapeseed and 95.5% for wheat.

Analyzing the temporal behavior of nodes in time-varying graphs is useful for many applications such as targeted advertising, community evolution and outlier detection. In this paper, we present a novel approach, STWalk, for learning trajectory representations of nodes in temporal graphs. The proposed framework makes u…

2017-11-11abs ↗pdf ↗

This paper evaluates anomaly detection methods for multivariate time series data.

problem Lack of systematic comparison of anomaly detection methods on multivariate time series data.
method Comprehensive evaluation of 10 models and 4 scoring functions on 10 datasets.
result Dynamic scoring functions outperform static ones, and the choice of scoring functions matters more than the model choice.