Sciweavers

17 search results - page 1 / 4
» An Inequality for Nearly Log-Concave Distributions with Appl...
Sort
View
COLT
2004
Springer
13 years 10 months ago
An Inequality for Nearly Log-Concave Distributions with Applications to Learning
Abstract— We prove that given a nearly log-concave distribution, in any partition of the space to two well separated sets, the measure of the points that do not belong to these s...
Constantine Caramanis, Shie Mannor
APPROX
2009
Springer
129views Algorithms» more  APPROX 2009»
13 years 11 months ago
Baum's Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions
In 1990, E. Baum gave an elegant polynomial-time algorithm for learning the intersection of two origin-centered halfspaces with respect to any symmetric distribution (i.e., any D s...
Adam R. Klivans, Philip M. Long, Alex K. Tang
NIPS
2004
13 years 6 months ago
Triangle Fixing Algorithms for the Metric Nearness Problem
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
Inderjit S. Dhillon, Suvrit Sra, Joel A. Tropp
NIPS
2000
13 years 6 months ago
On Reversing Jensen's Inequality
Jensen's inequality is a powerful mathematical tool and one of the workhorses in statistical learning. Its applications therein include the EM algorithm, Bayesian estimation ...
Tony Jebara, Alex Pentland
ICML
2009
IEEE
14 years 5 months ago
Structure learning with independent non-identically distributed data
There are well known algorithms for learning the structure of directed and undirected graphical models from data, but nearly all assume that the data consists of a single i.i.d. s...
Robert E. Tillman