[Abstract] Non-active adaptive sampling is a way of building machine learning models from a training data base which are supposed to dynamically and automatically derive guaranteed sample size. In this context and regardless of the strategy used in both scheduling and generating of weak predictors, a proposal for calculating absolute convergence and error thresholds is described. We not only make it possible to establish when the quality of the model no longer increases, but also supplies a proximity condition to estimate in absolute terms how close it is to achieving such a goal, thus supporting decision making for fine-tuning learning parameters in model selection. The technique proves its correctness and completeness with respect to our ...
International audienceWe explore the sequential decision-making problem where the goal is to estimat...
An algorithm to estimate the evolution of learning curves on the whole of a training data base, base...
In the design of ecient simulation algorithms, one is often beset with a poorchoice of proposal dist...
Financiado para publicación en acceso aberto: Universidade de Vigo/CISUGNon-active adaptive sampling...
We introduce an adaptive scheduling for adaptive sampling as a novel way of machine learning in the ...
This thesis presents a general discussion of active learning and adaptive sampling. In many practica...
While the amount of data that we are able to collect keeps growing, the use of Machine Learning and ...
While the amount of data that we are able to collect keeps growing, the use of Machine Learning and ...
This thesis is in the field of machine learning: the use of data to automatically learn a hypothesis...
International audienceWe survey recent results on efficient margin-based algorithms for adaptive sam...
Within the natural language processing (NLP) community, active learning has been widely investigated...
Adaptive importance samplers are adaptive Monte Carlo algorithms to estimate expectations with respe...
The amount of data being generated and stored is growing exponentially, owed in part to the continui...
International audienceIn reinforcement learning, an agent collects information interacting with an e...
This thesis addresses a problem arising in large and expensive experiments where incomplete data com...
International audienceWe explore the sequential decision-making problem where the goal is to estimat...
An algorithm to estimate the evolution of learning curves on the whole of a training data base, base...
In the design of ecient simulation algorithms, one is often beset with a poorchoice of proposal dist...
Financiado para publicación en acceso aberto: Universidade de Vigo/CISUGNon-active adaptive sampling...
We introduce an adaptive scheduling for adaptive sampling as a novel way of machine learning in the ...
This thesis presents a general discussion of active learning and adaptive sampling. In many practica...
While the amount of data that we are able to collect keeps growing, the use of Machine Learning and ...
While the amount of data that we are able to collect keeps growing, the use of Machine Learning and ...
This thesis is in the field of machine learning: the use of data to automatically learn a hypothesis...
International audienceWe survey recent results on efficient margin-based algorithms for adaptive sam...
Within the natural language processing (NLP) community, active learning has been widely investigated...
Adaptive importance samplers are adaptive Monte Carlo algorithms to estimate expectations with respe...
The amount of data being generated and stored is growing exponentially, owed in part to the continui...
International audienceIn reinforcement learning, an agent collects information interacting with an e...
This thesis addresses a problem arising in large and expensive experiments where incomplete data com...
International audienceWe explore the sequential decision-making problem where the goal is to estimat...
An algorithm to estimate the evolution of learning curves on the whole of a training data base, base...
In the design of ecient simulation algorithms, one is often beset with a poorchoice of proposal dist...