Saved in:
| Main Author: | Jiang, Yuwen |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2604.08850 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Finite Sample Complexity Analysis of Binary Segmentation
by: Hocking, Toby Dylan
Published: (2024)
by: Hocking, Toby Dylan
Published: (2024)
Finite Sample Bounds for Non-Parametric Regression: Optimal Sample Efficiency and Space Complexity
by: Maran, Davide, et al.
Published: (2024)
by: Maran, Davide, 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)
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)
Sample Complexity Bounds for Linear System Identification from a Finite Set
by: Chatzikiriakos, Nicolas, et al.
Published: (2024)
by: Chatzikiriakos, Nicolas, et al.
Published: (2024)
Finite-Sample Analysis of Elimination in Active Hypothesis Testing
by: Lin, Ziyuan, et al.
Published: (2026)
by: Lin, Ziyuan, et al.
Published: (2026)
Diverse Influence Component Analysis: A Geometric Approach to Nonlinear Mixture Identifiability
by: Nguyen, Hoang-Son, et al.
Published: (2025)
by: Nguyen, Hoang-Son, et al.
Published: (2025)
On Size-Independent Sample Complexity of ReLU Networks
by: Sellke, Mark
Published: (2023)
by: Sellke, Mark
Published: (2023)
Finite Time Analysis of Constrained Natural Critic-Actor Algorithm with Improved Sample Complexity
by: Panda, Prashansa, et al.
Published: (2025)
by: Panda, Prashansa, et al.
Published: (2025)
Finite Sample Bounds for Learning with Score Matching
by: Smedira, Devin, et al.
Published: (2026)
by: Smedira, Devin, et al.
Published: (2026)
RL in Markov Games with Independent Function Approximation: Improved Sample Complexity Bound under the Local Access Model
by: Fan, Junyi, et al.
Published: (2024)
by: Fan, Junyi, et al.
Published: (2024)
An Interventional Perspective on Identifiability in Gaussian LTI Systems with Independent Component Analysis
by: Rajendran, Goutham, et al.
Published: (2023)
by: Rajendran, Goutham, et al.
Published: (2023)
Independent Component Analysis by Robust Distance Correlation
by: Leyder, Sarah, et al.
Published: (2025)
by: Leyder, Sarah, et al.
Published: (2025)
On The Sample Complexity Bounds In Bilevel Reinforcement Learning
by: Gaur, Mudit, et al.
Published: (2025)
by: Gaur, Mudit, et al.
Published: (2025)
Kernel Two-Sample Testing via Directional Components Analysis
by: Cui, Rui, et al.
Published: (2025)
by: Cui, Rui, et al.
Published: (2025)
Estimating Treatment Effects with Independent Component Analysis
by: Reizinger, Patrik, et al.
Published: (2025)
by: Reizinger, Patrik, et al.
Published: (2025)
A Variance-Based Analysis of Sample Complexity for Grid Coverage
by: Yuhuan, Lyu
Published: (2025)
by: Yuhuan, Lyu
Published: (2025)
Tight Sample Complexity Bounds for Entropic Best Policy Identification
by: Essakine, Amer, et al.
Published: (2026)
by: Essakine, Amer, et al.
Published: (2026)
Sample Complexity Bounds for Estimating Probability Divergences under Invariances
by: Tahmasebi, Behrooz, et al.
Published: (2023)
by: Tahmasebi, Behrooz, et al.
Published: (2023)
A Finite Time Analysis of Thompson Sampling for Bayesian Optimization with Preferential Feedback
by: Lazzaro, Joseph, et al.
Published: (2026)
by: Lazzaro, Joseph, et al.
Published: (2026)
Finite-Sample Analysis of the Monte Carlo Exploring Starts Algorithm for Reinforcement Learning
by: Chen, Suei-Wen, et al.
Published: (2024)
by: Chen, Suei-Wen, et al.
Published: (2024)
Finite-Sample Analysis of Policy Evaluation for Robust Average Reward Reinforcement Learning
by: Xu, Yang, et al.
Published: (2025)
by: Xu, Yang, et al.
Published: (2025)
A Finite Sample Analysis of Distributional TD Learning with Linear Function Approximation
by: Peng, Yang, et al.
Published: (2025)
by: Peng, Yang, et al.
Published: (2025)
Sample Complexity Analysis for Constrained Bilevel Reinforcement Learning
by: Saxena, Naman, et al.
Published: (2026)
by: Saxena, Naman, et al.
Published: (2026)
Fast Nonlinear Two-Time-Scale Stochastic Approximation: Achieving $O(1/k)$ Finite-Sample Complexity
by: Doan, Thinh T.
Published: (2024)
by: Doan, Thinh T.
Published: (2024)
Nonlinear Principal Component Analysis with Random Bernoulli Features for Process Monitoring
by: Chen, Ke, et al.
Published: (2025)
by: Chen, Ke, et al.
Published: (2025)
Beyond the Independence Assumption: Finite-Sample Guarantees for Deep Q-Learning under $τ$-Mixing
by: Halgryn, Leon, et al.
Published: (2026)
by: Halgryn, Leon, et al.
Published: (2026)
Supervised Learning as Lossy Compression: Characterizing Generalization and Sample Complexity via Finite Blocklength Analysis
by: Sugiyama, Kosuke, et al.
Published: (2026)
by: Sugiyama, Kosuke, et al.
Published: (2026)
Finite Sample Analysis of Tensor Decomposition for Learning Mixtures of Linear Systems
by: Rui, Maryann, et al.
Published: (2024)
by: Rui, Maryann, et al.
Published: (2024)
Frequency Response Identification of Low-Order Systems: Finite-Sample Analysis
by: Honarpisheh, Arya, et al.
Published: (2025)
by: Honarpisheh, Arya, et al.
Published: (2025)
Finite Sample Analysis of Linear Temporal Difference Learning with Arbitrary Features
by: Xie, Zixuan, et al.
Published: (2025)
by: Xie, Zixuan, et al.
Published: (2025)
Spectral Thresholds for Identifiability and Stability:Finite-Sample Phase Transitions in High-Dimensional Learning
by: Huang, William Hao-Cheng
Published: (2025)
by: Huang, William Hao-Cheng
Published: (2025)
One-shot Robust Federated Learning of Independent Component Analysis
by: Jin, Dian, et al.
Published: (2025)
by: Jin, Dian, et al.
Published: (2025)
Efficient Estimation of Unique Components in Independent Component Analysis by Matrix Representation
by: Matsuda, Yoshitatsu, et al.
Published: (2024)
by: Matsuda, Yoshitatsu, et al.
Published: (2024)
Sample Complexity Bounds for Stochastic Shortest Path with a Generative Model
by: Tarbouriech, Jean, et al.
Published: (2026)
by: Tarbouriech, Jean, et al.
Published: (2026)
Sample Complexity Bounds for Linear Constrained MDPs with a Generative Model
by: Liu, Xingtu, et al.
Published: (2025)
by: Liu, Xingtu, et al.
Published: (2025)
Near-Optimal Sample Complexity Bounds for Constrained Average-Reward MDPs
by: Wei, Yukuan, et al.
Published: (2025)
by: Wei, Yukuan, et al.
Published: (2025)
Finite-Sample Bounds for Adaptive Inverse Reinforcement Learning using Passive Langevin Dynamics
by: Snow, Luke, et al.
Published: (2023)
by: Snow, Luke, et al.
Published: (2023)
Robust Principal Component Analysis via Discriminant Sample Weight Learning
by: Deng, Yingzhuo, et al.
Published: (2024)
by: Deng, Yingzhuo, et al.
Published: (2024)
Model-Free Robust Reinforcement Learning with Sample Complexity Analysis
by: Wang, Yudan, et al.
Published: (2024)
by: Wang, Yudan, et al.
Published: (2024)
Similar Items
-
Finite Sample Complexity Analysis of Binary Segmentation
by: Hocking, Toby Dylan
Published: (2024) -
Finite Sample Bounds for Non-Parametric Regression: Optimal Sample Efficiency and Space Complexity
by: Maran, Davide, et al.
Published: (2024) -
A Finite Sample Complexity Bound for Distributionally Robust Q-learning
by: Wang, Shengbo, et al.
Published: (2023) -
Finite-Sample Wasserstein Error Bounds and Concentration Inequalities for Nonlinear Stochastic Approximation
by: Kong, Seo Taek, et al.
Published: (2026) -
Sample Complexity Bounds for Linear System Identification from a Finite Set
by: Chatzikiriakos, Nicolas, et al.
Published: (2024)