منابع مشابه
Charakterformeln Für Kipp-moduln Über Kac-moody-algebren
We show how to express the characters of tilting modules in a (possibly parabolic) category O over a Kac-Moody algebra in terms of the characters of simple highest weight modules. This settles in lots of cases Conjecture 7.2 in Kazhdan-Lusztig-Polynome und eine Kombinatorik für KippModuln, Represent. Theory (1997), by the author, describing the character of tilting modules for quantum groups at...
متن کامل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...
متن کاملEmpirical Entropy, Minimax Regret and Minimax Risk
We consider the random design regression with square loss. We propose a method that aggregates empirical minimizers (ERM) over appropriately chosen random subsets and reduces to ERM in the extreme case, and we establish exact oracle inequalities for its risk. We show that, under the −p growth of the empirical -entropy, the excess risk of the proposed method attains the rate n− 2 2+p for p ∈ (0,...
متن کاملMinimax Embeddings
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfuctions of a quadratic form generated from the graph. We introduce a more general and more robust formulation of NLDR based on the singular value decomposition (SVD). In this framework, most spectral NLDR principles can be recovered by taking a subset of the constraints in ...
متن کاملMinimax Probability
When constructing a classiier, the probability of correct classii-cation of future data points should be maximized. In the current paper this desideratum is translated in a very direct way into an optimization problem, which is solved using methods from convex optimization. We also show how to exploit Mercer kernels in this setting to obtain nonlinear decision boundaries. A worst-case bound on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1986
ISSN: 0021-8693
DOI: 10.1016/0021-8693(86)90125-0