paper-with-me

홈 › Papers

Fitting Laplacian Regularized Stratified Gaussian Models

2020-05-04 · Jonathan Tuck, Stephen Boyd

We consider the problem of jointly estimating multiple related zero-mean Gaussian distributions from data. We propose to jointly estimate these covariance matrices using Laplacian regularized stratified model fitting, which includes loss and regularization terms for each covariance matrix, and also a term that encourages the different covariances matrices to be close. This method `borrows strength' from the neighboring covariances, to improve its estimate. With well chosen hyper-parameters, such models can perform very well, especially in the low data regime. We propose a distributed method that scales to large problems, and illustrate the efficacy of the method with examples in finance, radar signal processing, and weather forecasting.

📄 PDF Abstract BibTeX arXiv:2005.01752

Code (1)

cvxgrp/strat_models 공식 구현 pytorch

Tasks

Weather Forecasting

Similar Papers 제목 키워드 기반

A Distributed Method for Fitting Laplacian Regularized Stratified Models

2019-04-26 · Jonathan Tuck, Shane Barratt, Stephen Boyd

Stratified models are models that depend in an arbitrary way on a set of selected categorical features, and depend linearly on the other features. In a basic and traditional formulation a separate model is fit for each v…

Eigen-Stratified Models

2020-01-27 · Jonathan Tuck, Stephen Boyd

Stratified models depend in an arbitrary way on a selected categorical feature that takes $K$ values, and depend linearly on the other $n$ features. Laplacian regularization with respect to a graph on the feature values …

Joint Graph Learning and Model Fitting in Laplacian Regularized Stratified Models

2023-05-04 · Ziheng Cheng, Junzi Zhang, Akshay Agrawal, Stephen Boyd

Laplacian regularized stratified models (LRSM) are models that utilize the explicit or implicit network structure of the sub-problems as defined by the categorical features called strata (e.g., age, region, time, forecas…

Few-Shot LearningGraph ClusteringGraph LearningRepresentation Learning+2

Regularized Laplacian Estimation and Fast Eigenvector Approximation

2011-12-01 · NeurIPS 2011 12 · Patrick O. Perry, Michael W. Mahoney

Recently, Mahoney and Orecchia demonstrated that popular diffusion-based procedures to compute a quick approximation to the first nontrivial eigenvector of a data graph Laplacian exactly solve certain regularized Semi-De…

regression

Portfolio Construction Using Stratified Models

2021-01-11 · Jonathan Tuck, Shane Barratt, Stephen Boyd

In this paper we develop models of asset return mean and covariance that depend on some observable market conditions, and use these to construct a trading policy that depends on these conditions, and the current portfoli…