Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
COLT
2008
Springer
10 years 2 months ago
Teaching Dimensions based on Cooperative Learning
The problem of how a teacher and a learner can cooperate in the process of learning concepts from examples in order to minimize the required sample size without “coding tricksâ€...
Sandra Zilles, Steffen Lange, Robert Holte, Martin...
COLT
2008
Springer
10 years 3 months ago
On the Margin Explanation of Boosting Algorithms
Much attention has been paid to the theoretical explanation of the empirical success of AdaBoost. The most influential work is the margin theory, which is essentially an upper bou...
Liwei Wang, Masashi Sugiyama, Cheng Yang, Zhi-Hua ...
COLT
2008
Springer
10 years 3 months ago
Does Unlabeled Data Provably Help? Worst-case Analysis of the Sample Complexity of Semi-Supervised Learning
We study the potential benefits to classification prediction that arise from having access to unlabeled samples. We compare learning in the semi-supervised model to the standard, ...
Shai Ben-David, Tyler Lu, Dávid Pál
COLT
2008
Springer
10 years 3 months ago
High-Probability Regret Bounds for Bandit Online Linear Optimization
We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ( ...
Peter L. Bartlett, Varsha Dani, Thomas P. Hayes, S...
COLT
2008
Springer
10 years 3 months ago
On-line Sequential Bin Packing
András György, Gábor Lugosi, Gy...
COLT
2008
Springer
10 years 3 months ago
Adaptive Hausdorff Estimation of Density Level Sets
Consider the problem of estimating the -level set G = {x : f(x) } of an unknown d-dimensional density function f based on n independent observations X1, . . . , Xn from the densi...
Aarti Singh, Robert Nowak, Clayton Scott
COLT
2008
Springer
10 years 3 months ago
Learning Acyclic Probabilistic Circuits Using Test Paths
We define a model of learning probabilistic acyclic circuits using value injection queries, in which an arbitrary subset of wires is set to fixed values, and the value on the sing...
Dana Angluin, James Aspnes, Jiang Chen, David Eise...
COLT
2008
Springer
10 years 3 months ago
Learning Mixtures of Product Distributions Using Correlations and Independence
We study the problem of learning mixtures of distributions, a natural formalization of clustering. A mixture of distributions is a collection of distributions D = {D1, . . . DT },...
Kamalika Chaudhuri, Satish Rao
COLT
2008
Springer
10 years 3 months ago
Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization
We introduce an efficient algorithm for the problem of online linear optimization in the bandit setting which achieves the optimal O ( T) regret. The setting is a natural general...
Jacob Abernethy, Elad Hazan, Alexander Rakhlin
COLT
2008
Springer
10 years 3 months ago
Minimizing Wide Range Regret with Time Selection Functions
Subhash Khot, Ashok Kumar Ponnuswami
books