提出可保证性能的对称表示学习框架,统一处理回归与不确定性估计。
Representation Learning for Equivariant Inference with Guarantees
- 基于群表示论构建对称且解耦的特征表示
- 首次提供非渐近统计保证,回归误差低于基线
- 适合需物理对称性建模的机器人等实际场景
在回归、条件概率估计和不确定性量化等实际应用中,利用物理或几何中的对称性可显著提升泛化能力和样本效率。尽管几何深度学习已通过引入对称性先验取得进展,但统计学习保证仍关注不足。本文提出一种对称表示学习框架,同时实现回归、条件概率估计和不确定性量化,并首次提供非渐近统计学习保证。基于算子与群表示理论,该框架逼近条件期望算子的谱分解,构建沿独立对称商群对称且解耦的表示。在合成数据集和真实机器人任务上的实验表明,该方法在回归性能上达到或超过现有对称基线,同时提供校准良好的不确定性估计。
原文摘要 · Abstract (English)
In many real-world applications of regression, conditional probability estimation, and uncertainty quantification, exploiting symmetries rooted in physics or geometry can dramatically improve generalization and sample efficiency. While geometric deep learning has made empirical advances by incorporating symmetry and geometry priors, less attention has been given to statistical learning guarantees. In this paper, we introduce an equivariant representation learning framework that simultaneously addresses regression, conditional probability estimation, and uncertainty quantification while providing first-of-its-kind non-asymptotic statistical learning guarantees. Grounded in operator and group representation theory, our framework approximates the spectral decomposition of the conditional expectation operator, building representations that are both equivariant and disentangled along independent symmetry quotient groups. Empirical evaluations on synthetic datasets and real-world robotics applications confirm the potential of our approach, matching or outperforming existing equivariant baselines in regression while providing well-calibrated uncertainty estimates.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。