The following pages link to (Q5405176):
Displaying 28 items.
- A chain rule for the expected suprema of Gaussian processes (Q329618) (← links)
- Online variance minimization (Q420931) (← links)
- A generalized online mirror descent with applications to classification and regression (Q493737) (← links)
- A continuous-time approach to online optimization (Q520967) (← links)
- Optimizing non-decomposable measures with deep networks (Q1631814) (← links)
- Online multikernel learning based on a triple-norm regularizer for semantic image classification (Q1665404) (← links)
- Conditional gradient type methods for composite nonlinear and stochastic optimization (Q1717236) (← links)
- Generalized stochastic Frank-Wolfe algorithm with stochastic ``substitute'' gradient for structured convex optimization (Q2020608) (← links)
- Joint feature selection and classification for positive unlabelled multi-label data using weighted penalized empirical risk minimization (Q2162144) (← links)
- Handling concept drift via model reuse (Q2183593) (← links)
- Accelerated methods for saddle-point problem (Q2214606) (← links)
- Convergence of online mirror descent (Q2278461) (← links)
- Analysis of singular value thresholding algorithm for matrix completion (Q2338558) (← links)
- Fast rates by transferring from auxiliary hypotheses (Q2361574) (← links)
- Logarithmic sample bounds for sample average approximation with capacity- or budget-constraints (Q2661625) (← links)
- Generalization analysis of multi-modal metric learning (Q2809235) (← links)
- A Vector-Contraction Inequality for Rademacher Complexities (Q2830263) (← links)
- (Q4558184) (← links)
- On the Convergence of Gradient-Like Flows with Noisy Gradient Input (Q4602552) (← links)
- Distributed Robust Subspace Recovery (Q4685332) (← links)
- (Q5053185) (← links)
- Online First-Order Framework for Robust Convex Optimization (Q5131545) (← links)
- A STOCHASTIC APPROXIMATION ALGORITHM FOR STOCHASTIC SEMIDEFINITE PROGRAMMING (Q5358088) (← links)
- Guaranteed Classification via Regularized Similarity Learning (Q5378332) (← links)
- Near-Optimal Algorithms for Online Matrix Prediction (Q5737809) (← links)
- On the Convergence of Mirror Descent beyond Stochastic Convex Programming (Q5853716) (← links)
- Optimistic optimisation of composite objective with exponentiated update (Q6097136) (← links)
- The effect of intrinsic dimension on the Bayes-error of projected quadratic discriminant classification (Q6173569) (← links)
