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

Trend · papers per month

336698131 · Jun 202019922001200920172026
48 results for probabilistic triggering

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.

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.

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.

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 ↗

Study improves CTS's approximation regret for combinatorial bandits.

problem Improving CTS's performance on non-exact oracles.
method Develops a new O(log(T)/Δ)\mathcal{O}(\log(T)/Δ) upper bound for CTS under specific conditions.
result First O(log(T)/Δ)\mathcal{O}(\log(T)/Δ) approximation regret upper bound for CTS.

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 ↗

Pricing Chinese convertible bonds using Monte Carlo simulation and dynamic programming.

problem Pricing Chinese convertible bonds accurately.
method Monte Carlo simulation and dynamic programming with regression and backward induction.
result An underpriced strategy significantly outperforms benchmarks.

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 ↗

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.

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 need for consistent treatment of uncertainty has recently triggered increased interest in probabilistic deep learning methods. However, most current approaches have severe limitations when it comes to inference, since many of these models do not even permit to evaluate exact data likelihoods. Sum-product networks (…

2018-06-05abs ↗pdf ↗

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.

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 ↗

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 ↗

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.

Meta-active learning optimizes control of safety-critical systems by efficiently learning dynamics and configurations.

problem Efficiently learning system dynamics and optimal configurations for safety-critical systems like deep brain stimulation.
method Meta-learning an acquisition function using LSTM, cast as meta-learning, with a mixed-integer linear program policy.
result Achieved a 46% increase in information gain and a 20% speedup in computation time over baselines.

A probabilistic framework is introduced that represents stylized banking networks and aims to predict the size of contagion events. In contrast to previous work on random financial networks, which assumes independent connections between banks, the possibility of disassortative edge probabilities (an above average tende…

2011-10-19abs ↗pdf ↗

Improved tensor rank learning for CPD models using a generalized hyperbolic prior.

problem Inaccurate tensor rank determination leads to overfitting or underfitting in CPD models.
method Introduced a generalized hyperbolic prior for automatic tensor rank learning in probabilistic CPD models.
result Significantly improved performance in learning both low and high tensor ranks, even for low SNR cases.

Paper proposes a DRL-based controller for networked AP systems that reduces communication frequency.

problem Reduce communication frequency in networked AP systems while maintaining control performance.
method Develops a DRL-based controller that avoids explicit update timing learning, using a semi-Markov decision process (SMDP).
result Improves communication efficiency without sacrificing control performance.

Contingent Convertible bonds (CoCos) are debt instruments that convert into equity or are written down in times of distress. Existing pricing models assume conversion triggers based on market prices and on the assumption that markets can always observe all relevant firm information. But all Cocos issued so far have tri…

2018-04-18abs ↗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.