https://w3id.org/kpxl/ios/ds/np/RAZmAIr2d5... RAZmAIr2d5

links a nanopublication to its assertion http://www.nanopub.org/nschema#hasAssertion assertion

https://w3id.org/kpxl/ios/ds/terms/SAC-TD3_Hybrid SAC-TD3_Hybrid

http://www.w3.org/2002/07/owl#sameAs sameAs

Tobias Kuhn

2024-10-04T09:20:40.120Z

https://w3id.org/np/RAgOeYsOZ9... RAgOeYsOZ9

links a nanopublication to its assertion http://www.nanopub.org/nschema#hasAssertion assertion

http://www.w3.org/1999/02/22-rdf-syntax-ns#type type

http://www.w3.org/2002/07/owl#Class Class

(unknown)

2024-10-02T09:51:13.183Z

https://w3id.org/np/RAgOeYsOZ9... RAgOeYsOZ9

links a nanopublication to its assertion http://www.nanopub.org/nschema#hasAssertion assertion

http://www.w3.org/2000/01/rdf-schema#label label

SAC-TD3 Hybrid

(unknown)

2024-10-02T09:51:13.183Z

https://w3id.org/np/RAgOeYsOZ9... RAgOeYsOZ9

links a nanopublication to its assertion http://www.nanopub.org/nschema#hasAssertion assertion

http://www.w3.org/2000/01/rdf-schema#subClassOf subClassOf

http://www.wikidata.org/entity/Q8366 Q8366

(unknown)

2024-10-02T09:51:13.183Z

https://w3id.org/np/RAgOeYsOZ9... RAgOeYsOZ9

links a nanopublication to its assertion http://www.nanopub.org/nschema#hasAssertion assertion

http://www.w3.org/2004/02/skos/core#definition definition

SAC-TD3 is an algorithm incorporating elements both from the SAC and TD3 algorithms for reinforcement learning. It incorporates the idea of entropy regularization from SAC while borrowing target policy smoothening, delayed policy updates from the TD3 algorithm. It has been used to estimate the reaction barrier given a potential energy surface. Stable states in complex systems correspond to local minima on the associated potential energy surface, transitions between which govern the dynamics of the system. Precisely determining the transition pathways in complex and high-dimensional systems is challenging because these transitions are rare events, and the system remains near a local minimum for most of the time. The probability of such transitions decreases exponentially with the height of the energy barrier, making the system's dynamics highly sensitive to the calculated energy barriers. This problem has is formulated as a cost-minimization problem and solved using the aforementioned reinforcement learning algorithm. The exploratory nature of the algorithm enables efficient sampling and better estimation of the minimum energy barrier for transitions.

(unknown)

2024-10-02T09:51:13.183Z

https://w3id.org/np/RAgOeYsOZ9... RAgOeYsOZ9

links a nanopublication to its assertion http://www.nanopub.org/nschema#hasAssertion assertion

http://www.w3.org/2004/02/skos/core#relatedMatch relatedMatch

http://www.wikidata.org/entity/Q830687 Q830687

(unknown)

2024-10-02T09:51:13.183Z

https://w3id.org/np/RAgOeYsOZ9... RAgOeYsOZ9

links a nanopublication to its assertion http://www.nanopub.org/nschema#hasAssertion assertion

http://www.w3.org/2004/02/skos/core#relatedMatch relatedMatch

http://www.wikidata.org/entity/Q65079156 Q65079156

(unknown)

2024-10-02T09:51:13.183Z

https://w3id.org/np/RAgOeYsOZ9... RAgOeYsOZ9

links a nanopublication to its pubinfo http://www.nanopub.org/nschema#hasPublicationInfo pubinfo

https://w3id.org/np/RAgOeYsOZ9... RAgOeYsOZ9

http://purl.org/nanopub/x/introduces introduces

(unknown)

2024-10-02T09:51:13.183Z