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

3.5%7.0%10.4%13.9% · Feb 202619922001200920172026
48 results for trigger inference

PHAZE framework uses zkML and hashing for fast, verifiable LHC trigger decisions.

problem Inefficient inference on large machine learning models for LHC trigger performance.
method Cryptographic techniques like hashing and zkML for low latency, certifiable inference.
result Achieves nanosecond-order latency for LHC triggers, enabling dynamic low-level triggers.

In classical Hawkes process, the baseline intensity and triggering kernel are assumed to be a constant and parametric function respectively, which limits the model flexibility. To generalize it, we present a fully Bayesian nonparametric model, namely Gaussian process modulated Hawkes process and propose an EM-variation…

2019-05-29abs ↗pdf ↗

TIER uses extended strain data to improve gravitational wave detection sensitivity.

problem Improving gravitational wave detection sensitivity using extended strain data.
method TIER framework using machine learning to capture extended strain data features.
result Up to 20% improvement in sensitive volume time in LIGO-Virgo-Kagra O3 data.

Neural backdoor attack is emerging as a severe security threat to deep learning, while the capability of existing defense methods is limited, especially for complex backdoor triggers. In the work, we explore the space formed by the pixel values of all possible backdoor triggers. An original trigger used by an attacker …

2019-10-10abs ↗pdf ↗

CLEANN detects and mitigates neural network Trojans without labeled data.

problem Trojans in embedded neural networks that bypass detection during inference.
method Dictionary learning and sparse approximation for identifying Trojan triggers, lightweight algorithm/hardware co-design.
result Efficient real-time execution on resource-constrained platforms, competitive attack resiliency.

Defense against DL-based lithographic hotspot detectors backdooring attacks reduces success rate from 84% to ~0%

problem DL-based lithographic hotspot detectors are vulnerable to backdoor attacks that can misclassify hotspots.
method Training data augmentation to eliminate intentional biases introduced during training.
result Significant reduction in attack success rate (from 84% to ~0%) using the proposed defense.

Common event-triggered state estimation (ETSE) algorithms save communication in networked control systems by predicting agents' behavior, and transmitting updates only when the predictions deviate significantly. The effectiveness in reducing communication thus heavily depends on the quality of the dynamics models used …

2018-03-05abs ↗pdf ↗

Bayesian approach models earthquake clustering with spatial mainshocks and aftershocks.

problem Estimating uncertainty in earthquake clustering models due to complex likelihood functions.
method Nonparametric Dirichlet process mixture prior for spatial mainshocks and an auxiliary latent variable routine for efficient inference.
result Efficient Bayesian forecasting of spatial earthquake occurrences with uncertainty quantification.

New Hawkes processes model spatiotemporal events with triggering and clustering.

problem Modeling self-excitatory behavior in spatiotemporal data.
method Developed a new class of spatiotemporal Hawkes processes with efficient inference method.
result Efficiently modeled and inferred spatiotemporal events with triggering and clustering.

New algorithm for contextual combinatorial bandits with probabilistic arm triggering.

problem Optimizing decisions in dynamic environments with probabilistic arm availability.
method C^2-UCB-T and VAC^2-UCB algorithms with TPM and VM conditions.
result Achieved improved regret bounds for contextual combinatorial bandits.

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 ↗

Backdoor attacks make models predict a specific class near triggers, smoothing their decision function.

problem Understanding and mitigating backdoor attacks on deep neural networks.
method Defined a measure to quantify backdoor smoothing and detected other smoothing patterns.
result Backdoor attacks induce a smoother decision function around triggered samples.

Paper improves CMAB regret bounds by reducing batch-size dependency.

problem Reducing batch-size dependency in combinatorial semi-bandits.
method Developed BCUCB-T and SESCB algorithms with new TPVM conditions.
result Significantly improved regret bounds for various applications.

BadGD identifies gradient descent vulnerabilities through strategic backdoor attacks.

problem Gradient descent vulnerabilities through malicious data manipulation.
method Introduces Max RiskWarp, Max GradWarp, and Max GradDistWarp triggers to exploit gradient descent.
result Demonstrates how malicious triggers can significantly alter loss landscapes and gradient calculations.

We present a probabilistic model of events in continuous time in which each event triggers a Poisson process of successor events. The ensemble of observed events is thereby modeled as a superposition of Poisson processes. Efficient inference is feasible under this model with an EM algorithm. Moreover, the EM algorithm …

2012-03-15abs ↗pdf ↗

Corporate defaults may be triggered by some major market news or events such as financial crises or collapses of major banks or financial institutions. With a view to develop a more realistic model for credit risk analysis, we introduce a new type of reduced-form intensity-based model that can incorporate the impacts o…

2013-01-01abs ↗pdf ↗

Graph-Triggered Bandits unify rested and restless bandits with graph-defined arm interactions.

problem Modeling sequential decision-making problems with evolving arm rewards.
method Graph-Triggered Bandits (GTBs) framework that generalizes rested and restless bandits using a graph.
result Rested and restless bandits are special cases of GTBs for suitable graphs.

Improved speech recognition for voice assistants by analyzing speech data.

problem Reducing false triggers in speech-enabled assistants.
method Post-processing LVCSR hypothesis lattice with a Bidirectional Lattice Recurrent Neural Network (LatticeRNN).
result LatticeRNN significantly improves detection accuracy over traditional methods.

Unified reinforcement learning and stochastic processes with action-driven processes.

problem Combining reinforcement learning and stochastic processes for efficient control.
method Action-driven processes, leveraging control-as-inference, and minimizing Kullback-Leibler divergence.
result Action-driven processes unify reinforcement learning and stochastic processes, equivalent to maximum entropy reinforcement learning.

Graph neural networks detect structural perturbations from time series data.

problem Detecting structural causes of disturbances in complex systems.
method Graph neural network approach to infer structural perturbations from functional time series.
result Data-driven approach outperforms typical reconstruction methods and meets Bayesian inference accuracy.

The problem of resource allocation of nonlinear networked control systems is investigated, where, unlike the well discussed case of triggering for stability, the objective is optimal triggering. An approximate dynamic programming approach is developed for solving problems with fixed final times initially and then it is…

2014-12-17abs ↗pdf ↗

In this paper we discuss the issue of computation of the bilateral credit valuation adjustment (CVA) under rating triggers, and in presence of ratings-linked margin agreements. Specifically, we consider collateralized OTC contracts, that are subject to rating triggers, between two parties -- an investor and a counterpa…

2012-05-30abs ↗pdf ↗

The commercialization of deep learning creates a compelling need for intellectual property (IP) protection. Deep neural network (DNN) watermarking has been proposed as a promising tool to help model owners prove ownership and fight piracy. A popular approach of watermarking is to train a DNN to recognize images with ce…

2019-06-11abs ↗pdf ↗

Paper proposes B3D method for black-box backdoor detection.

problem Detecting backdoor attacks in black-box models without access to training data.
method Gradient-free optimization to reverse-engineer triggers, simple strategy for reliable predictions.
result Effectiveness of B3D method corroborated on hundreds of DNN models.

ET-GP-UCB optimizes time-varying functions without knowing change rates.

problem Sequentially optimizing a time-varying objective function with unknown change rates.
method Event-triggered Bayesian optimization with adaptive resets based on probabilistic uniform error bounds.
result ET-GP-UCB outperforms other GP-UCB algorithms in synthetic and real-world data.

The causal effect of a treatment can vary from person to person based on their individual characteristics and predispositions. Mining for patterns of individual-level effect differences, a problem known as heterogeneous treatment effect estimation, has many important applications, from precision medicine to recommender…

2019-01-31abs ↗pdf ↗

Study combines speaker verification and voice trigger detection in a single network.

problem Separate training for speaker verification and voice trigger detection.
method Multi-task learning with a single network trained on both tasks.
result Single network achieves comparable accuracy to independent models for each task.

Unified framework for predicting data changes influenced by predictions.

problem Complex feedback loops in environments where predictions alter data distributions.
method Repeated Risk Minimization (RRM) and two-step plug-in estimator integrating RePPI and Importance Sampling.
result Achieves semiparametric efficiency bound and robustness under mild misspecification.

In this paper, we present a framework for fitting multivariate Hawkes processes for large-scale problems both in the number of events in the observed history nn and the number of event types dd (i.e. dimensions). The proposed Low-Rank Hawkes Process (LRHP) framework introduces a low-rank approximation of the kernel m…

2016-02-26abs ↗pdf ↗