Saved in:
| Main Authors: | Zhang, Zhiyu, Yang, Heng, Cutkosky, Ashok, Paschalidis, Ioannis Ch. |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2309.16044 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Fully Unconstrained Online Learning
by: Cutkosky, Ashok, et al.
Published: (2024)
by: Cutkosky, Ashok, et al.
Published: (2024)
Unconstrained Robust Online Convex Optimization
by: Zhang, Jiujia, et al.
Published: (2025)
by: Zhang, Jiujia, et al.
Published: (2025)
Online Linear Regression in Dynamic Environments via Discounting
by: Jacobsen, Andrew, et al.
Published: (2024)
by: Jacobsen, Andrew, et al.
Published: (2024)
A Model-Based Approach for Improving Reinforcement Learning Efficiency Leveraging Expert Observations
by: Ozcan, Erhan Can, et al.
Published: (2024)
by: Ozcan, Erhan Can, et al.
Published: (2024)
Distributionally Robust Learning in Survival Analysis
by: Jin, Yeping, et al.
Published: (2025)
by: Jin, Yeping, et al.
Published: (2025)
Adversarial Imitation Learning from Visual Observations using Latent Information
by: Giammarino, Vittorio, et al.
Published: (2023)
by: Giammarino, Vittorio, et al.
Published: (2023)
Visually Robust Adversarial Imitation Learning from Videos with Contrastive Learning
by: Giammarino, Vittorio, et al.
Published: (2024)
by: Giammarino, Vittorio, et al.
Published: (2024)
Optimal Linear Decay Learning Rate Schedules and Further Refinements
by: Defazio, Aaron, et al.
Published: (2023)
by: Defazio, Aaron, et al.
Published: (2023)
Discounted Adaptive Online Learning: Towards Better Regularization
by: Zhang, Zhiyu, et al.
Published: (2024)
by: Zhang, Zhiyu, et al.
Published: (2024)
On Value Iteration Convergence in Connected MDPs
by: Mustafin, Arsenii, et al.
Published: (2024)
by: Mustafin, Arsenii, et al.
Published: (2024)
Closing the gap between SVRG and TD-SVRG with Gradient Splitting
by: Mustafin, Arsenii, et al.
Published: (2022)
by: Mustafin, Arsenii, et al.
Published: (2022)
Bridging the Gap Between Average and Discounted TD Learning
by: Tian, Haoxing, et al.
Published: (2026)
by: Tian, Haoxing, et al.
Published: (2026)
Provably Efficient Off-Policy Adversarial Imitation Learning with Convergence Guarantees
by: Chen, Yilei, et al.
Published: (2024)
by: Chen, Yilei, et al.
Published: (2024)
Multiple-policy Evaluation via Density Estimation
by: Chen, Yilei, et al.
Published: (2024)
by: Chen, Yilei, et al.
Published: (2024)
Distributionally Robust Token Optimization in RLHF
by: Jin, Yeping, et al.
Published: (2026)
by: Jin, Yeping, et al.
Published: (2026)
Random Scaling and Momentum for Non-smooth Non-convex Optimization
by: Zhang, Qinzi, et al.
Published: (2024)
by: Zhang, Qinzi, et al.
Published: (2024)
Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversion
by: Cutkosky, Ashok, et al.
Published: (2023)
by: Cutkosky, Ashok, et al.
Published: (2023)
DRO-Augment Framework: Robustness by Synergizing Wasserstein Distributionally Robust Optimization and Data Augmentation
by: Hu, Jiaming, et al.
Published: (2025)
by: Hu, Jiaming, et al.
Published: (2025)
One-Shot Averaging for Distributed TD($λ$) Under Markov Sampling
by: Tian, Haoxing, et al.
Published: (2024)
by: Tian, Haoxing, et al.
Published: (2024)
Reevaluating Theoretical Analysis Methods for Optimization in Deep Learning
by: Tran, Hoang, et al.
Published: (2024)
by: Tran, Hoang, et al.
Published: (2024)
Generalized Policy Improvement Algorithms with Theoretically Supported Sample Reuse
by: Queeney, James, et al.
Published: (2022)
by: Queeney, James, et al.
Published: (2022)
Analysis of Value Iteration Through Absolute Probability Sequences
by: Mustafin, Arsenii, et al.
Published: (2025)
by: Mustafin, Arsenii, et al.
Published: (2025)
Geometric Re-Analysis of Classical MDP Solving Algorithms
by: Mustafin, Arsenii, et al.
Published: (2025)
by: Mustafin, Arsenii, et al.
Published: (2025)
Parameter-free Mirror Descent
by: Jacobsen, Andrew, et al.
Published: (2022)
by: Jacobsen, Andrew, et al.
Published: (2022)
Adam with model exponential moving average is effective for nonconvex optimization
by: Ahn, Kwangjun, et al.
Published: (2024)
by: Ahn, Kwangjun, et al.
Published: (2024)
MDP Geometry, Normalization and Reward Balancing Solvers
by: Mustafin, Arsenii, et al.
Published: (2024)
by: Mustafin, Arsenii, et al.
Published: (2024)
Optimal Transport Perturbations for Safe Reinforcement Learning with Robustness Guarantees
by: Queeney, James, et al.
Published: (2023)
by: Queeney, James, et al.
Published: (2023)
Smooth Ranking SVM via Cutting-Plane Method
by: Ozcan, Erhan Can, et al.
Published: (2024)
by: Ozcan, Erhan Can, et al.
Published: (2024)
Private Zeroth-Order Nonsmooth Nonconvex Optimization
by: Zhang, Qinzi, et al.
Published: (2024)
by: Zhang, Qinzi, et al.
Published: (2024)
General framework for online-to-nonconvex conversion: Schedule-free SGD is also effective for nonconvex optimization
by: Ahn, Kwangjun, et al.
Published: (2024)
by: Ahn, Kwangjun, et al.
Published: (2024)
The Benefit of Being Bayesian in Online Conformal Prediction
by: Zhang, Zhiyu, et al.
Published: (2024)
by: Zhang, Zhiyu, et al.
Published: (2024)
Towards General Preference Alignment: Diffusion Models at Nash Equilibrium
by: Hu, Jiaming, et al.
Published: (2026)
by: Hu, Jiaming, et al.
Published: (2026)
Fast TRAC: A Parameter-Free Optimizer for Lifelong Reinforcement Learning
by: Muppidi, Aneesh, et al.
Published: (2024)
by: Muppidi, Aneesh, et al.
Published: (2024)
Scaling In-Context Online Learning Capability of LLMs via Cross-Episode Meta-RL
by: Lin, Xiaofeng, et al.
Published: (2026)
by: Lin, Xiaofeng, et al.
Published: (2026)
Adaptive Discretization in Online Reinforcement Learning
by: Sinclair, Sean R., et al.
Published: (2021)
by: Sinclair, Sean R., et al.
Published: (2021)
The Road Less Scheduled
by: Defazio, Aaron, et al.
Published: (2024)
by: Defazio, Aaron, et al.
Published: (2024)
Operationalizing Stein's Method for Online Linear Optimization: CLT-Based Optimal Tradeoffs
by: Zhang, Zhiyu, et al.
Published: (2026)
by: Zhang, Zhiyu, et al.
Published: (2026)
Enhancing Reinforcement Learning Fine-Tuning with an Online Refiner
by: Ma, Hao, et al.
Published: (2026)
by: Ma, Hao, et al.
Published: (2026)
Cooperative Multi-Agent Graph Bandits: UCB Algorithm and Regret Analysis
by: Paschalidis, Phevos, et al.
Published: (2024)
by: Paschalidis, Phevos, et al.
Published: (2024)
ARM: Refining Multivariate Forecasting with Adaptive Temporal-Contextual Learning
by: Lu, Jiecheng, et al.
Published: (2023)
by: Lu, Jiecheng, et al.
Published: (2023)
Similar Items
-
Fully Unconstrained Online Learning
by: Cutkosky, Ashok, et al.
Published: (2024) -
Unconstrained Robust Online Convex Optimization
by: Zhang, Jiujia, et al.
Published: (2025) -
Online Linear Regression in Dynamic Environments via Discounting
by: Jacobsen, Andrew, et al.
Published: (2024) -
A Model-Based Approach for Improving Reinforcement Learning Efficiency Leveraging Expert Observations
by: Ozcan, Erhan Can, et al.
Published: (2024) -
Distributionally Robust Learning in Survival Analysis
by: Jin, Yeping, et al.
Published: (2025)