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

Trend · papers per month

1122 · Oct 201819922001200920172026
20 results for event-triggered

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 ↗

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.

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.

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 ↗

Federated Q-Learning achieves linear regret speedup with low communication cost.

problem Achieving linear regret speedup in federated reinforcement learning without high communication costs.
method Proposed two federated Q-Learning algorithms: FedQ-Hoeffding and FedQ-Bernstein, using event-triggered synchronization, novel step size selection, and concentration inequalities.
result Total regrets achieve linear speedup compared to single-agent counterparts with logarithmic communication cost.

This paper models how features influence event triggers in high-dimensional networks.

problem Estimating context-dependent networks in high-dimensional marked point processes.
method Leveraging compositional time series and regularization methods, the paper considers autoregressive multinomial and logistic-normal models for network estimation.
result The logistic-normal model leads to a convex negative log-likelihood objective and captures dependence across categories.

EVARS-GPR refines Gaussian Process Regression for seasonal data with sudden scale changes.

problem Challenges in forecasting with changing system behavior over time.
method Combines online change point detection with data augmentation for refitting.
result 20.8% lower RMSE on real-world datasets compared to similar methods.

The paper uses machine learning to compute rare event probabilities in stochastic systems.

problem Characterizing rare events in stochastic dynamical systems with weak noise.
method Developed a neural network framework for computing quasipotential, most probable paths, and prefactors.
result Demonstrated higher effectiveness and accuracy of the algorithm in calculating mean exit times.

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.

Develops a machine learning framework for computing most probable paths in stochastic systems.

problem Computing the most probable paths in stochastic dynamical systems.
method Reformulates the boundary value problem of Hamiltonian systems and uses a neural network to solve the Euler-Lagrange equation for the Onsager-Machlup action functional.
result Demonstrates the efficacy and accuracy of the machine learning approach in computing most probable paths for stochastic systems with various types of noise.

In this paper, we present an online reinforcement learning algorithm, called Renewal Monte Carlo (RMC), for infinite horizon Markov decision processes with a designated start state. RMC is a Monte Carlo algorithm and retains the advantages of Monte Carlo methods including low bias, simplicity, and ease of implementatio…

2018-04-03abs ↗pdf ↗

Develops a new method to discover stochastic systems with non-Gaussian noise.

problem Discovering governing laws from complex systems with non-Gaussian noise.
method Theoretical framework and numerical algorithm to extract stochastic differential equations with Gaussian and non-Gaussian noise.
result Demonstrated the efficacy and accuracy of the approach on various systems.

A new method extracts events and their arguments efficiently from text.

problem Efficiently extract event information from texts with long-range dependencies and associations.
method Graph Convolutional Networks with shortest dependency paths to capture syntactic relationships.
result Significant improvement over state-of-the-art methods.