Imagen de Portada

Improved Sample Complexity For Diffusion Model Training Without Empirical Risk Minimizer Access

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Gaur, Mudit, Trivedi, Prashant, Kunapuli, Sasidhar, Bedi, Amrit Singh, Aggarwal, Vaneet
Formato:	Preprint
Publicado:	2025
Materias:	Machine Learning Artificial Intelligence
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Generative Modeling with Continuous Flows: Sample Complexity of Flow Matching
por: Gaur, Mudit, et al.
Publicado: (2025)

On The Sample Complexity Bounds In Bilevel Reinforcement Learning
por: Gaur, Mudit, et al.
Publicado: (2025)

Closing the Gap: Achieving Global Convergence (Last Iterate) of Actor-Critic under Markovian Sampling with Neural Network Parametrization
por: Gaur, Mudit, et al.
Publicado: (2024)

Discrete State Diffusion Models: A Sample Complexity Perspective
por: Srikanth, Aadithya, et al.
Publicado: (2025)

Order-Optimal Sample Complexity of Rectified Flows
por: Sahoo, Hari Krishna, et al.
Publicado: (2026)

Align-Pro: A Principled Approach to Prompt Optimization for LLM Alignment
por: Trivedi, Prashant, et al.
Publicado: (2025)

Achieving Zero Constraint Violation for Constrained Reinforcement Learning via Conservative Natural Policy Gradient Primal-Dual Algorithm
por: Bai, Qinbo, et al.
Publicado: (2022)

On The Global Convergence Of Online RLHF With Neural Parametrization
por: Gaur, Mudit, et al.
Publicado: (2024)

Sample Complexity Analysis for Constrained Bilevel Reinforcement Learning
por: Saxena, Naman, et al.
Publicado: (2026)

Improved Sample Complexity Analysis of Natural Policy Gradient Algorithm with General Parameterization for Infinite Horizon Discounted Reward Markov Decision Processes
por: Mondal, Washim Uddin, et al.
Publicado: (2023)

Oracle-Robust Online Alignment for Large Language Models
por: Li, Zimeng, et al.
Publicado: (2026)

Sample-Efficient Constrained Reinforcement Learning with General Parameterization
por: Mondal, Washim Uddin, et al.
Publicado: (2024)

Improved Bayesian Regret Bounds for Thompson Sampling in Reinforcement Learning
por: Moradipari, Ahmadreza, et al.
Publicado: (2023)

BalancedDPO: Adaptive Multi-Metric Alignment
por: Tamboli, Dipesh, et al.
Publicado: (2025)

Why Pass@k Optimization Can Degrade Pass@1: Prompt Interference in LLM Post-training
por: Barakat, Anas, et al.
Publicado: (2026)

SafeR-CLIP: Mitigating NSFW Content in Vision-Language Models While Preserving Pre-Trained Knowledge
por: Yousaf, Adeel, et al.
Publicado: (2025)

Last-Iterate Convergence of General Parameterized Policies in Constrained MDPs
por: Mondal, Washim Uddin, et al.
Publicado: (2024)

$γ$-weakly $θ$-up-concavity: A Unified Framework for Non-Convex Optimization Beyond DR-Submodular and OSS Functions
por: Pedramfar, Mohammad, et al.
Publicado: (2026)

Accelerating Quantum Reinforcement Learning with a Quantum Natural Policy Gradient Based Approach
por: Xu, Yang, et al.
Publicado: (2025)

Constrained Reinforcement Learning with Average Reward Objective: Model-Based and Model-Free Algorithms
por: Aggarwal, Vaneet, et al.
Publicado: (2024)

Stronger Approximation Guarantees for Non-Monotone γ-Weakly DR-Submodular Maximization
por: Jadav, Hareshkumar, et al.
Publicado: (2026)

Stochastic Submodular Bandits with Delayed Composite Anonymous Bandit Feedback
por: Pedramfar, Mohammad, et al.
Publicado: (2023)

Draft-Conditioned Constrained Decoding for Structured Generation in LLMs
por: Reddy, Avinash, et al.
Publicado: (2026)

Variational Offline Multi-agent Skill Discovery
por: Chen, Jiayu, et al.
Publicado: (2024)

Efficient $Q$-Learning and Actor-Critic Methods for Robust Average Reward Reinforcement Learning
por: Xu, Yang, et al.
Publicado: (2025)

On the Global Optimality of Policy Gradient Methods in General Utility Reinforcement Learning
por: Barakat, Anas, et al.
Publicado: (2024)

MAD-OOD: A Deep Learning Cluster-Driven Framework for an Out-of-Distribution Malware Detection and Classification
por: Ige, Tosin, et al.
Publicado: (2025)

Multi-LLM QA with Embodied Exploration
por: Patel, Bhrij, et al.
Publicado: (2024)

Don't Freeze, Don't Crash: Extending the Safe Operating Range of Neural Navigation in Dense Crowds
por: Zhang, Jiefu, et al.
Publicado: (2026)

Learning General Parameterized Policies for Infinite Horizon Average Reward Constrained MDPs via Primal-Dual Policy Gradient Algorithm
por: Bai, Qinbo, et al.
Publicado: (2024)

Regret Analysis of Policy Gradient Algorithm for Infinite Horizon Average Reward Markov Decision Processes
por: Bai, Qinbo, et al.
Publicado: (2023)

BAGEL: Projection-Free Algorithm for Adversarially Constrained Online Convex Optimization
por: Lu, Yiyang, et al.
Publicado: (2025)

Augmenting generative models with biomedical knowledge graphs improves targeted drug discovery
por: Malusare, Aditya, et al.
Publicado: (2025)

Joint Optimization of Multi-Objective Reinforcement Learning with Policy Gradient Based Algorithm
por: Bai, Qinbo, et al.
Publicado: (2021)

Quantum Speedups in Regret Analysis of Infinite Horizon Average-Reward Markov Decision Processes
por: Ganguly, Bhargav, et al.
Publicado: (2023)

Code Comprehension then Auditing for Unsupervised LLM Evaluation
por: Patel, Bhrij, et al.
Publicado: (2024)

SAIL: Self-Improving Efficient Online Alignment of Large Language Models
por: Ding, Mucong, et al.
Publicado: (2024)

ECPv2: Fast, Efficient, and Scalable Global Optimization of Lipschitz Functions
por: Fourati, Fares, et al.
Publicado: (2025)

Stochastic Q-learning for Large Discrete Action Spaces
por: Fourati, Fares, et al.
Publicado: (2024)

A Unified Approach for Maximizing Continuous DR-submodular Functions
por: Pedramfar, Mohammad, et al.
Publicado: (2023)