Zobrazeno 1 - 10
of 12 768
pro vyhledávání: '"A. Ben‐David"'
Autor:
Agarwal, Avantika, Ben-David, Shalev
We study the quantum-classical polynomial hierarchy, QCPH, which is the class of languages solvable by a constant number of alternating classical quantifiers followed by a quantum verifier. Our main result is that QCPH is infinite relative to a rando
Externí odkaz:
http://arxiv.org/abs/2410.19062
Autor:
Ben-David, Shalev, Kundu, Srijita
We study the query complexity analogue of the class TFNP of total search problems. We give a way to convert partial functions to total search problems under certain settings; we also give a way to convert search problems back into partial functions.
Externí odkaz:
http://arxiv.org/abs/2410.16245
Autor:
Yu, Zhiying, Ben-David, Shalev
We study the quantum query algorithms for simplex finding, a generalization of triangle finding to hypergraphs. This problem satisfies a rank-reduction property: a quantum query algorithm for finding simplices in rank-$r$ hypergraphs can be turned in
Externí odkaz:
http://arxiv.org/abs/2409.00239
Autor:
Jacovi, Alon, Ambar, Moran, Ben-David, Eyal, Shaham, Uri, Feder, Amir, Geva, Mor, Marcus, Dror, Caciularu, Avi
There is a growing line of research on verifying the correctness of language models' outputs. At the same time, LMs are being used to tackle complex queries that require reasoning. We introduce CoverBench, a challenging benchmark focused on verifying
Externí odkaz:
http://arxiv.org/abs/2408.03325
We examine the relationship between learnability and robust (or agnostic) learnability for the problem of distribution learning. We show that, contrary to other learning settings (e.g., PAC learning of function classes), realizable learnability of a
Externí odkaz:
http://arxiv.org/abs/2406.17814
Autor:
Caciularu, Avi, Jacovi, Alon, Ben-David, Eyal, Goldshtein, Sasha, Schuster, Tal, Herzig, Jonathan, Elidan, Gal, Globerson, Amir
Large Language Models (LLMs) often do not perform well on queries that require the aggregation of information across texts. To better evaluate this setting and facilitate modeling efforts, we introduce TACT - Text And Calculations through Tables, a d
Externí odkaz:
http://arxiv.org/abs/2406.03618
The divide between weak and strong lensing is of course artificial, in that both regimes are manifestations of the same physical phenomenon: gravity bending the path of light. Nevertheless, these two regimes have to a large extent been treated separa
Externí odkaz:
http://arxiv.org/abs/2405.18930
Publikováno v:
NIK, 1 (2023)
Gravitational lensing occurs as the path of light from distant celestial bodies is distorted due to gravitational attraction by other celestial bodies, whose mass is partly invisible, being so-called dark matter. When observed through a gravitational
Externí odkaz:
http://arxiv.org/abs/2405.17498
Embedding news articles is a crucial tool for multiple fields, such as media bias detection, identifying fake news, and making news recommendations. However, existing news embedding methods are not optimized to capture the latent context of news even
Externí odkaz:
http://arxiv.org/abs/2405.13071
Autor:
Ben-David, Shalev, Kundu, Srijita
We give an oracle separation between QMA and QCMA for quantum algorithms that have bounded adaptivity in their oracle queries; that is, the number of rounds of oracle calls is small, though each round may involve polynomially many queries in parallel
Externí odkaz:
http://arxiv.org/abs/2402.00298