arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2406.09375stat.MLcs.LGmath.STstat.TH
收藏

在连续空间上学习条件分布

Learning conditional distributions on continuous spaces

Université d’Évry-Val-d’Essonne(埃夫里-瓦尔德埃松大学);ENSIIE(国立信息与电子高等学校);University of Toronto(多伦多大学)

Cyril Bénézet, Ziteng Cheng, Sebastian Jaimungal

AI总结:

本文研究连续空间中的条件分布学习,分析固定半径球与 kNN 聚类的收敛速率,并将近邻、近似搜索、Sinkhorn 算法和稀疏传输计划集成到神经网络训练中。

摘要:

我们研究多维单位盒上基于样本的条件分布学习,允许特征空间与目标空间具有不同维度。我们的方法是在特征空间中不同查询点附近对数据进行聚类,以在目标空间中构造经验测度。我们采用两种不同的聚类方案:一种基于固定半径球,另一种基于最近邻。我们建立了两种方法收敛速率的上界,并由这些界推导出半径和近邻数量的最优配置。我们建议将近邻方法纳入神经网络训练,因为经验分析表明它在实践中具有更好的性能。为提高效率,训练过程使用基于随机二进制空间划分的近似最近邻搜索。此外,我们采用 Sinkhorn 算法和强制稀疏性的传输计划。我们的经验结果表明,通过适当设计的结构,神经网络能够局部适应合适水平的 Lipschitz 连续性。为便于复现,代码位于 https://github.com/zcheng-a/LCD_kNN。

英文摘要:

We investigate sample-based learning of conditional distributions on multi-dimensional unit boxes, allowing for different dimensions of the feature and target spaces. Our approach involves clustering data near varying query points in the feature space to create empirical measures in the target space. We employ two distinct clustering schemes: one based on a fixed-radius ball and the other on nearest neighbors. We establish upper bounds for the convergence rates of both methods and, from these bounds, deduce optimal configurations for the radius and the number of neighbors. We propose to incorporate the nearest neighbors method into neural network training, as our empirical analysis indicates it has better performance in practice. For efficiency, our training process utilizes approximate nearest neighbors search with random binary space partitioning. Additionally, we employ the Sinkhorn algorithm and a sparsity-enforced transport plan. Our empirical findings demonstrate that, with a suitably designed structure, the neural network has the ability to adapt to a suitable level of Lipschitz continuity locally. For reproducibility, our code is available at \url{https://github.com/zcheng-a/LCD_kNN}.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑