Saved in:
| Main Authors: | Wang, Yue, Zhou, Yi, Zou, Shaofeng |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2209.02555 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Non-Asymptotic Analysis for Single-Loop (Natural) Actor-Critic with Compatible Function Approximation
by: Wang, Yudan, et al.
Published: (2024)
by: Wang, Yudan, et al.
Published: (2024)
Achieving the Asymptotically Optimal Sample Complexity of Offline Reinforcement Learning: A DRO-Based Approach
by: Wang, Yue, et al.
Published: (2023)
by: Wang, Yue, et al.
Published: (2023)
Model-Free Robust Reinforcement Learning with Sample Complexity Analysis
by: Wang, Yudan, et al.
Published: (2024)
by: Wang, Yudan, et al.
Published: (2024)
Convergence Guarantees for RMSProp and Adam in Generalized-smooth Non-convex Optimization with Affine Noise Variance
by: Zhang, Qi, et al.
Published: (2024)
by: Zhang, Qi, et al.
Published: (2024)
GQ-VAE: A gated quantized VAE for learning variable length tokens
by: Datta, Theo, et al.
Published: (2025)
by: Datta, Theo, et al.
Published: (2025)
Large-Scale Non-convex Stochastic Constrained Distributionally Robust Optimization
by: Zhang, Qi, et al.
Published: (2024)
by: Zhang, Qi, et al.
Published: (2024)
Adaptive Gradient Normalization and Independent Sampling for (Stochastic) Generalized-Smooth Optimization
by: Yang, Yufeng, et al.
Published: (2024)
by: Yang, Yufeng, et al.
Published: (2024)
Lower Bounds for Greedy Teaching Set Constructions
by: Compton, Spencer, et al.
Published: (2025)
by: Compton, Spencer, et al.
Published: (2025)
Near-Optimal Sample Complexity for Iterated CVaR Reinforcement Learning with a Generative Model
by: Deng, Zilong, et al.
Published: (2025)
by: Deng, Zilong, et al.
Published: (2025)
Finite-Time Logarithmic Bayes Regret Upper Bounds
by: Atsidakou, Alexia, et al.
Published: (2023)
by: Atsidakou, Alexia, et al.
Published: (2023)
Why Adam Can Beat SGD: Second-Moment Normalization Yields Sharper Tails
by: Jin, Ruinan, et al.
Published: (2026)
by: Jin, Ruinan, et al.
Published: (2026)
Finite-Sample Wasserstein Error Bounds and Concentration Inequalities for Nonlinear Stochastic Approximation
by: Kong, Seo Taek, et al.
Published: (2026)
by: Kong, Seo Taek, et al.
Published: (2026)
Step-level Denoising-time Diffusion Alignment with Multiple Objectives
by: Zhang, Qi, et al.
Published: (2026)
by: Zhang, Qi, et al.
Published: (2026)
Finite Neural Networks as Mixtures of Gaussian Processes: From Provable Error Bounds to Prior Selection
by: Adams, Steven, et al.
Published: (2024)
by: Adams, Steven, et al.
Published: (2024)
Detector-Evasive LLM Paraphrasing via Constrained Policy Optimization
by: Wang, Mingyi, et al.
Published: (2026)
by: Wang, Mingyi, et al.
Published: (2026)
Finite-Time Bounds for Average-Reward Fitted Q-Iteration
by: Lee, Jongmin, et al.
Published: (2025)
by: Lee, Jongmin, et al.
Published: (2025)
LDC-MTL: Balancing Multi-Task Learning through Scalable Loss Discrepancy Control
by: Xiao, Peiyao, et al.
Published: (2025)
by: Xiao, Peiyao, et al.
Published: (2025)
Sample Complexity Characterization for Linear Contextual MDPs
by: Deng, Junze, et al.
Published: (2024)
by: Deng, Junze, et al.
Published: (2024)
Constrained Reinforcement Learning Under Model Mismatch
by: Sun, Zhongchang, et al.
Published: (2024)
by: Sun, Zhongchang, et al.
Published: (2024)
A Finite Sample Complexity Bound for Distributionally Robust Q-learning
by: Wang, Shengbo, et al.
Published: (2023)
by: Wang, Shengbo, et al.
Published: (2023)
Theoretical Study of Conflict-Avoidant Multi-Objective Reinforcement Learning
by: Wang, Yudan, et al.
Published: (2024)
by: Wang, Yudan, et al.
Published: (2024)
Lower Bound on the Greedy Approximation Ratio for Adaptive Submodular Cover
by: Harris, Blake, et al.
Published: (2024)
by: Harris, Blake, et al.
Published: (2024)
LINC: Decoupling Local Consequence Scoring from Hidden Matching in Constructive Neural Routing
by: Qin, Shaofeng, et al.
Published: (2026)
by: Qin, Shaofeng, et al.
Published: (2026)
Operator Learning for Schrödinger Equation: Unitarity, Error Bounds, and Time Generalization
by: Patel, Yash, et al.
Published: (2025)
by: Patel, Yash, et al.
Published: (2025)
Finite-Time Error Analysis of Soft Q-Learning: Switching System Approach
by: Jeong, Narim, et al.
Published: (2024)
by: Jeong, Narim, et al.
Published: (2024)
Error-quantified Conformal Inference for Time Series
by: Wu, Junxi, et al.
Published: (2025)
by: Wu, Junxi, et al.
Published: (2025)
The Exploration of Error Bounds in Classification with Noisy Labels
by: Liu, Haixia, et al.
Published: (2025)
by: Liu, Haixia, et al.
Published: (2025)
A Greedy Strategy for Graph Cut
by: Nie, Feiping, et al.
Published: (2024)
by: Nie, Feiping, et al.
Published: (2024)
MGDA Converges under Generalized Smoothness, Provably
by: Zhang, Qi, et al.
Published: (2024)
by: Zhang, Qi, et al.
Published: (2024)
Nonasymptotic CLT and Error Bounds for Two-Time-Scale Stochastic Approximation
by: Kong, Seo Taek, et al.
Published: (2025)
by: Kong, Seo Taek, et al.
Published: (2025)
Greedy Information Projection for LLM Data Selection
by: Dong, Victor Ye, et al.
Published: (2026)
by: Dong, Victor Ye, et al.
Published: (2026)
Relative Error Bound Analysis for Nuclear Norm Regularized Matrix Completion
by: Zhang, Lijun, et al.
Published: (2015)
by: Zhang, Lijun, et al.
Published: (2015)
Optimization of Epsilon-Greedy Exploration
by: Che, Ethan, et al.
Published: (2025)
by: Che, Ethan, et al.
Published: (2025)
Extremely Greedy Equivalence Search
by: Nazaret, Achille, et al.
Published: (2025)
by: Nazaret, Achille, et al.
Published: (2025)
Error Bounds for Flow Matching Methods
by: Benton, Joe, et al.
Published: (2023)
by: Benton, Joe, et al.
Published: (2023)
Classification Error Bound for Low Bayes Error Conditions in Machine Learning
by: Yang, Zijian, et al.
Published: (2025)
by: Yang, Zijian, et al.
Published: (2025)
Error Slice Discovery via Manifold Compactness
by: Yu, Han, et al.
Published: (2025)
by: Yu, Han, et al.
Published: (2025)
Greedy Alignment Principle for Optimizer Selection
by: Lee, Jaerin, et al.
Published: (2025)
by: Lee, Jaerin, et al.
Published: (2025)
QGFN: Controllable Greediness with Action Values
by: Lau, Elaine, et al.
Published: (2024)
by: Lau, Elaine, et al.
Published: (2024)
Revisiting Randomization in Greedy Model Search
by: Chen, Xin, et al.
Published: (2025)
by: Chen, Xin, et al.
Published: (2025)
Similar Items
-
Non-Asymptotic Analysis for Single-Loop (Natural) Actor-Critic with Compatible Function Approximation
by: Wang, Yudan, et al.
Published: (2024) -
Achieving the Asymptotically Optimal Sample Complexity of Offline Reinforcement Learning: A DRO-Based Approach
by: Wang, Yue, et al.
Published: (2023) -
Model-Free Robust Reinforcement Learning with Sample Complexity Analysis
by: Wang, Yudan, et al.
Published: (2024) -
Convergence Guarantees for RMSProp and Adam in Generalized-smooth Non-convex Optimization with Affine Noise Variance
by: Zhang, Qi, et al.
Published: (2024) -
GQ-VAE: A gated quantized VAE for learning variable length tokens
by: Datta, Theo, et al.
Published: (2025)