多维累积分布函数及固定价格机制的样本复杂性
The Sample Complexity of Uniform Approximation for Multi-Dimensional CDFs and Fixed-Price Mechanisms
AI总结:
研究在仅有一比特反馈限制下学习多维累积分布函数均匀近似样本复杂性,提出近维度不变结果及小市场固定价格机制学习的紧样本复杂性界和新遗憾界。
摘要:
我们研究在观测受限于最小一比特反馈的情况下,学习一个n维累积分布函数(CDF)的均匀近似在误差ε>0内的样本复杂性。这作为多变量DKW不等式在''全反馈''情况下的对应物,将其扩展到''轮盘反馈''设置。我们的主要结果表明样本复杂性具有近维度不变性:我们得到一个均匀ε-近似,其样本复杂性为1/ε³ log(1/ε)^{O(n)},其中维度n只影响对数项。作为直接推论,我们提供了学习小市场固定价格机制的紧样本复杂性界和新遗憾界,例如双方面贸易设置。
英文摘要:
We study the sample complexity of learning a uniform approximation of an $n$-dimensional cumulative distribution function (CDF) within an error $ε> 0$, when observations are restricted to a minimal one-bit feedback. This serves as a counterpart to the multivariate DKW inequality under ''full feedback'', extending it to the setting of ''bandit feedback''. Our main result shows a near-dimensional-invariance in the sample complexity: we get a uniform $ε$-approximation with a sample complexity $\frac{1}{ε^3}{\log\left(\frac 1 ε\right)^{\mathcal{O}(n)}}$ over a arbitrary fine grid, where the dimensionality $n$ only affects logarithmic terms. As direct corollaries, we provide tight sample complexity bounds and novel regret guarantees for learning fixed-price mechanisms in small markets, such as bilateral trade settings.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。