paper-with-me

Papers

The Kernel Trick for Nonlinear Factor Modeling

2021-03-01 · Varlam Kutateladze

Factor modeling is a powerful statistical technique that permits to capture the common dynamics in a large panel of data with a few latent variables, or factors, thus alleviating the curse of dimensionality. Despite its popularity and widespread use for various applications ranging from genomics to finance, this methodology has predominantly remained linear. This study estimates factors nonlinearly through the kernel method, which allows flexible nonlinearities while still avoiding the curse of dimensionality. We focus on factor-augmented forecasting of a single time series in a high-dimensional setting, known as diffusion index forecasting in macroeconomics literature. Our main contribution is twofold. First, we show that the proposed estimator is consistent and it nests linear PCA estimator as well as some nonlinear estimators introduced in the literature as specific examples. Second, our empirical application to a classical macroeconomic dataset demonstrates that this approach can offer substantial advantages over mainstream methods.

📄 PDF Abstract BibTeX arXiv:2103.01266

Code (0)

등록된 구현이 없습니다.

Tasks

Time SeriesTime Series Analysis

Methods 이 논문이 사용한 방법론

Diffusion Diffusion models generate samples by gradually removing noise from a signal, and their training objective can be expressed as a reweighted variational lower-bound…
PCA Principle Components Analysis (PCA) is an unsupervised method primary used for dimensionality reduction within machine learning. PCA is calculated via a singular value…

Similar Papers 제목 키워드 기반

Fitting networks with a cancellation trick

2025-02-23 · Jiashun Jin, Jingming Wang

The degree-corrected block model (DCBM), latent space model (LSM), and $\beta$-model are all popular network models. We combine their modeling ideas and propose the logit-DCBM as a new model. Similar as the $\beta$-model…

Community Detectionparameter estimation

Efficient KLMS and KRLS Algorithms: A Random Fourier Feature Perspective

2016-06-12 · Pantelis Bouboulis, Spyridon Pougkakiotis, Sergios Theodoridis

We present a new framework for online Least Squares algorithms for nonlinear modeling in RKH spaces (RKHS). Instead of implicitly mapping the data to a RKHS (e.g., kernel trick), we map the data to a finite dimensional E…

Fast Graph Laplacian Regularized Kernel Learning via Semidefinite–Quadratic–Linear Programming

2009-12-01 · NeurIPS 2009 12 · Xiao-Ming Wu, Anthony M. So, Zhenguo Li, Shuo-Yen R. Li

Kernel learning is a powerful framework for nonlinear data modeling. Using the kernel trick, a number of problems have been formulated as semidefinite programs (SDPs). These include Maximum Variance Unfolding (MVU) (Wein…

ClusteringComputational EfficiencyConstrained ClusteringDimensionality Reduction

Kernelized Classification in Deep Networks

2020-12-08 · Sadeep Jayasumana, Srikumar Ramalingam, Sanjiv Kumar

We propose a kernelized classification layer for deep networks. Although conventional deep networks introduce an abundance of nonlinearity for representation (feature) learning, they almost universally use a linear class…

ClassificationGeneral Classification

Data-Driven Optimal Feedback Laws via Kernel Mean Embeddings

2024-07-23 · Petar Bevanda, Nicolas Hoischen, Stefan Sosnowski, Sandra Hirche 외

This paper proposes a fully data-driven approach for optimal control of nonlinear control-affine systems represented by a stochastic diffusion. The focus is on the scenario where both the nonlinear dynamics and stage cos…