Browsing by Author "Castro Rabal, Jorge"
Now showing items 1-20 of 20
-
Adaptively learning probabilistic deterministic automata from data streams
(2014-07)
Article
Restricted access - publisher's policyMarkovian models with hidden state are widely-used formalisms for modeling sequential phenomena. Learnability of these models has been well studied when the sample is given in batch mode, and algorithms with PAC-like ... -
A lower bound for learning distributions generated by probabilistic automata
(Springer, 2010)
Conference report
Open AccessKnown algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability μ of the target machine, besides the number of states and the usual accuracy and confidence parameters. ... -
A New abstract combinatorial dimension for exact learning via queries
(2000-02)
External research report
Open AccessWe introduce an abstract model of exact learning via queries that can be instantiated to all the query learning models currently in use, while being closer to them than previous unificatory attempts. We present a ... -
A note on bounded query learning
(2005-04)
External research report
Open AccessWe study in this note the relationships between two usual models of learning via queries: the so-called exact and bounded learning models. One of our goals is to point out under which conditions the learning dimension ... -
A Note on learning decision lists
(1995-01)
External research report
Open AccessWe show an algorithm that learns decision lists via equivalence queries, provided that a set G including all terms of the target list is given. The algorithm runs in time polynomial in the cardinality of G. From this last ... -
Bootstrapping and learning PDFA in data streams
(2012)
Conference report
Open AccessMarkovian models with hidden state are widely-used formalisms for modeling sequential phenomena. Learnability of these models has been well studied when the sample is given in batch mode, and algorithms with PAC-like ... -
Learning nearly monotone k-term DNF
(1996-09)
External research report
Open AccessThis note studies the learnability of the class k-term DNF with a bounded number of negations per term. We study the case of learning with membership queries alone, and give tight upper and lower bounds on the ... -
Learning PDFA with asynchronous transitions
(Springer, 2010)
Conference lecture
Open AccessIn this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time lengths, governed by exponential distributions. -
Learning probabilistic automata : a study in state distinguishability
(2013-02-18)
Article
Restricted access - publisher's policyKnown algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability μ of the target machine, besides the number of states and the usual accuracy and confidence parameters. We ... -
Learning probability distributions generated by finite-state machines
(Springer, 2016)
Part of book or chapter of book
Open AccessWe review methods for inference of probability distributions generated by probabilistic automata and related models for sequence generation. We focus on methods that can be proved to learn in the inference in the limit ... -
On the query complexity of quantum learners
(2005-06)
External research report
Open AccessThis paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setting have quantum counterparts. A combinatorial notion, ... -
Ordocoordinación: cómo organizar 700 estudiantes en un nuevo campus (y no morir en el intento)
(Asociación de Enseñantes Universitarios de la Informática (AENUI), 2018)
Conference report
Open AccessSince Autumn Term 2017 the Department of Computer Science of the Universitat Politecnica de Catalunya UPC-BarcelonaTech is in charge of teaching ”Fundamentals of Programming” in the new DiagonalBeso ´s Campus, at EEBE ... -
Power to invest
(2018)
Conference report
Open AccessIn this post recession time it is important to measure the possibilities offered by a society in relation to investments. To do that, we consider an investment schema I= (R;R_1,...,R_n) where R is a lower bound on the ... -
Query, PACS and simple-PAC learning
(1998-01)
External research report
Open AccessWe study a distribution dependent form of PAC learning that uses probability distributions related to Kolmogorov complexity. We relate the PACS model, defined by Denis, D'Halluin and Gilleron, with the standard simple-PAC ... -
Simple PAC learning of simple decision lists
(1995-06)
External research report
Open AccessWe prove that log n-decision lists - the class of decision lists such that all their terms have low Kolmogorov complexity - are learnable in the simple PAC learning model. The proof is based on a transformation from an ... -
The Consistency dimension and distribution-dependent learning from queries
(2000-05-01)
External research report
Open AccessWe prove a new combinatorial characterization of polynomial learnability from equivalence queries, and state some of its consequences relating the learnability of a class with the learnability via equivalence and ... -
The Consistency dimension and distribution-dependent learning from queries: (extended abstract with appendices)
(1999-12)
External research report
Open AccessWe prove a new combinatorial characterization of polynomial learnability from equivalence queries, and state some of its consequences relating the learnability of a class with the learnability via equivalence and membership ... -
The Plogi and ACi-1 operators on the polynomial time hierarchy
(1993-11)
External research report
Open AccessIn a previous paper ([CS-92]) we studied the agreement of operators P_{log^i} and AC^{i-1} acting on NP. In this article we extend this work to other classes of the polynomial time hierarchy. We show that on Sigma_k^p, ... -
The robustness of periodic orchestrations in uncertain evolving environments
(Springer, 2015)
Conference report
Open AccessA framework for assessing the robustness of long-duration repetitive orchestrations in uncertain evolving environments is proposed. The model assumes that service-based evaluation environments are stable over short ... -
Web apps and imprecise probabilities
(Springer, 2018)
Conference report
Open AccessWe propose a model for the behaviour of Web apps in the unreliable WWW. Web apps are described by orchestrations. An orchestration mimics the personal use of the Web by defining the way in which Web services are invoked. ...
