Suchergebnisse - query complexity and algorithmic learning theory

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

Volltext

Active learning via query synthesis and nearest neighbour search von 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 …”
Volltext

Queries revisited von 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 …”
Volltext

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

“… In this paper, we study the quantum PAC learning model, offering an improved lower bound on the query complexity …”
Volltext

Learning conditional preference networks von 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 …”
Volltext

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

“… : Angluin's model of exact learning from membership queries and Valiant's probably approximately correct (PAC …”
Volltext

Nonadaptive quantum query complexity von 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 …”
Volltext

Disjunctive closures for knowledge compilation von 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 …”
Volltext

Spectral Hashing With Semantically Consistent Graph for Image Indexing von 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 …”
Volltext

New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries von 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 …”
Volltext

Agnostically Learning Multi-Index Models with Queries von 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 …”
Volltext

Improved algorithms for quantum identification of Boolean oracles von 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 …”
Volltext

Complexity parameters for first order classes von 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 …”
Volltext

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

Volltext

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

“… , where the complexity of the required oracle depends on the query-types used by the learning algorithm …”
Volltext

Algorithmic Polynomials von Sherstov, Alexander A

“… \). Upper bounds on approximate degree have a variety of applications in learning theory, differential privacy, and algorithm design in general …”
Volltext

Robust and Efficient Ridge-Based Palmprint Matching von 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 …”
Volltext

Statistical Query Lower Bounds for Robust Estimation of High-Dimensional Gaussians and Gaussian Mixtures von 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 …”
Volltext

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

“… We study the parameterized complexity of learning k -juntas and some variations of juntas …”
Volltext

PathEmb: Random Walk Based Document Embedding for Global Pathway Similarity Search von 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 …”
Volltext