analiza aiqbench
This paper unifies stochastic process modeling with reinforcement learning by introducing action-driven processes, specifically demonstrating their utility in spiking neural networks. By leveraging control-as-inference principles, the authors establish a theoretical equivalence between minimizing Kullback-Leibler divergence and maximum entropy reinforcement learning. This work advances foundational machine learning theory by bridging probabilistic systems dynamics with policy optimization frameworks.
Action-Driven Processes for Continuous-Time Control
arXiv:2510.26672v2 Announce Type: replace-cross Abstract: At the heart of reinforcement learning are actions -- decisions made in response to observations of the environment. Actions are equally fundamental in the modeling of stochastic processes, as they trigger discontinuous state transitions and enable the flow of information through large, complex systems. In this paper, we unify the perspectives of stochastic processes and reinforcement learning through action-driven processes, and illustrate their application to spiking neural networks. Leveraging ideas from control-as-inference, we show that minimizing the Kullback-Leibler divergence between a policy-driven true distribution and a reward-driven model distribution for a suitably defined action-driven process is equivalent to maximum entropy reinforcement learning.
Abstract:At the heart of reinforcement learning are actions -- decisions made in response to observations of the environment. Actions are equally fundamental in the modeling of stochastic processes, as they trigger discontinuous state transitions and enable the flow of information through large, complex systems. In this paper, we unify the perspectives of stochastic processes and reinforcement learning through action-driven processes, and illustrate their application to spiking neural networks. Leveraging ideas from control-as-inference, we show that minimizing the Kullback-Leibler divergence between a policy-driven true distribution and a reward-driven model distribution for a suitably defined action-driven process is equivalent to maximum entropy reinforcement learning.
Machine Learning (stat.ML); Machine Learning (cs.LG)
arXiv:2510.26672 [stat.ML]
(or arXiv:2510.26672v2 [stat.ML] for this version)
https://doi.org/10.48550/arXiv.2510.26672 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 197 cuvinte
Subiecte conexe

Vertical Advantage: Transforming Industries with Lakebase and Agentic AI
Databricks · 27 aug. 2026
.webp%3Fssl%3D1&w=320)
Top 50 Best Penetration Testing Companies in 2026
Cybersecurity News · 31 iul. 2026

Hands-free first notice of loss: Using Strands Agents and Amazon Bedrock AgentCore Browser Tool for intelligent claims intake
AWS · 9 iun. 2026

Concrete Evaluations to Investigate the OpenAI Model That Hacked Hugging Face
AI Alignment Forum · 3 aug. 2026