Approximation of optimization problems with constraints through kernel Sum-Of-Squares
원문 초록
Handling an infinite number of inequality constraints in infinite-dimensional spaces occurs in many fields, from global optimization to optimal transport. These problems have been tackled individually in several previous articles through kernel Sum-Of-Squares (kSoS) approximations. We propose here a unified theorem to prove convergence guarantees for these schemes. Pointwise inequalities are turned into equalities within a class of nonnegative kSoS functions. Assuming further that the functions appearing in the problem are smooth, focusing on pointwise equality constraints enables the use of scattering inequalities to mitigate the curse of dimensionality in sampling the constraints. Our approach is illustrated in learning vector fields with side information, here the invariance of a set.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
AI Wizards at CheckThat! 2025: Enhancing Transformer-Based Embeddings with Sentiment for Subjectivity Detection in News Articles
Remember Past, Anticipate Future: Learning Continual Multimodal Misinformation Detectors
Narrative Shift Detection: A Hybrid Approach of Dynamic Topic Models and Large Language Models
NeRF-based CBCT Reconstruction needs Normalization and Initialization
Characterizing Linguistic Shifts in Croatian News via Diachronic Word Embeddings
How Grounded is Wikipedia? A Study on Structured Evidential Support
토론
이 논문과 연결된 포럼 글이 아직 없습니다.