東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Interactive Machine Learning With He...

Wang, Zhi.

FindBook

Google Book

Amazon

博客來

Interactive Machine Learning With Heterogeneous Data.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Interactive Machine Learning With Heterogeneous Data./
作者:	Wang, Zhi.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2024,
面頁冊數:	362 p.
附註:	Source: Dissertations Abstracts International, Volume: 85-10, Section: A.
Contained By:	Dissertations Abstracts International85-10A.
標題:	Computer science. -
電子資源:	https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30995604
ISBN:	9798382303888

Interactive Machine Learning With Heterogeneous Data.
Wang, Zhi.

Interactive Machine Learning With Heterogeneous Data. - Ann Arbor : ProQuest Dissertations & Theses, 2024 - 362 p.

Source: Dissertations Abstracts International, Volume: 85-10, Section: A.

Thesis (Ph.D.)--University of California, San Diego, 2024.

In interactive machine learning, learners utilize data collected from interacting with the environment or with humans to better achieve their goals. Real-world applications often involve heterogeneous data sources, such as a large pool of human users with diverse interests or preferences, or non-stationary environments with distribution shifts. In this dissertation, we investigate interactive machine learning in the presence of heterogeneous data. In particular, we study when and how provably efficient learning can be achieved when the heterogeneous data exhibit structure.In the first part, we study transfer learning in sequential decision-making. We consider a setting where learners are deployed to perform tasks in similar yet nonidentical{A0}multi-armed bandit environments. We study when and how knowledge acquired from one environment can be robustly transferred to others so as to improve the collective performance of the learners. We present two provably efficient algorithms that properly manage data collected across heterogeneous environments: one uses upper confidence bounds and the other is based on Thompson sampling. We then generalize the setting and certain results to multi-task reinforcement learning in tabular Markov decision processes.In the second part, we study metric learning from crowdsourced preference comparisons. In particular, we consider the ideal point model in preference learning, where a user prefers an item over another if it is closer to their latent ideal point. While users may have individual preferences and distinct ideal points, our goal is to learn a common Mahalanobis distance, which provides a more accurate measure of "closeness" that aligns with human values, perception and preferences. We study when and how such a metric can be learned if we can query each user a few times, asking questions in the form of "Do you prefer item A or B?".

ISBN: 9798382303888Subjects--Topical Terms:

523869
Computer science.
Subjects--Index Terms:

Machine learning

Interactive Machine Learning With Heterogeneous Data.
LDR:03025nmm a2200373 4500 001 2398169
005 20240812064356.5
006 m o d
007 cr#unu||||||||
008 251215s2024 ||||||||||||||||| ||eng d
020 $a 9798382303888
035 $a (MiAaPQ)AAI30995604
035 $a AAI30995604
040 $a MiAaPQ $c MiAaPQ
100 1 $a Wang, Zhi. $3 1900689
245 1 0 $a Interactive Machine Learning With Heterogeneous Data.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2024
300 $a 362 p.
500 $a Source: Dissertations Abstracts International, Volume: 85-10, Section: A.
500 $a Advisor: Chaudhuri, Kamalika.
502 $a Thesis (Ph.D.)--University of California, San Diego, 2024.
520 $a In interactive machine learning, learners utilize data collected from interacting with the environment or with humans to better achieve their goals. Real-world applications often involve heterogeneous data sources, such as a large pool of human users with diverse interests or preferences, or non-stationary environments with distribution shifts. In this dissertation, we investigate interactive machine learning in the presence of heterogeneous data. In particular, we study when and how provably efficient learning can be achieved when the heterogeneous data exhibit structure.In the first part, we study transfer learning in sequential decision-making. We consider a setting where learners are deployed to perform tasks in similar yet nonidentical{A0}multi-armed bandit environments. We study when and how knowledge acquired from one environment can be robustly transferred to others so as to improve the collective performance of the learners. We present two provably efficient algorithms that properly manage data collected across heterogeneous environments: one uses upper confidence bounds and the other is based on Thompson sampling. We then generalize the setting and certain results to multi-task reinforcement learning in tabular Markov decision processes.In the second part, we study metric learning from crowdsourced preference comparisons. In particular, we consider the ideal point model in preference learning, where a user prefers an item over another if it is closer to their latent ideal point. While users may have individual preferences and distinct ideal points, our goal is to learn a common Mahalanobis distance, which provides a more accurate measure of "closeness" that aligns with human values, perception and preferences. We study when and how such a metric can be learned if we can query each user a few times, asking questions in the form of "Do you prefer item A or B?".
590 $a School code: 0033.
650 4 $a Computer science. $3 523869
650 4 $a Information science. $3 554358
653 $a Machine learning
653 $a Decision-making
653 $a Heterogeneous data sources
653 $a Efficient learning
690 $a 0984
690 $a 0800
690 $a 0723
710 2 $a University of California, San Diego. $b Computer Science and Engineering. $3 1018473
773 0 $t Dissertations Abstracts International $g 85-10A.
790 $a 0033
791 $a Ph.D.
792 $a 2024
793 $a English
856 4 0 $u https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30995604