SYMMETRIZATION AND MINIMAX PRINCIPLES

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symmetrization, convexity and applications

Based on permutation enumeration of the symmetric group and ‘generalized’ barycentric coordinates on arbitrary convex polytope, we develop a technique to obtain symmetrization procedures for functions that provide a unified framework to derive new Hermite-Hadamard type inequalities. We also present applications of our results to the Wright-convex functions with special emphasis on their key rol...

متن کامل

Symmetrization and Rademacher Complexity

Let’s first see how primitive covers were inadequate. Recall that a function class G is a primitive cover for a function class F at scale > 0 over some set S if: • G ⊆ F , • |G| <∞, and • for every f ∈ F there exists g ∈ G with supx∈S |g(x)− f(x)| ≤ . Last class, we gave a generalization bound for classes with primitive covers (basically, primitive covers give discretizations, and then we apply...

متن کامل

Symmetrization, quantum images and measurement

We argue that symmetrization of an incoming microstate with similar states in a sea of microstates contained in a macroscopic detector can produce an effective image, which does not contradict the no-cloning theorem, and such a combinatorial set can then be used with first passage random walk interactions suggested in an earlier work to give the right quantum mechanical weight for measured eige...

متن کامل

Multivariate medians and measure-symmetrization

Geometric and stochastic ideas interact in a wide variety of ways over both theory and applications. For two connections that do not seem to have been mentioned before, we present here descriptive comments and suggestions for further investigation. The first deals with multivariate medians, an active area of research in which Yehuda himself was interested (see [11] with Cun-Hui Zhang). Using th...

متن کامل

Minimax Pathology and Real-Number Minimax Model

Game-playing programs usually evaluate moves by searching the game tree using the minimax principle. Practice shows that deeper searches produce better results. However, theoretical analyses indicate that under apparently reasonable conditions, the behavior of minimax is pathological, i.e. deeper searches produce worse results. In this paper, a minimax model that – unlike most work in this area...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Communications in Contemporary Mathematics

سال: 2005

ISSN: 0219-1997,1793-6683

DOI: 10.1142/s0219199705001817