Deep Sketched Output Kernel Regression for Structured Prediction
Not on the map. Why?
Abstract (arXiv)
By leveraging the kernel trick in the output space, kernel-induced losses provide a principled way to define structured output prediction tasks for a wide variety of output modalities. In particular, they have been successfully used in the context of surrogate non-parametric regression, where the kernel trick is typically exploited in the input space as well. However, when inputs are images or texts, more expressive models such as deep neural networks seem more suited than non-parametric methods. In this work, we tackle the question of how to train neural networks to solve structured output prediction tasks, while still benefiting from the versatility and relevance of kernel-induced losses. We design a novel family of deep neural architectures, whose last layer predicts in a data-dependent finite-dimensional subspace of the infinite-dimensional output feature space deriving from the kernel-induced loss. This subspace is chosen as the span of the eigenfunctions of a randomly-approximated version of the empirical kernel covariance operator. Interestingly, this approach unlocks the use of gradient descent algorithms (and consequently of any neural architecture) for structured prediction. Experiments on synthetic tasks as well as real-world supervised graph prediction problems show the relevance of our method.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 31 of its 76 references that are in the map. First posted on arXiv 13 Jun 2024.
Builds on
31 of 76 references.
References · 31
- 2017Attention Is All You Needcited by 59,932
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2023Segment Anythingcited by 8,158
- 2019SciBERT: A Pretrained Language Model for Scientific Textcited by 1,404
- 2014Sketching as a Tool for Numerical Linear Algebracited by 285
- 2018Optimal Transport for structured data with application on graphscited by 170
- 2016Generalization Properties of Learning with Random Featurescited by 163
- 2015Less is More: Nystr"om Computational Regularizationcited by 89
- 2020Kernel methods through the roof: handling billions of points efficientlycited by 88
- 2020Graph Kernels: State-of-the-Art and Future Challengescited by 63
- 2015Structured Prediction Energy Networkscited by 59
- 2018GraKeL: A Graph Kernel Library in Pythoncited by 54
19 more
- 2020A General Framework for Consistent Structured Prediction with Implicit Loss Embeddingscited by 35
- 2016A Consistent Regularization Approach for Structured Predictioncited by 33
- 2017End-to-End Learning for Structured Prediction Energy Networkscited by 33
- 2015Randomized sketches for kernels: Fast and optimal non-parametric regressioncited by 31
- 2022Learning to Predict Graphs with Fused Gromov-Wasserstein Barycenterscited by 22
- 2018A Structured Prediction Approach for Label Rankingcited by 18
- 2023Estimating Koopman operators with sketching to provably learn large scale dynamical systemscited by 15
- 2023Tanimoto Random Features for Scalable Molecular Machine Learningcited by 15
- 2018Learning Approximate Inference Networks for Structured Predictioncited by 13
- 2018Sharp Analysis of Learning with Discrete Lossescited by 13
- 2017Deep Value Networks Learn to Evaluate and Iteratively Refine Structured Outputscited by 12
- 2018Deep Structured Prediction with Nonlinear Output Transformationscited by 12
- 2021Fast rates in structured predictioncited by 11
- 2021Statistical Optimality and Computational Efficiency of Nystr"om Kernel PCAcited by 10
- 2020Consistent Structured Prediction with Max-Min Margin Markov Networkscited by 9
- 2019Gaussian Sketching yields a J-L Lemma in RKHScited by 6
- 2020Adaptive and Oblivious Randomized Subspace Methods for High-Dimensional Optimization: Sharp Analysis and Lower Boundscited by 6
- 2022Fast Kernel Methods for Generic Lipschitz Losses via p-Sparsified Sketchescited by 5
- 2023Sketch In, Sketch Out: Accelerating both Learning and Inference for Structured Prediction with Kernelscited by 5
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.