<p>In this note, we introduce a family of “power sum” kernels and the corresponding Gaussian processes on symmetric groups <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10958_2025_7976_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="22" /> </InlineMediaObject> <EquationSource Format="TEX">\({{\,\textrm{S}\,}}_n\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mrow> <mspace width="0.166667em" /> <mtext>S</mtext> <mspace width="0.166667em" /> </mrow> <mi>n</mi> </msub> </math></EquationSource> </InlineEquation>. Such processes are bi-invariant: the action of <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10958_2025_7976_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="22" /> </InlineMediaObject> <EquationSource Format="TEX">\({{\,\textrm{S}\,}}_n\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mrow> <mspace width="0.166667em" /> <mtext>S</mtext> <mspace width="0.166667em" /> </mrow> <mi>n</mi> </msub> </math></EquationSource> </InlineEquation> on itself from both sides does not change their finite-dimensional distributions. We show that the values of power sum kernels can be efficiently calculated, and we also propose a method enabling approximate sampling of the corresponding Gaussian processes with polynomial computational complexity. By doing this we provide the tools that are required to use the introduced family of kernels and the respective processes for statistical modeling and machine learning. Bibliography: 20 titles.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

ON POWER SUM KERNELS ON SYMMETRIC GROUPS

  • I. Azangulov,
  • V. Borovitskiy,
  • A. Smolensky

摘要

In this note, we introduce a family of “power sum” kernels and the corresponding Gaussian processes on symmetric groups \({{\,\textrm{S}\,}}_n\) S n . Such processes are bi-invariant: the action of \({{\,\textrm{S}\,}}_n\) S n on itself from both sides does not change their finite-dimensional distributions. We show that the values of power sum kernels can be efficiently calculated, and we also propose a method enabling approximate sampling of the corresponding Gaussian processes with polynomial computational complexity. By doing this we provide the tools that are required to use the introduced family of kernels and the respective processes for statistical modeling and machine learning. Bibliography: 20 titles.