会员服务
Timely Best Arm Identification in Restless Shared Networks
Arxiv
0+阅读 · 3月16日
Offline Estimation of Controlled Markov Chains: Minimaxity and Sample Complexity
Arxiv
0+阅读 · 3月15日
A theory of learning data statistics in diffusion models, from easy to hard
Arxiv
0+阅读 · 3月13日
Partially Observable Multi-Agent Reinforcement Learning with Information Sharing
Arxiv
0+阅读 · 3月12日
The Sample Complexity of Replicable Realizable PAC Learning
Arxiv
0+阅读 · 2月23日
On Estimating the Quantum Tsallis Relative Entropy
Arxiv
0+阅读 · 2月23日
The Sample Complexity of Online Reinforcement Learning: A Multi-model Perspective
Arxiv
0+阅读 · 2月27日
Metric Entropy-Free Sample Complexity Bounds for Sample Average Approximation in Convex Stochastic Programming
Arxiv
0+阅读 · 3月2日
From Contextual Combinatorial Semi-Bandits to Bandit List Classification: Improved Sample Complexity with Sparse Rewards
Arxiv
0+阅读 · 2月23日
The Sample Complexity of Lossless Data Compression
Arxiv
0+阅读 · 2月19日
On the Sample Complexity of Learning for Blind Inverse Problems
On the Sample Complexity of Learning for Blind Inverse Problems
Arxiv
0+阅读 · 2月19日
LexiSafe: Offline Safe Reinforcement Learning with Lexicographic Safety-Reward Hierarchy
LexiSafe: Offline Safe Reinforcement Learning with Lexicographic Safety-Reward Hierarchy
Arxiv
0+阅读 · 2月19日
Fixed Budget is No Harder Than Fixed Confidence in Best-Arm Identification up to Logarithmic Factors
Arxiv
0+阅读 · 2月18日
Efficient Adaptive Data Analysis over Dense Distributions
Arxiv
0+阅读 · 2月7日
The Sample Complexity of Uniform Approximation for Multi-Dimensional CDFs and Fixed-Price Mechanisms
Arxiv
0+阅读 · 2月11日
参考链接
微信扫码咨询专知VIP会员
Top