Sciweavers

180 search results - page 6 / 36
» On the Convergence Rate of Good-Turing Estimators
Sort
View
SIAMNUM
2010
103views more  SIAMNUM 2010»
14 years 5 months ago
Error Estimates for Space-Time Discretizations of a Rate-Independent Variational Inequality
This paper deals with error estimates for space-time discretizations in the context of nary variational inequalities of rate-independent type. After introducing a general abstract ...
Alexander Mielke, Laetitia Paoli, Adrien Petrov, U...
JMLR
2012
13 years 25 days ago
Minimax-Optimal Rates For Sparse Additive Models Over Kernel Classes Via Convex Programming
Sparse additive models are families of d-variate functions with the additive decomposition f∗ = ∑j∈S f∗ j , where S is an unknown subset of cardinality s d. In this paper,...
Garvesh Raskutti, Martin J. Wainwright, Bin Yu
98
Voted
MOC
2002
120views more  MOC 2002»
14 years 10 months ago
Analysis of iterative methods for saddle point problems: a unified approach
In this paper two classes of iterative methods for saddle point problems are considered: inexact Uzawa algorithms and a class of methods with symmetric preconditioners. In both cas...
Walter Zulehner
PAMI
2007
253views more  PAMI 2007»
14 years 10 months ago
Gaussian Mean-Shift Is an EM Algorithm
The mean-shift algorithm, based on ideas proposed by Fukunaga and Hostetler (1975), is a hill-climbing algorithm on the density defined by a finite mixture or a kernel density e...
Miguel Á. Carreira-Perpiñán
CISS
2008
IEEE
15 years 4 months ago
Subgradient methods in network resource allocation: Rate analysis
— We consider dual subgradient methods for solving (nonsmooth) convex constrained optimization problems. Our focus is on generating approximate primal solutions with performance ...
Angelia Nedic, Asuman E. Ozdaglar