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

306090120 · Jun 202019922001200920172026
48 results for event-driven updates

New asynchronous algorithms improve speed in decentralized optimization networks.

problem Hard convergence analysis for asynchronous decentralized optimization.
method Continuized framework to analyze heterogeneous delays in event-driven updates.
result Achieves asynchronous speedup with convergence rate controlled by eigengap weighted by local delays.

REST framework predicts stock trends by considering stock-specific and related-stock events.

problem Predicting stock trends using event information from news, social media, and discussion boards.
method REST framework addresses two main shortcomings of existing event-driven methods: stock-specific event influence and related-stock event influence.
result REST framework achieves higher investment returns compared to baselines.

Paper uncovers causal structures in Hawkes processes with latent subprocesses.

problem Tackles latent subprocesses in Hawkes processes with complex event-driven interactions.
method Proposes a two-phase iterative algorithm that infers causal relationships and identifies latent subprocesses.
result Successfully recovers causal structures in datasets with latent subprocesses.

PredictionMarketBench benchmarks trading agents on prediction markets.

problem Evaluating trading agents on prediction markets with realistic conditions.
method Deterministic replay of historical data, execution-realistic simulator, agent interface.
result Fee-aware algorithmic strategies outperform naive agents in volatile episodes.

Paper proposes a new trading strategy using corporate event detection from news articles.

problem Predicting stock movements based on corporate events from news articles.
method Bi-level event detection model: low-level for token-level event identification, high-level for article-level event identification.
result The proposed strategy outperforms existing models in stock prediction metrics.

The paper challenges the assumption of a unique global time in financial markets, highlighting market incompleteness.

problem The assumption of a unique global time in financial markets is challenged.
method The paper contrasts event-time, renewal, point-process, and order-flow descriptions of financial markets.
result Non-uniqueness of time leads to a more foundational form of market incompleteness.

This paper introduces a new learning rule for probabilistic SNNs that improves log-likelihood, accuracy, and calibration.

problem Training and inference of deterministic SNNs are constrained by their inability to generate multiple independent outputs.
method Introduces a generalized expectation-maximization (GEM) learning rule for probabilistic SNNs.
result The GEM-SNN learning rule leads to significant improvements in log-likelihood, accuracy, and calibration.

Summarizes financial news for better investment decisions.

problem Information overload from financial news hinders timely investment decisions.
method Personalized Chain-of-Thought summarization framework integrating user-specified keywords.
result Personalized summaries highlight relevant market signals, improving investment narratives.

Optimizes search times by resetting agents when a threshold is reached.

problem Improving search efficiency in systems with thresholds.
method Develops a framework for correlated stochastic processes with threshold resetting.
result Optimal resetting can prevent larger losses and is applicable to various stochastic systems.

Exact simulation method for market impact estimation under various execution strategies.

problem Estimating market impact from observed price trajectories under different execution strategies.
method Conditional simulation of point processes under perturbed intensities.
result Exact, event-driven algorithm for reconstructing counterfactual paths.

This work optimizes DNN inference for energy-harvesting devices by compressing and selectively executing neural network exits.

problem Inference delays and energy inefficiency in energy-harvesting devices.
method Developed a power trace-aware and exit-guided network compression algorithm for multi-exit neural networks.
result Superior accuracy and reduced latency compared to state-of-the-art techniques.

The study uses financial events to predict stock market movements.

problem Predicting stock market movements using financial events.
method Combined event extraction method, BERT/ALBERT enhanced event representation, and extended hierarchical attention network.
result Significantly better accuracies and higher simulated returns compared to state-of-the-art models.

We propose reinforcement learning on simple networks consisting of random connections of spiking neurons (both recurrent and feed-forward) that can learn complex tasks with very little trainable parameters. Such sparse and randomly interconnected recurrent spiking networks exhibit highly non-linear dynamics that transf…

2019-06-04abs ↗pdf ↗

Fan tokens surged before World Cup matches, but declined during them, revealing cognitive biases.

problem Analyzing the impact of FIFA World Cup matches on fan tokens.
method Event study and intraday analysis of blockchain-based fan tokens.
result Fan tokens experienced a surge in returns six months before the World Cup, followed by a decline during the matches, revealing asymmetries in performance.

A new update rule for deep reinforcement learning reduces learning variance and variance in reference signals.

problem Learning variance and incorrect reference signals in deep reinforcement learning.
method t-soft update method inspired by student-t distribution, which reduces extreme updates and accelerates similar updates.
result The t-soft update method outperforms conventional methods in terms of return and variance in PyBullet robotics simulations.

Recently, the technique of local updates is a powerful tool in centralized settings to improve communication efficiency via periodical communication. For decentralized settings, it is still unclear how to efficiently combine local updates and decentralized communication. In this work, we propose an algorithm named as L…

2019-10-21abs ↗pdf ↗

The paper examines how updates to probabilistic models influence behavior based on evidence.

problem Understanding how updates to probabilistic models influence behavior based on evidence.
method Study of KL-regularized soft updates as Bayesian posterior updates within a single probabilistic model.
result Posterior updates determine relative incentives but not absolute rewards, which are ambiguous up to context-specific baselines.

In this paper, we study the randomized distributed coordinate descent algorithm with quantized updates. In the literature, the iteration complexity of the randomized distributed coordinate descent algorithm has been characterized under the assumption that machines can exchange updates with an infinite precision. We con…

2016-09-18abs ↗pdf ↗

Proposes a new method for nonlinear Bayesian updates using ensemble kernel regression.

problem Nonlinear and non-Gaussian Bayesian updates for complex systems.
method Combines Kalman filtering for observed components and kernel density estimation for unobserved components, with subsampling and clustering.
result Reduces estimation errors in highly nonlinear scenarios compared to standard linear updates.

This paper analyzes how periodic and soft target updates stabilize linear Q-learning.

problem Theoretical explanation of stabilization mechanisms for linear Q-learning.
method Exact analysis using switched linear system dynamics and the joint spectral radius.
result Periodic and soft target updates can guarantee convergence to the exact projected Q-Bellman solution under specific conditions.

In this letter, we generalize the convolutional NMF by taking the ββ-divergence as the contrast function and present the correct multiplicative updates for its factors in closed form. The new updates unify the ββ-NMF and the convolutional NMF. We state why almost all of the existing updates are inexact and approximat…

2018-03-14abs ↗pdf ↗

Improved HGF networks avoid negative precision errors in volatility updates.

problem Negative posterior precision errors in volatility-coupled nodes of HGF networks.
method Introduced a modified quadratic approximation to variational energy.
result Robust update equations across parameter space that track posterior faithfully.

Algorithm estimates bounds of updated classifier coefficients efficiently.

problem Determining sensitivity of updated classifiers without retraining.
method Proposes an algorithm to estimate upper and lower bounds of updated classifier coefficients.
result Estimates bounds with low computational complexity and tightness.