← Back
FeaturedAIModels#Hawkes-CT DDPG#Hawkes process#Reinforcement Learning#Stochastic Control

Continuous-Time Reinforcement Learning for Controlled Hawkes Jump-Diffusions

arXiv AI/CL/LG(论文)T2
01:4008/20, 01:40 AMPaperRead the original ↗Export MD ↓

Score

73
Information gain9 ×0.3

首次将连续时间强化学习系统应用于非马尔可夫Hawkes跳跃扩散控制,提出新算法和收敛性理论,信息增量大。

Content quality8 ×0.2

理论证明完整,实验对比多种核函数,结构严谨,方法细节清晰。

Practical value8 ×0.2

无模型算法可应用于金融、网络等事件驱动场景,实用性较强。

Timeliness7 ×0.15

arXiv预印本,日期疑似为未来编号,但内容紧跟强化学习与随机控制前沿。

Source reliability8 ×0.15

来源为arXiv AI/CL/LG,属于权威预印本平台,且作者有完整学术论证。

Base 81.5 × T2 Source weight ×0.9 = 73

Curation line 70Selected

Why selected

Strong methodological innovation with theoretical proofs and empirical validation, significantly advancing the intersection of continuous-time stochastic control and reinforcement learning.

AI commentary

「The most noteworthy aspect is moving reinforcement learning beyond discrete-time paradigms to handle Hawkes processes with memory. If you work on high-frequency trading or event sequence modeling, this model-free continuous-time control method may be more suitable for real-world systems than off-the-shelf DQN-style tools.」

Quick overview

This study addresses stochastic control of multivariate Hawkes-driven stochastic differential equations using machine learning algorithms in a non-Markovian setting. Due to the path dependence of Hawkes intensity memory, the problem does not fit classical stochastic control theory. The authors develop a finite-dimensional Markovianization procedure approximating multivariate Hawkes processes with mixtures of exponential kernels and prove convergence. They then formulate continuous-time deterministic policy gradient learning, called Hawkes-CT DDPG, which solves the non-Markovian optimization model-free by observing only event times, SDE realizations, and decay filters, without knowing Hawkes kernel coefficients. Comparisons against discrete-time reinforcement learning under exponential, Erlang, and power-law kernels demonstrate the effectiveness of the proposed method.

  • Proposes a finite-dimensional Markovianization method for Hawkes jump-diffusions, proving convergence of the process, intensity, and value function
  • Designs Hawkes-CT DDPG, a continuous-time deterministic policy gradient algorithm for model-free learning
  • Requires only event times, SDE solutions, and decay filters, without knowing Hawkes kernel coefficients
  • Demonstrates advantages over discrete-time RL under exponential, Erlang, and power-law kernels

Full text

This is an AI-generated Chinese digest; use "View original" for the source text.

This paper studies the control of multivariate Hawkes-driven stochastic differential equations. The key difficulty is that the memory of the Hawkes intensity makes the system non-Markovian, so classical stochastic control theory cannot be directly applied. The authors construct a finite-dimensional Markovianized system by approximating the kernel with a mixture of exponentials, and prove that the approximated Hawkes process, its intensity, and the value function converge to those of the original non-Markovian problem. They then propose Hawkes-CT DDPG, a continuous-time deterministic policy gradient algorithm. This model-free method learns optimal control policies using only event times, SDE paths, and a set of decay filters, without requiring explicit knowledge of Hawkes kernel coefficients. Experiments compare against discrete-time RL under simple exponential, Erlang, and power-law kernels, showing competitive control performance and sample efficiency. This work opens a new avenue for controlling stochastic systems with memory, with potential applications in high-frequency finance, epidemic modeling, and social network diffusion.

Related items

92
08:00OpenRouter:Announcements(RSS)T1RSS

FeaturedDeepSeek V4 Doubles Token Share on OpenRouter, Driven by Agentic Workloads

DeepSeek V4 在 OpenRouter 上的代币份额翻倍,智能体工作负载成主要驱动力

The rapid adoption of DeepSeek V4 signals a strong market preference for high-performance, low-cost inference models, especially as agentic use cases reshape AI deployment.

AIModels#DeepSeek#OpenRouter#V4 Flash
91

Five-dimension score

Information gain9 ×0.3

详细揭示了两个具体设置如何协同作用实现三倍性能提升,信息增量高。

Content quality8 ×0.2

来自OpenAI官方,数据明确,结构清晰,但缺少对比实验细节。

Practical value9 ×0.2

为AI工程师提供了可直接操作的性能调优方案,实用性强。

Timeliness10 ×0.15

消息刚发布,具有高度时效性。

Source reliability10 ×0.15

信源为OpenAI官方新闻,权威可靠。

Base 91 × T1 Source weight ×1 = 91

Curation line 60Selected

23:00OpenAI:News(RSS)T1RSS

FeaturedEnabling Two Settings Triples ARC-AGI-3 Benchmark Scores

启用两项设置使ARC-AGI-3基准测试分数提升三倍

This finding is crucial! It shows that model performance depends not only on training but also on inference-time configuration. For AI engineers and researchers, this is a must-know optimization direction. Teams deploying models on resource-constrained devices in particular could find a low-cost way to boost capabilities.

TechModels#ARC-AGI-3#GPT-5.6#OpenAI
91

Five-dimension score

Information gain9 ×0.3

首次公开GPT-5.6具体效率优化细节,此前仅有传闻。

Content quality8 ×0.2

内容简洁,关键指标明确,但缺乏详细技术文档支撑。

Practical value9 ×0.2

直接指导企业如何降低AI部署成本,具有商业参考价值。

Timeliness10 ×0.15

刚发布的官方新闻,时效性极强。

Source reliability10 ×0.15

来源为OpenAI官方博客,信源权威。

Base 91 × T1 Source weight ×1 = 91

Curation line 60Selected

08:00OpenAI:News(RSS)T1RSS

FeaturedGPT-5.6: Fusing Frontier Intelligence with Frontier Efficiency

GPT-5.6:前沿智能与前沿效率的融合

This news is worth watching as it marks a shift from pure parameter scaling to efficiency competition. For AI developers and business decision-makers, GPT-5.6 means higher performance at lower cost, especially for long-context or agentic tasks previously hindered by inference expenses. OpenAI's move may redefine what 'frontier' means.

AIModels#Agent Workflows#GPT-5.6#OpenAI
91

Five-dimension score

Information gain8 ×0.3

首次提出针对CPU优化的1M上下文模型,填补了边缘设备长文本推理的空白,信息增量显著。

Content quality9 ×0.2

技术细节清晰,提供了基准测试对比和架构解释,图文并茂,质量上乘。

Practical value10 ×0.2

直接降低长上下文应用的硬件成本,开源权重可立即部署,实用价值极高。

Timeliness10 ×0.15

当日发布的博客,且长上下文推理是当前AI热点,时效性满分。

Source reliability9 ×0.15

Hugging Face官方博客,作者为Liquid AI,属于第一方技术发布,可信度高。

Base 90.5 × T1 Source weight ×1 = 91

Curation line 60Selected

23:01Hugging Face:Blog(RSS)T1RSS

FeaturedLFM2.5-Encoders: New Models for Fast Long-Context Inference on CPU

LFM2.5-Encoder:面向CPU快速长上下文推理的新模型

This blog post catches my eye because it directly solves the pain point of running long-context LLMs on CPU. For teams or individual developers without high-end GPUs, the LFM2.5-Encoder series offers a ready-to-use open-source solution. Highly recommended for those working on RAG, document search, or code analysis—now a standard server can handle million-token documents.

AIModels#CPU Inference Optimization#LFM2.5-Encoder#Liquid AI
91

Five-dimension score

Information gain9 ×0.3

首次公开自动化红队系统的具体机制与实验发现,信息增量高。

Content quality8 ×0.2

来自官方,结构清晰,但未提供完整技术细节(如具体模型版本),扣1分。

Practical value9 ×0.2

对AI安全工程师、模型开发者和企业部署者直接指导作用,实用性极强。

Timeliness10 ×0.15

刚刚发布,是当前AI安全领域最前沿进展之一。

Source reliability10 ×0.15

信源为OpenAI官方新闻,权威且一手。

Base 91 × T1 Source weight ×1 = 91

Curation line 60Selected

18:00OpenAI:News(RSS)T1RSS

FeaturedGPT-Red: OpenAI Automates Red Teaming via Self-Play to Boost Model Robustness

GPT-Red:OpenAI通过自我对弈实现AI红队自动化,提升模型鲁棒性

GPT-Red marks a milestone from human to automated red-teaming—essential for safety engineers and alignment researchers. While reducing cost, it also raises ethical questions about automated attacks, worth pondering for everyone in AI governance.

AIModels#AI Safety Alignment#GPT-Red#OpenAI
91

Five-dimension score

Information gain9 ×0.3

这是首个针对AI模型生物安全的漏洞赏金计划,为行业提供了全新的安全评估视角。

Content quality9 ×0.2

官方来源,内容清晰,涵盖范围、奖励、准则等关键细节。

Practical value8 ×0.2

对AI安全研究员和生物安全专家有直接参与价值,但普通用户关联度较低。

Timeliness10 ×0.15

刚刚发布,完全符合新闻时效要求。

Source reliability10 ×0.15

OpenAI官方RSS和博客,信源权威可靠。

Base 91 × T1 Source weight ×1 = 91

Curation line 60Selected

18:00OpenAI:News(RSS)T1RSS

FeaturedOpenAI Launches GPT-5.5 Bio Bug Bounty Program

OpenAI推出GPT-5.5生物漏洞赏金计划

This program deserves attention as it pioneers the extension of AI bug bounty to biosecurity, offering a new research direction for the security community and a practical training ground for AI risk governance. It is particularly important for model safety researchers, biosecurity experts, and practitioners concerned about dual-use AI risks.

AIModels#Bio Bug Bounty#GPT-5.5#OpenAI
91

Five-dimension score

Information gain8 ×0.3

公布了vLLM新后端的具体架构设计与实测数据,对了解推理优化前沿有较高信息增量。

Content quality9 ×0.2

技术细节清晰,有定量性能对比,来源为官方博客,内容质量高。

Practical value10 ×0.2

直接降低LLM部署门槛与成本,对AI工程化落地具有极高实用价值。

Timeliness10 ×0.15

发布即时,属于最新技术动态,时效性满分。

Source reliability9 ×0.15

来源为Hugging Face官方博客,vLLM为开源权威项目,可信度高。

Base 90.5 × T1 Source weight ×1 = 91

Curation line 60Selected

08:00Hugging Face:Blog(RSS)T1RSS

FeaturedvLLM Introduces Native-Speed Transformers Modeling Backend for Enhanced Inference Performance

vLLM推出原生速度Transformers建模后端,大幅提升推理性能

This update is critical for AI engineering teams: eliminating format conversion speeds up model iteration, and 2-5x speedup directly reduces GPU costs. If you're building LLM online services or batch inference, this is practically a must-read technical update.

AIModels#Hugging Face#PagedAttention#Transformers
90

Five-dimension score

Information gain9 ×0.3

手语转文本是AI无障碍领域的新突破,提供了此前罕见的具体模型信息。

Content quality8 ×0.2

来源权威,内容清晰描述了模型功能、应用场景和开发理念。

Practical value9 ×0.2

对聋人群体、开发者和无障碍研究者具有直接参考与应用价值。

Timeliness9 ×0.15

刚刚发布的官方公告,时效性非常高。

Source reliability10 ×0.15

Google DeepMind官方博客,信源可信度极高。

Base 89.5 × T1 Source weight ×1 = 90

Curation line 60Selected

22:01Google DeepMind:Blog(RSS)T1RSS

FeaturedGoogle DeepMind Introduces SL2T, a Sign Language-to-Text Model for Deaf Users

Google DeepMind 发布手语转文本模型 SL2T,助力聋人用户

This news matters not only as a technical breakthrough but also as a sign that AI is beginning to address the needs of marginalized groups. For developers, the architecture and technical approach of SL2T merit deep study; for accessibility advocates, it's a key case for advancing industry standards.

AIModels#Google DeepMind#SL2T#Sign Language Recognition

Verify against the original source before citing