Sequential recommender systems increasingly rely on transformer attention to model complex dependencies in user histories, yet standard attention is typically unconstrained: any candidate item may attend to any historical interaction. This flexibility can improve accuracy, but it often amplifies spurious correlations,...
We study sampling from a distribution supported on an unknown compact $d$-dimensional $C^2$ manifold $M\subset\mathbb{R}^D$, observed only through i.i.d. uniform points from $M$. We reconstruct the constraint using an adaptive local-convex-hull estimator and target an ambient distribution penalized by squared distance...
A non-parametric clustering algorithm which can accurately obtain the change points from a given Markovian dataset of length $n$ is proposed by bridging together two different components of mathematical statistics; Rademacher complexities of Markov chains, and adaptive clustering via penalisation.