paper-with-me

Papers

Scalable Matrix-valued Kernel Learning for High-dimensional Nonlinear Multivariate Regression and Granger Causality

2014-08-09 · Vikas Sindhwani, Ha Quang Minh, Aurelie Lozano

We propose a general matrix-valued multiple kernel learning framework for high-dimensional nonlinear multivariate regression problems. This framework allows a broad class of mixed norm regularizers, including those that induce sparsity, to be imposed on a dictionary of vector-valued Reproducing Kernel Hilbert Spaces. We develop a highly scalable and eigendecomposition-free algorithm that orchestrates two inexact solvers for simultaneously learning both the input and output components of separable matrix-valued kernels. As a key application enabled by our framework, we show how high-dimensional causal inference tasks can be naturally cast as sparse function estimation problems, leading to novel nonlinear extensions of a class of Graphical Granger Causality techniques. Our algorithmic developments and extensive empirical studies are complemented by theoretical analyses in terms of Rademacher generalization bounds.

📄 PDF Abstract BibTeX arXiv:1408.2066

Code (0)

등록된 구현이 없습니다.

Tasks

Causal InferenceGeneralization Boundsregression

Similar Papers 제목 키워드 기반

Learning Reconstructive Embeddings in Reproducing Kernel Hilbert Spaces via the Representer Theorem

2026-01-09 · Enrique Feito-Casares, Francisco M. Melgarejo-Meseguer, José-Luis Rojo-Álvarez arxiv

Motivated by the growing interest in representation learning approaches that uncover the latent structure of high-dimensional data, this work proposes new algorithms for reconstruction-based manifold learning within Repr…

Representation Learning

Rough kernel hedging

2025-01-16 · Nicola Muca Cirone, Cristopher Salvi

Building on the functional-analytic framework of operator-valued kernels and un-truncated signature kernels, we propose a scalable, provably convergent signature-based algorithm for a broad class of high-dimensional, pat…

Inner-product Kernels are Asymptotically Equivalent to Binary Discrete Kernels

2019-09-15 · Zhenyu Liao, Romain Couillet

This article investigates the eigenspectrum of the inner product-type kernel matrix $\sqrt{p} \mathbf{K}=\{f( \mathbf{x}_i^{\sf T} \mathbf{x}_j/\sqrt{p})\}_{i,j=1}^n $ under a binary mixture model in the high dimensional…

Embed and Conquer: Scalable Embeddings for Kernel k-Means on MapReduce

2013-11-11 · Ahmed Elgohary, Ahmed K. Farahat, Mohamed S. Kamel, Fakhri Karray

The kernel $k$-means is an effective method for data clustering which extends the commonly-used $k$-means algorithm to work on a similarity matrix over complex data structures. The kernel $k$-means algorithm is however c…

ClusteringDistributed Computing

Random Fourier Features for Operator-Valued Kernels

2016-05-09 · Romain Brault, Florence d'Alché-Buc, Markus Heinonen

Devoted to multi-task learning and structured output learning, operator-valued kernels provide a flexible tool to build vector-valued functions in the context of Reproducing Kernel Hilbert Spaces. To scale up these metho…

Multi-Task LearningTranslation