Zobrazeno 1 - 10
of 108 770
pro vyhledávání: '"A, Grossman"'
We have undertaken a mixed-methods study of fiction writers' experiences and attitudes with generative AI, primarily focused on the experiences of queer and disabled writers. We find that queer and disabled writers are markedly more pessimistic than
Externí odkaz:
http://arxiv.org/abs/2412.04575
In the current paradigm of image captioning, deep learning models are trained to generate text from image embeddings of latent features. We challenge the assumption that these latent features ought to be high-dimensional vectors which require model f
Externí odkaz:
http://arxiv.org/abs/2411.16523
Autor:
Grossman, Robert L., Boyd, Ceilyn, Do, Nhan, Elbers, Danne C., Fitzsimons, Michael S., Giger, Maryellen L., Juehne, Anthony, Larrick, Brienna, Lee, Jerry S. H., Lin, Dawei, Lukowski, Michael, Myers, James D., Schumm, L. Philip, Venkat, Aarti
Over the past few years, a growing number of data platforms have emerged, including data commons, data repositories, and databases containing biomedical, environmental, social determinants of health and other data relevant to improving health outcome
Externí odkaz:
http://arxiv.org/abs/2411.05248
The Standard Model predicts a long-range force mediated by a pair of neutrinos, known as "the neutrino force." We derive an expression for this force that is valid for all $r$. For large $r$, it reduces to the known $G_F^2/r^5$ form, while for small
Externí odkaz:
http://arxiv.org/abs/2410.19059
We consider two-dimensional periodically driven systems of fermions with particle-hole symmetry. Such systems support non-trivial topological phases, including ones that cannot be realized in equilibrium. We show that a space-time defect in the drivi
Externí odkaz:
http://arxiv.org/abs/2410.17314
A tournament is an orientation of a complete graph. A vertex that can reach every other vertex within two steps is called a \emph{king}. We study the complexity of finding $k$ kings in a tournament graph. We show that the randomized query complexity
Externí odkaz:
http://arxiv.org/abs/2410.10475
Novice programmers are increasingly relying on Large Language Models (LLMs) to generate code for learning programming concepts. However, this interaction can lead to superficial engagement, giving learners an illusion of learning and hindering skill
Externí odkaz:
http://arxiv.org/abs/2410.08922
NLP research on aligning lexical representation spaces to one another has so far focused on aligning language spaces in their entirety. However, cognitive science has long focused on a local perspective, investigating whether translation equivalents
Externí odkaz:
http://arxiv.org/abs/2410.07239
Autor:
Pu, Kevin, Feng, K. J. Kevin, Grossman, Tovi, Hope, Tom, Mishra, Bhavana Dalvi, Latzke, Matt, Bragg, Jonathan, Chang, Joseph Chee, Siangliulue, Pao
Research ideation involves broad exploring and deep refining ideas. Both require deep engagement with literature. Existing tools focus primarily on idea broad generation, yet offer little support for iterative specification, refinement, and evaluatio
Externí odkaz:
http://arxiv.org/abs/2410.04025
We apply numerical optimization and linear algebra algorithms for classical computers to the problem of automatically synthesizing algorithms for quantum computers. Using our framework, we apply several common techniques from these classical domains
Externí odkaz:
http://arxiv.org/abs/2408.15225