Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Baharav, Tavor Z."'
Autor:
Baharav, Tavor Z., Lai, Tze Leung
Data depth, introduced by Tukey (1975), is an important tool in data science, robust statistics, and computational geometry. One chief barrier to its broader practical utility is that many common measures of depth are computationally intensive, requi
Externí odkaz:
http://arxiv.org/abs/2211.03985
We study the problem of estimating the value of a known smooth function $f$ at an unknown point $\boldsymbol{\mu} \in \mathbb{R}^n$, where each component $\mu_i$ can be sampled via a noisy oracle. Sampling more frequently components of $\boldsymbol{\
Externí odkaz:
http://arxiv.org/abs/2203.10124
Autor:
Baharav, Tavor Z., Jiang, Daniel L., Kolluri, Kedarnath, Sanghavi, Sujay, Dhillon, Inderjit S.
Extreme multi-label classification (XMC) aims to learn a model that can tag data points with a subset of relevant labels from an extremely large label set. Real world e-commerce applications like personalized recommendations and product advertising c
Externí odkaz:
http://arxiv.org/abs/2106.00730
Pairwise alignment of DNA sequencing data is a ubiquitous task in bioinformatics and typically represents a heavy computational burden. State-of-the-art approaches to speed up this task use hashing to identify short segments (k-mers) that are shared
Externí odkaz:
http://arxiv.org/abs/2011.04832
Consider N cooperative but non-communicating players where each plays one out of M arms for T turns. Players have different utilities for each arm, representable as an NxM matrix. These utilities are unknown to the players. In each turn players selec
Externí odkaz:
http://arxiv.org/abs/2002.09808
Autor:
Chaung, Kaitlin, Baharav, Tavor Z., Henderson, George, Zheludev, Ivan N., Wang, Peter L., Salzman, Julia
Publikováno v:
In Cell 7 December 2023 186(25):5440-5456
Autor:
Baharav, Tavor Z., Tse, David N.
The medoid of a set of n points is the point in the set that minimizes the sum of distances to other points. It can be determined exactly in O(n^2) time by computing the distances between all pairs of points. Previous works show that one can signific
Externí odkaz:
http://arxiv.org/abs/1906.04356
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
The celebrated Monte Carlo method estimates an expensive-to-compute quantity by random sampling. Bandit-based Monte Carlo optimization is a general technique for computing the minimum of many such expensive-to-compute quantities by adaptive random sa
Externí odkaz:
http://arxiv.org/abs/1805.08321
Publikováno v:
In Patterns 11 September 2020 1(6)