Concentration Inequalities for the Stochastic Optimization of Unbounded Objectives with Application to Denoising Score Matching
원문 초록
We derive novel concentration inequalities that bound the statistical error for a large class of stochastic optimization problems, focusing on the case of unbounded objective functions. Our derivations utilize the following tools: 1) A new form of McDiarmid's inequality that is based on sample dependent one component difference bounds and which leads to a novel uniform law of large numbers result for unbounded functions. 2) A Rademacher complexity bound for families of functions that satisfy an appropriate local Lipschitz property. As an application of these results, we derive statistical error bounds for denoising score matching (DSM), an application that inherently requires one to consider unbounded objective functions, even when the data distribution has bounded support. In addition, our results establish the benefit of sample reuse in algorithms that employ easily sampled auxiliary random variables in addition to the training data, e.g., as in DSM, which uses auxiliary Gaussian random variables.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Refining Few-Step Text-to-Multiview Diffusion via Reinforcement Learning
On Designing Diffusion Autoencoders for Efficient Generation and Representation Learning
ScoreAdv: Score-based Targeted Generation of Natural Adversarial Examples via Diffusion Models
LangMamba: A Language-driven Mamba Framework for Low-dose CT Denoising with Vision-language Models
Hierarchical Intent-guided Optimization with Pluggable LLM-Driven Semantics for Session-based Recommendation
Energy-Based Transformers are Scalable Learners and Thinkers
토론
이 논문과 연결된 포럼 글이 아직 없습니다.