Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Alina Beygelzimer"'
Autor:
Charvi Rastogi, Ivan Stelmakh, Alina Beygelzimer, Yann N Dauphin, Percy Liang, Jennifer Wortman Vaughan, Zhenyu Xue, Hal Daumé Iii, Emma Pierson, Nihar B Shah
Publikováno v:
PLoS ONE, Vol 19, Iss 4, p e0300710 (2024)
How do author perceptions match up to the outcomes of the peer-review process and perceptions of others? In a top-tier computer science conference (NeurIPS 2021) with more than 23,000 submitting authors and 9,000 submitted papers, we surveyed the aut
Externí odkaz:
https://doaj.org/article/71cb7dcdf65a420d86a4fd1696eb9441
Autor:
Alina Beygelzimer, Mitsunori Ogihara
Publikováno v:
Theory of Computing Systems. Jul/Aug2003, Vol. 36 Issue 4, p359. 16p.
Publikováno v:
ICML
We state and analyze the first active learning algorithm that finds an @e-optimal hypothesis in any hypothesis class, when the underlying distribution has arbitrary forms of noise. The algorithm, A^2 (for Agnostic Active), relies only upon the assump
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::57d7ab010af5ae20df699e275f58c488
https://doi.org/10.1016/j.jcss.2008.07.003
https://doi.org/10.1016/j.jcss.2008.07.003
In this paper, we provide a summary of the mathematical and computational techniques that have enabled learning reductions to effectively address a wide class of tasks, and show that this approach to solving machine learning problems can be broadly u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::69a854ffee3fbd6b76cbcc198f2fbb84
Autor:
Alina Beygelzimer, Mitsunori Ogihara
Publikováno v:
MFCS
We show that one cannot rule out even a single possibility for the value of an arithmetic circuit on a given input using an NC algorithm, unless P collapses to NC (i.e., unless all problems with polynomial-time sequential solutions can be efficiently
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::06ef2c607c70b64209392ffed3630aa6
Publikováno v:
Physica A: Statistical Mechanics and its Applications. 357:593-612
An important property of networked systems is their robustness against removal of network nodes, through either random node failure or targeted attack. Although design methods have been proposed for creating, ab initio, a network that has optimal rob
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::00a6281e73b40edf4d7896f8d7b8764f
https://doi.org/10.1016/j.physa.2005.03.040
https://doi.org/10.1016/j.physa.2005.03.040
Autor:
Mitsunori Ogihara, Alina Beygelzimer
Publikováno v:
Theory of Computing Systems. 36:359-374
We investigate the complexity of enumerative approximation of two fundamental problems in linear algebra, computing the rank and the determinant of a matrix. We show that both are as hard to approximate (in the enumerative sense) as to compute exactl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::960c83024fcd52ec0820cf9704077483
https://doi.org/10.1007/s00224-003-1091-9
https://doi.org/10.1007/s00224-003-1091-9
Publikováno v:
Discrete Mathematics. 257:267-283
Given a set of n points in general position in the plane, where n is even, a halving line is a line going through two of the points and cutting the remaining set of n−2 points in half. Let h(n) denote the maximum number of halving lines that can be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1a29e2636194828d55e4040e35832d6d
https://doi.org/10.1016/s0012-365x(02)00430-2
https://doi.org/10.1016/s0012-365x(02)00430-2
Publikováno v:
Intelligent Data Analysis. 6:379-395
An important issue in visualizing categorical data is how to order categorical values -- non-numeric values that do not have a natural ordering, which makes it difficult to map them to visual coordinates. The focus of this paper is on constructing ca
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fee0235959e46301a399082a051cf93f
https://doi.org/10.3233/ida-2002-6406
https://doi.org/10.3233/ida-2002-6406
Publikováno v:
ACM SIGACT News. 30:25-40
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3edc70354f75c36ca47c599da792eb57
https://doi.org/10.1145/337885.337891
https://doi.org/10.1145/337885.337891