Search:
Match:
2 results

Analysis

This paper addresses a challenging class of multiobjective optimization problems involving non-smooth and non-convex objective functions. The authors propose a proximal subgradient algorithm and prove its convergence to stationary solutions under mild assumptions. This is significant because it provides a practical method for solving a complex class of optimization problems that arise in various applications.
Reference

Under mild assumptions, the sequence generated by the proposed algorithm is bounded and each of its cluster points is a stationary solution.

LacaDM: New AI Model for Multi-Objective Reinforcement Learning

Published:Dec 22, 2025 16:08
1 min read
ArXiv

Analysis

This research introduces LacaDM, a novel approach using latent causal diffusion models for multi-objective reinforcement learning. The paper's contribution lies in its application of diffusion models to address the complexities of reinforcement learning with multiple objectives, which is a growing area of interest.
Reference

LacaDM is a Latent Causal Diffusion Model for Multiobjective Reinforcement Learning.