Výsledky vyhľadávania - query complexity and algorithmic learning theory

Reconstructing weighted graphs with minimal query complexity: Algorithmic Learning Theory 5ALT 2009 Autor BSHOUTY, Nader H, MAZZAWI, Hanna

Získať plný text

Active learning via query synthesis and nearest neighbour search Autor Wang, Liantao, Hu, Xuelei, Yuan, Bo, Lu, Jianfeng

“… As the core component of active learning algorithms, query synthesis and pool-based sampling are two main scenarios of querying considered in the literature…”
Získať plný text

Queries revisited Autor Angluin, Dana

“…We begin with a brief tutorial on the problem of learning a finite concept class over a finite domain using membership queries and/or equivalence queries…”
Získať plný text

An improved lower bound on query complexity for quantum PAC learning Autor Zhang, Chi

“…In this paper, we study the quantum PAC learning model, offering an improved lower bound on the query complexity…”
Získať plný text

Learning conditional preference networks Autor Koriche, Frédéric, Zanuttini, Bruno

“… In this paper, we investigate the problem of learning CP-nets in the well-known model of exact identification with equivalence and membership queries…”
Získať plný text

Equivalences and Separations Between Quantum and Classical Learnability Autor Servedio, Rocco A., Gortler, Steven J.

“…: Angluin's model of exact learning from membership queries and Valiant's probably approximately correct (PAC…”
Získať plný text

Nonadaptive quantum query complexity Autor Montanaro, Ashley

“…We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries…”
Získať plný text

Disjunctive closures for knowledge compilation Autor Fargier, Hélène, Marquis, Pierre

“…, its ability to represent information using little space), and its time efficiency, i.e., the queries and transformations which can be achieved in polynomial time, among those of interest for the application under consideration…”
Získať plný text

Spectral Hashing With Semantically Consistent Graph for Image Indexing Autor Li, Peng, Wang, Meng, Cheng, Jian, Xu, Changsheng, Lu, Hanqing

“… Retrieving similar neighbors is then simply accomplished by retrieving images that have codes within a small Hamming distance of the code of the query…”
Získať plný text

New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries Autor Mitrana, Victor, Tîrnăucă, Cristina

“…In this note, we show that the number of equivalence queries asked by an algorithm proposed in Becerra-Bonache et al…”
Získať plný text

Agnostically Learning Multi-Index Models with Queries Autor Diakonikolas, Ilias, Kane, Daniel M., Kontonis, Vasilis, Tzamos, Christos, Zarifis, Nikos

“…We study the power of query access for the fundamental task of agnostic learning under the Gaussian distribution…”
Získať plný text

Improved algorithms for quantum identification of Boolean oracles Autor Ambainis, Andris, Iwama, Kazuo, Kawachi, Akinori, Raymond, Rudy, Yamashita, Shigeru

“…, S. Yamashita, Quantum identification of boolean oracles, in: Proc. of STACS’04, in: LNCS, vol. 2996, 2004, pp. 105–116] by providing a mostly optimal upper bound of query complexity for this problem…”
Získať plný text

Complexity parameters for first order classes Autor Arias, Marta, Khardon, Roni

“…: Tamás Horváth and Akihiro Yamamoto; ILP-2004 Guest Editors: Rui Camacho, Ross King and Ashwin Srinivasan We study several complexity parameters for first order formulas and their suitability for first order learning models…”
Získať plný text

Query learning of bounded-width OBDDs: Algorithmic Learning Theory Autor NAKAMURA, A

Získať plný text

The complexity of learning concept classes with polynomial general dimension Autor Köbler, Johannes, Lindner, Wolfgang

“…, where the complexity of the required oracle depends on the query-types used by the learning algorithm…”
Získať plný text

Algorithmic Polynomials Autor Sherstov, Alexander A

“…\). Upper bounds on approximate degree have a variety of applications in learning theory, differential privacy, and algorithm design in general…”
Získať plný text

Robust and Efficient Ridge-Based Palmprint Matching Autor Dai, Jifeng, Feng, Jianjiang, Zhou, Jie

“…During the past decade, many efforts have been made to use palmprints as a biometric modality. However, most of the existing palmprint recognition systems are…”
Získať plný text

Statistical Query Lower Bounds for Robust Estimation of High-Dimensional Gaussians and Gaussian Mixtures Autor Diakonikolas, Ilias, Kane, Daniel M., Stewart, Alistair

“…We describe a general technique that yields the first Statistical Query lower bounds for a range of fundamental high-dimensional learning problems involving Gaussian distributions…”
Získať plný text

Parameterized learnability of juntas Autor Arvind, V., Köbler, Johannes, Lindner, Wolfgang

“…We study the parameterized complexity of learning k -juntas and some variations of juntas…”
Získať plný text

PathEmb: Random Walk Based Document Embedding for Global Pathway Similarity Search Autor Zhang, Jiao, Kwong, Sam, Liu, Guangming, Lin, Qiuzhen, Wong, Ka-Chun

“… Given a query pathway as well as a database, a pathway similarity search aims to identify novel pathways that are homologous to the query pathway…”
Získať plný text