Publication

Online-Batch Strongly Convex Multi Kernel Learning

Related publications (23)

About
Privacy
Disclaimer

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Online-Batch Strongly Convex Multi Kernel Learning

Graph Chatbot

Chat with Graph Search

A Linearly Convergent Proximal Gradient Algorithm for Decentralized Optimization

A Conditional Gradient-Based Augmented Lagrangian Framework

Sparse approximation of multilinear problems with applications to kernel-based methods in UQ

Performance limits of stochastic sub-gradient learning, Part II: Multi-agent case

Exact Diffusion for Distributed Optimization and Learning---Part II: Convergence Analysis

Convergence of quasi-optimal sparse-grid approximation of Hilbert-space-valued functions: application to random elliptic PDEs

Splitting methods in control

Path-following gradient-based decomposition algorithms for separable convex optimization

MATHICSE Technical Report : Convergence of quasi-optimal sparse grid approximation of Hilbert-valued functions: application to random elliptic PDEs