<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
	<record>
		<datafield tag="980" ind1=" " ind2=" ">
			<subfield code="a">REPORT</subfield>
		</datafield>
		<datafield tag="970" ind1=" " ind2=" ">
			<subfield code="a">Tommasi_Idiap-RR-16-2013/IDIAP</subfield>
		</datafield>
		<datafield tag="245" ind1=" " ind2=" ">
			<subfield code="a">Learning Categories from Few Examples with Multi Model Knowledge Transfer</subfield>
		</datafield>
		<datafield tag="700" ind1=" " ind2=" ">
			<subfield code="a">Tommasi, Tatiana</subfield>
		</datafield>
		<datafield tag="700" ind1=" " ind2=" ">
			<subfield code="a">Orabona, Francesco</subfield>
		</datafield>
		<datafield tag="700" ind1=" " ind2=" ">
			<subfield code="a">Caputo, Barbara</subfield>
		</datafield>
		<datafield tag="088" ind1=" " ind2=" ">
			<subfield code="a">Idiap-RR-16-2013</subfield>
		</datafield>
		<datafield tag="260" ind1=" " ind2=" ">
			<subfield code="c">2013</subfield>
			<subfield code="b">Idiap</subfield>
		</datafield>
		<datafield tag="771" ind1="2" ind2=" ">
			<subfield code="d">April 2013</subfield>
		</datafield>
		<datafield tag="520" ind1=" " ind2=" ">
			<subfield code="a">Learning a visual object category from few samples is a compelling and challenging problem. In several real-world
applications collecting many annotated data is costly and not always possible. However a small training set does not allow to cover the
high intraclass variability typical of visual objects. In this condition, machine learning methods provide very few guarantees. This paper
presents a discriminative model adaptation algorithm able to proficiently learn a target object with few examples by relying on other
previously learned source categories. The proposed method autonomously chooses from where and how much to transfer information
by solving a convex optimization problem which ensures to have the minimal leave-one-out error on the available training set. We
analyze several properties of the described approach and perform an extensive experimental comparison with other existing transfer
solutions, consistently showing the value of our algorithm.</subfield>
		</datafield>
	</record>
</collection>