Upgrade to Pro
— share decks privately, control downloads, hide ads and more …
Speaker Deck
Features
Speaker Deck
PRO
Sign in
Sign up for free
Search
Search
OpenTalks.AI - Александр Артеменков, Towards Scalable Dimensionality Reduction via Noise Contrastive Estimation
Search
OpenTalks.AI
February 21, 2020
Science
0
2.1k
OpenTalks.AI - Александр Артеменков, Towards Scalable Dimensionality Reduction via Noise Contrastive Estimation
OpenTalks.AI
February 21, 2020
Tweet
Share
More Decks by OpenTalks.AI
See All by OpenTalks.AI
OpenTalks.AI - Виктор Лемпицкий, Моделирование 3Д сцен: новые подходы в 2020 году
opentalks
0
420
OpenTalks.AI - Алексей Чернявский, Нейросетевые алгоритмы для повышения качества медицинских изображений
opentalks
0
400
OpenTalks.AI - Александр Громов, Устойчивость нейросетевых моделей при анализе КТ/НДКТ-исследований
opentalks
0
350
OpenTalks.AI - Денис Тимонин, Megatron-LM: Обучение мультимиллиардных LMs при помощи техники Model Parallelism
opentalks
0
460
OpenTalks.AI - Егор Филимонов, Возможности платформы Huawei Atlas и эффективный гетерогенный инференс.
opentalks
0
110
OpenTalks.AI - Александр Прозоров, Референсная архитектура робота сервисного центра в отраслях с изменчивыми бизнес-процессами
opentalks
0
340
OpenTalks.AI - Наталья Лукашевич, Анализ тональности по отношению к компании — с чем не справился BERT
opentalks
0
320
OpenTalks.AI - Константин Воронцов, Фейковые новости и другие типы потенциально опасного дискурса: типология, подходы, датасеты, соревнования
opentalks
0
390
OpenTalks.AI - Дмитрий Ветров, Фрактальность функции потерь, эффект двойного спуска и степенные законы в глубинном обучении - фрагменты одной мозаики
opentalks
0
410
Other Decks in Science
See All in Science
構造活性フォーラム2023-山﨑担当分
yamasakih
0
310
AI科学の何が“哲学”の問題になるのか ~問いマッピングの試み~
rmaruy
1
1.2k
AI(人工知能)の過去・現在・未来 —AIは人間を超えるのか—
tagtag
0
230
How we developed a data exchange format: Lessons learned from Camtrap DP
peterdesmet
1
140
Presenting Effectively with Data (in a Hurry)
thomaselove
1
250
2023-07-18_Verge_Genomics
lcolladotor
0
110
Yasuke
drawsbygba
0
610
Endocannabinology 101
drbonci
PRO
0
250
Design of three-dimensional binary manipulators based on the KS statistic and maximum empty circles (IECON2023)
konakalab
0
230
遺伝子発現プロファイルに基づく新しい薬物間相互作用予測法
tagtag
0
100
The Universe, How it works
arafkarsh
0
100
JSol'Ex : solar image processing in Java
melix
0
240
Featured
See All Featured
Why Our Code Smells
bkeepers
PRO
331
56k
KATA
mclloyd
15
12k
The Illustrated Children's Guide to Kubernetes
chrisshort
31
46k
No one is an island. Learnings from fostering a developers community.
thoeni
16
2.1k
Web Components: a chance to create the future
zenorocha
305
41k
Let's Do A Bunch of Simple Stuff to Make Websites Faster
chriscoyier
501
140k
GraphQLの誤解/rethinking-graphql
sonatard
50
9.2k
Raft: Consensus for Rubyists
vanstee
132
6.3k
Git: the NoSQL Database
bkeepers
PRO
422
63k
Web development in the modern age
philhawksworth
202
10k
Responsive Adventures: Dirty Tricks From The Dark Corners of Front-End
smashingmag
244
20k
Art, The Web, and Tiny UX
lynnandtonic
289
19k
Transcript
Towards Scalable Dimensionality Reduction Aleksandr Artemenkov joint work with Maxim
Panov via Noise Contrastive Estimation
News Headlines Of India 3 million topics you are unfamiliar
with Kaggle Dataset
None
Just repeat 3 million times! (not a good idea)
Is there a better approach? (visualization)
None
Noise Contrastive Estimation (without a single formula) (check out the
poster for them)
Building Representation “cold” “frosty” “cold” “warm” “cold” “first” similar different
unrelated (noisy) ? ? ?
Simple Insight • similar points = closer than predefined noisy
distance • different points = further than predefined noisy distance Any benefits from such approach?
Parallelized Batch Optimization • noisy distance is predefined • repel
different points • attract similar points • adjustments are independent of each other to distinguish them from noise Meet NCVis! (Noise Contrastive Visualization) GitHub Repository
Why use NCVis? (there are reasons) Paper
None
None
Thank you for your attention! (find me near the poster)