Linear classifiers are nearly optimal when hidden variables have diverse effects
نویسندگان
چکیده
منابع مشابه
nearly optimal linear programming and its application in farm management
linear programming has been employed in many areas of constrained optimization including in agricultural planning for a long time. one of the most important disadvantages of such a method is that there is only one optimum solution for a given objective function and constraints set. another method named nearly optimal linear programming has been developed for solving the problem. this method can...
متن کاملOptimal and Efficient Crossover Designs When Subject Effects Are Random
Most studies on optimal crossover designs are based on models that assume subject effects to be fixed effects. In this article we identify and study optimal and efficient designs for a model with random subject effects. With the number of periods not exceeding the number of treatments, we find that totally balanced designs are universally optimal for treatment effects in a large subclass of com...
متن کاملSample-Optimal Density Estimation in Nearly-Linear Time
We design a new, fast algorithm for agnostically learning univariate probability distributions whose densities are well approximated by piecewise polynomial functions. Let f be the density function of an arbitrary univariate distribution, and suppose that f is OPT close in L1-distance to an unknown piecewise polynomial function with t interval pieces and degree d. Our algorithm draws n = O(t(d+...
متن کاملLinear Time Erasure Codes With Nearly Optimal Recovery
An (n; c; `; r)-erasure code consists of an encoding algorithm and a decoding algorithm with the following properties. The encoding algorithm produces a set of`-bit packets of total length cn from an n-bit message. The decoding algorithm is able to recover the message from any set of packets whose total length is r, i.e., from any set of r=`packets. We describe erasure codes where both the enco...
متن کاملA linear time erasure-resilient code with nearly optimal recovery
We develop an efficient scheme that produces an encoding of a given message such that the message can be decoded from any portion of the encoding that is approximately equal to the length of the message. More precisely, an (n, c, `, r)-erasure-resilient code consists of an encoding algorithm and a decoding algorithm with the following properties. The encoding algorithm produces a set of `-bit p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine Learning
سال: 2011
ISSN: 0885-6125,1573-0565
DOI: 10.1007/s10994-011-5262-7