DOCSLIB.ORG

Bregman Divergence Bounds and Universality Properties of the Logarithmic Loss Amichai Painsky, Member, IEEE, and Gregory W

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Bregman Divergence Bounds and Universality Properties of the Logarithmic Loss Amichai Painsky, Member, IEEE, and Gregory W 1 Bregman Divergence Bounds and Universality Properties of the Logarithmic Loss Amichai Painsky, Member, IEEE, and Gregory W. Wornell, Fellow, IEEE Abstract—A loss function measures the discrepancy between Moreover, designing a predictor with respect to one measure the true values and their estimated fits, for a given instance may result in poor performance when evaluated by another. of data. In classification problems, a loss function is said to For example, the minimizer of a 0-1 loss may result in be proper if a minimizer of the expected loss is the true underlying probability. We show that for binary classification, an unbounded loss, when measured with a Bernoulli log- the divergence associated with smooth, proper, and convex likelihood loss. In such cases, it would be desireable to design loss functions is upper bounded by the Kullback-Leibler (KL) a predictor according to a “universal” measure, i.e., one that divergence, to within a normalization constant. This implies is suitable for a variety of purposes, and provide performance that by minimizing the logarithmic loss associated with the KL guarantees for different uses. divergence, we minimize an upper bound to any choice of loss from this set. As such the logarithmic loss is universal in the In this paper, we show that for binary classification, the sense of providing performance guarantees with respect to a Bernoulli log-likelihood loss (log-loss) is such a universal broad class of accuracy measures. Importantly, this notion of choice, dominating all alternative “analytically convenient” universality is not problem-specific, enabling its use in diverse (i.e., smooth, proper, and convex) loss functions. Specifically, applications, including predictive modeling, data clustering and we show that by minimizing the log-loss we minimize the sample complexity analysis. Generalizations to arbitary finite alphabets are also developed. The derived inequalities extend regret associated with all possible alternatives from this set. several well-known f-divergence results. Our result justifies the use of log-loss in many applications. As we develop, our universality result may be equivalently Index Terms—Kullback-Leibler (KL) divergence, logarithmic loss, Bregman divergences, Pinsker inequality. viewed from a divergence analysis viewpoint. In particular, we establish that the divergence associated with the log-loss— . i.e., Kullback Leibler (KL) divergence—upper bounds a set of Bregman divergences that satisfy a condition on its Hessian. I. INTRODUCTION Additionally, we show that any separable Bregman divergence NE of the major roles of statistical analysis is making that is convex in its second argument is a member of this set. O predictions about future events and providing suitable This result provides a new set of Bregman divergence inequal- accuracy guarantees. For example, consider a weather fore- ities. In this sense, our Bregman analysis is complementary to caster that estimates the chances of rain on the following the well-known f-divergence inequality results [7]–[10]. day. Its performance may be evaluated by multiple statistical We further develop several applications for our results, measures. We may count the number of times it assessed the including universal forecasting, universal data clustering, and chance of rain as greater than 50%, when there was eventually universal sample complexity analysis for learning problems, no rain (and vice versa). This corresponds to the so-called 0-1 in addition to establishing the universality of the information loss, with threshold parameter t = 1=2. Alternatively, we may bottleneck principle. We emphasize that our universality re- consider a variety of values for t, or even a completely dif- sults are derived in a rather general setting, and not restricted arXiv:1810.07014v2 [cs.IT] 2 Jan 2020 ferent measure. Indeed, there are many candidates, including to a specific problem. As such, they may find a wide range of the quadratic loss, Bernoulli log-likelihood loss, boosting loss, additional applications. etc. [2]. Choosing a good measure is a well-studied problem, The remainder of the paper is organized as follows. Sec- mostly in the context of scoring rules in decision theory [3]– tionII summarizes related work on loss function analysis, [6]. universality and divergence inequalities. Section III provides Assuming that the desired measure is known in advance, the needed notation, terminology, and definitions. SectionIV the predictor may be designed accordingly—i.e., to minimize contains the main results for binary alphabets, and their gener- that measure. However, in practice, different tasks may require alization to arbitrary finite alphabets is developed in SectionV. inferring different information from the provided estimates. Additional numerical analysis and experimental validation is provided in SectionVI, and the implications of our results in Manuscript received Oct. 2018, revised July 2019. The material in this three distinct applications is described in Section VII. Finally, paper was presented in part at the Int. Symp. Inform. Theory (ISIT-2018) [1], Vail, Colorado, June 2018. Section VIII contains some concluding remarks. This work was supported, in part, by NSF under Grant No. CCF-1717610. A. Painsky is with the Department of Industrial Engineering, Tel Aviv University, Tel Aviv 6139001, Israel (E-mail: [email protected]). II. RELATED WORK G. W. Wornell is with the Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139 (E- The Bernoulli log-likelihood loss function plays a funda- mail: [email protected]). mental role in information theory, machine learning, statistics 2 and many other disciplines. Its unique properties and broad any discrete memoryless source is successively refinable under applications have been extensively studied over the years. an arbitrary distortion criterion for the second decoder. The Bernoulli log-likelihood loss function arises naturally It is important to emphasize that universality results of in the context of parameter estimation. Consider a set of n the type discussed above are largely limited to relatively independent, identically distributed (i.i.d.) observations y = narrowly-defined problems and specific optimization criteria. (y1; : : : ; yn) drawn from a distribution pY (·; θ) whose param- By contrast, our development is aimed at a broader notion of eter θ is unknown. Then the maximum likelihood estimate of universality that is not restricted to a specific problem, and - θ in O is considers a broader range of criteria. θ^ = arg max L(θ; yn); θ2O- An additional information-theoretic justification for the wide use of the log-loss is introduced in [14]. This work where n focuses on statistical inference with side information, showing n n Y L(θ; y ) = pY n (y ; θ) = pY (yi; θ): that for an alphabet size greater than two, the log-loss is the i=1 only loss function that benefits from side information and Intuitively, it selects the parameters values that make the data satisfies the data processing lemma. This result extends some most probable. Equivalently, this estimate minimizes a loss well-known properties of the log-loss with respect to the data that is the (negative, normalized, natural) logarithm of the processing lemma, as later described. likelihood function, viz., Within decision theory, statistical learning and inference n problems, the log-loss also plays further key role in the context n 1 n 1 X `(θ; y ) − log L(θ; y ) = − log p (y ; θ); of proper loss function, which produce estimates that are , n n Y i i=1 unbiased with respect to the true underlaying distribution. whose mean is Proper loss functions have been extensively studied, compared, and suggested for a variety of tasks [3]–[6], [15]. Among these, E [`(θ; Y )] = −E [log pY (Y ; θ)] : the log-loss is special: it is the only proper loss that is local [16], [17]. This means that the log-loss is the only proper loss Hence, by minimizing this Bernoulli log-likelihood loss, function that assigns an estimate for the probability of the termed the log-loss, over a set of parameters we maximize event Y = y0 that depends only on the outcome Y = y0. the likelihood of the given observations. The log-loss also arises naturally in information theory. In turn, proper loss functions are closely related to Breg- man divergences, with which there exists a one-to-one cor- The self-information loss function − log pY (y) defines the ideal codeword length for describing the realization Y = y respondence [4]. For the log-loss, the associated Bregman [11]. In this sense, minimizing the log-loss corresponds to divergence is KL divergence, which is also an instance of an minimizing the amount of information that are necessary f-divergence [18]. Significantly, for probability distributions, to convey the observed realizations. Further, the expected the KL divergence is the only divergence measure that is a self-information is simply Shannon’s entropy which reflects member of both of these classes of divergences [19]. The the average uncertainty associated with sampling the random Bregman divergences are the only divergences that satisfy variable Y . a “mean-as-minimizer” property [20], while any divergence The logarithmic loss function is known to be “universal” that satisfy the data processing inequality is necessarily an f- from several information-theoretic points of view. In [12], divergence (or a unique (one-to-one) mapping thereof) [21]. Feder and Merhav consider the problem of universal sequential As a consequence, any divergence that satisfies both of these prediction, where a future observation is to be estimated from important properties simultaneously is necessarily proportional a given set of past observations. The notion of universality to the KL divergence [22, Corollary 6]. Additional properties comes from the assumption that the underlaying distribution of KL divergence are also discussed in [22]. is unknown, or even nonexistent. In this case, it is shown that Finally, divergences inequalities have been studied exten- if there exists a universal predictor (with a uniformly rapidly sively.
Load more

Recommended publications
  • Learning to Approximate a Bregman Divergence
    Learning to Approximate a Bregman Divergence Ali Siahkamari1 Xide Xia2 Venkatesh Saligrama1 David Castañón1 Brian Kulis1,2 1 Department of Electrical and Computer Engineering 2 Department of Computer Science Boston University Boston, MA, 02215 {siaa, xidexia, srv, dac, bkulis}@bu.edu Abstract Bregman divergences generalize measures such as the squared Euclidean distance and the KL divergence, and arise throughout many areas of machine learning. In this paper, we focus on the problem of approximating an arbitrary Bregman divergence from supervision, and we provide a well-principled approach to ana- lyzing such approximations. We develop a formulation and algorithm for learning arbitrary Bregman divergences based on approximating their underlying convex generating function via a piecewise linear function. We provide theoretical ap- proximation bounds using our parameterization and show that the generalization −1=2 error Op(m ) for metric learning using our framework matches the known generalization error in the strictly less general Mahalanobis metric learning setting. We further demonstrate empirically that our method performs well in comparison to existing metric learning methods, particularly for clustering and ranking problems. 1 Introduction Bregman divergences arise frequently in machine learning. They play an important role in clus- tering [3] and optimization [7], and specific Bregman divergences such as the KL divergence and squared Euclidean distance are fundamental in many areas. Many learning problems require di- vergences other than Euclidean distances—for instance, when requiring a divergence between two distributions—and Bregman divergences are natural in such settings. The goal of this paper is to provide a well-principled framework for learning an arbitrary Bregman divergence from supervision.
    [Show full text]
  • Bregman Divergence Bounds and Universality Properties of the Logarithmic Loss Amichai Painsky, Member, IEEE, and Gregory W
    This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TIT.2019.2958705, IEEE Transactions on Information Theory 1 Bregman Divergence Bounds and Universality Properties of the Logarithmic Loss Amichai Painsky, Member, IEEE, and Gregory W. Wornell, Fellow, IEEE Abstract—A loss function measures the discrepancy between Moreover, designing a predictor with respect to one measure the true values and their estimated fits, for a given instance may result in poor performance when evaluated by another. of data. In classification problems, a loss function is said to For example, the minimizer of a 0-1 loss may result in be proper if a minimizer of the expected loss is the true underlying probability. We show that for binary classification, an unbounded loss, when measured with a Bernoulli log- the divergence associated with smooth, proper, and convex likelihood loss. In such cases, it would be desireable to design loss functions is upper bounded by the Kullback-Leibler (KL) a predictor according to a “universal” measure, i.e., one that divergence, to within a normalization constant. This implies is suitable for a variety of purposes, and provide performance that by minimizing the logarithmic loss associated with the KL guarantees for different uses. divergence, we minimize an upper bound to any choice of loss from this set. As such the logarithmic loss is universal in the In this paper, we show that for binary classification, the sense of providing performance guarantees with respect to a Bernoulli log-likelihood loss (log-loss) is such a universal broad class of accuracy measures.
    [Show full text]
  • Metrics Defined by Bregman Divergences †
    1 METRICS DEFINED BY BREGMAN DIVERGENCES y PENGWEN CHEN z AND YUNMEI CHEN, MURALI RAOx Abstract. Bregman divergences are generalizations of the well known Kullback Leibler diver- gence. They are based on convex functions and have recently received great attention. We present a class of \squared root metrics" based on Bregman divergences. They can be regarded as natural generalization of Euclidean distance. We provide necessary and sufficient conditions for a convex function so that the square root of its associated average Bregman divergence is a metric. Key words. Metrics, Bregman divergence, Convexity subject classifications. Analysis of noise-corrupted data, is difficult without interpreting the data to have been randomly drawn from some unknown distribution with unknown parameters. The most common assumption on noise is Gaussian distribution. However, it may be inappropriate if data is binary-valued or integer-valued or nonnegative. Gaussian is a member of the exponential family. Other members of this family for example the Poisson and the Bernoulli are better suited for integer and binary data. Exponential families and Bregman divergences ( Definition 1.1 ) have a very intimate relationship. There exists a unique Bregman divergence corresponding to every regular exponential family [13][3]. More precisely, the log-likelihood of an exponential family distribution can be represented by a sum of a Bregman divergence and a parameter unrelated term. Hence, Bregman divergence provides a likelihood distance for exponential family in some sense. This property has been used in generalizing principal component analysis to the Exponential family [7]. The Bregman divergence however is not a metric, because it is not symmetric, and does not satisfy the triangle inequality.
    [Show full text]
  • On a Generalization of the Jensen-Shannon Divergence and the Jensen-Shannon Centroid
    On a generalization of the Jensen-Shannon divergence and the JS-symmetrization of distances relying on abstract means∗ Frank Nielsen† Sony Computer Science Laboratories, Inc. Tokyo, Japan Abstract The Jensen-Shannon divergence is a renown bounded symmetrization of the unbounded Kullback-Leibler divergence which measures the total Kullback-Leibler divergence to the aver- age mixture distribution. However the Jensen-Shannon divergence between Gaussian distribu- tions is not available in closed-form. To bypass this problem, we present a generalization of the Jensen-Shannon (JS) divergence using abstract means which yields closed-form expressions when the mean is chosen according to the parametric family of distributions. More generally, we define the JS-symmetrizations of any distance using generalized statistical mixtures derived from abstract means. In particular, we first show that the geometric mean is well-suited for exponential families, and report two closed-form formula for (i) the geometric Jensen-Shannon divergence between probability densities of the same exponential family, and (ii) the geometric JS-symmetrization of the reverse Kullback-Leibler divergence. As a second illustrating example, we show that the harmonic mean is well-suited for the scale Cauchy distributions, and report a closed-form formula for the harmonic Jensen-Shannon divergence between scale Cauchy distribu- tions. We also define generalized Jensen-Shannon divergences between matrices (e.g., quantum Jensen-Shannon divergences) and consider clustering with respect to these novel Jensen-Shannon divergences. Keywords: Jensen-Shannon divergence, Jeffreys divergence, resistor average distance, Bhat- tacharyya distance, Chernoff information, f-divergence, Jensen divergence, Burbea-Rao divergence, arXiv:1904.04017v3 [cs.IT] 10 Dec 2020 Bregman divergence, abstract weighted mean, quasi-arithmetic mean, mixture family, statistical M-mixture, exponential family, Gaussian family, Cauchy scale family, clustering.
    [Show full text]
  • Information Divergences and the Curious Case of the Binary Alphabet
    Information Divergences and the Curious Case of the Binary Alphabet Jiantao Jiao∗, Thomas Courtadey, Albert No∗, Kartik Venkat∗, and Tsachy Weissman∗ ∗Department of Electrical Engineering, Stanford University; yEECS Department, University of California, Berkeley Email: fjiantao, albertno, kvenkat, [email protected], [email protected] Abstract—Four problems related to information divergence answers to the above series of questions imply that the class measures defined on finite alphabets are considered. In three of “interesting” divergence measures can be very small when of the cases we consider, we illustrate a contrast which arises n ≥ 3 (e.g., restricted to the class of f-divergences, or a between the binary-alphabet and larger-alphabet settings. This is surprising in some instances, since characterizations for the multiple of KL divergence). However, in the binary alphabet larger-alphabet settings do not generalize their binary-alphabet setting, the class of “interesting” divergence measures is strik- counterparts. For example, we show that f-divergences are not ingly rich, a point which will be emphasized in our results. In the unique decomposable divergences on binary alphabets that many ways, this richness is surprising since the binary alphabet satisfy the data processing inequality, despite contrary claims in is usually viewed as the simplest setting one can consider. the literature. In particular, we would expect that the class of interesting I. INTRODUCTION divergence measures corresponding to binary alphabets would Divergence measures play a central role in information the- be less rich than the counterpart class for larger alphabets. ory and other branches of mathematics. Many special classes However, as we will see, the opposite is true.
    [Show full text]
  • Statistical Exponential Families: a Digest with Flash Cards
    Statistical exponential families: A digest with flash cards∗ Frank Nielsen†and Vincent Garcia‡ May 16, 2011 (v2.0) Abstract This document describes concisely the ubiquitous class of exponential family distributions met in statistics. The first part recalls definitions and summarizes main properties and duality with Bregman divergences (all proofs are skipped). The second part lists decompositions and re- lated formula of common exponential family distributions. We recall the Fisher-Rao-Riemannian geometries and the dual affine connection information geometries of statistical manifolds. It is intended to maintain and update this document and catalog by adding new distribution items. arXiv:0911.4863v2 [cs.LG] 13 May 2011 ∗See the jMEF library, a Java package for processing mixture of exponential families. Available for download at http://www.lix.polytechnique.fr/~nielsen/MEF/ †Ecole´ Polytechnique (France) and Sony Computer Science Laboratories Inc. (Japan). ‡Ecole´ Polytechnique (France). 1 Part I A digest of exponential families 1 Essentials of exponential families 1.1 Sufficient statistics A fundamental problem in statistics is to recover the model parameters λ from a given set of observations x1, ..., etc. Those samples are assumed to be randomly drawn from an independent and identically-distributed random vector with associated density p(x; λ). Since the sample set is finite, statisticians estimate a close approximation λˆ of the true parameter. However, a surprising fact is that one can collect and concentrate from a random sample all necessary information for recovering/estimating the parameters. The information is collected into a few elementary statistics of the random vector, called the sufficient statistic.1 Figure 1 illustrates the notions of statistics and sufficiency.
    [Show full text]
  • Applications of Bregman Divergence Measures in Bayesian Modeling Gyuhyeong Goh University of Connecticut - Storrs, [email protected]
    University of Connecticut OpenCommons@UConn Doctoral Dissertations University of Connecticut Graduate School 7-6-2015 Applications of Bregman Divergence Measures in Bayesian Modeling Gyuhyeong Goh University of Connecticut - Storrs, [email protected] Follow this and additional works at: https://opencommons.uconn.edu/dissertations Recommended Citation Goh, Gyuhyeong, "Applications of Bregman Divergence Measures in Bayesian Modeling" (2015). Doctoral Dissertations. 785. https://opencommons.uconn.edu/dissertations/785 Applications of Bregman Divergence Measures in Bayesian Modeling Gyuhyeong Goh, Ph.D. University of Connecticut, 2015 ABSTRACT This dissertation has mainly focused on the development of statistical theory, methodology, and application from a Bayesian perspective using a general class of di- vergence measures (or loss functions), called Bregman divergence. Many applications of Bregman divergence have played a key role in recent advances in machine learn- ing. My goal is to turn the spotlight on Bregman divergence and its applications in Bayesian modeling. Since Bregman divergence includes many well-known loss func- tions such as squared error loss, Kullback-Leibler divergence, Itakura-Saito distance, and Mahalanobis distance, the theoretical and methodological development unify and extend many existing Bayesian methods. The broad applicability of both Bregman divergence and Bayesian approach can handle diverse types of data such as circular data, high-dimensional data, multivariate data and functional data. Furthermore,
    [Show full text]
  • Jensen-Bregman Logdet Divergence with Application to Efficient
    TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, DECEMBER 2012 1 Jensen-Bregman LogDet Divergence with Application to Efficient Similarity Search for Covariance Matrices Anoop Cherian, Student Member, IEEE, Suvrit Sra, Arindam Banerjee and Nikolaos Papanikolopoulos, Fellow, IEEE Covariance matrices have found success in several computer vision applications, including activity recognition, visual surveillance, and diffusion tensor imaging. This is because they provide an easy platform for fusing multiple features compactly. An important task in all of these applications is to compare two covariance matrices using a (dis)similarity function, for which the common choice is the Riemannian metric on the manifold inhabited by these matrices. As this Riemannian manifold is not flat, the dissimilarities should take into account the curvature of the manifold. As a result such distance computations tend to slow down, especially when the matrix dimensions are large or gradients are required. Further, suitability of the metric to enable efficient nearest neighbor retrieval is an important requirement in the contemporary times of big data analytics. To alleviate these difficulties, this paper proposes a novel dissimilarity measure for covariances, the Jensen-Bregman LogDet Divergence (JBLD). This divergence enjoys several desirable theoretical properties, at the same time is computationally less demanding (compared to standard measures). Utilizing the fact that the square-root of JBLD is a metric, we address the problem of efficient nearest neighbor retrieval on large covariance datasets via a metric tree data structure. To this end, we propose a K-Means clustering algorithm on JBLD. We demonstrate the superior performance of JBLD on covariance datasets from several computer vision applications.
    [Show full text]
  • Generalized Bregman and Jensen Divergences Which Include Some F-Divergences
    GENERALIZED BREGMAN AND JENSEN DIVERGENCES WHICH INCLUDE SOME F-DIVERGENCES TOMOHIRO NISHIYAMA Abstract. In this paper, we introduce new classes of divergences by extend- ing the definitions of the Bregman divergence and the skew Jensen divergence. These new divergence classes (g-Bregman divergence and skew g-Jensen di- vergence) satisfy some properties similar to the Bregman or skew Jensen di- vergence. We show these g-divergences include divergences which belong to a class of f-divergence (the Hellinger distance, the chi-square divergence and the alpha-divergence in addition to the Kullback-Leibler divergence). More- over, we derive an inequality between the g-Bregman divergence and the skew g-Jensen divergence and show this inequality is a generalization of Lin's in- equality. Keywords: Bregman divergence, f-divergence, Jensen divergence, Kullback- Leibler divergence, Jeffreys divergence, Jensen-Shannon divergence, Hellinger distance, Chi-square divergence, Alpha divergence, Centroid, Parallelogram, Lin's inequality. 1. Introduction Divergences are functions measure the discrepancy between two points and play a key role in the field of machine learning, signal processing and so on. Given a set S and p; q 2 S, a divergence is defined as a function D : S × S ! R which satisfies the following properties. 1. D(p; q) ≥ 0 for all p; q 2 S 2. D(p; q) = 0 () p = q The Bregman divergence [7] B (p; q) def= F (p) − F (q) − hp − q; rF (q)i and f- P F def pi divergence [1, 10] Df (pkq) = qif( ) are representative divergences defined by i qi using a strictly convex function, where F; f : S ! R are strictly convex functions and f(1) = 0.
    [Show full text]
  • Bregman Metrics and Their Applications
    BREGMAN METRICS AND THEIR APPLICATIONS By PENGWEN CHEN A DISSERTATION PRESENTED TO THE GRADUATE SCHOOL OF THE UNIVERSITY OF FLORIDA IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY UNIVERSITY OF FLORIDA 2007 1 °c 2007 Pengwen Chen 2 ACKNOWLEDGMENTS My ¯rst and foremost thanks go to my advisers, Dr. Yunmei Chen and Dr. Murali Rao. Without their constant encouragement, and support, I would not have been to complete this research work. They were very generous with their time and help. Especially, they gave me a lot of helpful mathematical and non-mathematical advice and assistance throughout my research work. I am grateful to my supervisory committee members (William Hager, Gopalakrishnan Jayadeep, Jose Principe, and Rongling Wu) for my study. It is a pleasure to acknowledge their suggestions on this research work. I bene¯ted from every discussion with them. I am especially grateful to Dr. Gopalakrishnan Jayadeep and Dr. William Hager for o®ering numerical courses. Listening to their lectures was a pleasant experience. I would also like to thank the professors in my department who helped me on various occasions, and in particular Dr. John Klauder for our enjoyable discussions during my ¯rst year. Last but not least, I want to thank my wife April, my parents and her parents for their understanding and support. 3 TABLE OF CONTENTS page ACKNOWLEDGMENTS ................................. 3 LIST OF TABLES ..................................... 7 LIST OF FIGURES .................................... 8 ABSTRACT ........................................ 9 CHAPTER 1 MOTIVATION AND OUTLINE OF THIS PAPER ................ 11 2 BREGMAN METRICS ............................... 15 2.1 Introduction ................................... 15 2.2 Preliminaries and Notations .........................
    [Show full text]
  • Low-Rank Kernel Learning with Bregman Matrix Divergences
    Journal of Machine Learning Research 10 (2009) 341-376 Submitted 8/07; Revised 10/08; Published 2/09 Low-Rank Kernel Learning with Bregman Matrix Divergences Brian Kulis [email protected] Maty´ as´ A. Sustik [email protected] Inderjit S. Dhillon [email protected] Department of Computer Sciences University of Texas at Austin Austin, TX 78712, USA Editor: Michael I. Jordan Abstract In this paper, we study low-rank matrix nearness problems, with a focus on learning low-rank positive semidefinite (kernel) matrices for machine learning applications. We propose efficient algorithms that scale linearly in the number of data points and quadratically in the rank of the input matrix. Existing algorithms for learning kernel matrices often scale poorly, with running times that are cubic in the number of data points. We employ Bregman matrix divergences as the measures of nearness—these divergences are natural for learning low-rank kernels since they preserve rank as well as positive semidefiniteness. Special cases of our framework yield faster algorithms for various existing learning problems, and experimental results demonstrate that our algorithms can effectively learn both low-rank and full-rank kernel matrices. Keywords: kernel methods, Bregman divergences, convex optimization, kernel learning, matrix nearness 1. Introduction Underlying many machine learning algorithms is a measure of distance, or divergence, between data objects. A number of factors affect the choice of the particular divergence measure used: the data may be intrinsically suited for a specific divergence measure, an algorithm may be faster or easier to implement for some measure, or analysis may be simpler for a particular measure.
    [Show full text]
  • Proximal Approaches for Matrix Optimization
    Proximal approaches for matrix optimization problems: Application to robust precision matrix estimation Alessandro Benfenati, Emilie Chouzenoux, Jean-Christophe Pesquet To cite this version: Alessandro Benfenati, Emilie Chouzenoux, Jean-Christophe Pesquet. Proximal approaches for matrix optimization problems: Application to robust precision matrix estimation. Signal Processing, Elsevier, 2020, 169, 10.1016/j.sigpro.2019.107417. hal-02422403 HAL Id: hal-02422403 https://hal.archives-ouvertes.fr/hal-02422403 Submitted on 22 Dec 2019 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Proximal Approaches for Matrix Optimization Problems: Application to Robust Precision Matrix Estimation? A. Benfenatia,∗, E. Chouzenouxb, J.{C. Pesquetb aDipartimento di Scienze e Politiche Ambientali, Universit´adegli studi di Milano, Via Celoria 2, 20133, Milano, Italy bCenter for Visual Computing, INRIA Saclay and CentraleSup´elec, University Paris-Saclay, 9 rue Joliot{Curie, 91190, Gif{sur{Yvette, France Abstract In recent years, there has been a growing interest in mathematical models leading to the minimization, in a symmetric matrix space, of a Bregman divergence coupled with a regularization term. We address problems of this type within a general framework where the regularization term is split into two parts, one being a spectral function while the other is arbitrary.
    [Show full text]