東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

FindBook

Google Book

Amazon

博客來

Minimum-Distortion Embedding.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Minimum-Distortion Embedding./
作者:	Agrawal, Akshay Kumar.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2021,
面頁冊數:	167 p.
附註:	Source: Dissertations Abstracts International, Volume: 83-09, Section: B.
Contained By:	Dissertations Abstracts International83-09B.
標題:	Fines & penalties. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28971837
ISBN:	9798780650058

Minimum-Distortion Embedding.
Agrawal, Akshay Kumar.

Minimum-Distortion Embedding. - Ann Arbor : ProQuest Dissertations & Theses, 2021 - 167 p.

Source: Dissertations Abstracts International, Volume: 83-09, Section: B.

Thesis (Ph.D.)--Stanford University, 2021.

This item must not be sold to any third party vendors.

We consider the vector embedding problem. We are given a finite set of items, with the goal of assigning a representative vector to each one, possibly under some constraints (such as the collection of vectors being standardized, i.e., having zero mean and unit covariance). We are given data indicating that some pairs of items are similar, and optionally, some other pairs are dissimilar. For pairs of similar items, we want the corresponding vectors to be near each other, and for dissimilar pairs, we want the corresponding vectors to not be near each other, measured in Euclidean distance. We formalize this by introducing distortion functions, defined for some pairs of the items. Our goal is to choose an embedding that minimizes the total distortion, subject to the constraints. We call this the minimum-distortion embedding (MDE) problem. This monograph is accompanied by an open-source Python package, PyMDE, for approximately solving MDE problems. Users can select from a library of distortion functions and constraints or specify custom ones, making it easy to rapidly experiment with different embeddings. Because our algorithm is scalable, and because PyMDE can exploit GPUs, our software scales to data sets with millions of items and tens of millions of distortion functions. Additionally, PyMDE is competitive in runtime with specialized implementations of specific embedding methods. To demonstrate our method, we compute embeddings for several real-world data sets, including images, an academic co-author network, US county demographic data, and single-cell mRNA transcriptomes.

ISBN: 9798780650058Subjects--Topical Terms:

3560680
Fines & penalties.

Minimum-Distortion Embedding.
LDR:02592nmm a2200325 4500 001 2349910
005 20221010063655.5
008 241004s2021 ||||||||||||||||| ||eng d
020 $a 9798780650058
035 $a (MiAaPQ)AAI28971837
035 $a (MiAaPQ)STANFORDgw270nn2045
035 $a AAI28971837
040 $a MiAaPQ $c MiAaPQ
100 1 $a Agrawal, Akshay Kumar. $3 3689336
245 1 0 $a Minimum-Distortion Embedding.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2021
300 $a 167 p.
500 $a Source: Dissertations Abstracts International, Volume: 83-09, Section: B.
500 $a Advisor: Boyd, Stephen P. .
502 $a Thesis (Ph.D.)--Stanford University, 2021.
506 $a This item must not be sold to any third party vendors.
520 $a We consider the vector embedding problem. We are given a finite set of items, with the goal of assigning a representative vector to each one, possibly under some constraints (such as the collection of vectors being standardized, i.e., having zero mean and unit covariance). We are given data indicating that some pairs of items are similar, and optionally, some other pairs are dissimilar. For pairs of similar items, we want the corresponding vectors to be near each other, and for dissimilar pairs, we want the corresponding vectors to not be near each other, measured in Euclidean distance. We formalize this by introducing distortion functions, defined for some pairs of the items. Our goal is to choose an embedding that minimizes the total distortion, subject to the constraints. We call this the minimum-distortion embedding (MDE) problem. This monograph is accompanied by an open-source Python package, PyMDE, for approximately solving MDE problems. Users can select from a library of distortion functions and constraints or specify custom ones, making it easy to rapidly experiment with different embeddings. Because our algorithm is scalable, and because PyMDE can exploit GPUs, our software scales to data sets with millions of items and tens of millions of distortion functions. Additionally, PyMDE is competitive in runtime with specialized implementations of specific embedding methods. To demonstrate our method, we compute embeddings for several real-world data sets, including images, an academic co-author network, US county demographic data, and single-cell mRNA transcriptomes.
590 $a School code: 0212.
650 4 $a Fines & penalties. $3 3560680
650 4 $a Population genetics. $3 517299
650 4 $a Co authorship. $3 3687004
650 4 $a Algorithms. $3 536374
650 4 $a Neighborhoods. $3 993475
650 4 $a Artificial intelligence. $3 516317
650 4 $a Computer science. $3 523869
650 4 $a Genetics. $3 530508
690 $a 0800
690 $a 0984
690 $a 0369
710 2 $a Stanford University. $3 754827
773 0 $t Dissertations Abstracts International $g 83-09B.
790 $a 0212
791 $a Ph.D.
792 $a 2021
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28971837