نتایج جستجو برای: minimax module

تعداد نتایج: 73366  

Journal: :iranian journal of fuzzy systems 2005
paul isaac

the concepts of free modules, projective modules, injective modules and the likeform an important area in module theory. the notion of free fuzzy modules was introducedby muganda as an extension of free modules in the fuzzy context. zahedi and ameriintroduced the concept of projective and injective l-modules. in this paper we give analternate definition for projective l-modules. we prove that e...

2011
T. Tony Cai Zhao Ren Harrison H. Zhou

Toeplitz covariance matrices are used in the analysis of stationary stochastic processes and a wide range of applications including radar imaging, target detection, speech recognition, and communications systems. In this paper, we consider optimal estimation of large Toeplitz covariance matrices and establish the minimax rate of convergence for two commonly used parameter spaces under the spect...

2003
Aleksander Sadikov Ivan Bratko Igor Kononenko

This article presents the results of an empirical experiment designed to gain insight into what is the effect of the minimax on the evaluation function. The experiment’s simulations were performed upon the KRK chess endgame. Main result is that dependencies between evaluations of sibling nodes in a game tree and an abundance of possibilities to commit blunders present in the KRK endgame are not...

2009
Marco Saerens

Markov games is a framework which can be used to formalise n-agent reinforcement learning (RL). Littman (Markov games as a framework for multi-agent reinforcement learning, in: Proceedings of the 11th International Conference on Machine Learning (ICML-94), 1994.) uses this framework to model two-agent zero-sum problems and, within this context, proposes the minimax-Q algorithm. This paper revie...

2017
Marek Cygan Lukasz Kowalik Arkadiusz Socala Krzysztof Sornat

We present three results on the complexity of Minimax Approval Voting. First, we study Minimax Approval Voting parameterized by the Hamming distance d from the solution to the votes. We show Minimax Approval Voting admits no algorithm running in time O(2 log ), unless the Exponential Time Hypothesis (ETH) fails. This means that the O(d) algorithm of Misra et al. [AAMAS 2015] is essentially opti...

 Let $R$ be a commutative ring with identity and $M$ be a finitely generated unital $R$-module. In this paper, first we give necessary and sufficient conditions that a finitely generated module to be a multiplication module. Moreover, we investigate some conditions which imply that the module $M$ is the direct sum of some cyclic modules and free modules. Then some properties of Fitting ideals o...

2016
Farzan Farnia David Tse

Given a task of predicting Y from X , a loss function L, and a set of probability distributions Γ, what is the optimal decision rule minimizing the worst-case expected loss over Γ? In this paper, we address this question by introducing a generalization of the principle of maximum entropy. Applying this principle to sets of distributions with a proposed structure, we develop a general minimax ap...

1996
Yazhen Wang

In this article we study function estimation via wavelet shrinkage for data with long-range dependence. We propose a fractional Gaussian noise model to approximate nonparametric regression with long-range dependence and establish asymp-totics for minimax risks. Because of long-range dependence, the minimax risk and the minimax linear risk converge to zero at rates that diier from those for data...

Journal: :Math. Oper. Res. 2014
Gábor Bartók Dean P. Foster Dávid Pál Alexander Rakhlin Csaba Szepesvári

In a partial monitoring game, the learner repeatedly chooses an action, the environment responds with an outcome, and then the learner suffers a loss and receives a feedback signal, both of which are fixed functions of the action and the outcome. The goal of the learner is to minimize his regret, which is the difference between his total cumulative loss and the total loss of the best fixed acti...

Journal: :IEEE Trans. Information Theory 2002
Jianqing Fan Ja-Yong Koo

This paper studies the issue of optimal deconvolution density estimation using wavelets. We explore the asymptotic properties of estimators based on thresholding of estimated wavelet coe cients. Minimax rates of convergence under the integrated square loss are studied over Besov classes B pq of functions for both ordinary smooth and supersmooth convolution kernels. The minimax rates of converge...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید