498 search results - page 4 / 100 » Estimating Robust Query Models with Convex Optimization |
VLDB
2007
ACM
14 years 8 months ago
2007
ACM
An optimization query asks for one or more data objects that maximize or minimize some function over the data set. We propose a general class of queries, model-based optimization ...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
This paper develops theoretical results regarding noisy 1-bit compressed sensing and sparse binomial regression. We demonstrate that a single convex program gives an accurate estim...
SIGMOD
2005
ACM
14 years 7 months ago
2005
ACM
Research on query optimization has focused almost exclusively on reducing query execution time, while important qualities such as consistency and predictability have largely been ...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We analyze a class of estimators based on a convex relaxation for solving highdimensional matrix decomposition problems. The observations are the noisy realizations of the sum of ...
JMLR
2012
11 years 10 months ago
2012
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,...