Sciweavers

426 search results - page 32 / 86
» A Minimax Chebyshev Estimator for Bounded Error Estimation
Sort
View
JAT
2010
61views more  JAT 2010»
13 years 7 months ago
Close-to-optimal bounds for SU(N) loop approximation
In [6], we proved an asymptotic O(n−α/(α+1)) bound for the approximation of SU(N) loops (N ≥ 2) with Lipschitz smoothness α > 1/2 by polynomial loops of degree ≤ n. Th...
Peter Oswald, Tatiana Shingel
VLDB
2007
ACM
130views Database» more  VLDB 2007»
14 years 9 months ago
A Simple and Efficient Estimation Method for Stream Expression Cardinalities
Estimating the cardinality (i.e. number of distinct elements) of an arbitrary set expression defined over multiple distributed streams is one of the most fundamental queries of in...
Aiyou Chen, Jin Cao, Tian Bu
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 10 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
COLT
2007
Springer
14 years 3 months ago
Prediction by Categorical Features: Generalization Properties and Application to Feature Ranking
We describe and analyze a new approach for feature ranking in the presence of categorical features with a large number of possible values. It is shown that popular ranking criteria...
Sivan Sabato, Shai Shalev-Shwartz
NIPS
2008
13 years 10 months ago
Rademacher Complexity Bounds for Non-I.I.D. Processes
This paper presents the first Rademacher complexity-based error bounds for noni.i.d. settings, a generalization of similar existing bounds derived for the i.i.d. case. Our bounds ...
Mehryar Mohri, Afshin Rostamizadeh