Uploaded October 2026 | Updated November 2026, 4 days ago
DecisionSystems.jl: Closing the Loop Between Physics and Decisions by Venkatesh-Prasad Bhat
PreTalx: pretalx.com/juliacon-2026/talk/HMSN8Q
Decisions often affect the dynamics of a system. DecisionSystem is a unified way of capturing both dynamics and decisions of complex systems.
Real systems don't just evolve, they respond. DecisionSystems is a unified way of capturing physics simulation and decision-making, letting you model the full cycle: simulate dynamics, observe state, decide, act, repeat.
A vehicle braking system. A drug dosing schedule. A spacecraft attitude controller. What these share is a fundamental loop: physics evolves continuously, an agent decides discretely, and those decisions reshape the physics.
DecisionSystems.jl provides an optimized API to design experiments to define these dynamics in Dyad (ModelingToolkit) and add decision parameters to iteratively update actions based on MDP, POMDP and RL environments. The library handles: state extraction, integrator stepping, action application, and belief tracking under uncertainty.
Using examples, the talk walks through the core idea, its generalizations, and what it unlocks for hybrid physical-decision systems in Julia, covering both current features and what's planned.
DecisionSystems.jl: Closing the Loop Between Physics and Decisions by Venkatesh-Prasad Bhat
PreTalx: pretalx.com/juliacon-2026/talk/HMSN8Q
Decisions often affect the dynamics of a system. DecisionSystem is a unified way of capturing both dynamics and decisions of complex systems.
Real systems don't just evolve, they respond. DecisionSystems is a unified way of capturing physics simulation and decision-making, letting you model the full cycle: simulate dynamics, observe state, decide, act, repeat.
A vehicle braking system. A drug dosing schedule. A spacecraft attitude controller. What these share is a fundamental loop: physics evolves continuously, an agent decides discretely, and those decisions reshape the physics.
DecisionSystems.jl provides an optimized API to design experiments to define these dynamics in Dyad (ModelingToolkit) and add decision parameters to iteratively update actions based on MDP, POMDP and RL environments. The library handles: state extraction, integrator stepping, action application, and belief tracking under uncertainty.
Using examples, the talk walks through the core idea, its generalizations, and what it unlocks for hybrid physical-decision systems in Julia, covering both current features and what's planned.



.
For structured systems with many variables, such as minimal problems in computer vision, the resulting Vandermonde-like interpolation matrices become prohibitively large, leading to expensive nullspace computations and numerical instability. We address this by exploiting equivariance of minimal problems with respect to matrix Lie group actions. The interpolation space of bounded-degree polynomials decomposes into isotypic components as a representation of the Lie symmetry group, allowing a substantial reduction of the problem size. This representation-theoretic decomposition is implemented in the Julia package [DecomposingGroupRepresentations.jl](https://github.com/MultivariatePolynomialSystems/DecomposingGroupRepresentations.jl). Together, these tools provide a scalable Julia-based framework that integrates monodromy and computational representation theory to recover closed-form symmetries of polynomial systems. Using monodromy and representation theory to recover symmetries of polynomial systems | Korotynskiy](https://i.ytimg.com/vi/sQnEwwvZYoA/mqdefault.jpg)
. This work provides the framework for identifying optimal algorithms for refinement of protein structures.
Protein structures are determined experimentally by X‑ray crystallography, electron microscopy, or NMR, or they are predicted with AlphaFold or RoseTTAFold [1,2]. Either way, the resulting protein models often contain missing atoms, distorted bond lengths, or unrealistic side chain orientations generating severe steric clashes and steep energy gradients. Energy minimization is thus essential to achieve physically realistic conformations. While classical minimizers (e.g., conjugate gradient, quasi-Newton) are standard, we demonstrate how machine learning (ML) optimizers can be effectively adapted to this domain.
We introduce a novel mini-batching strategy for ML-based minimization (e.g., SGD, ADAM), implemented in BiochemicalAlgorithms.jl, our library for molecular analysis and simulation [3]. The library provides molecular mechanic functionalities to evaluate energy gradients and corresponding forces, which are essential for energy minimization. Our mini-batching strategy partitions the force‑field contributions by atom‑pair groups, allowing the energy and gradient calculations to be performed on small batches corresponding to random selected portions of the molecule.
Furthermore, a major contribution of this work is a systematic assessment of different optimization algorithms by leveraging the unified Optimization.jl ecosystem—an interface that connects to more than 25 optimization libraries [4].
Our approach supports the possibility of interchanging solvers including SGD and ADAM or alternative ML solvers for energy minimization of proteins without custom code per algorithm.
Using a representative set of proteins from each of the five top‑level SCOP classes, we compared runtime and convergence precision across the solvers. The results highlight which algorithms deliver the best trade‑off between speed and final energy for different structural families.
Overall, the talk will demonstrate how the proposed mini‑batching scheme opens a path towards ML‑augmented protein‑structure refinement and how a single, extensible optimization interface can streamline the evaluation of diverse minimization strategies for protein structure relaxation.
[1] J. Jumper et al., “Highly accurate protein structure prediction with AlphaFold,” Nature, vol. 596, pp. 583‑589, 2021, doi: 10.1038/s41586‑021‑03819‑2.
[2] M. Baek et al., “Accurate prediction of protein structures and interactions using a three‑track neural network,” Science, vol. 373, pp. 871‑876, 2021, doi: 10.1126/science.abj8754.
[3] J. Leclaire et al., “Structure‑based bioinformatics with BiochemicalAlgorithms.jl,” in Proceedings of the JuliaCon Conferences, vol. 7, no. 78, p. 188, 2025, doi: 10.21105/jcon.00188.
[4] V. K. Dixit and C. Rackauckas, “Optimization.jl: A unified optimization package (version v3.12.1),” Zenodo, Mar. 2024. [Online]. Available: https://doi.org/10.5281/zenodo.7738525.
[5] N. K. Fox, S. E. Brenner, and J. M. Chandonia, “SCOPe: Structural classification of proteins—extended, integrating SCOP and ASTRAL data and classification of new structures,” Nucleic Acids Res., vol. 42, no. D1, pp. D304‑D309, 2014, doi: 10.1093/nar/gkt1240. Effects of stochasticity on molecular minimization | Leclaire | JuliaCon Global 2026](https://i.ytimg.com/vi/sbtZq2jgngw/mqdefault.jpg)





