We study the rank, trace-norm and max-norm as complexity measures of matrices, focusing on the problem of fitting a matrix with matrices having low complexity. We present generalization error bounds for predicting unobserved entries that are based on these measures. We also consider the possible relations between these measures. We show gaps between them, and bounds on the extent of such gaps.

Background: DNA microarray is a useful technology that simultaneously assesses the expression of thousands of genes. It can be utilized for the detection of cancer types and cancer biomarkers. This study aimed to predict blood cancer using leukemia gene expression data and a robust ℓ2,p-norm sparsity-based gene selection method. Materials and Methods: In this descriptive study, the microarray ...

Using an economic bargaining game, we tested for the existence of two phenomena related to social norms, namely norm manipulation – the selection of an interpretation of the norm that best suits an individual – and norm evasion – the deliberate, private violation of a social norm. We found that the manipulation of a norm of fairness was characterized by a self-serving bias in beliefs about what...

Two routes to overeating are discussed; they are both premised on people's strong motivation to avoid eating excessively and thereby avoid negative ascriptions associated with the overeatingloverweight stereotype. The first route to overeating involves infractions of restrictive intake norms: people who attempt to restrict their intake by implementing dietary rules often run afoul of disinhibit...

We study certain function algebras and their operator algebra completions on r-discrete abelian groupoids, the corresponding conditional expectations, maximal abelian subalgebras (masa) and eigen-functionals. We give a semidirect product decomposition for an abelian groupoid. This is done through a matched pair and leads to a C*-diagonal (for a special case). We use this decomposition to study ...