Sciweavers

648 search results - page 3 / 130
» A general dimension for query learning
Sort
View
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 4 months ago
Learning Functions of Few Arbitrary Linear Parameters in High Dimensions
Let us assume that f is a continuous function defined on the unit ball of Rd , of the form f(x) = g(Ax), where A is a k×d matrix and g is a function of k variables for k ≪ d. ...
Massimo Fornasier, Karin Schnass, Jan Vybír...
KDD
2000
ACM
153views Data Mining» more  KDD 2000»
13 years 9 months ago
The generalized Bayesian committee machine
In this paper we introduce the Generalized Bayesian Committee Machine (GBCM) for applications with large data sets. In particular, the GBCM can be used in the context of kernel ba...
Volker Tresp
ILP
2005
Springer
13 years 11 months ago
Generalization Behaviour of Alkemic Decision Trees
Abstract. This paper is concerned with generalization issues for a decision tree learner for structured data called Alkemy. Motivated by error bounds established in statistical lea...
Kee Siong Ng
FOCS
2006
IEEE
13 years 11 months ago
On the Quantum Query Complexity of Local Search in Two and Three Dimensions
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
Xiaoming Sun, Andrew Chi-Chih Yao
JMLR
2010
84views more  JMLR 2010»
13 years 16 days ago
Learning Exponential Families in High-Dimensions: Strong Convexity and Sparsity
The versatility of exponential families, along with their attendant convexity properties, make them a popular and effective statistical model. A central issue is learning these mo...
Sham Kakade, Ohad Shamir, Karthik Sindharan, Ambuj...