Cover Image

Closing the Gap on the Sample Complexity of 1-Identification

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Li, Zitian, Cheung, Wang Chi
Format:	Preprint
Published:	2026
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Near Optimal Non-asymptotic Sample Complexity of 1-Identification
by: Li, Zitian, et al.
Published: (2025)

Best Arm Identification with Resource Constraints
by: Li, Zitian, et al.
Published: (2024)

Pure Exploration for a Good Policy in Reinforcement Learning with Bandit Feedback
by: Li, Zitian, et al.
Published: (2026)

Learning with a Budget: Identifying the Best Arm with Resource Constraints
by: Li, Zitian, et al.
Published: (2026)

Episodic Contextual Bandits with Knapsacks under Conversion Models
by: Cheung, Wang Chi, et al.
Published: (2025)

Closing the Domain Gap in Biomedical Imaging by In-Context Control Samples
by: Sanchez-Fernandez, Ana, et al.
Published: (2026)

Sample Complexity of Causal Identification with Temporal Heterogeneity
by: Rathod, Ameya, et al.
Published: (2026)

The Sampling Complexity of Condorcet Winner Identification in Dueling Bandits
by: Saad, El Mehdi, et al.
Published: (2026)

Best Arm Identification with Possibly Biased Offline Data
by: Yang, Le, et al.
Published: (2025)

Online Bandits with (Biased) Offline Data: Adaptive Learning under Distribution Mismatch
by: Cheung, Wang Chi, et al.
Published: (2024)

Closing the Gaps: Optimality of Sample Average Approximation for Data-Driven Newsvendor Problems
by: Lyu, Jiameng, et al.
Published: (2024)

Tight Sample Complexity Bounds for Entropic Best Policy Identification
by: Essakine, Amer, et al.
Published: (2026)

Sample Complexity of Offline Distributionally Robust Linear Markov Decision Processes
by: Wang, He, et al.
Published: (2024)

Distributionally Robust Model-Based Offline Reinforcement Learning with Near-Optimal Sample Complexity
by: Shi, Laixi, et al.
Published: (2022)

Closing Gaps in Emissions Monitoring with Climate TRACE
by: Lancellotti, Brittany V., et al.
Published: (2025)

TabPrep: Closing the Feature Engineering Gap in Tabular Benchmarks
by: Tschalzev, Andrej, et al.
Published: (2026)

The Sample-Communication Complexity Trade-off in Federated Q-Learning
by: Salgia, Sudeep, et al.
Published: (2024)

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

MomentKV: Closing the Directional Gap in KV Cache Eviction for Long-Context Inference
by: Li, Yu, et al.
Published: (2026)

Efficiently Solving Discounted MDPs with Predictions on Transition Matrices
by: Lyu, Lixing, et al.
Published: (2025)

Stochastically Constrained Best Arm Identification with Thompson Sampling
by: Yang, Le, et al.
Published: (2025)

Sample Complexity of Average-Reward Q-Learning: From Single-agent to Federated Reinforcement Learning
by: Jiao, Yuchen, et al.
Published: (2026)

Sample Complexity of Nonparametric Closeness Testing for Continuous Distributions and Its Application to Causal Discovery with Hidden Confounding
by: Jamshidi, Fateme, et al.
Published: (2025)

The Sample Complexity of Multiple Change Point Identification under Bandit Feedback
by: Graf, Maximilian, et al.
Published: (2026)

Closing the Gap between TD Learning and Supervised Learning with $Q$-Conditioned Maximization
by: Lei, Xing, et al.
Published: (2025)

Achieving $\widetilde{O}(1/ε)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises
by: Yi, Hongyu, et al.
Published: (2026)

Sample Complexity Bounds for Linear System Identification from a Finite Set
by: Chatzikiriakos, Nicolas, et al.
Published: (2024)

Private Realizable-to-Agnostic Transformation with Near-Optimal Sample Complexity
by: Li, Bo, et al.
Published: (2025)

Pseudo Relevance Feedback is Enough to Close the Gap Between Small and Large Dense Retrieval Models
by: Li, Hang, et al.
Published: (2025)

Enhancing Startup Success Predictions in Venture Capital: A GraphRAG Augmented Multivariate Time Series Method
by: Gao, Zitian, et al.
Published: (2024)

Closing the Intent-to-Behavior Gap via Fulfillment Priority Logic
by: Mabsout, Bassel El, et al.
Published: (2025)

Closing Gaps: An Imputation Analysis of ICU Vital Signs
by: Turubayev, Alisher, et al.
Published: (2025)

Closing the Sim2Real Performance Gap in RL
by: Anand, Akhil S, et al.
Published: (2025)

Hybrid Adversarial Spectral Loss Conditional Generative Adversarial Networks for Signal Data Augmentation in Ultra-precision Machining Surface Roughness Prediction
by: Shang, Suiyan, et al.
Published: (2025)

Sampling Complexity of TD and PPO in RKHS
by: Zou, Lu, et al.
Published: (2025)

Sample Complexity of the Sign-Perturbed Sums Identification Method: Scalar Case
by: Szentpéteri, Szabolcs, et al.
Published: (2024)

Pareto Set Identification With Posterior Sampling
by: Kone, Cyrille, et al.
Published: (2024)

Closing the Train-Test Gap in World Models for Gradient-Based Planning
by: Parthasarathy, Arjun, et al.
Published: (2025)

Closing the Gap in the Trade-off between Fair Representations and Accuracy
by: Rout, Biswajit, et al.
Published: (2024)

Bridging the Gap: Rademacher Complexity in Robust and Standard Generalization
by: Xiao, Jiancong, et al.
Published: (2024)