conftrace_

sample complexity bound

11 papers

Explore in graph

Co-occurring keywords · papers mentioning both

sample complexity (4) generative model (2) reinforcement learning (2) worst-case policy value (1) distributional discrepancy (1) policy suboptimality (1) stationary policy (1) safety guarantee (1) eligibility trace (1) competitive threshold model (1)

Papers

Partially Observable Reinforcement Learning with Memory Traces ICML 2025 Sample Efficient Omniprediction and Downstream Swap Regret for Non-Linear Losses COLT 2025 Position: On the Possibilities of AI-Generated Text Detection ICML 2024 Worst-Case Offline Reinforcement Learning with Arbitrary Data Support NeurIPS 2024 Data-Copying in Generative Models: A Formal Framework ICML 2023 Adaptive Sampling for Heterogeneous Rank Aggregation from Noisy Pairwise Comparisons AISTATS 2022 Learnability of Competitive Threshold Models IJCAI 2022 Reinforcement Learning with Almost Sure Constraints L4DC 2022 Refined bounds for algorithm configuration: The knife-edge of dual class approximability ICML 2020 Sample Complexity Bounds for Iterative Stochastic Policy Optimization NeurIPS 2015 Empirical Risk Minimization with Approximations of Probabilistic Grammars NeurIPS 2010