Author: Xiao BianPublisher:
ISBN:
Category :
Languages : en
Pages : 120
Book Description
Sparse and Low-Rank Modeling on High Dimensional Data
Author: Xiao BianHigh-Dimensional Data Analysis with Low-Dimensional Models
Author: John WrightPublisher: Cambridge University Press
ISBN: 1108805558
Category : Computers
Languages : en
Pages : 718
Book Description
Connecting theory with practice, this systematic and rigorous introduction covers the fundamental principles, algorithms and applications of key mathematical models for high-dimensional data analysis. Comprehensive in its approach, it provides unified coverage of many different low-dimensional models and analytical techniques, including sparse and low-rank models, and both convex and non-convex formulations. Readers will learn how to develop efficient and scalable algorithms for solving real-world problems, supported by numerous examples and exercises throughout, and how to use the computational tools learnt in several application contexts. Applications presented include scientific imaging, communication, face recognition, 3D vision, and deep networks for classification. With code available online, this is an ideal textbook for senior and graduate students in computer science, data science, and electrical engineering, as well as for those taking courses on sparsity, low-dimensional structures, and high-dimensional data. Foreword by Emmanuel Candès.
High-Dimensional Data Analysis with Low-Dimensional Models
Author: John WrightPublisher: Cambridge University Press
ISBN: 1108489737
Category : Computers
Languages : en
Pages : 717
Book Description
Connects fundamental mathematical theory with real-world problems, through efficient and scalable optimization algorithms.
Sparse Graphical Modeling for High Dimensional Data
Author: Faming LiangPublisher: CRC Press
ISBN: 0429584806
Category : Mathematics
Languages : en
Pages : 151
Book Description
A general framework for learning sparse graphical models with conditional independence tests Complete treatments for different types of data, Gaussian, Poisson, multinomial, and mixed data Unified treatments for data integration, network comparison, and covariate adjustment Unified treatments for missing data and heterogeneous data Efficient methods for joint estimation of multiple graphical models Effective methods of high-dimensional variable selection Effective methods of high-dimensional inference
Prediction and Model Selection for High-dimensional Data with Sparse Or Low-rank Structure
Author: Rina Foygel BarberPublisher:
ISBN: 9781267437174
Category :
Languages : en
Pages : 201
Book Description
For sparse regression and sparse graphical models, we consider the model selection problem, where the goal is to identify the structure of an underlying sparse model that exactly describes the distribution of the data. We analyze the extended Bayesian information criterion and its connection to the Bayesian posterior distribution over models in a high-dimensional scenario. The model selection properties of these methods are explored further with experiments on spam email filtering data and precipitation pattern data.
Generalized Low Rank Models
Author: Madeleine UdellPublisher:
ISBN:
Category :
Languages : en
Pages :
Book Description
Principal components analysis (PCA) is a well-known technique for approximating a tabular data set by a low rank matrix. This dissertation extends the idea of PCA to handle arbitrary data sets consisting of numerical, Boolean, categorical, ordinal, and other data types. This framework encompasses many well known techniques in data analysis, such as nonnegative matrix factorization, matrix completion, sparse and robust PCA, k-means, k-SVD, and maximum margin matrix factorization. The method handles heterogeneous data sets, and leads to coherent schemes for compressing, denoising, and imputing missing entries across all data types simultaneously. It also admits a number of interesting interpretations of the low rank factors, which allow clustering of examples or of features. We propose several parallel algorithms for fitting generalized low rank models, and describe implementations and numerical results.
Deep Learning through Sparse and Low-Rank Modeling
Author: Zhangyang WangPublisher: Academic Press
ISBN: 012813660X
Category : Computers
Languages : en
Pages : 298
Book Description
Deep Learning through Sparse Representation and Low-Rank Modeling bridges classical sparse and low rank models—those that emphasize problem-specific Interpretability—with recent deep network models that have enabled a larger learning capacity and better utilization of Big Data. It shows how the toolkit of deep learning is closely tied with the sparse/low rank methods and algorithms, providing a rich variety of theoretical and analytic tools to guide the design and interpretation of deep learning models. The development of the theory and models is supported by a wide variety of applications in computer vision, machine learning, signal processing, and data mining. This book will be highly useful for researchers, graduate students and practitioners working in the fields of computer vision, machine learning, signal processing, optimization and statistics. - Combines classical sparse and low-rank models and algorithms with the latest advances in deep learning networks - Shows how the structure and algorithms of sparse and low-rank methods improves the performance and interpretability of Deep Learning models - Provides tactics on how to build and apply customized deep learning models for various applications
Metric Learning
Author: Aurélien MuisePublisher: Springer Nature
ISBN: 303101572X
Category : Computers
Languages : en
Pages : 139
Book Description
Similarity between objects plays an important role in both human cognitive processes and artificial systems for recognition and categorization. How to appropriately measure such similarities for a given task is crucial to the performance of many machine learning, pattern recognition and data mining methods. This book is devoted to metric learning, a set of techniques to automatically learn similarity and distance functions from data that has attracted a lot of interest in machine learning and related fields in the past ten years. In this book, we provide a thorough review of the metric learning literature that covers algorithms, theory and applications for both numerical and structured data. We first introduce relevant definitions and classic metric functions, as well as examples of their use in machine learning and data mining. We then review a wide range of metric learning algorithms, starting with the simple setting of linear distance and similarity learning. We show how one may scale-up these methods to very large amounts of training data. To go beyond the linear case, we discuss methods that learn nonlinear metrics or multiple linear metrics throughout the feature space, and review methods for more complex settings such as multi-task and semi-supervised learning. Although most of the existing work has focused on numerical data, we cover the literature on metric learning for structured data like strings, trees, graphs and time series. In the more technical part of the book, we present some recent statistical frameworks for analyzing the generalization performance in metric learning and derive results for some of the algorithms presented earlier. Finally, we illustrate the relevance of metric learning in real-world problems through a series of successful applications to computer vision, bioinformatics and information retrieval. Table of Contents: Introduction / Metrics / Properties of Metric Learning Algorithms / Linear Metric Learning / Nonlinear and Local Metric Learning / Metric Learning for Special Settings / Metric Learning for Structured Data / Generalization Guarantees for Metric Learning / Applications / Conclusion / Bibliography / Authors' Biographies
Low Rank and Sparse Modeling for Data Analysis
Author: Zhao KangPublisher:
ISBN:
Category : Compressed sensing (Telecommunication)
Languages : en
Pages : 246
Book Description
Nowadays, many real-world problems must deal with collections of high-dimensional data. High dimensional data usually have intrinsic low-dimensional representations, which are suited for subsequent analysis or processing. Therefore, finding low-dimensional representations is an essential step in many machine learning and data mining tasks. Low-rank and sparse modeling are emerging mathematical tools dealing with uncertainties of real-world data. Leveraging on the underlying structure of data, low-rank and sparse modeling approaches have achieved impressive performance in many data analysis tasks. Since the general rank minimization problem is computationally NP-hard, the convex relaxation of original problem is often solved. One popular heuristic method is to use the nuclear norm to approximate the rank of a matrix. Despite the success of nuclear norm minimization in capturing the low intrinsic-dimensionality of data, the nuclear norm minimizes not only the rank, but also the variance of matrix and may not be a good approximation to the rank function in practical problems. To mitigate above issue, this thesis proposes several nonconvex functions to approximate the rank function. However, It is often difficult to solve nonconvex problem. In this thesis, an optimization framework for nonconvex problem is further developed. The effectiveness of this approach is examined on several important applications, including matrix completion, robust principle component analysis, clustering, and recommender systems. Another issue associated with current clustering methods is that they work in two separate steps including similarity matrix computation and subsequent spectral clustering. The learned similarity matrix may not be optimal for subsequent clustering. Therefore, a unified algorithm framework is developed in this thesis. To capture the nonlinear relations among data points, we formulate this method in kernel space. Furthermore, the obtained continuous spectral solutions could severely deviate from the true discrete cluster labels, a discrete transformation is further incorporated in our model. Finally, our framework can simultaneously learn similarity matrix, kernel, and discrete cluster labels. The performance of the proposed algorithms is established through extensive experiments. This framework can be easily extended to semi-supervised classification.
Low-Rank Models in Visual Analysis
Author: Zhouchen LinPublisher: Academic Press
ISBN: 0128127325
Category : Computers
Languages : en
Pages : 262
Book Description
Low-Rank Models in Visual Analysis: Theories, Algorithms, and Applications presents the state-of-the-art on low-rank models and their application to visual analysis. It provides insight into the ideas behind the models and their algorithms, giving details of their formulation and deduction. The main applications included are video denoising, background modeling, image alignment and rectification, motion segmentation, image segmentation and image saliency detection. Readers will learn which Low-rank models are highly useful in practice (both linear and nonlinear models), how to solve low-rank models efficiently, and how to apply low-rank models to real problems. - Presents a self-contained, up-to-date introduction that covers underlying theory, algorithms and the state-of-the-art in current applications - Provides a full and clear explanation of the theory behind the models - Includes detailed proofs in the appendices