Goto

Collaborating Authors

 Reinforcement Learning







APPENDIX MADG: Margin-based Adversarial Learning for Domain Generalization

Neural Information Processing Systems

Theorem 2. Consider a mixture of Theorem 3. Given the same setting as Corollary 1 and Lemma 3, for any From Lemma 3, we upper-bound the expected MDD as shown below. Using the above results and Corollary 1, we get Theorem 3 . In this section, we discuss earlier literature proposed for the DG problem, in terms of their broad categories. By conducting experiments on these benchmark datasets, we ensure a comprehensive evaluation of the proposed MADG model's performance, taking into account diverse domains, varying class distributions, and image characteristics. This section provides detailed results for each domain on all five datasets in Tables A3 to A7.




Latent Exploration for Reinforcement Learning

Neural Information Processing Systems

While this unstructured exploration has proven successful in numerous tasks, it can be suboptimal for overactuated systems. When multiple actuators, such as motors or muscles, drive behavior, uncorrelated perturbations risk diminishing each other's effect, or modifying the behavior in a task-irrelevant way. While solutions to introduce time correlation across action perturbations exist, introducing correlation across actuators has been largely ignored.