This paper is concerned with the generalization ability of learning to rank algorithms for information retrieval (IR). We point out that the key for addressing the learning proble...
Yanyan Lan, Tie-Yan Liu, Tao Qin, Zhiming Ma, Hang...
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...
We define notions of stability for learning algorithms and show how to use these notions to derive generalization error bounds based on the empirical error and the leave-one-out e...
We propose the definition of T-KKM points and consider generic stability of T-KKM mappings and essential components of sets of T-KKM points. As applications, using a unified appr...
This paper constructs strong-stability-preserving general linear time-stepping methods that are well suited for hyperbolic PDEs discretized by the method of lines. These methods ge...