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

2457 · Jun 202619922001200920172026
48 results for no-knowledge alarms

One possible way of risk management for an insurance company is to develop an early and appropriate alarm system before the possible ruin. The ruin is defined through the status of the aggregate risk process, which in turn is determined by premium accumulation as well as claim settlement outgo for the insurance company…

2010-06-28abs ↗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.

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.

Detects data drift in deep learning models using neural embeddings.

problem Detecting changes in data distribution in deep learning models.
method Formulates drift detection in a sequential decision framework and introduces a loss function to balance false alarms and quick detection.
result Demonstrates improved ability to balance false alarms and quick detection in change detection.

Interpretation of electroencephalogram (EEG) signals can be complicated by obfuscating artifacts. Artifact detection plays an important role in the observation and analysis of EEG signals. Spatial information contained in the placement of the electrodes can be exploited to accurately detect artifacts. However, when few…

2018-01-03abs ↗pdf ↗

Adaptive monitoring for AI systems detects and diagnoses shifts in data distribution.

problem Continuous monitoring of AI systems to detect and address unsafe behavior.
method Weighted-conformal martingales (WCTMs) for online monitoring of AI systems.
result Improved performance over state-of-the-art baselines on real-world datasets.

An important application of intelligent vehicles is advance detection of dangerous events such as collisions. This problem is framed as a problem of optimal alarm choice given predictive models for vehicle location and motion. Techniques for real-time collision detection are surveyed and grouped into three classes: ran…

2017-08-16abs ↗pdf ↗

KQT-EWMA monitors multivariate data streams online with flexible and practical change detection.

problem Online monitoring of multivariate data streams for detecting changes.
method Combines Kernel-QuantTree histogram and EWMA statistic for non-parametric monitoring.
result Controls Average Run Length (ARL0) while achieving comparable detection delays.

Extends FC-RAG to anytime-valid sequential coverage for language model swarms.

problem Maintain distribution-free coverage for a swarm of weak language models over time.
method Introduces Anytime-FC-RAG, a sequential extension with a summable calibration-deviation budget.
result Achieves time-uniform alarm validity and safety under predictable adaptive control.

We propose a novel non-parametric adaptive anomaly detection algorithm for high dimensional data based on rank-SVM. Data points are first ranked based on scores derived from nearest neighbor graphs on n-point nominal data. We then train a rank-SVM using this ranked data. A test-point is declared as an anomaly at alpha-…

2014-05-02abs ↗pdf ↗

New method detects and locates changes in spatio-temporal point processes.

problem Detecting and localizing changes in spatio-temporal data.
method Score-based, likelihood-free approach estimating change time and region.
result The method provides theoretical guarantees on detection and localization accuracy.

Balancing graph summarization and change detection in streaming data.

problem Balancing compression rate in graph summarization and accuracy in change detection.
method Introducing a probabilistic hierarchical latent variable model and optimizing parameters based on the minimum description length principle to balance the trade-off.
result Guaranteed suppression of Type I error probability (false alarms) in change detection.

Financial markets are well known for their dramatic dynamics and consequences that affect much of the world's population. Consequently, much research has aimed at understanding, identifying and forecasting crashes and rebounds in financial markets. The Johansen-Ledoit-Sornette (JLS) model provides an operational framew…

2011-07-30abs ↗pdf ↗

PITMonitor monitors model calibration over time with formal error guarantees.

problem Fixed-sample tests applied to models over time can lead to false alarms.
method PITMonitor uses mixture e-processes to detect distributional shifts in probability integral transforms.
result PITMonitor achieves competitive detection rates on river's FriedmanDrift benchmark.

We propose a non-parametric anomaly detection algorithm for high dimensional data. We score each datapoint by its average KK-NN distance, and rank them accordingly. We then train limited complexity models to imitate these scores based on the max-margin learning-to-rank framework. A test-point is declared as an anomaly…

2015-02-06abs ↗pdf ↗

In this paper, we study a polynomial decomposition model that arises in problems of system identification, signal processing and machine learning. We show that this decomposition is a special case of the X-rank decomposition --- a powerful novel concept in algebraic geometry that generalizes the tensor CP decomposition…

2016-03-04abs ↗pdf ↗

We propose a non-parametric anomaly detection algorithm for high dimensional data. We first rank scores derived from nearest neighbor graphs on nn-point nominal training data. We then train limited complexity models to imitate these scores based on the max-margin learning-to-rank framework. A test-point is declared as…

2016-01-22abs ↗pdf ↗

We study data poisoning attacks in the online setting where training items arrive sequentially, and the attacker may perturb the current item to manipulate online learning. Importantly, the attacker has no knowledge of future training items nor the data generating distribution. We formulate online data poisoning attack…

2019-03-05abs ↗pdf ↗

The hypothesis of randomness is fundamental in statistical machine learning and in many areas of nonparametric statistics; it says that the observations are assumed to be independent and coming from the same unknown probability distribution. This hypothesis is close, in certain respects, to the hypothesis of exchangeab…

2019-06-21abs ↗pdf ↗

E-valuator converts verifier scores into reliable decision rules.

problem Ensuring the correctness of agent trajectories based on heuristic scores.
method Sequential hypothesis testing framework for online monitoring of agent trajectories.
result E-valuator provides better false alarm rate control and statistical power than other strategies.

In this paper, we propose an effective THresholding method based on ORder Statistic, called THORS, to convert an arbitrary scoring-type classifier, which can induce a continuous cumulative distribution function of the score, into a cost-sensitive one. The procedure, uses order statistic to find an optimal threshold for…

2018-11-07abs ↗pdf ↗

Proposes real-time risk monitoring for machine learning systems under unknown shifts.

problem Dynamic distribution shifts challenge real-world machine learning systems' risk assurances.
method Sequential hypothesis testing with 'testing by betting' to detect risk violations.
result Effective real-time risk monitoring under various unknown shifts.

Model change detection is studied, in which there are two sets of samples that are independently and identically distributed (i.i.d.) according to a pre-change probabilistic model with parameter θθ, and a post-change model with parameter θθ', respectively. The goal is to detect whether the change in the model is sign…

2018-11-19abs ↗pdf ↗

Reduces change detection to estimation using confidence sequences.

problem Detecting changes in data streams with minimal delay and false alarms.
method Reduction from sequential change detection to sequential estimation using confidence sequences.
result Change detection scheme with minimal structural assumptions and strong guarantees.

Geometric observables detect financial regime shifts with high accuracy.

problem Detecting regime shifts in financial markets.
method Extracted four geometric observables from equity-index returns and evaluated them against various baseline methods.
result The Berry Phase Rate achieves an unbiased out-of-sample median Cohen's d of 0.72, significantly reducing false alarms.