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

58116174232 · Jun 202019922001200920172026
48 results for modulation detection

New ML-based detection improves PMH signal detection in load-modulated MIMO systems.

problem Detecting PMH signals without prior CSI is challenging and computationally expensive.
method Proposes HEM-ML and HEM-KD schemes using EM and KD-tree for efficient detection.
result Achieves comparable detection results to optimal ML detector with reduced complexity.

We study a module structure on Khovanov homology, which we show is natural under the Ozsvath-Szabo spectral sequence to the Floer homology of the branched double cover. As an application, we show that this module structure detects trivial links. A key ingredient of our proof is that the H_1/Torsion module structure on …

2012-04-04abs ↗pdf ↗

We introduce two invariants called sl(3) Khovanov module and pointed sl(3) Khovanov homology for spatial webs (bipartite trivalent graphs). Those invariants are related to Kronheimer-Mrowka's instanton invariants JJ^\sharp and II^\sharp for spatial webs by two spectral sequences. As an application of the spectral seq…

2018-09-13abs ↗pdf ↗

Extending ideas of Hedden-Ni, we show that the module structure on Khovanov homology detects split links. We also prove an analogue for untwisted Heegaard Floer homology of the branched double cover. Technical results proved along the way include two interpretations of the module structure on untwisted Heegaard Floer h…

2019-10-09abs ↗pdf ↗

SUOD accelerates unsupervised outlier detection for large datasets.

problem Scalability issues in unsupervised outlier detection for high-dimensional datasets.
method Three-module acceleration framework: Random Projection, Balanced Parallel Scheduling, Pseudo-supervised Approximation.
result SUOD significantly improves efficiency and scalability in outlier detection.

It follows from earlier work of Silver-Williams and the authors that twisted Alexander polynomials detect the unknot and the Hopf link. We now show that twisted Alexander polynomials also detect the trefoil and the figure-8 knot, that twisted Alexander polynomials detect whether a link is split and that twisted Alexand…

2013-06-14abs ↗pdf ↗

Given a Heegaard splitting of a closed 3-manifold, the skein modules of the two handlebodies are modules over the skein algebra of their common boundary surface. The zeroth Hochschild homology of the skein algebra of a surface with coefficients in the tensor product of the skein modules of two handlebodies is interpret…

2004-05-20abs ↗pdf ↗

The classical abelian invariants of a knot are the Alexander module, which is the first homology group of the the unique infinite cyclic covering space of S^3-K, considered as a module over the (commutative) Laurent polynomial ring, and the Blanchfield linking pairing defined on this module. From the perspective of the…

2002-06-25abs ↗pdf ↗

Cochran defined the nth-order integral Alexander module of a knot in the three sphere as the first homology group of the knot's (n+1)th-iterated abelian cover. The case n=0 gives the classical Alexander module (and polynomial). After a localization, one can get a finitely presented module over a principal ideal domain,…

2013-03-06abs ↗pdf ↗

Model detects market anomalies using a Hawkes process with hidden Markov chain.

problem Detecting high-frequency market manipulation in cryptocurrency trades.
method Developed a Markov-modulated Hawkes process with piecewise constant excitation kernels.
result Demonstrated the model's effectiveness in detecting suspicious trading activities.

Online anomaly detection in surveillance videos with false alarm rate bounds.

problem Lack of theoretical performance analysis and online decision making in anomaly detection.
method Proposes an online anomaly detection method with asymptotic bounds on false alarm rate.
result Demonstrates effectiveness on publicly available data sets, outperforming state-of-the-art algorithms.

We investigate the detectability of modules in large networks when the number of modules is not known in advance. We employ the minimum description length (MDL) principle which seeks to minimize the total amount of information required to describe the network, and avoid overfitting. According to this criterion, we obta…

2012-12-19abs ↗pdf ↗

DKULENOVO team improves speech diarization by 27.5% and 31.7% in DIHARD II.

problem Challenges in speech diarization, especially in distinguishing overlapping speakers.
method Used a combination of VAD, speaker embedding extraction, similarity scoring, clustering, and resegmentation techniques.
result Achieved 18.84% DER in Track1 and 27.90% DER in Track2, reducing baseline DERs by 27.5% and 31.7% respectively.

PFPN improves salient object detection by progressively polishing multi-level features.

problem Improving salient object detection by refining multi-level features.
method Progressive Feature Polishing Network (PFPN) with Feature Polishing Modules (FPMs).
result PFPN achieves superior performance on five benchmark datasets without post-processing.

Motivation: The rapid growth of diverse biological data allows us to consider interactions between a variety of objects, such as genes, chemicals, molecular signatures, diseases, pathways and environmental exposures. Often, any pair of objects--such as a gene and a disease--can be related in different ways, for example…

2017-08-10abs ↗pdf ↗

Using computational techniques we tabulate prime knots up to five crossings in the solid torus and the infinite family of lens spaces L(p,q)L(p,q). For these knots we calculate the second and third skein module and establish which prime knots in the solid torus are amphichiral. Most knots are distinguished by the skein mod…

2016-11-21abs ↗pdf ↗

We define invariants of unoriented knots and links by enhancing the integral kei counting invariant Phi_X^Z (K) for a finite kei X using representations of the kei algebra, Z_K[X], a quotient of the quandle algebra Z[X] defined by Andruskiewitsch and Grana. We give an example that demonstrates that the enhanced invaria…

2011-02-21abs ↗pdf ↗

We introduce an algebra Z[X,S] associated to a pair (X,S) of a virtual birack X and X-shadow S. We use modules over Z[X,S] to define enhancements of the virtual birack shadow counting invariant, extending the birack shadow module invariants to virtual case. We repeat this construction for the twisted virtual case. As a…

2011-10-09abs ↗pdf ↗

Improved trading strategy using deep learning and changepoint detection for market changes.

problem Traditional momentum strategies struggle with rapid market changes, especially after trend reversals.
method Inserted an online changepoint detection module into a Deep Momentum Network (DMN) pipeline.
result Improvement in Sharpe ratio by one-third over 1995-2020 period, especially beneficial in nonstationary periods.

New method improves object detection models for long-tailed datasets.

problem Classifier imbalance in long-tail object detection datasets.
method Balanced Group Softmax (BAGS) module for balanced training of classifiers.
result Significantly improves performance of object detection models.

The powerful character variety techniques of Culler and Shalen can be used to find essential surfaces in knot manifolds. We show that module structures on the coordinate ring of the character variety can be used to identify detected boundary slopes as well as when closed surfaces are detected. This approach also yields…

2012-01-10abs ↗pdf ↗

With a 4-ended tangle TT, we associate a Heegaard Floer invariant CFT(T)\operatorname{CFT^\partial}(T), the peculiar module of TT. Based on Zarev's bordered sutured Heegaard Floer theory, we prove a glueing formula for this invariant which recovers link Floer homology HFL^\operatorname{\widehat{HFL}}. Moreover, we classify…

2017-12-13abs ↗pdf ↗

CRAUM-Net improves salient object detection with context and uncertainty modeling.

problem Accurate salient object detection with precise boundary delineation.
method Contextual Recursive Attention with Uncertainty Modeling, multi-scale context aggregation, attention mechanisms, edge-aware decoder, Monte Carlo Dropout.
result Superior performance in producing accurate and reliable saliency maps.

The linking genotype to phenotype is the fundamental aim of modern genetics. We focus on study of links between gene expression data and phenotype data through integrative analysis. We propose three approaches. 1) The inherent complexity of phenotypes makes high-throughput phenotype profiling a very difficult and labor…

2015-06-29abs ↗pdf ↗

An unsupervised anomaly detection method for irregularly sampled time-series data.

problem Anomaly detection in irregularly sampled or missing valued time-series data.
method Uses LSTM networks with time modulation gates to extract temporal features and SVDD for anomaly labeling.
result Significantly outperforms standard approaches on real-life datasets.

It is known, since works of Burde and de Rham, that one can detect the roots of the Alexander polynomial of a knot by the study of the representations of the knot group into the group of the invertible upper triangular 2x22x2 matrices. In this work, we propose to generalize this result by considering the representations…

2007-09-14abs ↗pdf ↗

Enhances OOD detection using latent diffusion for more robust and efficient training.

problem Improving reliability of machine learning models in real-world scenarios.
method Proposes Outlier-Aware Learning (OAL) framework that generates synthetic OOD data in latent space and uses MICL and KD modules.
result Demonstrates superior performance on benchmark datasets.

Proposes a novel network-based neighborhood regression for biological systems.

problem Lack of comprehensive analysis on biological modules using both global and local network data.
method Develops a community-wise least square optimization approach to analyze gene modules and their regulatory strength.
result Achieves exact minimax optimality and linear consistency in identifying gene module associations.

Anomaly detection is the process of finding data points that deviate from a baseline. In a real-life setting, anomalies are usually unknown or extremely rare. Moreover, the detection must be accomplished in a timely manner or the risk of corrupting the system might grow exponentially. In this work, we propose a two lev…

2019-04-24abs ↗pdf ↗

Paper shows how to hide individuals in graphs to fool community detection models.

problem Adversarial attack on community detection models by hiding individuals.
method Iterative learning framework that updates a graph generator and a community detection model.
result Adversarial graphs generated by the method can fool multiple community detection models.

Floer homology detects taut foliations in rational homology spheres.

problem Detecting taut foliations in rational homology spheres using Floer homology.
method Strengthened the known result about reduced Floer homology of rational homology spheres admitting taut foliations.
result Reduced Floer homology of rational homology spheres admitting taut foliations admits a direct F\mathbb{F}-summand as an F[U]\mathbb{F}[U]-module.

MEMGAN uses memory to improve anomaly detection by isolating abnormal data.

problem Weak guarantees for detecting anomalous data in classical algorithms.
method Memory-augmented Generative Adversarial Networks (MEMGAN) with a memory module.
result MEMGAN provides strong guarantees for anomaly detection with improved reconstruction.

CST-YOLO improves blood cell detection with YOLOv7 and CNN-Swin Transformer.

problem Small-scale object detection in blood cells.
method YOLOv7 architecture enhanced with CNN-Swin Transformer, W-ELAN, MCS, CatConv.
result CST-YOLO achieves 92.7%, 95.6%, and 91.1% mAP@0.5 on three blood cell datasets.

TODS automates time series outlier detection with customizable pipelines.

problem Automated detection of outliers in time series data.
method Modular system with 70 primitives for data processing, time series analysis, and detection algorithms. GUI and data-driven searcher for pipeline design.
result Automated discovery and construction of effective outlier detection pipelines.