Measuring Task Learning Curve with Usage Graph Eccentricity Distribution Peaks
نویسندگان
چکیده
منابع مشابه
Laplacian Sum-Eccentricity Energy of a Graph
We introduce the Laplacian sum-eccentricity matrix LS_e} of a graph G, and its Laplacian sum-eccentricity energy LS_eE=sum_{i=1}^n |eta_i|, where eta_i=zeta_i-frac{2m}{n} and where zeta_1,zeta_2,ldots,zeta_n are the eigenvalues of LS_e}. Upper bounds for LS_eE are obtained. A graph is said to be twinenergetic if sum_{i=1}^n |eta_i|=sum_{i=1}^n |zeta_i|. Conditions ...
متن کاملOn Eccentricity Version of Laplacian Energy of a Graph
The energy of a graph G is equal to the sum of absolute values of the eigenvalues of the adjacency matrix of G, whereas the Laplacian energy of a graph G is equal to the sum of the absolute value of the difference between the eigenvalues of the Laplacian matrix of G and the average degree of the vertices of G. Motivated by the work from Sharafdini an...
متن کاملRepresenting a Functional Curve by Curves with Fewer Peaks
We study the problems of (approximately) representing a functional curve in 2-D by a set of curves with fewer peaks. Let f be an input nonnegative piecewise linear functional curve of size n. We consider the following problems. (1) Uphill-downhill pair representation (UDPR): Find two nonnegative piecewise linear curves, one nondecreasing and one nonincreasing, such that their sum approximately ...
متن کاملDistributed Stochastic Multi-Task Learning with Graph Regularization
We propose methods for distributed graph-based multi-task learning that are based on weighted averaging of messages from other machines. Uniform averaging or diminishing stepsize in these methods would yield consensus (single task) learning. We show how simply skewing the averaging weights or controlling the stepsize allows learning different, but related, tasks on the different machines.
متن کاملGraph Structure Learning for Task Ordering
In many practical applications, multiple interrelated tasks must be accomplished in sequential order through user interactions with multiple retrieval, classification and recommendation systems. The ordering of the tasks may have a significant impact on the overall utility (or performance); hence optimal ordering of tasks is desirable. However, manual specification of near-optimal ordering is o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal on Interactive Systems
سال: 2018
ISSN: 2236-3297
DOI: 10.5753/jis.2018.708