Sciweavers

1604 search results - page 138 / 321
» Regularization on Discrete Spaces
Sort
View
UAI
2008
15 years 5 months ago
Projected Subgradient Methods for Learning Sparse Gaussians
Gaussian Markov random fields (GMRFs) are useful in a broad range of applications. In this paper we tackle the problem of learning a sparse GMRF in a high-dimensional space. Our a...
John Duchi, Stephen Gould, Daphne Koller
APPML
2002
89views more  APPML 2002»
15 years 3 months ago
Average sampling in spline subspaces
Let V () be a shift invariant subspace of L2 (R) generated by a Riesz or frame generator (t) in L2 (R). We assume that (t) is suitably chosen so that the regular sampling expansio...
Wenchang Sun, Xingwei Zhou
TIT
1998
63views more  TIT 1998»
15 years 3 months ago
On the Consistency of Minimum Complexity Nonparametric Estimation
— Nonparametric estimation is usually inconsistent without some form of regularization. One way to impose regularity is through a prior measure. Barron and Cover [1], [2] have sh...
Zhiyi Chi, Stuart Geman
SIAMNUM
2010
120views more  SIAMNUM 2010»
14 years 10 months ago
Sparse Spectral Approximations of High-Dimensional Problems Based on Hyperbolic Cross
Hyperbolic cross approximations by some classical orthogonal polynomials/functions in both bounded and unbounded domains are considered in this paper. Optimal error estimates in pr...
Jie Shen, Li-lian Wang
EMNLP
2011
14 years 3 months ago
Structured Sparsity in Structured Prediction
Linear models have enjoyed great success in structured prediction in NLP. While a lot of progress has been made on efficient training with several loss functions, the problem of ...
André F. T. Martins, Noah A. Smith, M&aacut...