Saved in:
| Main Authors: | Zheng, Zhong, Gao, Fengyu, Xue, Lingzhou, Yang, Jing |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2312.15023 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Regret-Optimal Q-Learning with Low Cost for Single-Agent and Federated Reinforcement Learning
by: Zhang, Haochen, et al.
Published: (2025)
by: Zhang, Haochen, et al.
Published: (2025)
Federated Q-Learning with Reference-Advantage Decomposition: Almost Optimal Regret and Logarithmic Communication Cost
by: Zheng, Zhong, et al.
Published: (2024)
by: Zheng, Zhong, et al.
Published: (2024)
Q-Learning with Fine-Grained Gap-Dependent Regret
by: Zhang, Haochen, et al.
Published: (2025)
by: Zhang, Haochen, et al.
Published: (2025)
Gap-Dependent Bounds for Federated $Q$-learning
by: Zhang, Haochen, et al.
Published: (2025)
by: Zhang, Haochen, et al.
Published: (2025)
Gap-Dependent Bounds for Q-Learning using Reference-Advantage Decomposition
by: Zheng, Zhong, et al.
Published: (2024)
by: Zheng, Zhong, et al.
Published: (2024)
Gap-Dependent Bounds for Nearly Minimax Optimal Reinforcement Learning with Linear Function Approximation
by: Zhang, Haochen, et al.
Published: (2026)
by: Zhang, Haochen, et al.
Published: (2026)
Federated Online Prediction from Experts with Differential Privacy: Separations and Regret Speed-ups
by: Gao, Fengyu, et al.
Published: (2024)
by: Gao, Fengyu, et al.
Published: (2024)
A New Inexact Proximal Linear Algorithm with Adaptive Stopping Criteria for Robust Phase Retrieval
by: Zheng, Zhong, et al.
Published: (2023)
by: Zheng, Zhong, et al.
Published: (2023)
Smoothed Robust Phase Retrieval
by: Zheng, Zhong, et al.
Published: (2024)
by: Zheng, Zhong, et al.
Published: (2024)
Achieving Linear Speedup for Composite Federated Learning
by: Huang, Kun, et al.
Published: (2026)
by: Huang, Kun, et al.
Published: (2026)
On the Linear Speedup of Personalized Federated Reinforcement Learning with Shared Representations
by: Xiong, Guojun, et al.
Published: (2024)
by: Xiong, Guojun, et al.
Published: (2024)
Achieving Linear Speedup in Asynchronous Federated Learning with Heterogeneous Clients
by: Wang, Xiaolu, et al.
Published: (2024)
by: Wang, Xiaolu, et al.
Published: (2024)
Understanding the Statistical Accuracy-Communication Trade-off in Personalized Federated Learning with Minimax Guarantees
by: Yu, Xin, et al.
Published: (2024)
by: Yu, Xin, et al.
Published: (2024)
Differentially Private Preference Data Synthesis for Large Language Model Alignment
by: Gao, Fengyu, et al.
Published: (2026)
by: Gao, Fengyu, et al.
Published: (2026)
AltLoRA: Towards Better Gradient Approximation in Low-Rank Adaptation with Alternating Projections
by: Yu, Xin, et al.
Published: (2025)
by: Yu, Xin, et al.
Published: (2025)
A Unified Linear Speedup Analysis of Federated Averaging and Nesterov FedAvg
by: Qu, Zhaonan, et al.
Published: (2020)
by: Qu, Zhaonan, et al.
Published: (2020)
Strongly Consistent Community Detection in Popularity Adjusted Block Models
by: Yuan, Quan, et al.
Published: (2025)
by: Yuan, Quan, et al.
Published: (2025)
Quantum Speedups in Regret Analysis of Infinite Horizon Average-Reward Markov Decision Processes
by: Ganguly, Bhargav, et al.
Published: (2023)
by: Ganguly, Bhargav, et al.
Published: (2023)
Distributed Networked Multi-task Learning
by: Hong, Lingzhou, et al.
Published: (2024)
by: Hong, Lingzhou, et al.
Published: (2024)
Beyond $\mathcal{O}(\sqrt{T})$ Regret: Decoupling Learning and Decision-making in Online Linear Programming
by: Gao, Wenzhi, et al.
Published: (2025)
by: Gao, Wenzhi, et al.
Published: (2025)
Fast Learnings of Coupled Nonnegative Tensor Decomposition Using Optimal Gradient and Low-rank Approximation
by: Wang, Xiulin, et al.
Published: (2023)
by: Wang, Xiulin, et al.
Published: (2023)
Efficient, Low-Regret, Online Reinforcement Learning for Linear MDPs
by: John, Philips George, et al.
Published: (2024)
by: John, Philips George, et al.
Published: (2024)
Federated UCBVI: Communication-Efficient Federated Regret Minimization with Heterogeneous Agents
by: Labbi, Safwan, et al.
Published: (2024)
by: Labbi, Safwan, et al.
Published: (2024)
EXACT: Explicit Attribute-Guided Decoding-Time Personalization
by: Yu, Xin, et al.
Published: (2026)
by: Yu, Xin, et al.
Published: (2026)
A Copula Graphical Model for Multi-Attribute Data using Optimal Transport
by: Zhang, Qi, et al.
Published: (2024)
by: Zhang, Qi, et al.
Published: (2024)
Low-Regret and Low-Complexity Learning for Hierarchical Inference
by: Chattopadhyay, Sameep, et al.
Published: (2025)
by: Chattopadhyay, Sameep, et al.
Published: (2025)
PrunedLoRA: Robust Gradient-Based structured pruning for Low-rank Adaptation in Fine-tuning
by: Yu, Xin, et al.
Published: (2025)
by: Yu, Xin, et al.
Published: (2025)
Data-adaptive Differentially Private Prompt Synthesis for In-Context Learning
by: Gao, Fengyu, et al.
Published: (2024)
by: Gao, Fengyu, et al.
Published: (2024)
Achieving Linear Speedup with ProxSkip in Distributed Stochastic Optimization
by: Guo, Luyao, et al.
Published: (2023)
by: Guo, Luyao, et al.
Published: (2023)
Minibatch and Local SGD: Algorithmic Stability and Linear Speedup in Generalization
by: Lei, Yunwen, et al.
Published: (2023)
by: Lei, Yunwen, et al.
Published: (2023)
Hypothesis Testing for High-Dimensional Matrix-Valued Data
by: Cui, Shijie, et al.
Published: (2024)
by: Cui, Shijie, et al.
Published: (2024)
Regret Bounds for Episodic Risk-Sensitive Linear Quadratic Regulator
by: Xu, Wenhao, et al.
Published: (2024)
by: Xu, Wenhao, et al.
Published: (2024)
Structure-Preserving Nonlinear Sufficient Dimension Reduction for Tensors
by: Lin, Dianjun, et al.
Published: (2025)
by: Lin, Dianjun, et al.
Published: (2025)
Improved Regret of Linear Ensemble Sampling
by: Lee, Harin, et al.
Published: (2024)
by: Lee, Harin, et al.
Published: (2024)
Trading-off Accuracy and Communication Cost in Federated Learning
by: Villani, Mattia Jacopo, et al.
Published: (2025)
by: Villani, Mattia Jacopo, et al.
Published: (2025)
Bayesian Optimization for Unknown Cost-Varying Variable Subsets with No-Regret Costs
by: Hoang, Vu Viet, et al.
Published: (2024)
by: Hoang, Vu Viet, et al.
Published: (2024)
The Sample-Communication Complexity Trade-off in Federated Q-Learning
by: Salgia, Sudeep, et al.
Published: (2024)
by: Salgia, Sudeep, et al.
Published: (2024)
Approximate Thompson Sampling for Learning Linear Quadratic Regulators with $O(\sqrt{T})$ Regret
by: Kim, Yeoneung, et al.
Published: (2024)
by: Kim, Yeoneung, et al.
Published: (2024)
Doubly robust estimation of causal effects for random object outcomes with continuous treatments
by: Bhattacharjee, Satarupa, et al.
Published: (2025)
by: Bhattacharjee, Satarupa, et al.
Published: (2025)
Provably Efficient Exploration in Quantum Reinforcement Learning with Logarithmic Worst-Case Regret
by: Zhong, Han, et al.
Published: (2023)
by: Zhong, Han, et al.
Published: (2023)
Similar Items
-
Regret-Optimal Q-Learning with Low Cost for Single-Agent and Federated Reinforcement Learning
by: Zhang, Haochen, et al.
Published: (2025) -
Federated Q-Learning with Reference-Advantage Decomposition: Almost Optimal Regret and Logarithmic Communication Cost
by: Zheng, Zhong, et al.
Published: (2024) -
Q-Learning with Fine-Grained Gap-Dependent Regret
by: Zhang, Haochen, et al.
Published: (2025) -
Gap-Dependent Bounds for Federated $Q$-learning
by: Zhang, Haochen, et al.
Published: (2025) -
Gap-Dependent Bounds for Q-Learning using Reference-Advantage Decomposition
by: Zheng, Zhong, et al.
Published: (2024)