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

Trend · papers per month

265277103 · Jun 202019922001200920172026
48 results for trigger patterns

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.

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 ↗

Paper defends LSTM-based text classification models from backdoor attacks.

problem Backdoor attacks in LSTM models cause misclassification of spam or malicious speech.
method Backdoor Keyword Identification (BKI) to identify and exclude poisoned samples.
result BKI method effectively mitigates backdoor attacks in various text classification datasets.

Adversarial weight perturbations can inject backdoors into trained neural models.

problem Security risk of using publicly available trained models due to backdoors.
method Extended adversarial perturbations to model weights, using a composite loss and projected gradient descent.
result Adversarial weight perturbations can be successfully injected with very small changes, exposing security risks across various tasks.

New method defends against neural backdoors using generative modeling.

problem Neural backdoor attacks pose a significant security threat to deep learning models.
method Proposes max-entropy staircase approximator (MESA) for high-dimensional sampling-free generative modeling of backdoor trigger distributions.
result Demonstrates the effectiveness of MESA in modeling backdoor trigger distributions and robustness of the proposed defense method.

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 ↗

A data-driven approach predicts morphological development under structural instability.

problem Understanding and predicting spatiotemporal complexities of morphogenesis under structural instability.
method Machine-learning framework based on physical modeling of morphogenesis.
result Identification of key bifurcation characteristics and prediction of history-dependent development.

New method shows fully-connected networks can learn convolutional structures from data.

problem How to learn convolutional structures from translation-invariant data.
method Data-driven emergence of convolutional structure in neural networks.
result Initially fully-connected networks can learn convolutional structures from their inputs.

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.

PPPD framework extracts physical characterizations from stochastic mechanical systems.

problem Complex system behavior requires more than probabilistic descriptions of QoI.
method Probabilistic Performance-Pattern Decomposition (PPPD) framework.
result Decomposes system behaviors into meaningful patterns in response space.

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.

This review assesses deep-learning methods for complex sequential data.

problem Lack of robustness and transparency in deep-learning frameworks for irregular sequential data.
method Systematic literature review of existing algorithms.
result Recurrent neural networks dominate in performance evaluation of deep-learning frameworks.

We demystify attention patterns in multi-head softmax models for linear data.

problem Understanding the training dynamics and emergent patterns in multi-head softmax attention models.
method Extensive empirical experiments and rigorous theoretical analysis.
result Multi-head softmax attention models approximate a debiased gradient descent predictor, outperforming single-head attention and achieving near-Bayesian optimality.

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.

SPARQ-SGD optimizes communication in decentralized SGD with event-triggered and compressed updates.

problem Efficient communication in decentralized stochastic optimization for large-scale models.
method Event-triggered and compressed algorithm with quantized and sparsified model parameters.
result SPARQ-SGD converges with efficiency comparable to uncompressed training, demonstrating significant communication savings.

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.

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.

Researchers quantify the relationship between feature depth and performance in deep neural networks.

problem Understanding how depth affects feature extraction and generalization in deep neural networks.
method Adaptive analysis of feature-depth trade-offs in deep nets, proving optimal generalization performance.
result Optimal generalization performance achieved through empirical risk minimization on deep nets.

As a powerful tool of asynchronous event sequence analysis, point processes have been studied for a long time and achieved numerous successes in different fields. Among various point process models, Hawkes process and its variants attract many researchers in statistics and computer science these years because they capt…

2017-08-28abs ↗pdf ↗

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 ↗

Analyzes gaming in federated learning systems and provides design principles.

problem Gaming and cooperation in federated learning systems under partial observability.
method Developed an analytical framework to separate welfare-improving behavior from metric gaming.
result Derived threshold conditions for deterring harmful gaming and preserving cooperation.

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.

Deep learning models price convertible bonds with complex reset and call features.

problem Pricing convertible bonds with path-dependent reset and call provisions.
method Formulated as a PPDE, deep learning approximates conditional expectations.
result Deep learning produces stable and accurate prices across various model specifications.

Learning Granger causality for general point processes is a very challenging task. In this paper, we propose an effective method, learning Granger causality, for a special but significant type of point processes --- Hawkes process. We reveal the relationship between Hawkes process's impact function and its Granger caus…

2016-02-14abs ↗pdf ↗

Efficiently models event-based data with general parametric kernels.

problem Inference for Hawkes processes with general parametric kernels requires large datasets.
method Developed a fast 2\ell_2 gradient-based solver using a discretized version of events.
result Improved estimation of pattern latency in brain signals.

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.

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 ↗