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

Trend · papers per month

68135203270 · Jun 202019922001200920172026
48 results for undetected error

Adaptive algorithm identifies best arm with abstention, showing phase transition from polynomial to exponential error probability.

problem Bayesian best-arm identification with abstention to reduce undetected error.
method Adaptive algorithm PGWS that optimally uses abstention budget.
result Introducing any positive abstention budget induces an exponential decay in undetected error probability.

Backdoors in deep neural networks are undetectable and enable invariance-based adversarial examples.

problem Statistically undetectable backdoors in deep neural networks.
method Adversarial model trainer method to plant backdoors, showing invariance-based adversarial examples.
result Backdoors are statistically undetectable and enable generation of adversarial examples for every input.

We inject undetectable backdoors into obfuscated neural networks and language models.

problem Safeguarding models from sophisticated adversarial attacks.
method Developed a strategy to plant undetectable backdoors in obfuscated neural networks and language models.
result Undetectable backdoors can be planted in obfuscated models, even if weights and architecture are accessible.

For any positive integer r, we exhibit a knot Kr with (20 ×\times 2 r--1 + 1) crossings whose Jones polynomial V (Kr) is equal to 1 mod-ulo 2 r. Our construction rests on a certain 20-crossing tangle T 20 which is undetectable by the Kauffman bracket polynomial pair mod 2.

2016-10-18abs ↗pdf ↗

Paper optimizes change-point detection using learned distributions from training sequences.

problem Optimal change-point detection with unknown pre- and post-change distributions.
method Designs a change-point estimator using training sequences and test sequences.
result Optimal confidence width characterized as a function of undetected error.

Kishino's knot is not detected by the fundamental group or the bracket polynomial; these invariants cannot differentiate between Kishino's knot and the unknot. However, we can show that Kishino's knot is not equivalent to unknot by applying either the 3-strand bracket polynomial or the surface bracket polynomial. In th…

2004-02-18abs ↗pdf ↗

Recent work establishes dataset difficulty and removes annotation artifacts via partial-input baselines (e.g., hypothesis-only models for SNLI or question-only models for VQA). When a partial-input baseline gets high accuracy, a dataset is cheatable. However, the converse is not necessarily true: the failure of a parti…

2019-05-14abs ↗pdf ↗

The study uses DCC for financial market analysis, revealing hidden correlations.

problem Identifying hidden nonlinear correlations in financial markets.
method Agglomerative hierarchical clustering with distance correlation coefficient.
result DCC reveals more information than Pearson correlation for financial data.

There has been an ongoing cycle where stronger defenses against adversarial attacks are subsequently broken by a more advanced defense-aware attack. We present a new approach towards ending this cycle where we "deflect'' adversarial attacks by causing the attacker to produce an input that semantically resembles the att…

2020-02-18abs ↗pdf ↗

New method separates graph structure from node attributes to recover lost signal.

problem Standard representation learning on attributed graphs merges incompatible metric spaces, leading to geometrically flawed alignment.
method Custom variational autoencoder that separates manifold learning from structural alignment.
result Transforms geometric conflict into interpretable structural descriptor, uncovering connectivity patterns and anomalies.

Distributed learning is central for large-scale training of deep-learning models. However, they are exposed to a security threat in which Byzantine participants can interrupt or control the learning process. Previous attack models and their corresponding defenses assume that the rogue participants are (a) omniscient (k…

2019-02-16abs ↗pdf ↗

Deep Neural Networks (DNNs) are universal function approximators providing state-of- the-art solutions on wide range of applications. Common perceptual tasks such as speech recognition, image classification, and object tracking are now commonly tackled via DNNs. Some fundamental problems remain: (1) the lack of a mathe…

2017-10-25abs ↗pdf ↗

Artificial neural network (ANN) provides superior accuracy for nonlinear alternating current (AC) state estimation (SE) in smart grid over traditional methods. However, research has discovered that ANN could be easily fooled by adversarial examples. In this paper, we initiate a new study of adversarial false data injec…

2019-06-26abs ↗pdf ↗

Identification of patterns from discrete data time-series for statistical inference, threat detection, social opinion dynamics, brain activity prediction has received recent momentum. In addition to the huge data size, the associated challenges are, for example, (i) missing data to construct a closed time-varying compl…

2018-11-02abs ↗pdf ↗

Machine learning has begun to play a central role in many applications. A multitude of these applications typically also involve datasets that are distributed across multiple computing devices/machines due to either design constraints (e.g., multiagent systems) or computational/privacy reasons (e.g., learning on smartp…

2019-08-21abs ↗pdf ↗

The financial crisis clearly illustrated the importance of characterizing the level of 'systemic' risk associated with an entire credit network, rather than with single institutions. However, the interplay between financial distress and topological changes is still poorly understood. Here we analyze the quarterly inter…

2013-02-08abs ↗pdf ↗

Deep neural networks have been demonstrated to be vulnerable to backdoor attacks. Specifically, by injecting a small number of maliciously constructed inputs into the training set, an adversary is able to plant a backdoor into the trained model. This backdoor can then be activated during inference by a backdoor trigger…

2019-12-05abs ↗pdf ↗

In this paper we study embeddings of oriented connected closed surfaces in S3\mathbb S^3. We define a complete invariant, the fundamental span, for such embeddings, generalizing the notion of the peripheral system of a knot group. From the fundamental span, several computable invariants are derived and employed to stud…

2019-02-13abs ↗pdf ↗

A new, efficient kk-modes algorithm improves clustering of categorical data.

problem Clustering categorical data using existing methods like kk-means is inefficient.
method Developed a novel kk-modes algorithm called OTQT, which improves on existing methods.
result OTQT finds more accurate clusters per iteration and is faster overall.

ISAAC audits deep models for drug-target interactions, revealing structural differences.

problem Deep models for DTI often use irrelevant features, making them hard to evaluate.
method ISAAC uses intervention-based structural auditing to evaluate model sensitivity.
result ISAAC reveals significant structural differences in DTI models' reasoning.

New framework tackles fairness in link prediction beyond demographic parity.

problem Systemic biases in link prediction can exacerbate societal inequalities.
method Formalizes limitations of existing fairness evaluations and proposes a new framework.
result Proposes a lightweight post-processing method combined with decoupled link predictors.

New method targets relative risk heterogeneity in clinical trials.

problem Identifying treatment effects across subgroups with absolute risk differences.
method Modified causal forests using a novel node-splitting procedure based on relative risk.
result Relative risk causal forests can capture heterogeneity not detected by absolute risk methods.

Network operators are generally aware of common attack vectors that they defend against. For most networks the vast majority of traffic is legitimate. However new attack vectors are continually designed and attempted by bad actors which bypass detection and go unnoticed due to low volume. One strategy for finding such …

2019-04-02abs ↗pdf ↗

Paper uses robust GMM to reconstruct missing data in Sentinel-2 images for crop monitoring.

problem Missing data in remote sensing images, especially from multispectral and SAR sensors.
method Robust Gaussian Mixture Models (GMM) with outlier detection using isolation forest.
result Robust GMM outperforms standard GMM in reconstructing imputed values, reducing errors.

New method allocates capital based on tail central moments for financial risk assessment.

problem Inability of CTE-based capital allocation to reflect tail behavior of losses.
method Developed TCM-based capital allocation for normal mean-variance mixture distributions.
result TCM-based method captures tail risk contributions not detected by CTE.

We tackle anomaly detection in sparse time series data.

problem Sparse time series with low signal-to-noise ratios and non-uniform performance.
method We introduce a novel generative procedure for benchmark datasets and demonstrate how anomaly score smoothing improves performance.
result Anomaly score smoothing consistently improves performance in low-count time series anomaly detection.

This paper optimizes power grid protection settings to maximize network degradation due to cascading attacks.

problem Cascading attacks on power grids and their undetected nature.
method Constrained Bayesian Optimization applied to transmission line protection settings.
result Even limited misconfiguration of protection settings can cause severe cascading attacks.

We consider a three-layer Sejnowski machine and show that features learnt via contrastive divergence have a dual representation as patterns in a dense associative memory of order P=4. The latter is known to be able to Hebbian-store an amount of patterns scaling as N^{P-1}, where N denotes the number of constituting bin…

2019-11-28abs ↗pdf ↗

ODBAE detects complex phenotypes in biological data.

problem Challenges in identifying complex phenotypes from high-dimensional biological data.
method ODBAE (Outlier Detection using Balanced Autoencoders) identifies influential and high leverage points in latent relationships among multiple physiological parameters.
result ODBAE reveals novel metabolism-related genes and uncovers coordinated abnormalities across metabolic indicators.

Study of participating policies with guaranteed minimum interest rate and surrender option.

problem Analyzing the value and optimal surrender strategy of participating policies with minimum interest rate guarantee and surrender option.
method Probabilistic analysis using optimal stopping and free boundary theory.
result Identification of an optimal surrender strategy involving stop-loss and too-good-to-persist boundaries.

The wave trace of certain convex domains can be smooth near some points in the length spectrum.

problem Understanding the relationship between the wave trace and the length spectrum of convex domains.
method Constructing silent periodic billiard orbits with the same length but different Maslov indices, using a microlocal parametrix for wave invariants.
result The wave trace can be smooth near some points in the length spectrum, showing potential limitations for inverse spectral problems.

Machine learning improves diagnostic test accuracy for bovine tuberculosis.

problem Improving diagnostic test sensitivity for bovine tuberculosis.
method Machine learning to assess risk landscapes and predict infection.
result Test sensitivity improved, detecting 240 more infected herds per year.