We use a Ramsey-theoretic argument to obtain the first lower bounds for approximations over Zm by nonlinear polynomials: A degree-2 polynomial over Zm (m odd) must differ from the parity function on at least a 1=2 1=2(logn) (1) fraction of all points in the Boolean n-cube. A degree-O(1) polynomial over Zm (m odd) must differ from the parity function on at least a 1=2 o(1) fraction of all points...

We are using machine learning to construct a failure-susceptibility ranking of feeders that supply electricity to the boroughs of New York City. The electricity system is inherently dynamic and driven by environmental conditions and other unpredictable factors, and thus the ability to cope with concept drift in real time is central to our solution. Our approach builds on the ensemble-based noti...

‎the purpose of this paper is to establish some coupled coincidence point theorems for mappings having a mixed $g$-monotone property in partially ordered metric spaces‎. ‎also‎, ‎we present a result on the existence and uniqueness of coupled common fixed points‎. ‎the results presented in the paper generalize and extend several well-known results in the literature‎.

With the increasing volume of data in the world, the best approach for learning from this data is to exploit an online learning algorithm. Online ensemble methods are online algorithms which take advantage of an ensemble of classifiers to predict labels of data. Prediction with expert advice is a well-studied problem in the online ensemble learning literature. The Weighted Majority algorithm an...

Which is the best, impartially most plausible consensus view to serve as the basis of democratic group decision when voters disagree? Assuming that the judgment aggregation problem can be framed as a matter of judging a set of binary propositions (“issues”), we develop a multi-issue majoritarian approach based on the criterion of supermajority efficiency (SME). SME reflects the idea that smalle...