scientific article; zbMATH DE number 6276168
From MaRDI portal
Publication:5405176
zbMath1432.68388MaRDI QIDQ5405176
Ambuj Tewari, Sham M. Kakade, Shai Shalev-Shwartz
Publication date: 1 April 2014
Full work available at URL: http://www.jmlr.org/papers/v13/kakade12a.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
regularizationmulti-task learningregret boundsstrong convexitymultiple kernel learninggeneralization boundsmulti-class learning
Convex programming (90C25) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (28)
Fast rates by transferring from auxiliary hypotheses ⋮ Optimizing non-decomposable measures with deep networks ⋮ A chain rule for the expected suprema of Gaussian processes ⋮ Joint feature selection and classification for positive unlabelled multi-label data using weighted penalized empirical risk minimization ⋮ Online multikernel learning based on a triple-norm regularizer for semantic image classification ⋮ Logarithmic sample bounds for sample average approximation with capacity- or budget-constraints ⋮ Handling concept drift via model reuse ⋮ Optimistic optimisation of composite objective with exponentiated update ⋮ A STOCHASTIC APPROXIMATION ALGORITHM FOR STOCHASTIC SEMIDEFINITE PROGRAMMING ⋮ Online variance minimization ⋮ The effect of intrinsic dimension on the Bayes-error of projected quadratic discriminant classification ⋮ On the Convergence of Gradient-Like Flows with Noisy Gradient Input ⋮ Accelerated methods for saddle-point problem ⋮ Guaranteed Classification via Regularized Similarity Learning ⋮ Conditional gradient type methods for composite nonlinear and stochastic optimization ⋮ Online First-Order Framework for Robust Convex Optimization ⋮ A generalized online mirror descent with applications to classification and regression ⋮ Unnamed Item ⋮ A continuous-time approach to online optimization ⋮ Near-Optimal Algorithms for Online Matrix Prediction ⋮ Generalized stochastic Frank-Wolfe algorithm with stochastic ``substitute gradient for structured convex optimization ⋮ Unnamed Item ⋮ Convergence of online mirror descent ⋮ Distributed Robust Subspace Recovery ⋮ Generalization analysis of multi-modal metric learning ⋮ A Vector-Contraction Inequality for Rademacher Complexities ⋮ On the Convergence of Mirror Descent beyond Stochastic Convex Programming ⋮ Analysis of singular value thresholding algorithm for matrix completion
This page was built for publication:
