نتایج جستجو برای: approximately innercsigma dynamics

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

2017
Eric T. Nalisnick Padhraic Smyth

Informative Bayesian priors are often difficult to elicit, and when this is the case, modelers usually turn to noninformative or objective priors. However, objective priors such as the Jeffreys and reference priors are not tractable to derive for many models of interest. We address this issue by proposing techniques for learning reference prior approximations: we select a parametric family and ...

Journal: :CoRR 2015
Vasilis Syrgkanis Johannes Gehrke

Data as a commodity has always been purchased and sold. Recently, web services that are data marketplaces have emerged that match data buyers with data sellers. So far there are no guidelines how to price queries against a database. We consider the recently proposed query-based pricing framework of Koutris et al. [13] and ask the question of computing optimal input prices in this framework by f...

2000
Jiefu Shi Michael L. Littman

(www.aaai.org). All rights reserved. Creating strategies for different games forces us to grapple with different types of decision-making challenges. Poker is a stochastic game of imperfect information; unlike games of complete information, game-theoretic optimal strategies for poker can be randomized. Koller and Pfeffer [1] argue that two-player poker can be solved efficiently in the size of t...

2011
Loizos Michael

To what extent is learnability impeded when information is missing in learning instances? We present relevant known results and concrete open problems, in the context of a natural extension of the PAC learning model that accounts for arbitrarily missing information.

Journal: :IEEE Trans. Pattern Anal. Mach. Intell. 1993
Shimon Edelman

Previous results on nonlearnability of visual concepts relied on the assumption that such concepts are represented as sets of pixels [l]. This correspondence uses an approach developed by Haussler [2] to show that under an alternative, feature-based representation, recognition is PAC learnable from a feasible number of examples in a distribution-free manner.

Journal: :J. Symb. Log. 2006
Anand Pillay Dominika Polkowska

We introduce and study the notions of a PAC substructure of a stable structure, and a bounded substructure of an arbitrary substructure, generalizing [8]. We give precise definitions and equivalences, saying what it means for properties such as PAC to be first order, study some examples (such as differentially closed fields) in detail, relate the material to generic automorphisms, and generaliz...

Journal: :Combinatorics, Probability and Computing 2014

Journal: :Bulletin of the Korean Mathematical Society 2008

Journal: :Pacific Journal of Mathematics 1978

Journal: :Proceedings of the American Mathematical Society 2013

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

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