Search

Your search keyword '"Robinson, P"' showing total 100,691 results
Start Over Author "Robinson, P"
100,691 results on '"Robinson, P"'

1. COVID's Impact on Science Achievement: Trends from 2019 through 2024. Brief

Author

NWEA, Susan M. Kowalski, Scott J. Peters, Megan Kuhfeld, Gustave Robinson, and Karyn Lewis

Abstract

This brief continues ongoing research by NWEA® examining the degree to which the COVID-19 pandemic, and its associated school closures, influenced student learning. Prior research focused on math and reading and found that the pandemic's negative impact steadily accumulated during the 2020-2021 school year, with significant disparities in achievement and growth compared to prepandemic trends (Lewis, Kuhfeld, Ruzek, & McEachin, 2021). Although there were modest rebounds in reading and math during the 2021-2022 school year, progress toward pandemic recovery largely stalled in 2022-2023 and 2023-2024, with achievement and growth trends still trailing behind prepandemic levels (Kuhfeld & Lewis, 2022; Lewis & Kuhfeld, 2023; Lewis & Kuhfeld, 2024). Building on previous research series focused on math and reading achievement, this brief explores how the pandemic influenced student achievement in science. It examines science test scores across seven school years to understand how COVID-19 influenced science achievement.

Published
2024

2. Technical Appendix For: 'COVID's Impact on Science Achievement: Trends from 2019 through 2024.' Technical Brief

Author

NWEA, Susan Kowalski, Megan Kuhfeld, Scott Peters, Gustave Robinson, and Karyn Lewis

Abstract

The purpose of this technical appendix is to share detailed results and more fully describe the sample and methods used to produce the research brief, "COVID's Impact on Science Achievement: Trends from 2019 through 2024. We investigated three main research questions in this brief: 1) How did science achievement in 2021 and 2024 compare to achievement in 2019, before the pandemic? 2) How much additional schooling was required in spring 2021 and spring 2024 to return to spring 2019 levels? 3) How do these patterns differ by race/ethnicity?

Published
2024

3. 1969-70 Pre-kindergarten; Final Report: 1970 Summer Pre-kindergarten.

Author

Columbus Public Schools, OH. and Robinson, Barbara

Abstract

The Pre-Kindergarten Program was established as a part of the Language Development Program (funded under Title I of the 1965 Elementary Secondary Education Act) which is intended to increase the language facility of low income Columbus children. The pre-kindergarten child should leave the program feeling important and unique and should have gained language, social, and motor skills which enable him to be successful in kindergarten and first grade. The curriculum of the program was developed by the classroom teachers and social workers in the program. It included instruction in vocabulary development, social growth, gross-and-fine-motor coordination development, number concept development, music, art, and literature. The involvement of parents in the program was considered essential. Parents were encouraged to visit the classroom for observation and conferences with teachers. The teachers visited in the home to discuss the child's progress with the parents. There were 659 pupils enrolled at some time during the year and 487 remained during the entire year. Each child attended school for four half-day sessions per week. Each session accommodated between 12 and 18 pupils. The primary evaluation instrument was the "Bettye Caldwell Pre-School Inventory." (Author/JM)

Published
2024

4. Determining the Essential Characteristics for Effective College Teaching

Author

Christopher J. Eck, J. Shane Robinson, and Ki L. Cole

Abstract

Higher education institutions continually increase the demands on college instructors. Yet, all too often, many college instructors have had little to no preparation for teaching in higher education. What is needed is a comprehensive and clear list of characteristics expected of effective college teachers, both in-person and online, comprised by those who are focused on studying the subject matter deeply. To assess the characteristics deemed essential for college instructors to possess, a nationwide, modified Delphi technique was employed, eliciting opinions from an established panel of experts. At the conclusion of a three-round Delphi study, 46 of the 55 original items submitted by the panelists reached consensus of agreement. The 46 items were then categorized to establish six overarching themes associated with effective college teaching. The categorized themes and characteristics determined in the study of effective college teachers should be used as a comprehensive and clear list to provide college faculty with expectations of effective teaching. Additional research is needed to convert the items found in this study into an effective college teaching instrument. Such an instrument should be validated for use across academia as a starting point for the development, training, and support of future and current college teachers.

Published
2024

5. Design Principles for Accelerating Student Learning with High-Impact Tutoring. Design Principles Brief #30: Academic Acceleration. Updated

Author

Annenberg Institute for School Reform at Brown University, Results for America, Stanford Center for Assessment, Learning and Equity (SCALE), EdResearch for Action, Carly D. Robinson, Matthew A. Kraft, Susanna Loeb, and Beth Schueler

Abstract

The EdResearch for Action "Design Principles Series" focuses on a single program or practice that has been proven to have positive effects on student outcomes. Authors -- leading experts from across the field of education research -- look across many high-quality studies of similar programs to identify the components and conditions that are key to its effective implementation. The "Design Principles Series" helps practitioners adapt and successfully implement an evidence-based program to meet the needs of their target population. This brief is an update of the previous version published in 2021. It incorporates new research on effective design and implementation components in high-impact tutoring programs. [This brief was prepared in collaboration with the University of Virginia, School of Education and Human Development and National Student Support Accelerator.]

Published
2024

6. Latinx Science Students' Sense of Belonging in Rural Wisconsin

Author

Patrick Robinson, Cynthia Baeza, Luis Gonzalez-Quizhpe, Abigail Robinson, Diego Román, and Katherine Ward

Abstract

This study explores the sense of belonging of rural middle and high school Latinx science students in Wisconsin. Between 2000 and 2015, the Latinx population was the fastest growing ethnic group in Wisconsin and increased by 95%. Yet, little is known about the experiences of these students in rural schools or their engagement in science learning. Our research contributes to addressing this knowledge gap and provides insights into Latinx student experiences relative to the science classroom and community. Our findings indicate that a primary determinant of Latinx science students' positive sense of belonging is a positive relationship with their teachers.

Published
2024

7. The Effects of Virtual Tutoring on Young Readers: Results from a Randomized Controlled Trial. EdWorkingPaper No. 24-955

Author

Annenberg Institute for School Reform at Brown University, Carly D. Robinson, Cynthia Pollard, Sarah Novicoff, Sara White, and Susanna Loeb

Abstract

In-person tutoring has been shown to improve academic achievement. Though less well-researched, virtual tutoring has also shown a positive effect on achievement but has only been studied in grade five or above. We present findings from the first randomized controlled trial of virtual tutoring for young children (grades K-2). Students were assigned to 1:1 tutoring, 2:1 tutoring, or a control group. Assignment to any virtual tutoring increased early literacy skills by 0.05-0.08 SD with the largest effects for 1:1 tutoring (0.07-0.12 SD). Students initially scoring well below benchmark and first graders experienced the largest gains from 1:1 tutoring (0.15 and 0.20 SD, respectively). Effects are smaller than typically seen from in-person early literacy tutoring programs but still positive and statistically significant, suggesting promise particularly in communities with in-person staffing challenges. [On Your Mark and Uplift Education were partners in this research and additional support was provided by the National Student Support Accelerator Team.]

Published
2024

8. Answering the Call: How Changes to the Salience of Job Characteristics Affects College Students' Decisions. EdWorkingPaper No. 24-956

Author

Annenberg Institute for School Reform at Brown University, Carly D. Robinson, Katharine Meyer, Chasity Bailey-Fakhoury, Amirpasha Zandieh, and Susanna Loeb

Abstract

College students make job decisions without complete information. As a result, they may rely on misleading heuristics ("interesting jobs pay badly") and pursue options misaligned with their goals. We test whether highlighting job characteristics changes decision making. We find increasing the salience of a job's monetary benefits increases the likelihood college students apply by 196%. In contrast, emphasizing prosocial, career, or social benefits has no effect, despite students identifying these benefits as primary motivators for applying. The study highlights the detrimental incongruencies in students' decision making alongside a simple strategy for recruiting college students to jobs that offer enriching experiences.

Published
2024

9. How Universities Should Choose Their Next Accreditor. Policy Brief

Author

James G. Martin Center for Academic Renewal, Cardinal Institute for West Virginia Policy, Adam Kissel, and Jenna Robinson

Abstract

Accreditation is one of the three tickets that every college in America must punch if it wants access to federal student aid (FSA) programs for its students. The current regulatory regime for postsecondary institutions forces each college wanting to participate in FSA programs to get authorization from the state in which it operates, meet the standards set by the U.S. Department of Education, and--strange as it may seem--get a green light from a nongovernmental organization called an accreditor. The good news is that while American colleges can't shop for a different federal government, they can shop for a different accreditor. That's a new development. During the Trump administration, Secretary of Education Betsy DeVos instituted new regulations letting any accreditor do business anywhere in the country. Before this change, a small number of accreditors divided up the country into fiefdoms and did not intrude on each other's turf; they were therefore called regional accreditors. The historically regional accreditors are now all national accreditors. So, which accreditor should a college choose? This policy brief can help colleges and universities make a sound decision.

Published
2024

10. MindPlay Reading: Efficacy Study. Examining the Correlation of MindPlay Use and Outcomes on NWEA Map, Fall 2021-Spring 2022, Grades 2-6

Author

Charles River Media Group, LXD Research, Rachel L. Schechter, Anna Robinson, and Manvi Teki

Abstract

This study investigates the impact of the MindPlay Reading program on student literacy achievement in Dayton City Schools, Ohio, during the 2021-2022 academic year. A correlational analysis was conducted in collaboration with LXD Research to examine the relationship between MindPlay usage and student outcomes on literacy assessments. The sample included 3,444 students in grades 2-6, with 66% identifying as Black, 33% as White, and 13% as English Language Learners (ELL). Student progress was measured using MindPlay's internal assessments and NWEA MAP Growth, a standardized reading assessment that generates Rasch unIT (RIT) scores. Results indicated a positive correlation between increased usage of MindPlay Reading and higher Spring RIT scores. Students who engaged with the program for at least 60 hours (approximately 20 minutes per day) demonstrated above-average growth, closing critical skill gaps. MindPlay Reading, a digital literacy intervention with video instruction and interactive practice, offers a comprehensive approach to phoneme awareness, phonics, vocabulary, fluency, and comprehension. This research supports the program's effectiveness in promoting significant literacy gains in diverse student populations.

Published
2024

11. Heggerty Bridge to Reading Efficacy Study Preliminary Findings: Mid-Year First Grade Gains with MAP Growth and MAP Fluency, School Year 23-24

Author

Charles River Media Group, LXD Research, Rachel L. Schechter, Anna Robinson, and Isabella Ilievski

Abstract

This study aimed to assess the effectiveness of the Heggerty Bridge to Reading program for first-grade students compared to a business-as-usual reading program by employing a mixed-methods approach encompassing a matched quasi-experimental design, teacher surveys, and interviews. In light of the learning disruptions caused by the COVID-19 pandemic, the study underscores the necessity of explicit reading instruction, with a focus on phonemic awareness and systematic phonics. Results indicate that the Bridge to Reading program, integrating phonemic awareness lessons with daily explicit phonics instruction, significantly improves student achievement on MAP Growth and MAP Fluency formative assessments, leading to higher RIT scores and growth compared to the control group. Analysis of student subgroups reveals significant progress among lower-achieving students, indicating effective support in bridging foundational reading skill gaps from kindergarten. Moreover, the program surpasses the comparison group in meeting projected growth targets, with a greater proportion of students reaching their mid-year growth target. Feedback from educators in the treatment group underscores positive perceptions, with teachers reporting enhanced understanding of reading methods and alignment with literacy development. The study also examines demographic factors and baseline scores, revealing significant impacts in areas such as phonological awareness, phonics, and word recognition. Additionally, the study outlines future steps, including qualitative data collection and end-of-year quantitative analysis, to further elucidate the program's efficacy. These preliminary findings suggest that the Bridge to Reading program holds promise in bolstering student achievement in foundational reading skills, particularly amidst the challenges posed by the COVID-19 pandemic. [This report was published with Heggerty.]

Published
2024

12. Walking the Talk: Engendering a 'Community of Teachers' in an Educator Preparation Program in the Southern United States

Author

Nicholas D. Hartlep, Jon C. Saderholm, Julian Viera, Maggie Robillard, Keesha Greer-Effs, Lisa Rosenbarker, Shaniqua Robinson, Cinda Holland, Herbie Brock, Collis R. Robinson, Angela J. Cox, Heather Chapman, Joshua Woodward, Noé R. Guevara, Jennifer Whitt, and Julia Allen

Abstract

In this article, the Education Studies Department (ESD) at Berea College shares lessons learned while becoming an inclusive, justice-focused, and democratic Education Preparation Program (EPP) together with its "Community of Teachers" (CoT). ESD values diversity, equity, inclusion, and belonging (DEI+B) and democratic relationships. These values influence how we do our work. We begin by sharing how the theoretical framework of Community of Practice (CoP) frames our case study. After explaining how a CoP applies to ESD's approach to educator preparation, we give an overview of Berea College. We share some of its history and its eight Great Commitments. We detail how ESD is a unique EPP compared with other more traditional EPPs. Next, we chronicle the story of how ESD "walks its talk" and invests in the teacher profession. We detail the participants of the case study, outline our methodology of the case study, and share the data we analyzed for this article. Data were analyzed and three emergent themes were discovered about the praxis of ESD: (a) community-engaged and justice-focused teacher preparation, (b) community building within teacher preparation programs, and (c) diversity, equity, inclusion, and belonging. The article concludes by sharing implications for EPPs and a conclusion.

Published
2024
Full Text
View/download PDF

13. LoRePIE: $\ell_0$ Regularised Extended Ptychographical Iterative Engine for Low-dose and Fast Electron Ptychography

Author

Moshtaghpour, Amirafshar, Velazco-Torrejon, Abner, Robinson, Alex W., Browning, Nigel D., and Kirkland, Angus I.

Subjects
Physics - Applied Physics
Abstract

The extended Ptychographical Iterative Engine (ePIE) is a widely used phase retrieval algorithm for Electron Ptychography from 4-dimensional (4-D) Scanning Transmission Electron Microscopy (4-D STEM) measurements acquired with a focused or defocused electron probe. However, ePIE relies on redundancy in the data and hence requires adjacent illuminated areas to overlap. In this paper, we propose a regularised variant of ePIE that is more robust to low overlap ratios. We examine the performance of the proposed algorithm on an experimental 4-D STEM data of double layered Rotavirus particles acquired in a full scan with 85% overlap. By artificial down-sampling of the probe positions, we have created synthetic 4-D STEM datasets with different overlap ratios and use these to show that a high quality reconstruction of Rotavirus particles can be obtained from data with an overlap as low as 56%., Comment: Submitted to Physical Review Letters

Published
2024

14. Advanced LIGO detector performance in the fourth observing run

Author

Capote, E., Jia, W., Aritomi, N., Nakano, M., Xu, V., Abbott, R., Abouelfettouh, I., Adhikari, R. X., Ananyeva, A., Appert, S., Apple, S. K., Arai, K., Aston, S. M., Ball, M., Ballmer, S. W., Barker, D., Barsotti, L., Berger, B. K., Betzwieser, J., Bhattacharjee, D., Billingsley, G., Biscans, S., Blair, C. D., Bode, N., Bonilla, E., Bossilkov, V., Branch, A., Brooks, A. F., Brown, D. D., Bryant, J., Cahillane, C., Cao, H., Clara, F., Collins, J., Compton, C. M., Cottingham, R., Coyne, D. C., Crouch, R., Csizmazia, J., Cumming, A., Dartez, L. P., Davis, D., Demos, N., Dohmen, E., Driggers, J. C., Dwyer, S. E., Effler, A., Ejlli, A., Etzel, T., Evans, M., Feicht, J., Frey, R., Frischhertz, W., Fritschel, P., Frolov, V. V., Fuentes-Garcia, M., Fulda, P., Fyffe, M., Ganapathy, D., Gateley, B., Gayer, T., Giaime, J. A., Giardina, K. D., Glanzer, J., Goetz, E., Goetz, R., Goodwin-Jones, A. W., Gras, S., Gray, C., Griffith, D., Grote, H., Guidry, T., Gurs, J., Hall, E. D., Hanks, J., Hanson, J., Heintze, M. C., Helmling-Cornell, A. F., Holland, N. A., Hoyland, D., Huang, H. Y., Inoue, Y., James, A. L., Jamies, A., Jennings, A., Jones, D. H., Kabagoz, H. B., Karat, S., Karki, S., Kasprzack, M., Kawabe, K., Kijbunchoo, N., King, P. J., Kissel, J. S., Komori, K., Kontos, A., Kumar, Rahul, Kuns, K., Landry, M., Lantz, B., Laxen, M., Lee, K., Lesovsky, M., Villarreal, F. Llamas, Lormand, M., Loughlin, H. A., Macas, R., MacInnis, M., Makarem, C. N., Mannix, B., Mansell, G. L., Martin, R. M., Mason, K., Matichard, F., Mavalvala, N., Maxwell, N., McCarrol, G., McCarthy, R., McClelland, D. E., McCormick, S., McRae, T., Mera, F., Merilh, E. L., Meylahn, F., Mittleman, R., Moraru, D., Moreno, G., Mullavey, A., Nelson, T. J. N., Neunzert, A., Notte, J., Oberling, J., OHanlon, T., Osthelder, C., Ottaway, D. J., Overmier, H., Parker, W., Patane, O., Pele, A., Pham, H., Pirello, M., Pullin, J., Quetschke, V., Ramirez, K. E., Ransom, K., Reyes, J., Richardson, J. W., Robinson, M., Rollins, J. G., Romel, C. L., Romie, J. H., Ross, M. P., Ryan, K., Sadecki, T., Sanchez, A., Sanchez, E. J., Sanchez, L. E., Savage, R. L., Schaetzl, D., Schiworski, M. G., Schnabel, R., Schofield, R. M. S., Schwartz, E., Sellers, D., Shaffer, T., Short, R. W., Sigg, D., Slagmolen, B. J. J., Soike, C., Soni, S., Srivastava, V., Sun, L., Tanner, D. B., Thomas, M., Thomas, P., Thorne, K. A., Todd, M. R., Torrie, C. I., Traylor, G., Ubhi, A. S., Vajente, G., Vanosky, J., Vecchio, A., Veitch, P. J., Vibhute, A. M., von Reis, E. R. G., Warner, J., Weaver, B., Weiss, R., Whittle, C., Willke, B., Wipf, C. C., Wright, J. L., Yamamoto, H., Zhang, L., and Zucker, M. E.

Subjects
General Relativity and Quantum Cosmology, Astrophysics - Instrumentation and Methods for Astrophysics, Physics - Instrumentation and Detectors, Physics - Optics, Quantum Physics
Abstract

On May 24th, 2023, the Advanced Laser Interferometer Gravitational-Wave Observatory (LIGO), joined by the Advanced Virgo and KAGRA detectors, began the fourth observing run for a two-year-long dedicated search for gravitational waves. The LIGO Hanford and Livingston detectors have achieved an unprecedented sensitivity to gravitational waves, with an angle-averaged median range to binary neutron star mergers of 152 Mpc and 160 Mpc, and duty cycles of 65.0% and 71.2%, respectively, with a coincident duty cycle of 52.6%. The maximum range achieved by the LIGO Hanford detector is 165 Mpc and the LIGO Livingston detector 177 Mpc, both achieved during the second part of the fourth observing run. For the fourth run, the quantum-limited sensitivity of the detectors was increased significantly due to the higher intracavity power from laser system upgrades and replacement of core optics, and from the addition of a 300 m filter cavity to provide the squeezed light with a frequency-dependent squeezing angle, part of the A+ upgrade program. Altogether, the A+ upgrades led to reduced detector-wide losses for the squeezed vacuum states of light which, alongside the filter cavity, enabled broadband quantum noise reduction of up to 5.2 dB at the Hanford observatory and 6.1 dB at the Livingston observatory. Improvements to sensors and actuators as well as significant controls commissioning increased low frequency sensitivity. This paper details these instrumental upgrades, analyzes the noise sources that limit detector sensitivity, and describes the commissioning challenges of the fourth observing run., Comment: 26 pages, 18 figures

Published
2024

15. A Comprehensive Hadronic Code Comparison for Active Galactic Nuclei

Author

Cerruti, Matteo, Rudolph, Annika, Petropoulou, Maria, Böttcher, Markus, Stathopoulos, Stamatios I., Oikonomou, Foteini, Dimitrakoudis, Stavros, Dmytriiev, Anton, Gao, Shan, Inoue, Susumu, Mastichiadis, Apostolos, Murase, Kohta, Reimer, Anita, Robinson, Joshua, Rodrigues, Xavier, Winter, Walter, and Zech, Andreas

Subjects
Astrophysics - High Energy Astrophysical Phenomena
Abstract

We perform the first dedicated comparison of five hadronic codes (AM$^3$, ATHE$\nu$A, B13, LeHa-Paris, and LeHaMoC) that have been extensively used in modeling of the spectral energy distribution (SED) of jetted active galactic nuclei. The purpose of this comparison is to identify the sources of systematic errors (e.g., implementation method of proton-photon interactions) and to quantify the expected dispersion in numerical SED models computed with the five codes. The outputs from the codes are first tested in synchrotron self-Compton scenarios that are the simplest blazar emission models used in the literature. We then compare the injection rates and spectra of secondary particles produced in pure hadronic cases with monoenergetic and power-law protons interacting on black-body and power-law photon fields. We finally compare the photon SEDs and the neutrino spectra for realistic proton-synchrotron and leptohadronic blazar models. We find that the codes are in excellent agreement with respect to the spectral shape of the photons and neutrinos. There is a remaining spread in the overall normalization that we quantify, at its maximum, at the level of $\pm 40\%$. This value should be used as an additional, conservative, systematic uncertainty term when comparing numerical simulations and observations., Comment: 32 pages; prepared for submission to AAS journals

Published
2024

16. Omnidirectional Wireless Power Transfer for Millimetric Magnetoelectric Biomedical Implants

Author

Wang, Wei, Yu, Zhanghao, Zou, Yiwei, Woods, Joshua E, Chari, Prahalad, Su, Yumin, Robinson, Jacob T, and Yang, Kaiyuan

Subjects
Electrical Engineering and Systems Science - Systems and Control, Physics - Medical Physics
Abstract

Miniature bioelectronic implants promise revolutionary therapies for cardiovascular and neurological disorders. Wireless power transfer (WPT) is a significant method for miniaturization, eliminating the need for bulky batteries in devices. Despite successful demonstrations of millimetric battery free implants in animal models, the robustness and efficiency of WPT are known to degrade significantly under misalignment incurred by body movements, respiration, heart beating, and limited control of implant orientation during surgery. This article presents an omnidirectional WPT platform for millimetric bioelectronic implants, employing the emerging magnetoelectric (ME) WPT modality, and magnetic field steering technique based on multiple transmitter (TX) coils. To accurately sense the weak coupling in a miniature implant and adaptively control the multicoil TX array in a closed loop, we develop an active echo (AE) scheme using a tiny coil on the implant. Our prototype comprises a fully integrated 14.2 mm3 implantable stimulator embedding a custom low power system on chip (SoC) powered by an ME film, a TX with a custom three channel AE RX chip, and a multicoil TX array with mutual inductance cancellation. The AE RX achieves negative 161 dBm per Hz input referred noise with 64 dB gain tuning range to reliably sense the AE signal, and offers fast polarity detection for driver control. AE simultaneously enhances the robustness, efficiency, and charging range of ME WPT. Under 90 degree rotation from the ideal position, our omnidirectional WPT system achieves 6.8x higher power transfer efficiency (PTE) than a single coil baseline. The tracking error of AE negligibly degrades the PTE by less than 2 percent from using ideal control., Comment: 13 pages, 27 figures

Published
2024
Full Text
View/download PDF

17. Sensor-fusion based Prognostics Framework for Complex Engineering Systems Exhibiting Multiple Failure Modes

Author

Peters, Benjamin, Mohanty, Ayush, Fang, Xiaolei, Robinson, Stephen K., and Gebraeel, Nagi

Subjects
Statistics - Machine Learning, Computer Science - Machine Learning, Electrical Engineering and Systems Science - Systems and Control, Statistics - Applications
Abstract

Complex engineering systems are often subject to multiple failure modes. Developing a remaining useful life (RUL) prediction model that does not consider the failure mode causing degradation is likely to result in inaccurate predictions. However, distinguishing between causes of failure without manually inspecting the system is nontrivial. This challenge is increased when the causes of historically observed failures are unknown. Sensors, which are useful for monitoring the state-of-health of systems, can also be used for distinguishing between multiple failure modes as the presence of multiple failure modes results in discriminatory behavior of the sensor signals. When systems are equipped with multiple sensors, some sensors may exhibit behavior correlated with degradation, while other sensors do not. Furthermore, which sensors exhibit this behavior may differ for each failure mode. In this paper, we present a simultaneous clustering and sensor selection approach for unlabeled training datasets of systems exhibiting multiple failure modes. The cluster assignments and the selected sensors are then utilized in real-time to first diagnose the active failure mode and then to predict the system RUL. We validate the complete pipeline of the methodology using a simulated dataset of systems exhibiting two failure modes and on a turbofan degradation dataset from NASA.

Published
2024

18. NatureLM-audio: an Audio-Language Foundation Model for Bioacoustics

Author

Robinson, David, Miron, Marius, Hagiwara, Masato, and Pietquin, Olivier

Subjects
Computer Science - Sound, Computer Science - Artificial Intelligence, Computer Science - Machine Learning, Electrical Engineering and Systems Science - Audio and Speech Processing
Abstract

Large language models (LLMs) prompted with text and audio represent the state of the art in various auditory tasks, including speech, music, and general audio, showing emergent abilities on unseen tasks. However, these capabilities have yet to be fully demonstrated in bioacoustics tasks, such as detecting animal vocalizations in large recordings, classifying rare and endangered species, and labeling context and behavior - tasks that are crucial for conservation, biodiversity monitoring, and the study of animal behavior. In this work, we present NatureLM-audio, the first audio-language foundation model specifically designed for bioacoustics. Our carefully curated training dataset comprises text-audio pairs spanning a diverse range of bioacoustics, speech, and music data, designed to address the challenges posed by limited annotated datasets in the field. We demonstrate successful transfer of learned representations from music and speech to bioacoustics, and our model shows promising generalization to unseen taxa and tasks. Importantly, we test NatureLM-audio on a novel benchmark (BEANS-Zero) and it sets the new state of the art (SotA) on several bioacoustics tasks, including zero-shot classification of unseen species. To advance bioacoustics research, we also open-source the code for generating training and benchmark data, as well as for training the model., Comment: Demo page: https://earthspecies.github.io/naturelm-audio-demo/ The code will be open-sourced and available shortly

Published
2024

19. The Singular Optimality of Distributed Computation in LOCAL

Author

Dufoulon, Fabien, Pandurangan, Gopal, Robinson, Peter, and Scquizzato, Michele

Subjects
Computer Science - Distributed, Parallel, and Cluster Computing
Abstract

It has been shown that one can design distributed algorithms that are (nearly) singularly optimal, meaning they simultaneously achieve optimal time and message complexity (within polylogarithmic factors), for several fundamental global problems such as broadcast, leader election, and spanning tree construction, under the $\text{KT}_0$ assumption. With this assumption, nodes have initial knowledge only of themselves, not their neighbors. In this case the time and message lower bounds are $\Omega(D)$ and $\Omega(m)$, respectively, where $D$ is the diameter of the network and $m$ is the number of edges, and there exist (even) deterministic algorithms that simultaneously match these bounds. On the other hand, under the $\text{KT}_1$ assumption, whereby each node has initial knowledge of itself and the identifiers of its neighbors, the situation is not clear. For the $\text{KT}_1$ CONGEST model (where messages are of small size), King, Kutten, and Thorup (KKT) showed that one can solve several fundamental global problems (with the notable exception of BFS tree construction) such as broadcast, leader election, and spanning tree construction with $\tilde{O}(n)$ message complexity ($n$ is the network size), which can be significantly smaller than $m$. Randomization is crucial in obtaining this result. While the message complexity of the KKT result is near-optimal, its time complexity is $\tilde{O}(n)$ rounds, which is far from the standard lower bound of $\Omega(D)$. In this paper, we show that in the $\text{KT}_1$ LOCAL model (where message sizes are not restricted), singular optimality is achievable. Our main result is that all global problems, including BFS tree construction, can be solved in $\tilde{O}(D)$ rounds and $\tilde{O}(n)$ messages, where both bounds are optimal up to polylogarithmic factors. Moreover, we show that this can be achieved deterministically., Comment: Reduced abstract to fit arxiv requirements

Published
2024

20. Examining the rotation of the planet-hosting M dwarf GJ 3942

Author

Fonseca, Andrew and Dodson-Robinson, Sarah

Subjects
Astrophysics - Solar and Stellar Astrophysics, Astrophysics - Earth and Planetary Astrophysics
Abstract

Based on radial velocities, EXORAP photometry, and activity indicators, the HADES team reported a 16.3-day rotation period for the M dwarf GJ 3942. However, an RV--H$\alpha$ magnitude-squared coherence estimate has significant peaks at frequencies 1/16 cycles/day and 1/32 cycles/day. We re-analyze HADES data plus Hipparcos, SuperWASP, and TESS photometry to see whether the rotation period could be 32 days with 16-day harmonic. SuperWASP shows no significant periodicities, while the Hipparcos observing cadence is suboptimal for detecting 16- and 32-day periodicities. Although the average TESS periodogram has peaks at harmonics of 1/16 cycles/day, the harmonic sequence is not fully resolved according to the Rayleigh criterion. The TESS observations suggest a 1/16 cycles/day rotation frequency and a 1/32 cycles/day subharmonic, though resolution makes the TESS rotation detection ambiguous., Comment: 5 pages, 1 figure, submitted to RNAAS

Published
2024

21. Select2Plan: Training-Free ICL-Based Planning through VQA and Memory Retrieval

Author

Buoso, Davide, Robinson, Luke, Averta, Giuseppe, Torr, Philip, Franzmeyer, Tim, and De Martini, Daniele

Subjects
Computer Science - Robotics, Computer Science - Artificial Intelligence
Abstract

This study explores the potential of off-the-shelf Vision-Language Models (VLMs) for high-level robot planning in the context of autonomous navigation. Indeed, while most of existing learning-based approaches for path planning require extensive task-specific training/fine-tuning, we demonstrate how such training can be avoided for most practical cases. To do this, we introduce Select2Plan (S2P), a novel training-free framework for high-level robot planning which completely eliminates the need for fine-tuning or specialised training. By leveraging structured Visual Question-Answering (VQA) and In-Context Learning (ICL), our approach drastically reduces the need for data collection, requiring a fraction of the task-specific data typically used by trained models, or even relying only on online data. Our method facilitates the effective use of a generally trained VLM in a flexible and cost-efficient way, and does not require additional sensing except for a simple monocular camera. We demonstrate its adaptability across various scene types, context sources, and sensing setups. We evaluate our approach in two distinct scenarios: traditional First-Person View (FPV) and infrastructure-driven Third-Person View (TPV) navigation, demonstrating the flexibility and simplicity of our method. Our technique significantly enhances the navigational capabilities of a baseline VLM of approximately 50% in TPV scenario, and is comparable to trained models in the FPV one, with as few as 20 demonstrations.

Published
2024

22. TwiNet: Connecting Real World Networks to their Digital Twins Through a Live Bidirectional Link

Author

Robinson, Clifton Paul, Lacava, Andrea, Johari, Pedram, Cuomo, Francesca, and Melodia, Tommaso

Subjects
Computer Science - Networking and Internet Architecture
Abstract

The wireless spectrum's increasing complexity poses challenges and opportunities, highlighting the necessity for real-time solutions and robust data processing capabilities. Digital Twin (DT), virtual replicas of physical systems, integrate real-time data to mirror their real-world counterparts, enabling precise monitoring and optimization. Incorporating DTs into wireless communication enhances predictive maintenance, resource allocation, and troubleshooting, thus bolstering network reliability. Our paper introduces TwiNet, enabling bidirectional, near-realtime links between real-world wireless spectrum scenarios and DT replicas. Utilizing the protocol, MQTT, we can achieve data transfer times with an average latency of 14 ms, suitable for real-time communication. This is confirmed by monitoring real-world traffic and mirroring it in real-time within the DT's wireless environment. We evaluate TwiNet's performance in two use cases: (i) assessing risky traffic configurations of UEs in a Safe Adaptive Data Rate (SADR) system, improving network performance by approximately 15% compared to original network selections; and (ii) deploying new CNNs in response to jammed pilots, achieving up to 97% accuracy training on artificial data and deploying a new model in as low as 2 minutes to counter persistent adversaries. TwiNet enables swift deployment and adaptation of DTs, addressing crucial challenges in modern wireless communication systems., Comment: 6 pages, 7 figures, conference paper

Published
2024

23. gSeaGen code by KM3NeT: an efficient tool to propagate muons simulated with CORSIKA

Author

Aiello, S., Albert, A., Alhebsi, A. R., Alshamsi, M., Garre, S. Alves, Ambrosone, A., Ameli, F., Andre, M., Aphecetche, L., Ardid, M., Ardid, S., Atmani, H., Aublin, J., Badaracco, F., Bailly-Salins, L., Bardačová, Z., Baret, B., Bariego-Quintana, A., Becherini, Y., Bendahman, M., Benfenati, F., Benhassi, M., Bennani, M., Benoit, D. M., Berbee, E., Bertin, V., Biagi, S., Boettcher, M., Bonanno, D., Bouasla, A. B., Boumaaza, J., Bouta, M., Bouwhuis, M., Bozza, C., Bozza, R. M., Brânzaş, H., Bretaudeau, F., Breuhaus, M., Bruijn, R., Brunner, J., Bruno, R., Buis, E., Buompane, R., Busto, J., Caiffi, B., Calvo, D., Capone, A., Carenini, F., Carretero, V., Cartraud, T., Castaldi, P., Cecchini, V., Celli, S., Cerisy, L., Chabab, M., Chen, A., Cherubini, S., Chiarusi, T., Circella, M., Cocimano, R., Coelho, J. A. B., Coleiro, A., Condorelli, A., Coniglione, R., Coyle, P., Creusot, A., Cuttone, G., Dallier, R., De Benedittis, A., De Martino, B., De Wasseige, G., Decoene, V., Del Rosso, I., Di Mauro, L. S., Di Palma, I., Díaz, A. F., Diego-Tortosa, D., Distefano, C., Domi, A., Donzaud, C., Dornic, D., Drakopoulou, E., Drouhin, D., Ducoin, J. -G., Dvornický, R., Eberl, T., Eckerová, E., Eddymaoui, A., van Eeden, T., Eff, M., van Eijk, D., Bojaddaini, I. El, Hedri, S. El, Ellajosyula, V., Enzenhöfer, A., Ferrara, G., Filipović, M. D., Filippini, F., Franciotti, D., Fusco, L. A., Gagliardini, S., Gal, T., Méndez, J. García, Soto, A. Garcia, Oliver, C. Gatius, Geißelbrecht, N., Genton, E., Ghaddari, H., Gialanella, L., Gibson, B. K., Giorgio, E., Goos, I., Goswami, P., Gozzini, S. R., Gracia, R., Guidi, C., Guillon, B., Gutiérrez, M., Haack, C., van Haren, H., Heijboer, A., Hennig, L., Hernández-Rey, J. J., Ibnsalih, W. Idrissi, Illuminati, G., Joly, D., de Jong, M., de Jong, P., Jung, B. J., Kalaczyński, P., Kistauri, G., Kopper, C., Kouchner, A., Kovalev, Y. Y., Kueviakoe, V., Kulikovskiy, V., Kvatadze, R., Labalme, M., Lahmann, R., Lamoureux, M., Larosa, G., Lastoria, C., Lazo, A., Stum, S. Le, Lehaut, G., Lemaître, V., Leonora, E., Lessing, N., Clark, M. Lindsey, Longhitano, F., Magnani, F., Majumdar, J., Malerba, L., Mamedov, F., Mańczak, J., Manfreda, A., Marconi, M., Margiotta, A., Marinelli, A., Markou, C., Martin, L., Mastrodicasa, M., Mastroianni, S., Mauro, J., Miele, G., Migliozzi, P., Migneco, E., Mitsou, M. L., Mollo, C. M., Morales-Gallegos, L., Moussa, A., Mateo, I. Mozun, Muller, R., Musone, M. R., Musumeci, M., Navas, S., Nayerhoda, A., Nicolau, C. A., Nkosi, B., Fearraigh, B. Ó, Oliviero, V., Orlando, A., Oukacha, E., Paesani, D., González, J. Palacios, Papalashvili, G., Parisi, V., Gomez, E. J. Pastor, Pastore, C., Păun, A. M., Păvălaş, G. E., Martínez, S. Peña, Perrin-Terrin, M., Pestel, V., Pestes, R., Piattelli, P., Plavin, A., Poirè, C., Popa, V., Pradier, T., Prado, J., Pulvirenti, S., Quiroz-Rangel, C. A., Randazzo, N., Razzaque, S., Rea, I. C., Real, D., Riccobene, G., Robinson, J., Romanov, A., Ros, E., Šaina, A., Greus, F. Salesa, Samtleben, D. F. E., Losa, A. Sánchez, Sanfilippo, S., Sanguineti, M., Santonocito, D., Sapienza, P., Schnabel, J., Schumann, J., Schutte, H. M., Seneca, J., Sgura, I., Shanidze, R., Sharma, A., Shitov, Y., Šimkovic, F., Simonelli, A., Sinopoulou, A., Spisso, B., Spurio, M., Stavropoulos, D., Štekl, I., Stellacci, S. M., Taiuti, M., Tayalati, Y., Thiersen, H., Thoudam, S., Melo, I. Tosta e, Trocmé, B., Tsourapis, V., Tudorache, A., Tzamariudaki, E., Ukleja, A., Vacheret, A., Valsecchi, V., Van Elewyck, V., Vannoye, G., Vasileiadis, G., de Sola, F. Vazquez, Veutro, A., Viola, S., Vivolo, D., van Vliet, A., de Wolf, E., Lhenry-Yvon, I., Zavatarelli, S., Zegarelli, A., Zito, D., Zornoza, J. D., Zúñiga, J., and Zywucka, N.

Subjects
High Energy Physics - Experiment, Astrophysics - Instrumentation and Methods for Astrophysics, Physics - Computational Physics
Abstract

The KM3NeT Collaboration has tackled a common challenge faced by the astroparticle physics community, namely adapting the experiment-specific simulation software to work with the CORSIKA air shower simulation output. The proposed solution is an extension of the open-source code gSeaGen, allowing for the transport of muons generated by CORSIKA to a detector of any size at an arbitrary depth. The gSeaGen code was not only extended in terms of functionalities but also underwent a thorough redesign of the muon propagation routine, resulting in a more accurate and efficient simulation. This paper presents the capabilities of the new gSeaGen code as well as prospects for further developments., Comment: 27 pages, 13 figures, submitted to Computer Physics Communications

Published
2024

24. Can Large-Language Models Help us Better Understand and Teach the Development of Energy-Efficient Software?

Author

Hasler, Ryan, Läufer, Konstantin, Thiruvathukal, George K., Peng, Huiyun, Robinson, Kyle, Davis, Kirsten, Lu, Yung-Hsiang, and Davis, James C.

Subjects
Computer Science - Computers and Society, Computer Science - Software Engineering, D.2.3
Abstract

Computing systems are consuming an increasing and unsustainable fraction of society's energy footprint, notably in data centers. Meanwhile, energy-efficient software engineering techniques are often absent from undergraduate curricula. We propose to develop a learning module for energy-efficient software, suitable for incorporation into an undergraduate software engineering class. There is one major problem with such an endeavor: undergraduate curricula have limited space for mastering energy-related systems programming aspects. To address this problem, we propose to leverage the domain expertise afforded by large language models (LLMs). In our preliminary studies, we observe that LLMs can generate energy-efficient variations of basic linear algebra codes tailored to both ARM64 and AMD64 architectures, as well as unit tests and energy measurement harnesses. On toy examples suitable for classroom use, this approach reduces energy expenditure by 30-90%. These initial experiences give rise to our vision of LLM-based meta-compilers as a tool for students to transform high-level algorithms into efficient, hardware-specific implementations. Complementing this tooling, we will incorporate systems thinking concepts into the learning module so that students can reason both locally and globally about the effects of energy optimizations.

Published
2024

25. CurateGPT: A flexible language-model assisted biocuration tool

Author

Caufield, Harry, Kroll, Carlo, O'Neil, Shawn T, Reese, Justin T, Joachimiak, Marcin P, Hegde, Harshad, Harris, Nomi L, Krishnamurthy, Madan, McLaughlin, James A, Smedley, Damian, Haendel, Melissa A, Robinson, Peter N, and Mungall, Christopher J

Subjects
Computer Science - Computation and Language, Computer Science - Artificial Intelligence, Computer Science - Databases, Quantitative Biology - Quantitative Methods
Abstract

Effective data-driven biomedical discovery requires data curation: a time-consuming process of finding, organizing, distilling, integrating, interpreting, annotating, and validating diverse information into a structured form suitable for databases and knowledge bases. Accurate and efficient curation of these digital assets is critical to ensuring that they are FAIR, trustworthy, and sustainable. Unfortunately, expert curators face significant time and resource constraints. The rapid pace of new information being published daily is exceeding their capacity for curation. Generative AI, exemplified by instruction-tuned large language models (LLMs), has opened up new possibilities for assisting human-driven curation. The design philosophy of agents combines the emerging abilities of generative AI with more precise methods. A curator's tasks can be aided by agents for performing reasoning, searching ontologies, and integrating knowledge across external sources, all efforts otherwise requiring extensive manual effort. Our LLM-driven annotation tool, CurateGPT, melds the power of generative AI together with trusted knowledge bases and literature sources. CurateGPT streamlines the curation process, enhancing collaboration and efficiency in common workflows. Compared to direct interaction with an LLM, CurateGPT's agents enable access to information beyond that in the LLM's training data and they provide direct links to the data supporting each claim. This helps curators, researchers, and engineers scale up curation efforts to keep pace with the ever-increasing volume of scientific data.

Published
2024

26. Neutrino detection rates from lepto-hadronic model simulations of bright blazar flares

Author

Robinson, Joshua and Boettcher, Markus

Subjects
Astrophysics - High Energy Astrophysical Phenomena
Abstract

There is mounting evidence that blazars are the sources of part of the very-high-energy astrophysical neutrino flux detected by IceCube. In particular, there have been several spatial and temporal coincidences of individual IceCube neutrino events with flaring blazars, the most prominent of them being IceCube-170922A, coincident with a multi-wavelength flare of TXS~0506+056. Motivated by this, we used the time-dependent lepto-hadronic code OneHaLe to model the spectral energy distributions and light curves of a sample of bright $\gamma$-ray flares of blazars detected by Fermi-LAT, for which Kreter et al. (2020) provided calorimetric estimates of the expected neutrino detection rates. Flares were modelled with temporal changes of the proton injection spectra. Our analysis shows that the calorimetric approach overestimates the increase in neutrino production by a factor of typically $\sim 10$ if the $\gamma$-ray emission is dominated by proton-synchrotron radiation., Comment: 11 pages; Accepted for publication in ApJ

Published
2024

27. RingSim- An Agent-based Approach for Modelling Mesoscopic Magnetic Nanowire Networks

Author

Vidamour, Ian T, Venkat, Guru, Swindells, Charles, Griffin, David, Fry, Paul W, Rowan-Robinson, Richard M, Welbourne, Alexander, Maccherozzi, Francesco, Dhesi, Sarnjeet S, Stepney, Susan, Allwood, Dan A, and Hayward, Thomas J

Subjects
Condensed Matter - Mesoscale and Nanoscale Physics
Abstract

We describe 'RingSim', a phenomenological agent-based model that allows numerical simulation of magnetic nanowire networks with areas of hundreds of micrometers squared for durations of hundreds of seconds; a practical impossibility for general-purpose micromagnetic simulation tools. In RingSim, domain walls (DWs) are instanced as mobile agents which respond to external magnetic fields, and their stochastic interactions with pinning sites and other DWs are described via simple phenomenological rules. We first present a detailed description of the model and its algorithmic implementation for simulating the behaviours of arrays of interconnected ring-shaped nanowires, which have previously been proposed as hardware platforms for unconventional computing applications. The model is then validated against a series of experimental measurements of an array's static and dynamic responses to rotating magnetic fields. The robust agreement between the modelled and experimental data demonstrates that agent-based modelling is a powerful tool for exploring mesoscale magnetic devices, enabling time scales and device sizes that are inaccessible to more conventional magnetic simulation techniques.

Published
2024

28. Ultrabroadband THz Conductivity of Gated Graphene In- and Out-of-equilibrium

Author

Coslovich, G., Smith, R. P., Shi, S. -F., Buss, J. H., Robinson, J. T., Wang, F., and Kaindl, R. A.

Subjects
Condensed Matter - Mesoscale and Nanoscale Physics, Condensed Matter - Materials Science
Abstract

We employ ultrabroadband terahertz (THz) spectroscopy to expose the high-frequency transport properties of Dirac fermions in monolayer graphene. By controlling the carrier concentration via tunable electrical gating, both equilibrium and transient optical conductivities are obtained for a range of Fermi levels. The frequency-dependent equilibrium response is determined through a combination of time-domain THz and Fourier-transform infrared spectroscopy for energies up to the near-infrared, which also provides a measure of the gate-voltage dependent Fermi level. Transient changes in the real and imaginary parts of the graphene conductivity are electro-optically resolved for frequencies up to 15 THz after near-infrared femtosecond excitation, both at the charge-neutral point and for higher electrostatic-doping levels. Modeling of the THz response provides insight into changes of the carrier spectral weights and scattering rates, and reveals an additional broad-frequency ($\approx$ 8 THz) component to the photo-induced response, which we attribute to the zero-momentum mode of quantum-critical transport observed here in large-area CVD graphene.

Published
2024

29. GPT-4o System Card

Author

OpenAI, Hurst, Aaron, Lerer, Adam, Goucher, Adam P., Perelman, Adam, Ramesh, Aditya, Clark, Aidan, Ostrow, AJ, Welihinda, Akila, Hayes, Alan, Radford, Alec, Mądry, Aleksander, Baker-Whitcomb, Alex, Beutel, Alex, Borzunov, Alex, Carney, Alex, Chow, Alex, Kirillov, Alex, Nichol, Alex, Paino, Alex, Renzin, Alex, Passos, Alex Tachard, Kirillov, Alexander, Christakis, Alexi, Conneau, Alexis, Kamali, Ali, Jabri, Allan, Moyer, Allison, Tam, Allison, Crookes, Amadou, Tootoochian, Amin, Tootoonchian, Amin, Kumar, Ananya, Vallone, Andrea, Karpathy, Andrej, Braunstein, Andrew, Cann, Andrew, Codispoti, Andrew, Galu, Andrew, Kondrich, Andrew, Tulloch, Andrew, Mishchenko, Andrey, Baek, Angela, Jiang, Angela, Pelisse, Antoine, Woodford, Antonia, Gosalia, Anuj, Dhar, Arka, Pantuliano, Ashley, Nayak, Avi, Oliver, Avital, Zoph, Barret, Ghorbani, Behrooz, Leimberger, Ben, Rossen, Ben, Sokolowsky, Ben, Wang, Ben, Zweig, Benjamin, Hoover, Beth, Samic, Blake, McGrew, Bob, Spero, Bobby, Giertler, Bogo, Cheng, Bowen, Lightcap, Brad, Walkin, Brandon, Quinn, Brendan, Guarraci, Brian, Hsu, Brian, Kellogg, Bright, Eastman, Brydon, Lugaresi, Camillo, Wainwright, Carroll, Bassin, Cary, Hudson, Cary, Chu, Casey, Nelson, Chad, Li, Chak, Shern, Chan Jun, Conger, Channing, Barette, Charlotte, Voss, Chelsea, Ding, Chen, Lu, Cheng, Zhang, Chong, Beaumont, Chris, Hallacy, Chris, Koch, Chris, Gibson, Christian, Kim, Christina, Choi, Christine, McLeavey, Christine, Hesse, Christopher, Fischer, Claudia, Winter, Clemens, Czarnecki, Coley, Jarvis, Colin, Wei, Colin, Koumouzelis, Constantin, Sherburn, Dane, Kappler, Daniel, Levin, Daniel, Levy, Daniel, Carr, David, Farhi, David, Mely, David, Robinson, David, Sasaki, David, Jin, Denny, Valladares, Dev, Tsipras, Dimitris, Li, Doug, Nguyen, Duc Phong, Findlay, Duncan, Oiwoh, Edede, Wong, Edmund, Asdar, Ehsan, Proehl, Elizabeth, Yang, Elizabeth, Antonow, Eric, Kramer, Eric, Peterson, Eric, Sigler, Eric, Wallace, Eric, Brevdo, Eugene, Mays, Evan, Khorasani, Farzad, Such, Felipe Petroski, Raso, Filippo, Zhang, Francis, von Lohmann, Fred, Sulit, Freddie, Goh, Gabriel, Oden, Gene, Salmon, Geoff, Starace, Giulio, Brockman, Greg, Salman, Hadi, Bao, Haiming, Hu, Haitang, Wong, Hannah, Wang, Haoyu, Schmidt, Heather, Whitney, Heather, Jun, Heewoo, Kirchner, Hendrik, Pinto, Henrique Ponde de Oliveira, Ren, Hongyu, Chang, Huiwen, Chung, Hyung Won, Kivlichan, Ian, O'Connell, Ian, Osband, Ian, Silber, Ian, Sohl, Ian, Okuyucu, Ibrahim, Lan, Ikai, Kostrikov, Ilya, Sutskever, Ilya, Kanitscheider, Ingmar, Gulrajani, Ishaan, Coxon, Jacob, Menick, Jacob, Pachocki, Jakub, Aung, James, Betker, James, Crooks, James, Lennon, James, Kiros, Jamie, Leike, Jan, Park, Jane, Kwon, Jason, Phang, Jason, Teplitz, Jason, Wei, Jason, Wolfe, Jason, Chen, Jay, Harris, Jeff, Varavva, Jenia, Lee, Jessica Gan, Shieh, Jessica, Lin, Ji, Yu, Jiahui, Weng, Jiayi, Tang, Jie, Yu, Jieqi, Jang, Joanne, Candela, Joaquin Quinonero, Beutler, Joe, Landers, Joe, Parish, Joel, Heidecke, Johannes, Schulman, John, Lachman, Jonathan, McKay, Jonathan, Uesato, Jonathan, Ward, Jonathan, Kim, Jong Wook, Huizinga, Joost, Sitkin, Jordan, Kraaijeveld, Jos, Gross, Josh, Kaplan, Josh, Snyder, Josh, Achiam, Joshua, Jiao, Joy, Lee, Joyce, Zhuang, Juntang, Harriman, Justyn, Fricke, Kai, Hayashi, Kai, Singhal, Karan, Shi, Katy, Karthik, Kavin, Wood, Kayla, Rimbach, Kendra, Hsu, Kenny, Nguyen, Kenny, Gu-Lemberg, Keren, Button, Kevin, Liu, Kevin, Howe, Kiel, Muthukumar, Krithika, Luther, Kyle, Ahmad, Lama, Kai, Larry, Itow, Lauren, Workman, Lauren, Pathak, Leher, Chen, Leo, Jing, Li, Guy, Lia, Fedus, Liam, Zhou, Liang, Mamitsuka, Lien, Weng, Lilian, McCallum, Lindsay, Held, Lindsey, Ouyang, Long, Feuvrier, Louis, Zhang, Lu, Kondraciuk, Lukas, Kaiser, Lukasz, Hewitt, Luke, Metz, Luke, Doshi, Lyric, Aflak, Mada, Simens, Maddie, Boyd, Madelaine, Thompson, Madeleine, Dukhan, Marat, Chen, Mark, Gray, Mark, Hudnall, Mark, Zhang, Marvin, Aljubeh, Marwan, Litwin, Mateusz, Zeng, Matthew, Johnson, Max, Shetty, Maya, Gupta, Mayank, Shah, Meghan, Yatbaz, Mehmet, Yang, Meng Jia, Zhong, Mengchao, Glaese, Mia, Chen, Mianna, Janner, Michael, Lampe, Michael, Petrov, Michael, Wu, Michael, Wang, Michele, Fradin, Michelle, Pokrass, Michelle, Castro, Miguel, de Castro, Miguel Oom Temudo, Pavlov, Mikhail, Brundage, Miles, Wang, Miles, Khan, Minal, Murati, Mira, Bavarian, Mo, Lin, Molly, Yesildal, Murat, Soto, Nacho, Gimelshein, Natalia, Cone, Natalie, Staudacher, Natalie, Summers, Natalie, LaFontaine, Natan, Chowdhury, Neil, Ryder, Nick, Stathas, Nick, Turley, Nick, Tezak, Nik, Felix, Niko, Kudige, Nithanth, Keskar, Nitish, Deutsch, Noah, Bundick, Noel, Puckett, Nora, Nachum, Ofir, Okelola, Ola, Boiko, Oleg, Murk, Oleg, Jaffe, Oliver, Watkins, Olivia, Godement, Olivier, Campbell-Moore, Owen, Chao, Patrick, McMillan, Paul, Belov, Pavel, Su, Peng, Bak, Peter, Bakkum, Peter, Deng, Peter, Dolan, Peter, Hoeschele, Peter, Welinder, Peter, Tillet, Phil, Pronin, Philip, Tillet, Philippe, Dhariwal, Prafulla, Yuan, Qiming, Dias, Rachel, Lim, Rachel, Arora, Rahul, Troll, Rajan, Lin, Randall, Lopes, Rapha Gontijo, Puri, Raul, Miyara, Reah, Leike, Reimar, Gaubert, Renaud, Zamani, Reza, Wang, Ricky, Donnelly, Rob, Honsby, Rob, Smith, Rocky, Sahai, Rohan, Ramchandani, Rohit, Huet, Romain, Carmichael, Rory, Zellers, Rowan, Chen, Roy, Chen, Ruby, Nigmatullin, Ruslan, Cheu, Ryan, Jain, Saachi, Altman, Sam, Schoenholz, Sam, Toizer, Sam, Miserendino, Samuel, Agarwal, Sandhini, Culver, Sara, Ethersmith, Scott, Gray, Scott, Grove, Sean, Metzger, Sean, Hermani, Shamez, Jain, Shantanu, Zhao, Shengjia, Wu, Sherwin, Jomoto, Shino, Wu, Shirong, Shuaiqi, Xia, Phene, Sonia, Papay, Spencer, Narayanan, Srinivas, Coffey, Steve, Lee, Steve, Hall, Stewart, Balaji, Suchir, Broda, Tal, Stramer, Tal, Xu, Tao, Gogineni, Tarun, Christianson, Taya, Sanders, Ted, Patwardhan, Tejal, Cunninghman, Thomas, Degry, Thomas, Dimson, Thomas, Raoux, Thomas, Shadwell, Thomas, Zheng, Tianhao, Underwood, Todd, Markov, Todor, Sherbakov, Toki, Rubin, Tom, Stasi, Tom, Kaftan, Tomer, Heywood, Tristan, Peterson, Troy, Walters, Tyce, Eloundou, Tyna, Qi, Valerie, Moeller, Veit, Monaco, Vinnie, Kuo, Vishal, Fomenko, Vlad, Chang, Wayne, Zheng, Weiyi, Zhou, Wenda, Manassra, Wesam, Sheu, Will, Zaremba, Wojciech, Patil, Yash, Qian, Yilei, Kim, Yongjik, Cheng, Youlong, Zhang, Yu, He, Yuchen, Zhang, Yuchen, Jin, Yujia, Dai, Yunxing, and Malkov, Yury

Subjects
Computer Science - Computation and Language, Computer Science - Artificial Intelligence, Computer Science - Computer Vision and Pattern Recognition, Computer Science - Computers and Society, Computer Science - Machine Learning, Computer Science - Sound, Electrical Engineering and Systems Science - Audio and Speech Processing
Abstract

GPT-4o is an autoregressive omni model that accepts as input any combination of text, audio, image, and video, and generates any combination of text, audio, and image outputs. It's trained end-to-end across text, vision, and audio, meaning all inputs and outputs are processed by the same neural network. GPT-4o can respond to audio inputs in as little as 232 milliseconds, with an average of 320 milliseconds, which is similar to human response time in conversation. It matches GPT-4 Turbo performance on text in English and code, with significant improvement on text in non-English languages, while also being much faster and 50\% cheaper in the API. GPT-4o is especially better at vision and audio understanding compared to existing models. In line with our commitment to building AI safely and consistent with our voluntary commitments to the White House, we are sharing the GPT-4o System Card, which includes our Preparedness Framework evaluations. In this System Card, we provide a detailed look at GPT-4o's capabilities, limitations, and safety evaluations across multiple categories, focusing on speech-to-speech while also evaluating text and image capabilities, and measures we've implemented to ensure the model is safe and aligned. We also include third-party assessments on dangerous capabilities, as well as discussion of potential societal impacts of GPT-4o's text and vision capabilities.

Published
2024

30. Quantifying the Value of Revert Protection

Author

Zhu, Brian Z., Wan, Xin, Moallemi, Ciamac C., Robinson, Dan, and Bachu, Brad

Subjects
Computer Science - Computer Science and Game Theory
Abstract

Revert protection is a feature provided by some blockchain platforms that prevents users from incurring fees for failed transactions. This paper explores the economic implications and benefits of revert protection, in the context of priority auctions and maximal extractable value (MEV). We develop an equilibrium game theoretic model that captures the behavior of users (MEV searchers) bidding to have their transaction included ahead of others, in an environment where only a single transaction will succeed in realizing the common value of an opportunity, and in settings both with and without revert protection. Our model applies to a broad range of settings, including Layer 1 (L1) blockchains (e.g., Ethereum mainnet) and Layer 2 (L2) blockchains, and auctions such as ``bundle auctions'' (on L1s) or priority ordering auctions (on L2s). We establish that, in the absence of revert protection, users will employ randomized strategies to mitigate the impact of paying for failed transactions. This will ultimately result in less auction revenue, despite the fact that failed transactions still pay fees. Our results quantify in closed form how revert protection enhances auction revenue, and also improves market efficiency and provides for more efficient use of blockspace, as a function of the underlying parameters (the value of the MEV opportunity, the base fee, the revert penalties, and the number of participating agents).

Published
2024

31. Search for gravitational waves emitted from SN 2023ixf

Author

The LIGO Scientific Collaboration, the Virgo Collaboration, the KAGRA Collaboration, Abac, A. G., Abbott, R., Abouelfettouh, I., Acernese, F., Ackley, K., Adhicary, S., Adhikari, N., Adhikari, R. X., Adkins, V. K., Agarwal, D., Agathos, M., Abchouyeh, M. Aghaei, Aguiar, O. D., Aguilar, I., Aiello, L., Ain, A., Akutsu, T., Albanesi, S., Alfaidi, R. A., Al-Jodah, A., Alléné, C., Allocca, A., Al-Shammari, S., Altin, P. A., Alvarez-Lopez, S., Amato, A., Amez-Droz, L., Amorosi, A., Amra, C., Ananyeva, A., Anderson, S. B., Anderson, W. G., Andia, M., Ando, M., Andrade, T., Andres, N., Andrés-Carcasona, M., Andrić, T., Anglin, J., Ansoldi, S., Antelis, J. M., Antier, S., Aoumi, M., Appavuravther, E. Z., Appert, S., Apple, S. K., Arai, K., Araya, A., Araya, M. C., Areeda, J. S., Argianas, L., Aritomi, N., Armato, F., Arnaud, N., Arogeti, M., Aronson, S. M., Ashton, G., Aso, Y., Assiduo, M., Melo, S. Assis de Souza, Aston, S. M., Astone, P., Attadio, F., Aubin, F., AultONeal, K., Avallone, G., Babak, S., Badaracco, F., Badger, C., Bae, S., Bagnasco, S., Bagui, E., Baier, J. G., Baiotti, L., Bajpai, R., Baka, T., Ball, M., Ballardin, G., Ballmer, S. W., Banagiri, S., Banerjee, B., Bankar, D., Baral, P., Barayoga, J. C., Barish, B. C., Barker, D., Barneo, P., Barone, F., Barr, B., Barsotti, L., Barsuglia, M., Barta, D., Bartoletti, A. M., Barton, M. A., Bartos, I., Basak, S., Basalaev, A., Bassiri, R., Basti, A., Bates, D. E., Bawaj, M., Baxi, P., Bayley, J. C., Baylor, A. C., Baynard II, P. A., Bazzan, M., Bedakihale, V. M., Beirnaert, F., Bejger, M., Belardinelli, D., Bell, A. S., Benedetto, V., Benoit, W., Bentley, J. D., Yaala, M. Ben, Bera, S., Berbel, M., Bergamin, F., Berger, B. K., Bernuzzi, S., Beroiz, M., Bersanetti, D., Bertolini, A., Betzwieser, J., Beveridge, D., Bevins, N., Bhandare, R., Bhardwaj, U., Bhatt, R., Bhattacharjee, D., Bhaumik, S., Bhowmick, S., Bianchi, A., Bilenko, I. A., Billingsley, G., Binetti, A., Bini, S., Birnholtz, O., Biscoveanu, S., Bisht, A., Bitossi, M., Bizouard, M. -A., Blackburn, J. K., Blagg, L. A., Blair, C. D., Blair, D. G., Bobba, F., Bode, N., Boileau, G., Boldrini, M., Bolingbroke, G. N., Bolliand, A., Bonavena, L. D., Bondarescu, R., Bondu, F., Bonilla, E., Bonilla, M. S., Bonino, A., Bonnand, R., Booker, P., Borchers, A., Boschi, V., Bose, S., Bossilkov, V., Boudart, V., Boudon, A., Bozzi, A., Bradaschia, C., Brady, P. R., Braglia, M., Branch, A., Branchesi, M., Brandt, J., Braun, I., Breschi, M., Briant, T., Brillet, A., Brinkmann, M., Brockill, P., Brockmueller, E., Brooks, A. F., Brown, B. C., Brown, D. D., Brozzetti, M. L., Brunett, S., Bruno, G., Bruntz, R., Bryant, J., Bucci, F., Buchanan, J., Bulashenko, O., Bulik, T., Bulten, H. J., Buonanno, A., Burtnyk, K., Buscicchio, R., Buskulic, D., Buy, C., Byer, R. L., Davies, G. S. Cabourn, Cabras, G., Cabrita, R., Cáceres-Barbosa, V., Cadonati, L., Cagnoli, G., Cahillane, C., Bustillo, J. Calderón, Callister, T. A., Calloni, E., Camp, J. B., Canepa, M., Santoro, G. Caneva, Cannon, K. C., Cao, H., Capistran, L. A., Capocasa, E., Capote, E., Carapella, G., Carbognani, F., Carlassara, M., Carlin, J. B., Carpinelli, M., Carrillo, G., Carter, J. J., Carullo, G., Diaz, J. Casanueva, Casentini, C., Castro-Lucas, S. Y., Caudill, S., Cavaglià, M., Cavalieri, R., Cella, G., Cerdá-Durán, P., Cesarini, E., Chaibi, W., Chakraborty, P., Subrahmanya, S. Chalathadka, Chan, J. C. L., Chan, M., Chandra, K., Chang, R. -J., Chao, S., Charlton, E. L., Charlton, P., Chassande-Mottin, E., Chatterjee, C., Chatterjee, Debarati, Chatterjee, Deep, Chaturvedi, M., Chaty, S., Chen, A., Chen, A. H. -Y., Chen, D., Chen, H., Chen, H. Y., Chen, J., Chen, K. H., Chen, Y., Chen, Yanbei, Chen, Yitian, Cheng, H. P., Chessa, P., Cheung, H. T., Cheung, S. Y., Chiadini, F., Chiarini, G., Chierici, R., Chincarini, A., Chiofalo, M. L., Chiummo, A., Chou, C., Choudhary, S., Christensen, N., Chua, S. S. Y., Chugh, P., Ciani, G., Ciecielag, P., Cieślar, M., Cifaldi, M., Ciolfi, R., Clara, F., Clark, J. A., Clarke, J., Clarke, T. A., Clearwater, P., Clesse, S., Coccia, E., Codazzo, E., Cohadon, P. -F., Colace, S., Colleoni, M., Collette, C. G., Collins, J., Colloms, S., Colombo, A., Colpi, M., Compton, C. M., Connolly, G., Conti, L., Corbitt, T. R., Cordero-Carrión, I., Corezzi, S., Cornish, N. J., Corsi, A., Cortese, S., Costa, C. A., Cottingham, R., Coughlin, M. W., Couineaux, A., Coulon, J. -P., Countryman, S. T., Coupechoux, J. -F., Couvares, P., Coward, D. M., Cowart, M. J., Coyne, R., Craig, K., Creed, R., Creighton, J. D. E., Creighton, T. D., Cremonese, P., Criswell, A. W., Crockett-Gray, J. C. G., Crook, S., Crouch, R., Csizmazia, J., Cudell, J. R., Cullen, T. J., Cumming, A., Cuoco, E., Cusinato, M., Dabadie, P., Canton, T. Dal, Dall'Osso, S., Pra, S. Dal, Dálya, G., D'Angelo, B., Danilishin, S., D'Antonio, S., Danzmann, K., Darroch, K. E., Dartez, L. P., Dasgupta, A., Datta, S., Dattilo, V., Daumas, A., Davari, N., Dave, I., Davenport, A., Davier, M., Davies, T. F., Davis, D., Davis, L., Davis, M. C., Davis, P. J., Dax, M., De Bolle, J., Deenadayalan, M., Degallaix, J., De Laurentis, M., Deléglise, S., De Lillo, F., Dell'Aquila, D., Del Pozzo, W., De Marco, F., De Matteis, F., D'Emilio, V., Demos, N., Dent, T., Depasse, A., DePergola, N., De Pietri, R., De Rosa, R., De Rossi, C., DeSalvo, R., De Simone, R., Dhani, A., Diab, R., Díaz, M. C., Di Cesare, M., Dideron, G., Didio, N. A., Dietrich, T., Di Fiore, L., Di Fronzo, C., Di Giovanni, M., Di Girolamo, T., Diksha, D., Di Michele, A., Ding, J., Di Pace, S., Di Palma, I., Di Renzo, F., Divyajyoti, Dmitriev, A., Doctor, Z., Dohmen, E., Doleva, P. P., Dominguez, D., D'Onofrio, L., Donovan, F., Dooley, K. L., Dooney, T., Doravari, S., Dorosh, O., Drago, M., Driggers, J. C., Ducoin, J. -G., Dunn, L., Dupletsa, U., D'Urso, D., Duval, H., Duverne, P. -A., Dwyer, S. E., Eassa, C., Ebersold, M., Eckhardt, T., Eddolls, G., Edelman, B., Edo, T. B., Edy, O., Effler, A., Eichholz, J., Einsle, H., Eisenmann, M., Eisenstein, R. A., Ejlli, A., Eleveld, R. M., Emma, M., Endo, K., Engl, A. J., Enloe, E., Errico, L., Essick, R. C., Estellés, H., Estevez, D., Etzel, T., Evans, M., Evstafyeva, T., Ewing, B. E., Ezquiaga, J. M., Fabrizi, F., Faedi, F., Fafone, V., Fairhurst, S., Farah, A. M., Farr, B., Farr, W. M., Favaro, G., Favata, M., Fays, M., Fazio, M., Feicht, J., Fejer, M. M., Felicetti, R., Fenyvesi, E., Ferguson, D. L., Ferraiuolo, S., Ferrante, I., Ferreira, T. A., Fidecaro, F., Figura, P., Fiori, A., Fiori, I., Fishbach, M., Fisher, R. P., Fittipaldi, R., Fiumara, V., Flaminio, R., Fleischer, S. M., Fleming, L. S., Floden, E., Foley, E. M., Fong, H., Font, J. A., Fornal, B., Forsyth, P. W. F., Franceschetti, K., Franchini, N., Frasca, S., Frasconi, F., Mascioli, A. Frattale, Frei, Z., Freise, A., Freitas, O., Frey, R., Frischhertz, W., Fritschel, P., Frolov, V. V., Fronzé, G. G., Fuentes-Garcia, M., Fujii, S., Fujimori, T., Fulda, P., Fyffe, M., Gadre, B., Gair, J. R., Galaudage, S., Galdi, V., Gallagher, H., Gallardo, S., Gallego, B., Gamba, R., Gamboa, A., Ganapathy, D., Ganguly, A., Garaventa, B., García-Bellido, J., Núñez, C. García, García-Quirós, C., Gardner, J. W., Gardner, K. A., Gargiulo, J., Garron, A., Garufi, F., Gasbarra, C., Gateley, B., Gayathri, V., Gemme, G., Gennai, A., Gennari, V., George, J., George, R., Gerberding, O., Gergely, L., Ghosh, Archisman, Ghosh, Sayantan, Ghosh, Shaon, Ghosh, Shrobana, Ghosh, Suprovo, Ghosh, Tathagata, Giacoppo, L., Giaime, J. A., Giardina, K. D., Gibson, D. R., Gibson, D. T., Gier, C., Giri, P., Gissi, F., Gkaitatzis, S., Glanzer, J., Glotin, F., Godfrey, J., Godwin, P., Goebbels, N. L., Goetz, E., Golomb, J., Lopez, S. Gomez, Goncharov, B., Gong, Y., González, G., Goodarzi, P., Goode, S., Goodwin-Jones, A. W., Gosselin, M., Göttel, A. S., Gouaty, R., Gould, D. W., Govorkova, K., Goyal, S., Grace, B., Grado, A., Graham, V., Granados, A. E., Granata, M., Granata, V., Gras, S., Grassia, P., Gray, A., Gray, C., Gray, R., Greco, G., Green, A. C., Green, S. M., Green, S. R., Gretarsson, A. M., Gretarsson, E. M., Griffith, D., Griffiths, W. L., Griggs, H. L., Grignani, G., Grimaldi, A., Grimaud, C., Grote, H., Guerra, D., Guetta, D., Guidi, G. M., Guimaraes, A. R., Gulati, H. K., Gulminelli, F., Gunny, A. M., Guo, H., Guo, W., Guo, Y., Gupta, Anchal, Gupta, Anuradha, Gupta, Ish, Gupta, N. C., Gupta, P., Gupta, S. K., Gupta, T., Gupte, N., Gurs, J., Gutierrez, N., Guzman, F., H, H. -Y., Haba, D., Haberland, M., Haino, S., Hall, E. D., Hamilton, E. Z., Hammond, G., Han, W. -B., Haney, M., Hanks, J., Hanna, C., Hannam, M. D., Hannuksela, O. A., Hanselman, A. G., Hansen, H., Hanson, J., Harada, R., Hardison, A. R., Haris, K., Harmark, T., Harms, J., Harry, G. M., Harry, I. W., Hart, J., Haskell, B., Haster, C. -J., Hathaway, J. S., Haughian, K., Hayakawa, H., Hayama, K., Hayes, R., Heffernan, A., Heidmann, A., Heintze, M. C., Heinze, J., Heinzel, J., Heitmann, H., Hellman, F., Hello, P., Helmling-Cornell, A. F., Hemming, G., Henderson-Sapir, O., Hendry, M., Heng, I. S., Hennes, E., Henshaw, C., Hertog, T., Heurs, M., Hewitt, A. L., Heyns, J., Higginbotham, S., Hild, S., Hill, S., Himemoto, Y., Hirata, N., Hirose, C., Hoang, S., Hochheim, S., Hofman, D., Holland, N. A., Holley-Bockelmann, K., Holmes, Z. J., Holz, D. E., Honet, L., Hong, C., Hornung, J., Hoshino, S., Hough, J., Hourihane, S., Howell, E. J., Hoy, C. G., Hrishikesh, C. A., Hsieh, H. -F., Hsiung, C., Hsu, H. C., Hsu, W. -F., Hu, P., Hu, Q., Huang, H. Y., Huang, Y. -J., Huddart, A. D., Hughey, B., Hui, D. C. Y., Hui, V., Husa, S., Huxford, R., Huynh-Dinh, T., Iampieri, L., Iandolo, G. A., Ianni, M., Iess, A., Imafuku, H., Inayoshi, K., Inoue, Y., Iorio, G., Iqbal, M. H., Irwin, J., Ishikawa, R., Isi, M., Ismail, M. A., Itoh, Y., Iwanaga, H., Iwaya, M., Iyer, B. R., JaberianHamedan, V., Jacquet, C., Jacquet, P. -E., Jadhav, S. J., Jadhav, S. P., Jain, T., James, A. L., James, P. A., Jamshidi, R., Janquart, J., Janssens, K., Janthalur, N. N., Jaraba, S., Jaranowski, P., Jaume, R., Javed, W., Jennings, A., Jia, W., Jiang, J., Kubisz, J., Johanson, C., Johns, G. R., Johnson, N. A., Johnston, M. C., Johnston, R., Johny, N., Jones, D. H., Jones, D. I., Jones, R., Jose, S., Joshi, P., Ju, L., Jung, K., Junker, J., Juste, V., Kajita, T., Kaku, I., Kalaghatgi, C., Kalogera, V., Kamiizumi, M., Kanda, N., Kandhasamy, S., Kang, G., Kanner, J. B., Kapadia, S. J., Kapasi, D. P., Karat, S., Karathanasis, C., Kashyap, R., Kasprzack, M., Kastaun, W., Kato, T., Katsavounidis, E., Katzman, W., Kaushik, R., Kawabe, K., Kawamoto, R., Kazemi, A., Keitel, D., Kelley-Derzon, J., Kennington, J., Kesharwani, R., Key, J. S., Khadela, R., Khadka, S., Khalili, F. Y., Khan, F., Khan, I., Khanam, T., Khursheed, M., Khusid, N. M., Kiendrebeogo, W., Kijbunchoo, N., Kim, C., Kim, J. C., Kim, K., Kim, M. H., Kim, S., Kim, Y. -M., Kimball, C., Kinley-Hanlon, M., Kinnear, M., Kissel, J. S., Klimenko, S., Knee, A. M., Knust, N., Kobayashi, K., Obergaulinger, M., Koch, P., Koehlenbeck, S. M., Koekoek, G., Kohri, K., Kokeyama, K., Koley, S., Kolitsidou, P., Kolstein, M., Komori, K., Kong, A. K. H., Kontos, A., Korobko, M., Kossak, R. V., Kou, X., Koushik, A., Kouvatsos, N., Kovalam, M., Kozak, D. B., Kranzhoff, S. L., Kringel, V., Krishnendu, N. V., Królak, A., Kruska, K., Kuehn, G., Kuijer, P., Kulkarni, S., Ramamohan, A. Kulur, Kumar, A., Kumar, Praveen, Kumar, Prayush, Kumar, Rahul, Kumar, Rakesh, Kume, J., Kuns, K., Kuntimaddi, N., Kuroyanagi, S., Kurth, N. J., Kuwahara, S., Kwak, K., Kwan, K., Kwok, J., Lacaille, G., Lagabbe, P., Laghi, D., Lai, S., Laity, A. H., Lakkis, M. H., Lalande, E., Lalleman, M., Lalremruati, P. C., Landry, M., Lane, B. B., Lang, R. N., Lange, J., Lantz, B., La Rana, A., La Rosa, I., Lartaux-Vollard, A., Lasky, P. D., Lawrence, J., Lawrence, M. N., Laxen, M., Lazzarini, A., Lazzaro, C., Leaci, P., Lecoeuche, Y. K., Lee, H. M., Lee, H. W., Lee, K., Lee, R. -K., Lee, R., Lee, S., Lee, Y., Legred, I. N., Lehmann, J., Lehner, L., Jean, M. Le, Lemaître, A., Lenti, M., Leonardi, M., Lequime, M., Leroy, N., Lesovsky, M., Letendre, N., Lethuillier, M., Levin, S. E., Levin, Y., Leyde, K., Li, A. K. Y., Li, K. L., Li, T. G. F., Li, X., Li, Z., Lihos, A., Lin, C-Y., Lin, C. -Y., Lin, E. T., Lin, F., Lin, H., Lin, L. C. -C., Lin, Y. -C., Linde, F., Linker, S. D., Littenberg, T. B., Liu, A., Liu, G. C., Liu, Jian, Villarreal, F. Llamas, Llobera-Querol, J., Lo, R. K. L., Locquet, J. -P., London, L. T., Longo, A., Lopez, D., Portilla, M. Lopez, Lorenzini, M., Lorenzo-Medina, A., Loriette, V., Lormand, M., Losurdo, G., Lott IV, T. P., Lough, J. D., Loughlin, H. A., Lousto, C. O., Lowry, M. J., Lu, N., Lück, H., Lumaca, D., Lundgren, A. P., Lussier, A. W., Ma, L. -T., Ma, S., Ma'arif, M., Macas, R., Macedo, A., MacInnis, M., Maciy, R. R., Macleod, D. M., MacMillan, I. A. O., Macquet, A., Macri, D., Maeda, K., Maenaut, S., Hernandez, I. Magaña, Magare, S. S., Magazzù, C., Magee, R. M., Maggio, E., Maggiore, R., Magnozzi, M., Mahesh, M., Mahesh, S., Maini, M., Majhi, S., Majorana, E., Makarem, C. N., Makelele, E., Malaquias-Reis, J. A., Mali, U., Maliakal, S., Malik, A., Man, N., Mandic, V., Mangano, V., Mannix, B., Mansell, G. L., Mansingh, G., Manske, M., Mantovani, M., Mapelli, M., Marchesoni, F., Pina, D. Marín, Marion, F., Márka, S., Márka, Z., Markosyan, A. S., Markowitz, A., Maros, E., Marsat, S., Martelli, F., Martin, I. W., Martin, R. M., Martinez, B. B., Martinez, M., Martinez, V., Martini, A., Martinovic, K., Martins, J. C., Martynov, D. V., Marx, E. J., Massaro, L., Masserot, A., Masso-Reid, M., Mastrodicasa, M., Mastrogiovanni, S., Matcovich, T., Matiushechkina, M., Matsuyama, M., Mavalvala, N., Maxwell, N., McCarrol, G., McCarthy, R., McClelland, D. E., McCormick, S., McCuller, L., McEachin, S., McElhenny, C., McGhee, G. I., McGinn, J., McGowan, K. B. M., McIver, J., McLeod, A., McRae, T., Meacher, D., Meijer, Q., Melatos, A., Mellaerts, S., Menendez-Vazquez, A., Menoni, C. S., Mera, F., Mercer, R. A., Mereni, L., Merfeld, K., Merilh, E. L., Mérou, J. R., Merritt, J. D., Merzougui, M., Messenger, C., Messick, C., Meyer-Conde, M., Meylahn, F., Mhaske, A., Miani, A., Miao, H., Michaloliakos, I., Michel, C., Michimura, Y., Middleton, H., Miller, A. L., Miller, S., Millhouse, M., Milotti, E., Milotti, V., Minenkov, Y., Mio, N., Mir, Ll. M., Mirasola, L., Miravet-Tenés, M., Miritescu, C. -A., Mishra, A. K., Mishra, A., Mishra, C., Mishra, T., Mitchell, A. L., Mitchell, J. G., Mitra, S., Mitrofanov, V. P., Mittleman, R., Miyakawa, O., Miyamoto, S., Miyoki, S., Mo, G., Mobilia, L., Mohapatra, S. R. P., Mohite, S. R., Molina-Ruiz, M., Mondal, C., Mondin, M., Montani, M., Moore, C. J., Moraru, D., More, A., More, S., Moreno, G., Morgan, C., Morisaki, S., Moriwaki, Y., Morras, G., Moscatello, A., Mourier, P., Mours, B., Mow-Lowry, C. M., Muciaccia, F., Mukherjee, Arunava, Mukherjee, D., Mukherjee, Samanwaya, Mukherjee, Soma, Mukherjee, Subroto, Mukherjee, Suvodip, Mukund, N., Mullavey, A., Munch, J., Mundi, J., Mungioli, C. L., Oberg, W. R. Munn, Murakami, Y., Murakoshi, M., Murray, P. G., Muusse, S., Nabari, D., Nadji, S. L., Nagar, A., Nagarajan, N., Nagler, K. N., Nakagaki, K., Nakamura, K., Nakano, H., Nakano, M., Nandi, D., Napolano, V., Narayan, P., Nardecchia, I., Narikawa, T., Narola, H., Naticchioni, L., Nayak, R. K., Neilson, J., Nelson, A., Nelson, T. J. N., Nery, M., Neunzert, A., Ng, S., Quynh, L. Nguyen, Nichols, S. A., Nielsen, A. B., Nieradka, G., Niko, A., Nishino, Y., Nishizawa, A., Nissanke, S., Nitoglia, E., Niu, W., Nocera, F., Norman, M., North, C., Novak, J., Siles, J. F. Nuño, Nuttall, L. K., Obayashi, K., Oberling, J., O'Dell, J., Oertel, M., Offermans, A., Oganesyan, G., Oh, J. J., Oh, K., O'Hanlon, T., Ohashi, M., Ohkawa, M., Ohme, F., Oliveira, A. S., Oliveri, R., O'Neal, B., Oohara, K., O'Reilly, B., Ormsby, N. D., Orselli, M., O'Shaughnessy, R., O'Shea, S., Oshima, Y., Oshino, S., Ossokine, S., Osthelder, C., Ota, I., Ottaway, D. J., Ouzriat, A., Overmier, H., Owen, B. J., Pace, A. E., Pagano, R., Page, M. A., Pai, A., Pal, A., Pal, S., Palaia, M. A., Pálfi, M., Palma, P. P., Palomba, C., Palud, P., Pan, H., Pan, J., Pan, K. C., Panai, R., Panda, P. K., Pandey, S., Panebianco, L., Pang, P. T. H., Pannarale, F., Pannone, K. A., Pant, B. C., Panther, F. H., Paoletti, F., Paolone, A., Papalexakis, E. E., Papalini, L., Papigkiotis, G., Paquis, A., Parisi, A., Park, B. -J., Park, J., Parker, W., Pascale, G., Pascucci, D., Pasqualetti, A., Passaquieti, R., Passenger, L., Passuello, D., Patane, O., Pathak, D., Pathak, M., Patra, A., Patricelli, B., Patron, A. S., Paul, K., Paul, S., Payne, E., Pearce, T., Pedraza, M., Pegna, R., Pele, A., Arellano, F. E. Peña, Penn, S., Penuliar, M. D., Perego, A., Pereira, Z., Perez, J. J., Périgois, C., Perna, G., Perreca, A., Perret, J., Perriès, S., Perry, J. W., Pesios, D., Petracca, S., Petrillo, C., Pfeiffer, H. P., Pham, H., Pham, K. A., Phukon, K. S., Phurailatpam, H., Piarulli, M., Piccari, L., Piccinni, O. J., Pichot, M., Piendibene, M., Piergiovanni, F., Pierini, L., Pierra, G., Pierro, V., Pietrzak, M., Pillas, M., Pilo, F., Pinard, L., Pinto, I. M., Pinto, M., Piotrzkowski, B. J., Pirello, M., Pitkin, M. D., Placidi, A., Placidi, E., Planas, M. L., Plastino, W., Poggiani, R., Polini, E., Pompili, L., Poon, J., Porcelli, E., Porter, E. K., Posnansky, C., Poulton, R., Powell, J., Pracchia, M., Pradhan, B. K., Pradier, T., Prajapati, A. K., Prasai, K., Prasanna, R., Prasia, P., Pratten, G., Principe, G., Principe, M., Prodi, G. A., Prokhorov, L., Prosposito, P., Puecher, A., Pullin, J., Punturo, M., Puppo, P., Pürrer, M., Qi, H., Qin, J., Quéméner, G., Quetschke, V., Quigley, C., Quinonez, P. J., Raab, F. J., Raabith, S. S., Raaijmakers, G., Raja, S., Rajan, C., Rajbhandari, B., Ramirez, K. E., Vidal, F. A. Ramis, Ramos-Buades, A., Rana, D., Ranjan, S., Ransom, K., Rapagnani, P., Ratto, B., Rawat, S., Ray, A., Raymond, V., Razzano, M., Read, J., Payo, M. Recaman, Regimbau, T., Rei, L., Reid, S., Reitze, D. H., Relton, P., Renzini, A. I., Rettegno, P., Revenu, B., Reyes, R., Rezaei, A. S., Ricci, F., Ricci, M., Ricciardone, A., Richardson, J. W., Richardson, M., Rijal, A., Riles, K., Riley, H. K., Rinaldi, S., Rittmeyer, J., Robertson, C., Robinet, F., Robinson, M., Rocchi, A., Rolland, L., Rollins, J. G., Romano, A. E., Romano, R., Romero, A., Romero-Shaw, I. M., Romie, J. H., Ronchini, S., Roocke, T. J., Rosa, L., Rosauer, T. J., Rose, C. A., Rosińska, D., Ross, M. P., Rossello, M., Rowan, S., Roy, S. K., Roy, S., Rozza, D., Ruggi, P., Ruhama, N., Morales, E. Ruiz, Ruiz-Rocha, K., Sachdev, S., Sadecki, T., Sadiq, J., Saffarieh, P., Sah, M. R., Saha, S. S., Saha, S., Sainrat, T., Menon, S. Sajith, Sakai, K., Sakellariadou, M., Sakon, S., Salafia, O. S., Salces-Carcoba, F., Salconi, L., Saleem, M., Salemi, F., Sallé, M., Salvador, S., Sanchez, A., Sanchez, E. J., Sanchez, J. H., Sanchez, L. E., Sanchis-Gual, N., Sanders, J. R., Sänger, E. M., Santoliquido, F., Saravanan, T. R., Sarin, N., Sasaoka, S., Sasli, A., Sassi, P., Sassolas, B., Satari, H., Sato, R., Sato, Y., Sauter, O., Savage, R. L., Sawada, T., Sawant, H. L., Sayah, S., Scacco, V., Schaetzl, D., Scheel, M., Schiebelbein, A., Schiworski, M. G., Schmidt, P., Schmidt, S., Schnabel, R., Schneewind, M., Schofield, R. M. S., Schouteden, K., Schulte, B. W., Schutz, B. F., Schwartz, E., Scialpi, M., Scott, J., Scott, S. M., Seetharamu, T. C., Seglar-Arroyo, M., Sekiguchi, Y., Sellers, D., Sengupta, A. S., Sentenac, D., Seo, E. G., Seo, J. W., Sequino, V., Serra, M., Servignat, G., Sevrin, A., Shaffer, T., Shah, U. S., Shaikh, M. A., Shao, L., Sharma, A. K., Sharma, P., Sharma-Chaudhary, S., Shaw, M. R., Shawhan, P., Shcheblanov, N. S., Sheridan, E., Shikano, Y., Shikauchi, M., Shimode, K., Shinkai, H., Shiota, J., Shoemaker, D. H., Shoemaker, D. M., Short, R. W., ShyamSundar, S., Sider, A., Siegel, H., Sieniawska, M., Sigg, D., Silenzi, L., Simmonds, M., Singer, L. P., Singh, A., Singh, D., Singh, M. K., Singh, S., Singha, A., Sintes, A. M., Sipala, V., Skliris, V., Slagmolen, B. J. J., Slaven-Blair, T. J., Smetana, J., Smith, J. R., Smith, L., Smith, R. J. E., Smith, W. J., Soldateschi, J., Somiya, K., Song, I., Soni, K., Soni, S., Sordini, V., Sorrentino, F., Sorrentino, N., Sotani, H., Soulard, R., Southgate, A., Spagnuolo, V., Spencer, A. P., Spera, M., Spinicelli, P., Spoon, J. B., Sprague, C. A., Srivastava, A. K., Stachurski, F., Steer, D. A., Steinlechner, J., Steinlechner, S., Stergioulas, N., Stevens, P., StPierre, M., Stratta, G., Strong, M. D., Strunk, A., Sturani, R., Stuver, A. L., Suchenek, M., Sudhagar, S., Sueltmann, N., Suleiman, L., Sullivan, K. D., Sun, L., Sunil, S., Suresh, J., Sutton, P. J., Suzuki, T., Suzuki, Y., Swinkels, B. L., Syx, A., Szczepańczyk, M. J., Szewczyk, P., Tacca, M., Tagoshi, H., Tait, S. C., Takahashi, H., Takahashi, R., Takamori, A., Takase, T., Takatani, K., Takeda, H., Takeshita, K., Talbot, C., Tamaki, M., Tamanini, N., Tanabe, D., Tanaka, K., Tanaka, S. J., Tanaka, T., Tang, D., Tanioka, S., Tanner, D. B., Tao, L., Tapia, R. D., Martín, E. N. Tapia San, Tarafder, R., Taranto, C., Taruya, A., Tasson, J. D., Teloi, M., Tenorio, R., Themann, H., Theodoropoulos, A., Thirugnanasambandam, M. P., Thomas, L. M., Thomas, M., Thomas, P., Thompson, J. E., Thondapu, S. R., Thorne, K. A., Thrane, E., Tissino, J., Tiwari, A., Tiwari, P., Tiwari, S., Tiwari, V., Todd, M. R., Toivonen, A. M., Toland, K., Tolley, A. E., Tomaru, T., Tomita, K., Tomura, T., Tong-Yu, C., Toriyama, A., Toropov, N., Torres-Forné, A., Torrie, C. I., Toscani, M., Melo, I. Tosta e, Tournefier, E., Trapananti, A., Travasso, F., Traylor, G., Trevor, M., Tringali, M. C., Tripathee, A., Troian, G., Troiano, L., Trovato, A., Trozzo, L., Trudeau, R. J., Tsang, T. T. L., Tso, R., Tsuchida, S., Tsukada, L., Tsutsui, T., Turbang, K., Turconi, M., Turski, C., Ubach, H., Uchikata, N., Uchiyama, T., Udall, R. P., Uehara, T., Uematsu, M., Ueno, K., Ueno, S., Undheim, V., Ushiba, T., Vacatello, M., Vahlbruch, H., Vaidya, N., Vajente, G., Vajpeyi, A., Valdes, G., Valencia, J., Valentini, M., Vallejo-Peña, S. A., Vallero, S., Valsan, V., van Bakel, N., van Beuzekom, M., van Dael, M., Brand, J. F. J. van den, Broeck, C. Van Den, Vander-Hyde, D. C., van der Sluys, M., Van de Walle, A., van Dongen, J., Vandra, K., van Haevermaet, H., van Heijningen, J. V., Van Hove, P., VanKeuren, M., Vanosky, J., van Putten, M. H. P. M., van Ranst, Z., van Remortel, N., Vardaro, M., Vargas, A. F., Varghese, J. J., Varma, V., Vasúth, M., Vecchio, A., Vedovato, G., Veitch, J., Veitch, P. J., Venikoudis, S., Venneberg, J., Verdier, P., Verkindt, D., Verma, B., Verma, P., Verma, Y., Vermeulen, S. M., Vetrano, F., Veutro, A., Vibhute, A. M., Viceré, A., Vidyant, S., Viets, A. D., Vijaykumar, A., Vilkha, A., Villa-Ortega, V., Vincent, E. T., Vinet, J. -Y., Viret, S., Virtuoso, A., Vitale, S., Vives, A., Vocca, H., Voigt, D., von Reis, E. R. G., von Wrangel, J. S. A., Vyatchanin, S. P., Wade, L. E., Wade, M., Wagner, K. J., Wajid, A., Walker, M., Wallace, G. S., Wallace, L., Wang, H., Wang, J. Z., Wang, W. H., Wang, Z., Waratkar, G., Warner, J., Was, M., Washimi, T., Washington, N. Y., Watarai, D., Wayt, K. E., Weaver, B. R., Weaver, B., Weaving, C. R., Webster, S. A., Weinert, M., Weinstein, A. J., Weiss, R., Wellmann, F., Wen, L., Weßels, P., Wette, K., Whelan, J. T., Whiting, B. F., Whittle, C., Wildberger, J. B., Wilk, O. S., Wilken, D., Wilkin, A. T., Willadsen, D. J., Willetts, K., Williams, D., Williams, M. J., Williams, N. S., Willis, J. L., Willke, B., Wils, M., Winterflood, J., Wipf, C. C., Woan, G., Woehler, J., Wofford, J. K., Wolfe, N. E., Wong, H. T., Wong, H. W. Y., Wong, I. C. F., Wright, J. L., Wright, M., Wu, C., Wu, D. S., Wu, H., Wuchner, E., Wysocki, D. M., Xu, V. A., Xu, Y., Yadav, N., Yamamoto, H., Yamamoto, K., Yamamoto, T. S., Yamamoto, T., Yamamura, S., Yamazaki, R., Yan, S., Yan, T., Yang, F. W., Yang, F., Yang, K. Z., Yang, Y., Yarbrough, Z., Yasui, H., Yeh, S. -W., Yelikar, A. B., Yin, X., Yokoyama, J., Yokozawa, T., Yoo, J., Yu, H., Yuan, S., Yuzurihara, H., Zadrożny, A., Zanolin, M., Zeeshan, M., Zelenova, T., Zendri, J. -P., Zeoli, M., Zerrad, M., Zevin, M., Zhang, A. C., Zhang, L., Zhang, R., Zhang, T., Zhang, Y., Zhao, C., Zhao, Yue, Zhao, Yuhang, Zheng, Y., Zhong, H., Zhou, R., Zhu, X. -J., Zhu, Z. -H., Zimmerman, A. B., Zucker, M. E., and Zweizig, J.

Subjects
Astrophysics - High Energy Astrophysical Phenomena
Abstract

We present the results of a search for gravitational-wave transients associated with core-collapse supernova SN 2023ixf, which was observed in the galaxy Messier 101 via optical emission on 2023 May 19th, during the LIGO-Virgo-KAGRA 15th Engineering Run. We define a five-day on-source window during which an accompanying gravitational-wave signal may have occurred. No gravitational waves have been identified in data when at least two gravitational-wave observatories were operating, which covered $\sim 14\%$ of this five-day window. We report the search detection efficiency for various possible gravitational-wave emission models. Considering the distance to M101 (6.7 Mpc), we derive constraints on the gravitational-wave emission mechanism of core-collapse supernovae across a broad frequency spectrum, ranging from 50 Hz to 2 kHz where we assume the GW emission occurred when coincident data are available in the on-source window. Considering an ellipsoid model for a rotating proto-neutron star, our search is sensitive to gravitational-wave energy $1 \times 10^{-5} M_{\odot} c^2$ and luminosity $4 \times 10^{-5} M_{\odot} c^2/\text{s}$ for a source emitting at 50 Hz. These constraints are around an order of magnitude more stringent than those obtained so far with gravitational-wave data. The constraint on the ellipticity of the proto-neutron star that is formed is as low as $1.04$, at frequencies above $1200$ Hz, surpassing results from SN 2019ejj., Comment: Main paper: 6 pages, 4 figures and 1 table. Total with appendices: 20 pages, 4 figures, and 1 table

Published
2024

32. HWO Yield Sensitivities in the NIR and NUV

Author

Morgan, Rhonda, Savransky, Dmitry, Turmon, Michael, Damiano, Mario, Hu, Renyu, Mennesson, Bertrand, Mamajek, Eric E., Robinson, Tyler D., and Tokadjian, Armen

Subjects
Astrophysics - Earth and Planetary Astrophysics, Astrophysics - Instrumentation and Methods for Astrophysics
Abstract

Habitable Worlds Observatory (HWO) will search for biosignatures from Earth-size exoplanets in the habitable zones of nearby stars. The wavelength range for biosignatures used by the HabEx and LUVOIR mission concept studies was 200 nm to 2 microns and, as such, this is a candidate wavelength range for HWO. The visible wavelength range (500-1000 nm) provides for detection of water, oxygen, and Raleigh scattering; the near-ultraviolet is valuable for detection of ozone; and the near-infrared enables detection of carbon dioxide and methane for Earth-like atmospheres. Damiano et al. 2023 showed the significant improvement in spectral retrieval reliability when the NUV and NIR are both used with the visible. However, the challenge of the NUV, in addition to the technological and engineering challenges of starlight suppression in the NUV, is the drop in flux of host stars. In the NIR, the challenge is the geometric access to the habitable zone due to the wavelength dependency of the inner working angle limit of coronagraphs. For these reasons, exoplanet yields are lower in the NUV and NIR than in the visible (Morgan et al. 2023, Morgan et al. 2024) and some instrument parameters are more critical for improving NUV and NIR yields than others. In this paper we present a new capability for performing a large number of end-to-end yield modeling simulations to enable large, multivariate parameter sweeps. We utilize this capability to calculate the Visible, NIR, and NUV yield sensitivities to the instrument parameters: aperture diameter, coronagraph core throughput, contrast, and inner working angle (IWA). We find that parameter interactions are important in determining yield, the most important of which is the interaction between contrast and IWA, but that the strength of that interaction is different in each of the three wavebands., Comment: 20 pages, 11 figures, 5 tables

Published
2024
Full Text
View/download PDF

33. LocateBench: Evaluating the Locating Ability of Vision Language Models

Author

Chiang, Ting-Rui, Robinson, Joshua, Yu, Xinyan Velocity, and Yogatama, Dani

Subjects
Computer Science - Computer Vision and Pattern Recognition, Computer Science - Artificial Intelligence
Abstract

The ability to locate an object in an image according to natural language instructions is crucial for many real-world applications. In this work we propose LocateBench, a high-quality benchmark dedicated to evaluating this ability. We experiment with multiple prompting approaches, and measure the accuracy of several large vision language models. We find that even the accuracy of the strongest model, GPT-4o, lags behind human accuracy by more than 10%., Comment: We release the dataset at https://usc-tamagotchi.github.io/locate-bench/

Published
2024

34. First-Person Fairness in Chatbots

Author

Eloundou, Tyna, Beutel, Alex, Robinson, David G., Gu-Lemberg, Keren, Brakman, Anna-Luisa, Mishkin, Pamela, Shah, Meghan, Heidecke, Johannes, Weng, Lilian, and Kalai, Adam Tauman

Subjects
Computer Science - Computers and Society, Computer Science - Artificial Intelligence, Computer Science - Computation and Language
Abstract

Chatbots like ChatGPT are used for diverse purposes, ranging from resume writing to entertainment. These real-world applications are different from the institutional uses, such as resume screening or credit scoring, which have been the focus of much of AI research on fairness. Ensuring equitable treatment for all users in these first-person contexts is critical. In this work, we study "first-person fairness," which means fairness toward the chatbot user. This includes providing high-quality responses to all users regardless of their identity or background and avoiding harmful stereotypes. We propose a scalable, privacy-preserving method for evaluating one aspect of first-person fairness across a large, heterogeneous corpus of real-world chatbot interactions. Specifically, we assess potential bias linked to users' names, which can serve as proxies for demographic attributes like gender or race, in chatbot systems such as ChatGPT, which provide mechanisms for storing and using user names. Our method leverages a second language model to privately analyze name-sensitivity in the chatbot's responses. We verify the validity of these annotations through independent human evaluation. Further, we show that post-training interventions, including RL, significantly mitigate harmful stereotypes. Our approach also yields succinct descriptions of response differences across tasks. For instance, in the "writing a story" task, chatbot responses show a tendency to create protagonists whose gender matches the likely gender inferred from the user's name. Moreover, a pattern emerges where users with female-associated names receive responses with friendlier and simpler language slightly more often than users with male-associated names. Finally, we provide the system messages required for external researchers to further investigate ChatGPT's behavior with hypothetical user profiles.

Published
2024

35. Density Fluctuations, Solvation Thermodynamics and Coexistence Curves in Grand Canonical Molecular Dynamics Simulations

Author

Sevilla, Mauricio, Baptista, Luis A., Kremer, Kurt, and Cortes-Huerto, Robinson

Subjects
Condensed Matter - Soft Condensed Matter
Abstract

Fluid transport across nanometric channels induced by electric, pressure and concentration gradients is ubiquitous in biological systems and fosters various applications. In this context, computer simulation setups with well-defined open-boundary equilibrium starting states are essential in understanding and assisting experimental studies. However, open-boundary computational methods are scarce and typically do not satisfy all the equilibrium conditions imposed by reality. Namely, in the absence of external gradients, 1) the system of interest (SoI) must be at thermodynamic and chemical equilibrium with an infinite reservoir of particles, 2) the fluctuations of the SoI in equilibrium should sample the grand canonical ensemble, 3) the local solvation thermodynamics, which is extremely sensitive to finite-size effects due to solvent depletion, should be correctly described. This point is particularly relevant for out-of-equilibrium systems. Finally, 4) the method should be robust enough to deal with phase transitions and coexistence conditions in the SoI. In this study, we demonstrate with prototypical liquid systems embedded into a reservoir of ideal gas particles that the adaptive resolution simulation (AdResS) method, coupled with particle insertion/deletion steps, satisfies all these requirements. Therefore, this AdResS setup is suitable for performing equilibrium and non-equilibrium simulations of open systems.

Published
2024

36. Rise and Shine Efficiently! The Complexity of Adversarial Wake-up in Asynchronous Networks

Author

Robinson, Peter and Tan, Ming Ming

Subjects
Computer Science - Distributed, Parallel, and Cluster Computing
Abstract

We study the wake-up problem in distributed networks, where an adversary awakens a subset of nodes at arbitrary times, and the goal is to wake up all other nodes as quickly as possible by sending only few messages. We prove the following lower bounds: * We first consider the setting where each node receives advice from an oracle who can observe the entire network, but does not know which nodes are awake initially. More specifically, we consider the $KT_0$ $LOCAL$ model with advice, where the nodes have no prior knowledge of their neighbors. We prove that any randomized algorithm must send $\Omega( \frac{n^{2}}{2^{\beta}\log n} )$ messages if nodes receive only $O(\beta)$ bits of advice on average. * For the $KT_1$ assumption, where each node knows its neighbors' IDs from the start, we show that any $(k+1)$-time algorithm requires $\Omega( n^{1+1/k} )$ messages. Our result is the first super-linear (in $n$) lower bound, for a problem that does not require individual nodes to learn a large amount of information about the network topology, which may be of independent interest. To complement our lower bound results, we present several new algorithms: * We give an asynchronous $KT_1$ $LOCAL$ algorithm that solves the wake-up problem with a time and message complexity of $O( n\log n )$ with high probability. * We introduce the notion of \emph{awake distance} $\rho_{\text{awk}}$, which is upper-bounded by the network diameter, and present a synchronous $KT_1$ $LOCAL$ algorithm that takes $O( \rho_{\text{awk}} )$ rounds and sends $O( n^{3/2}\sqrt{\log n} )$ messages with high probability. * We give deterministic advising schemes in the asynchronous $KT_0$ $CONGEST$ model (with advice). In particular, we obtain an $O( \rho_{\text{awk}}\log^2n )$-time advising scheme that sends $O( n\log^2n )$ messages, while requiring $O( \log^2n )$ bits of advice per node., Comment: Added Theorem 4

Published
2024

37. Improving Colorectal Cancer Screening and Risk Assessment through Predictive Modeling on Medical Images and Records

Author

Jiang, Shuai, Robinson, Christina, Anderson, Joseph, Hisey, William, Butterly, Lynn, Suriawinata, Arief, and Hassanpour, Saeed

Subjects
Computer Science - Computer Vision and Pattern Recognition, Computer Science - Machine Learning
Abstract

Colonoscopy screening is an effective method to find and remove colon polyps before they can develop into colorectal cancer (CRC). Current follow-up recommendations, as outlined by the U.S. Multi-Society Task Force for individuals found to have polyps, primarily rely on histopathological characteristics, neglecting other significant CRC risk factors. Moreover, the considerable variability in colorectal polyp characterization among pathologists poses challenges in effective colonoscopy follow-up or surveillance. The evolution of digital pathology and recent advancements in deep learning provide a unique opportunity to investigate the added benefits of including the additional medical record information and automatic processing of pathology slides using computer vision techniques in the calculation of future CRC risk. Leveraging the New Hampshire Colonoscopy Registry's extensive dataset, many with longitudinal colonoscopy follow-up information, we adapted our recently developed transformer-based model for histopathology image analysis in 5-year CRC risk prediction. Additionally, we investigated various multimodal fusion techniques, combining medical record information with deep learning derived risk estimates. Our findings reveal that training a transformer model to predict intermediate clinical variables contributes to enhancing 5-year CRC risk prediction performance, with an AUC of 0.630 comparing to direct prediction. Furthermore, the fusion of imaging and non-imaging features, while not requiring manual inspection of microscopy images, demonstrates improved predictive capabilities for 5-year CRC risk comparing to variables extracted from colonoscopy procedure and microscopy findings. This study signifies the potential of integrating diverse data sources and advanced computational techniques in transforming the accuracy and effectiveness of future CRC risk assessments.

Published
2024

38. Refusal-Trained LLMs Are Easily Jailbroken As Browser Agents

Author

Kumar, Priyanshu, Lau, Elaine, Vijayakumar, Saranya, Trinh, Tu, Team, Scale Red, Chang, Elaine, Robinson, Vaughn, Hendryx, Sean, Zhou, Shuyan, Fredrikson, Matt, Yue, Summer, and Wang, Zifan

Subjects
Computer Science - Cryptography and Security, Computer Science - Machine Learning
Abstract

For safety reasons, large language models (LLMs) are trained to refuse harmful user instructions, such as assisting dangerous activities. We study an open question in this work: does the desired safety refusal, typically enforced in chat contexts, generalize to non-chat and agentic use cases? Unlike chatbots, LLM agents equipped with general-purpose tools, such as web browsers and mobile devices, can directly influence the real world, making it even more crucial to refuse harmful instructions. In this work, we primarily focus on red-teaming browser agents, LLMs that manipulate information via web browsers. To this end, we introduce Browser Agent Red teaming Toolkit (BrowserART), a comprehensive test suite designed specifically for red-teaming browser agents. BrowserART is consist of 100 diverse browser-related harmful behaviors (including original behaviors and ones sourced from HarmBench [Mazeika et al., 2024] and AirBench 2024 [Zeng et al., 2024b]) across both synthetic and real websites. Our empirical study on state-of-the-art browser agents reveals that, while the backbone LLM refuses harmful instructions as a chatbot, the corresponding agent does not. Moreover, attack methods designed to jailbreak refusal-trained LLMs in the chat settings transfer effectively to browser agents. With human rewrites, GPT-4o and o1-preview-based browser agents attempted 98 and 63 harmful behaviors (out of 100), respectively. We publicly release BrowserART and call on LLM developers, policymakers, and agent developers to collaborate on improving agent safety

Published
2024

39. A search using GEO600 for gravitational waves coincident with fast radio bursts from SGR 1935+2154

Author

The LIGO Scientific Collaboration, the Virgo Collaboration, the KAGRA Collaboration, Abac, A. G., Abbott, R., Abouelfettouh, I., Acernese, F., Ackley, K., Adhicary, S., Adhikari, N., Adhikari, R. X., Adkins, V. K., Agarwal, D., Agathos, M., Abchouyeh, M. Aghaei, Aguiar, O. D., Aguilar, I., Aiello, L., Ain, A., Ajith, P., Akutsu, T., Albanesi, S., Alfaidi, R. A., Al-Jodah, A., Alléné, C., Allocca, A., Al-Shammari, S., Altin, P. A., Alvarez-Lopez, S., Amato, A., Amez-Droz, L., Amorosi, A., Amra, C., Ananyeva, A., Anderson, S. B., Anderson, W. G., Andia, M., Ando, M., Andrade, T., Andres, N., Andrés-Carcasona, M., Andrić, T., Anglin, J., Ansoldi, S., Antelis, J. M., Antier, S., Aoumi, M., Appavuravther, E. Z., Appert, S., Apple, S. K., Arai, K., Araya, A., Araya, M. C., Areeda, J. S., Argianas, L., Aritomi, N., Armato, F., Arnaud, N., Arogeti, M., Aronson, S. M., Ashton, G., Aso, Y., Assiduo, M., Melo, S. Assis de Souza, Aston, S. M., Astone, P., Attadio, F., Aubin, F., AultONeal, K., Avallone, G., Azrad, D., Babak, S., Badaracco, F., Badger, C., Bae, S., Bagnasco, S., Bagui, E., Baier, J. G., Baiotti, L., Bajpai, R., Baka, T., Ball, M., Ballardin, G., Ballmer, S. W., Banagiri, S., Banerjee, B., Bankar, D., Baral, P., Barayoga, J. C., Barish, B. C., Barker, D., Barneo, P., Barone, F., Barr, B., Barsotti, L., Barsuglia, M., Barta, D., Bartoletti, A. M., Barton, M. A., Bartos, I., Basak, S., Basalaev, A., Bassiri, R., Basti, A., Bates, D. E., Bawaj, M., Baxi, P., Bayley, J. C., Baylor, A. C., Baynard II, P. A., Bazzan, M., Bedakihale, V. M., Beirnaert, F., Bejger, M., Belardinelli, D., Bell, A. S., Benedetto, V., Benoit, W., Bentley, J. D., Yaala, M. Ben, Bera, S., Berbel, M., Bergamin, F., Berger, B. K., Bernuzzi, S., Beroiz, M., Bersanetti, D., Bertolini, A., Betzwieser, J., Beveridge, D., Bevins, N., Bhandare, R., Bhardwaj, U., Bhatt, R., Bhattacharjee, D., Bhaumik, S., Bhowmick, S., Bianchi, A., Bilenko, I. A., Billingsley, G., Binetti, A., Bini, S., Birnholtz, O., Biscoveanu, S., Bisht, A., Bitossi, M., Bizouard, M. -A., Blackburn, J. K., Blagg, L. A., Blair, C. D., Blair, D. G., Bobba, F., Bode, N., Boileau, G., Boldrini, M., Bolingbroke, G. N., Bolliand, A., Bonavena, L. D., Bondarescu, R., Bondu, F., Bonilla, E., Bonilla, M. S., Bonino, A., Bonnand, R., Booker, P., Borchers, A., Boschi, V., Bose, S., Bossilkov, V., Boudart, V., Boudon, A., Bozzi, A., Bradaschia, C., Brady, P. R., Braglia, M., Branch, A., Branchesi, M., Brandt, J., Braun, I., Breschi, M., Briant, T., Brillet, A., Brinkmann, M., Brockill, P., Brockmueller, E., Brooks, A. F., Brown, B. C., Brown, D. D., Brozzetti, M. L., Brunett, S., Bruno, G., Bruntz, R., Bryant, J., Bucci, F., Buchanan, J., Bulashenko, O., Bulik, T., Bulten, H. J., Buonanno, A., Burtnyk, K., Buscicchio, R., Buskulic, D., Buy, C., Byer, R. L., Davies, G. S. Cabourn, Cabras, G., Cabrita, R., Cáceres-Barbosa, V., Cadonati, L., Cagnoli, G., Cahillane, C., Bustillo, J. Calderón, Callister, T. A., Calloni, E., Camp, J. B., Canepa, M., Santoro, G. Caneva, Cannon, K. C., Cao, H., Capistran, L. A., Capocasa, E., Capote, E., Carapella, G., Carbognani, F., Carlassara, M., Carlin, J. B., Carpinelli, M., Carrillo, G., Carter, J. J., Carullo, G., Diaz, J. Casanueva, Casentini, C., Castro-Lucas, S. Y., Caudill, S., Cavaglià, M., Cavalieri, R., Cella, G., Cerdá-Durán, P., Cesarini, E., Chaibi, W., Chakraborty, P., Subrahmanya, S. Chalathadka, Chan, J. C. L., Chan, M., Chandra, K., Chang, R. -J., Chao, S., Charlton, E. L., Charlton, P., Chassande-Mottin, E., Chatterjee, C., Chatterjee, Debarati, Chatterjee, Deep, Chaturvedi, M., Chaty, S., Chen, A., Chen, A. H. -Y., Chen, D., Chen, H., Chen, H. Y., Chen, J., Chen, K. H., Chen, Y., Chen, Yanbei, Chen, Yitian, Cheng, H. P., Chessa, P., Cheung, H. T., Cheung, S. Y., Chiadini, F., Chiarini, G., Chierici, R., Chincarini, A., Chiofalo, M. L., Chiummo, A., Chou, C., Choudhary, S., Christensen, N., Chua, S. S. Y., Chugh, P., Ciani, G., Ciecielag, P., Cieślar, M., Cifaldi, M., Ciolfi, R., Clara, F., Clark, J. A., Clarke, J., Clarke, T. A., Clearwater, P., Clesse, S., Coccia, E., Codazzo, E., Cohadon, P. -F., Colace, S., Colleoni, M., Collette, C. G., Collins, J., Colloms, S., Colombo, A., Colpi, M., Compton, C. M., Connolly, G., Conti, L., Corbitt, T. R., Cordero-Carrión, I., Corezzi, S., Cornish, N. J., Corsi, A., Cortese, S., Costa, C. A., Cottingham, R., Coughlin, M. W., Couineaux, A., Coulon, J. -P., Countryman, S. T., Coupechoux, J. -F., Couvares, P., Coward, D. M., Cowart, M. J., Coyne, R., Craig, K., Creed, R., Creighton, J. D. E., Creighton, T. D., Cremonese, P., Criswell, A. W., Crockett-Gray, J. C. G., Crook, S., Crouch, R., Csizmazia, J., Cudell, J. R., Cullen, T. J., Cumming, A., Cuoco, E., Cusinato, M., Dabadie, P., Canton, T. Dal, Dall'Osso, S., Pra, S. Dal, Dálya, G., D'Angelo, B., Danilishin, S., D'Antonio, S., Danzmann, K., Darroch, K. E., Dartez, L. P., Dasgupta, A., Datta, S., Dattilo, V., Daumas, A., Davari, N., Dave, I., Davenport, A., Davier, M., Davies, T. F., Davis, D., Davis, L., Davis, M. C., Davis, P. J., Dax, M., De Bolle, J., Deenadayalan, M., Degallaix, J., De Laurentis, M., Deléglise, S., De Lillo, F., Dell'Aquila, D., Del Pozzo, W., De Marco, F., De Matteis, F., D'Emilio, V., Demos, N., Dent, T., Depasse, A., DePergola, N., De Pietri, R., De Rosa, R., De Rossi, C., DeSalvo, R., De Simone, R., Dhani, A., Diab, R., Díaz, M. C., Di Cesare, M., Dideron, G., Didio, N. A., Dietrich, T., Di Fiore, L., Di Fronzo, C., Di Giovanni, M., Di Girolamo, T., Diksha, D., Di Michele, A., Ding, J., Di Pace, S., Di Palma, I., Di Renzo, F., Divyajyoti, Dmitriev, A., Doctor, Z., Dohmen, E., Doleva, P. P., Dominguez, D., D'Onofrio, L., Donovan, F., Dooley, K. L., Dooney, T., Doravari, S., Dorosh, O., Drago, M., Driggers, J. C., Ducoin, J. -G., Dunn, L., Dupletsa, U., D'Urso, D., Duval, H., Duverne, P. -A., Dwyer, S. E., Eassa, C., Ebersold, M., Eckhardt, T., Eddolls, G., Edelman, B., Edo, T. B., Edy, O., Effler, A., Eichholz, J., Einsle, H., Eisenmann, M., Eisenstein, R. A., Ejlli, A., Eleveld, R. M., Emma, M., Endo, K., Engl, A. J., Enloe, E., Errico, L., Essick, R. C., Estellés, H., Estevez, D., Etzel, T., Evans, M., Evstafyeva, T., Ewing, B. E., Ezquiaga, J. M., Fabrizi, F., Faedi, F., Fafone, V., Fairhurst, S., Farah, A. M., Farr, B., Farr, W. M., Favaro, G., Favata, M., Fays, M., Fazio, M., Feicht, J., Fejer, M. M., Felicetti, R. ., Fenyvesi, E., Ferguson, D. L., Ferraiuolo, S., Ferrante, I., Ferreira, T. A., Fidecaro, F., Figura, P., Fiori, A., Fiori, I., Fishbach, M., Fisher, R. P., Fittipaldi, R., Fiumara, V., Flaminio, R., Fleischer, S. M., Fleming, L. S., Floden, E., Foley, E. M., Fong, H., Font, J. A., Fornal, B., Forsyth, P. W. F., Franceschetti, K., Franchini, N., Frasca, S., Frasconi, F., Mascioli, A. Frattale, Frei, Z., Freise, A., Freitas, O., Frey, R., Frischhertz, W., Fritschel, P., Frolov, V. V., Fronzé, G. G., Fuentes-Garcia, M., Fujii, S., Fujimori, T., Fulda, P., Fyffe, M., Gadre, B., Gair, J. R., Galaudage, S., Galdi, V., Gallagher, H., Gallardo, S., Gallego, B., Gamba, R., Gamboa, A., Ganapathy, D., Ganguly, A., Garaventa, B., García-Bellido, J., Núñez, C. García, García-Quirós, C., Gardner, J. W., Gardner, K. A., Gargiulo, J., Garron, A., Garufi, F., Gasbarra, C., Gateley, B., Gayathri, V., Gemme, G., Gennai, A., Gennari, V., George, J., George, R., Gerberding, O., Gergely, L., Ghonge, S., Ghosh, Archisman, Ghosh, Sayantan, Ghosh, Shaon, Ghosh, Shrobana, Ghosh, Suprovo, Ghosh, Tathagata, Giacoppo, L., Giaime, J. A., Giardina, K. D., Gibson, D. R., Gibson, D. T., Gier, C., Giri, P., Gissi, F., Gkaitatzis, S., Glanzer, J., Glotin, F., Godfrey, J., Godwin, P., Goebbels, N. L., Goetz, E., Golomb, J., Lopez, S. Gomez, Goncharov, B., Gong, Y., González, G., Goodarzi, P., Goode, S., Goodwin-Jones, A. W., Gosselin, M., Göttel, A. S., Gouaty, R., Gould, D. W., Govorkova, K., Goyal, S., Grace, B., Grado, A., Graham, V., Granados, A. E., Granata, M., Granata, V., Gras, S., Grassia, P., Gray, A., Gray, C., Gray, R., Greco, G., Green, A. C., Green, S. M., Green, S. R., Gretarsson, A. M., Gretarsson, E. M., Griffith, D., Griffiths, W. L., Griggs, H. L., Grignani, G., Grimaldi, A., Grimaud, C., Grote, H., Guerra, D., Guetta, D., Guidi, G. M., Guimaraes, A. R., Gulati, H. K., Gulminelli, F., Gunny, A. M., Guo, H., Guo, W., Guo, Y., Gupta, Anchal, Gupta, Anuradha, Gupta, Ish, Gupta, N. C., Gupta, P., Gupta, S. K., Gupta, T., Gupte, N., Gurs, J., Gutierrez, N., Guzman, F., H, H. -Y., Haba, D., Haberland, M., Haino, S., Hall, E. D., Hamilton, E. Z., Hammond, G., Han, W. -B., Haney, M., Hanks, J., Hanna, C., Hannam, M. D., Hannuksela, O. A., Hanselman, A. G., Hansen, H., Hanson, J., Harada, R., Hardison, A. R., Haris, K., Harmark, T., Harms, J., Harry, G. M., Harry, I. W., Hart, J., Haskell, B., Haster, C. -J., Hathaway, J. S., Haughian, K., Hayakawa, H., Hayama, K., Hayes, R., Heffernan, A., Heidmann, A., Heintze, M. C., Heinze, J., Heinzel, J., Heitmann, H., Hellman, F., Hello, P., Helmling-Cornell, A. F., Hemming, G., Henderson-Sapir, O., Hendry, M., Heng, I. S., Hennes, E., Henshaw, C., Hertog, T., Heurs, M., Hewitt, A. L., Heyns, J., Higginbotham, S., Hild, S., Hill, S., Himemoto, Y., Hirata, N., Hirose, C., Ho, W. C. G., Hoang, S., Hochheim, S., Hofman, D., Holland, N. A., Holley-Bockelmann, K., Holmes, Z. J., Holz, D. E., Honet, L., Hong, C., Hornung, J., Hoshino, S., Hough, J., Hourihane, S., Howell, E. J., Hoy, C. G., Hrishikesh, C. A., Hsieh, H. -F., Hsiung, C., Hsu, H. C., Hsu, W. -F., Hu, P., Hu, Q., Huang, H. Y., Huang, Y. -J., Huddart, A. D., Hughey, B., Hui, D. C. Y., Hui, V., Husa, S., Huxford, R., Huynh-Dinh, T., Iampieri, L., Iandolo, G. A., Ianni, M., Iess, A., Imafuku, H., Inayoshi, K., Inoue, Y., Iorio, G., Iqbal, M. H., Irwin, J., Ishikawa, R., Isi, M., Ismail, M. A., Itoh, Y., Iwanaga, H., Iwaya, M., Iyer, B. R., JaberianHamedan, V., Jacquet, C., Jacquet, P. -E., Jadhav, S. J., Jadhav, S. P., Jain, T., James, A. L., James, P. A., Jamshidi, R., Janquart, J., Janssens, K., Janthalur, N. N., Jaraba, S., Jaranowski, P., Jaume, R., Javed, W., Jennings, A., Jia, W., Jiang, J., Kubisz, J., Johanson, C., Johns, G. R., Johnson, N. A., Johnston, M. C., Johnston, R., Johny, N., Jones, D. H., Jones, D. I., Jones, R., Jose, S., Joshi, P., Ju, L., Jung, K., Junker, J., Juste, V., Kajita, T., Kaku, I., Kalaghatgi, C., Kalogera, V., Kamiizumi, M., Kanda, N., Kandhasamy, S., Kang, G., Kanner, J. B., Kapadia, S. J., Kapasi, D. P., Karat, S., Karathanasis, C., Kashyap, R., Kasprzack, M., Kastaun, W., Kato, T., Katsavounidis, E., Katzman, W., Kaushik, R., Kawabe, K., Kawamoto, R., Kazemi, A., Keitel, D., Kelley-Derzon, J., Kennington, J., Kesharwani, R., Key, J. S., Khadela, R., Khadka, S., Khalili, F. Y., Khan, F., Khan, I., Khanam, T., Khursheed, M., Khusid, N. M., Kiendrebeogo, W., Kijbunchoo, N., Kim, C., Kim, J. C., Kim, K., Kim, M. H., Kim, S., Kim, Y. -M., Kimball, C., Kinley-Hanlon, M., Kinnear, M., Kissel, J. S., Klimenko, S., Knee, A. M., Knust, N., Kobayashi, K., Koch, P., Koehlenbeck, S. M., Koekoek, G., Kohri, K., Kokeyama, K., Koley, S., Kolitsidou, P., Kolstein, M., Komori, K., Kong, A. K. H., Kontos, A., Korobko, M., Kossak, R. V., Kou, X., Koushik, A., Kouvatsos, N., Kovalam, M., Kozak, D. B., Kranzhoff, S. L., Kringel, V., Krishnendu, N. V., Królak, A., Kruska, K., Kuehn, G., Kuijer, P., Kulkarni, S., Ramamohan, A. Kulur, Kumar, A., Kumar, Praveen, Kumar, Prayush, Kumar, Rahul, Kumar, Rakesh, Kume, J., Kuns, K., Kuntimaddi, N., Kuroyanagi, S., Kurth, N. J., Kuwahara, S., Kwak, K., Kwan, K., Kwok, J., Lacaille, G., Lagabbe, P., Laghi, D., Lai, S., Laity, A. H., Lakkis, M. H., Lalande, E., Lalleman, M., Lalremruati, P. C., Landry, M., Lane, B. B., Lang, R. N., Lange, J., Lantz, B., La Rana, A., La Rosa, I., Lartaux-Vollard, A., Lasky, P. D., Lawrence, J., Lawrence, M. N., Laxen, M., Lazzarini, A., Lazzaro, C., Leaci, P., Lecoeuche, Y. K., Lee, H. M., Lee, H. W., Lee, K., Lee, R. -K., Lee, R., Lee, S., Lee, Y., Legred, I. N., Lehmann, J., Lehner, L., Jean, M. Le, Lemaître, A., Lenti, M., Leonardi, M., Lequime, M., Leroy, N., Lesovsky, M., Letendre, N., Lethuillier, M., Levin, S. E., Levin, Y., Leyde, K., Li, A. K. Y., Li, K. L., Li, T. G. F., Li, X., Li, Z., Lihos, A., Lin, C-Y., Lin, C. -Y., Lin, E. T., Lin, F., Lin, H., Lin, L. C. -C., Lin, Y. -C., Linde, F., Linker, S. D., Littenberg, T. B., Liu, A., Liu, G. C., Liu, Jian, Villarreal, F. Llamas, Llobera-Querol, J., Lo, R. K. L., Locquet, J. -P., London, L. T., Longo, A., Lopez, D., Portilla, M. Lopez, Lorenzini, M., Lorenzo-Medina, A., Loriette, V., Lormand, M., Losurdo, G., Lott IV, T. P., Lough, J. D., Loughlin, H. A., Lousto, C. O., Lowry, M. J., Lu, N., Lück, H., Lumaca, D., Lundgren, A. P., Lussier, A. W., Ma, L. -T., Ma, S., Ma'arif, M., Macas, R., Macedo, A., MacInnis, M., Maciy, R. R., Macleod, D. M., MacMillan, I. A. O., Macquet, A., Macri, D., Maeda, K., Maenaut, S., Hernandez, I. Magaña, Magare, S. S., Magazzù, C., Magee, R. M., Maggio, E., Maggiore, R., Magnozzi, M., Mahesh, M., Mahesh, S., Maini, M., Majhi, S., Majorana, E., Makarem, C. N., Makelele, E., Malaquias-Reis, J. A., Mali, U., Maliakal, S., Malik, A., Man, N., Mandic, V., Mangano, V., Mannix, B., Mansell, G. L., Mansingh, G., Manske, M., Mantovani, M., Mapelli, M., Marchesoni, F., Pina, D. Marín, Marion, F., Márka, S., Márka, Z., Markosyan, A. S., Markowitz, A., Maros, E., Marsat, S., Martelli, F., Martin, I. W., Martin, R. M., Martinez, B. B., Martinez, M., Martinez, V., Martini, A., Martinovic, K., Martins, J. C., Martynov, D. V., Marx, E. J., Massaro, L., Masserot, A., Masso-Reid, M., Mastrodicasa, M., Mastrogiovanni, S., Matcovich, T., Matiushechkina, M., Matsuyama, M., Mavalvala, N., Maxwell, N., McCarrol, G., McCarthy, R., McCormick, S., McCuller, L., McEachin, S., McElhenny, C., McGhee, G. I., McGinn, J., McGowan, K. B. M., McIver, J., McLeod, A., McRae, T., Meacher, D., Meijer, Q., Melatos, A., Mellaerts, S., Menendez-Vazquez, A., Menoni, C. S., Mera, F., Mercer, R. A., Mereni, L., Merfeld, K., Merilh, E. L., Mérou, J. R., Merritt, J. D., Merzougui, M., Messenger, C., Messick, C., Meyer-Conde, M., Meylahn, F., Mhaske, A., Miani, A., Miao, H., Michaloliakos, I., Michel, C., Michimura, Y., Middleton, H., Miller, A. L., Miller, S., Millhouse, M., Milotti, E., Milotti, V., Minenkov, Y., Mio, N., Mir, Ll. M., Mirasola, L., Miravet-Tenés, M., Miritescu, C. -A., Mishra, A. K., Mishra, A., Mishra, C., Mishra, T., Mitchell, A. L., Mitchell, J. G., Mitra, S., Mitrofanov, V. P., Mittleman, R., Miyakawa, O., Miyamoto, S., Miyoki, S., Mo, G., Mobilia, L., Mohapatra, S. R. P., Mohite, S. R., Molina-Ruiz, M., Mondal, C., Mondin, M., Montani, M., Moore, C. J., Moraru, D., More, A., More, S., Moreno, G., Morgan, C., Morisaki, S., Moriwaki, Y., Morras, G., Moscatello, A., Mourier, P., Mours, B., Mow-Lowry, C. M., Muciaccia, F., Mukherjee, Arunava, Mukherjee, D., Mukherjee, Samanwaya, Mukherjee, Soma, Mukherjee, Subroto, Mukherjee, Suvodip, Mukund, N., Mullavey, A., Munch, J., Mundi, J., Mungioli, C. L., Oberg, W. R. Munn, Murakami, Y., Murakoshi, M., Murray, P. G., Muusse, S., Nabari, D., Nadji, S. L., Nagar, A., Nagarajan, N., Nagler, K. N., Nakagaki, K., Nakamura, K., Nakano, H., Nakano, M., Nandi, D., Napolano, V., Narayan, P., Nardecchia, I., Narola, H., Naticchioni, L., Nayak, R. K., Neilson, J., Nelson, A., Nelson, T. J. N., Nery, M., Neunzert, A., Ng, S., Quynh, L. Nguyen, Nichols, S. A., Nielsen, A. B., Nieradka, G., Niko, A., Nishino, Y., Nishizawa, A., Nissanke, S., Nitoglia, E., Niu, W., Nocera, F., Norman, M., North, C., Novak, J., Siles, J. F. Nuño, Nuttall, L. K., Obayashi, K., Oberling, J., O'Dell, J., Oertel, M., Offermans, A., Oganesyan, G., Oh, J. J., Oh, K., O'Hanlon, T., Ohashi, M., Ohkawa, M., Ohme, F., Oliveira, A. S., Oliveri, R., O'Neal, B., Oohara, K., O'Reilly, B., Ormsby, N. D., Orselli, M., O'Shaughnessy, R., O'Shea, S., Oshima, Y., Oshino, S., Ossokine, S., Osthelder, C., Ota, I., Ottaway, D. J., Ouzriat, A., Overmier, H., Owen, B. J., Pace, A. E., Pagano, R., Page, M. A., Pai, A., Pal, A., Pal, S., Palaia, M. A., Pálfi, M., Palma, P. P., Palomba, C., Palud, P., Pan, H., Pan, J., Pan, K. C., Panai, R., Panda, P. K., Pandey, S., Panebianco, L., Pang, P. T. H., Pannarale, F., Pannone, K. A., Pant, B. C., Panther, F. H., Paoletti, F., Paolone, A., Papalexakis, E. E., Papalini, L., Papigkiotis, G., Paquis, A., Parisi, A., Park, B. -J., Park, J., Parker, W., Pascale, G., Pascucci, D., Pasqualetti, A., Passaquieti, R., Passenger, L., Passuello, D., Patane, O., Pathak, D., Pathak, M., Patra, A., Patricelli, B., Patron, A. S., Paul, K., Paul, S., Payne, E., Pearce, T., Pedraza, M., Pegna, R., Pele, A., Arellano, F. E. Peña, Penn, S., Penuliar, M. D., Perego, A., Pereira, Z., Perez, J. J., Périgois, C., Perna, G., Perreca, A., Perret, J., Perriès, S., Perry, J. W., Pesios, D., Petracca, S., Petrillo, C., Pfeiffer, H. P., Pham, H., Pham, K. A., Phukon, K. S., Phurailatpam, H., Piarulli, M., Piccari, L., Piccinni, O. J., Pichot, M., Piendibene, M., Piergiovanni, F., Pierini, L., Pierra, G., Pierro, V., Pietrzak, M., Pillas, M., Pilo, F., Pinard, L., Pinto, I. M., Pinto, M., Piotrzkowski, B. J., Pirello, M., Pitkin, M. D., Placidi, A., Placidi, E., Planas, M. L., Plastino, W., Poggiani, R., Polini, E., Pompili, L., Poon, J., Porcelli, E., Porter, E. K., Posnansky, C., Poulton, R., Powell, J., Pracchia, M., Pradhan, B. K., Pradier, T., Prajapati, A. K., Prasai, K., Prasanna, R., Prasia, P., Pratten, G., Principe, G., Principe, M., Prodi, G. A., Prokhorov, L., Prosposito, P., Puecher, A., Pullin, J., Punturo, M., Puppo, P., Pürrer, M., Qi, H., Qin, J., Quéméner, G., Quetschke, V., Quigley, C., Quinonez, P. J., Quitzow-James, R., Raab, F. J., Raabith, S. S., Raaijmakers, G., Raja, S., Rajan, C., Rajbhandari, B., Ramirez, K. E., Vidal, F. A. Ramis, Ramos-Buades, A., Rana, D., Ranjan, S., Ransom, K., Rapagnani, P., Ratto, B., Rawat, S., Ray, A., Raymond, V., Razzano, M., Read, J., Payo, M. Recaman, Regimbau, T., Rei, L., Reid, S., Reitze, D. H., Relton, P., Renzini, A. I., Rettegno, P., Revenu, B., Reyes, R., Rezaei, A. S., Ricci, F., Ricci, M., Ricciardone, A., Richardson, J. W., Richardson, M., Rijal, A., Riles, K., Riley, H. K., Rinaldi, S., Rittmeyer, J., Robertson, C., Robinet, F., Robinson, M., Rocchi, A., Rolland, L., Rollins, J. G., Romano, A. E., Romano, R., Romero, A., Romero-Shaw, I. M., Romie, J. H., Ronchini, S., Roocke, T. J., Rosa, L., Rosauer, T. J., Rose, C. A., Rosińska, D., Ross, M. P., Rossello, M., Rowan, S., Roy, S. K., Roy, S., Rozza, D., Ruggi, P., Ruhama, N., Morales, E. Ruiz, Ruiz-Rocha, K., Sachdev, S., Sadecki, T., Sadiq, J., Saffarieh, P., Sah, M. R., Saha, S. S., Saha, S., Sainrat, T., Menon, S. Sajith, Sakai, K., Sakellariadou, M., Sakon, S., Salafia, O. S., Salces-Carcoba, F., Salconi, L., Saleem, M., Salemi, F., Sallé, M., Salvador, S., Sanchez, A., Sanchez, E. J., Sanchez, J. H., Sanchez, L. E., Sanchis-Gual, N., Sanders, J. R., Sänger, E. M., Santoliquido, F., Saravanan, T. R., Sarin, N., Sasaoka, S., Sasli, A., Sassi, P., Sassolas, B., Satari, H., Sato, R., Sato, Y., Sauter, O., Savage, R. L., Sawada, T., Sawant, H. L., Sayah, S., Scacco, V., Schaetzl, D., Scheel, M., Schiebelbein, A., Schiworski, M. G., Schmidt, P., Schmidt, S., Schnabel, R., Schneewind, M., Schofield, R. M. S., Schouteden, K., Schulte, B. W., Schutz, B. F., Schwartz, E., Scialpi, M., Scott, J., Scott, S. M., Seetharamu, T. C., Seglar-Arroyo, M., Sekiguchi, Y., Sellers, D., Sengupta, A. S., Sentenac, D., Seo, E. G., Seo, J. W., Sequino, V., Serra, M., Servignat, G., Sevrin, A., Shaffer, T., Shah, U. S., Shaikh, M. A., Shao, L., Sharma, A. K., Sharma, P., Sharma-Chaudhary, S., Shaw, M. R., Shawhan, P., Shcheblanov, N. S., Sheridan, E., Shikano, Y., Shikauchi, M., Shimode, K., Shinkai, H., Shiota, J., Shoemaker, D. H., Shoemaker, D. M., Short, R. W., ShyamSundar, S., Sider, A., Siegel, H., Sieniawska, M., Sigg, D., Silenzi, L., Simmonds, M., Singer, L. P., Singh, A., Singh, D., Singh, M. K., Singh, S., Singha, A., Sintes, A. M., Sipala, V., Skliris, V., Slagmolen, B. J. J., Slaven-Blair, T. J., Smetana, J., Smith, J. R., Smith, L., Smith, R. J. E., Smith, W. J., Soldateschi, J., Somiya, K., Song, I., Soni, K., Soni, S., Sordini, V., Sorrentino, F., Sorrentino, N., Sotani, H., Soulard, R., Southgate, A., Spagnuolo, V., Spencer, A. P., Spera, M., Spinicelli, P., Spoon, J. B., Sprague, C. A., Srivastava, A. K., Stachurski, F., Steer, D. A., Steinlechner, J., Steinlechner, S., Stergioulas, N., Stevens, P., StPierre, M., Stratta, G., Strong, M. D., Strunk, A., Sturani, R., Stuver, A. L., Suchenek, M., Sudhagar, S., Sueltmann, N., Suleiman, L., Sullivan, K. D., Sun, L., Sunil, S., Suresh, J., Sutton, P. J., Suzuki, T., Suzuki, Y., Swinkels, B. L., Syx, A., Szczepańczyk, M. J., Szewczyk, P., Tacca, M., Tagoshi, H., Tait, S. C., Takahashi, H., Takahashi, R., Takamori, A., Takase, T., Takatani, K., Takeda, H., Takeshita, K., Talbot, C., Tamaki, M., Tamanini, N., Tanabe, D., Tanaka, K., Tanaka, S. J., Tanaka, T., Tang, D., Tanioka, S., Tanner, D. B., Tao, L., Tapia, R. D., Martín, E. N. Tapia San, Tarafder, R., Taranto, C., Taruya, A., Tasson, J. D., Teloi, M., Tenorio, R., Themann, H., Theodoropoulos, A., Thirugnanasambandam, M. P., Thomas, L. M., Thomas, M., Thomas, P., Thompson, J. E., Thondapu, S. R., Thorne, K. A., Thrane, E., Tissino, J., Tiwari, A., Tiwari, P., Tiwari, S., Tiwari, V., Todd, M. R., Toivonen, A. M., Toland, K., Tolley, A. E., Tomaru, T., Tomita, K., Tomura, T., Tong-Yu, C., Toriyama, A., Toropov, N., Torres-Forné, A., Torrie, C. I., Toscani, M., Melo, I. Tosta e, Tournefier, E., Trapananti, A., Travasso, F., Traylor, G., Trevor, M., Tringali, M. C., Tripathee, A., Troian, G., Troiano, L., Trovato, A., Trozzo, L., Trudeau, R. J., Tsang, T. T. L., Tso, R., Tsuchida, S., Tsukada, L., Tsutsui, T., Turbang, K., Turconi, M., Turski, C., Ubach, H., Uchiyama, T., Udall, R. P., Uehara, T., Uematsu, M., Ueno, K., Ueno, S., Undheim, V., Ushiba, T., Vacatello, M., Vahlbruch, H., Vaidya, N., Vajente, G., Vajpeyi, A., Valdes, G., Valencia, J., Valentini, M., Vallejo-Peña, S. A., Vallero, S., Valsan, V., van Bakel, N., van Beuzekom, M., van Dael, M., Brand, J. F. J. van den, Broeck, C. Van Den, Vander-Hyde, D. C., van der Sluys, M., Van de Walle, A., van Dongen, J., Vandra, K., van Haevermaet, H., van Heijningen, J. V., Van Hove, P., VanKeuren, M., Vanosky, J., van Putten, M. H. P. M., van Ranst, Z., van Remortel, N., Vardaro, M., Vargas, A. F., Varghese, J. J., Varma, V., Vasúth, M., Vecchio, A., Vedovato, G., Veitch, J., Veitch, P. J., Venikoudis, S., Venneberg, J., Verdier, P., Verkindt, D., Verma, B., Verma, P., Verma, Y., Vermeulen, S. M., Vetrano, F., Veutro, A., Vibhute, A. M., Viceré, A., Vidyant, S., Viets, A. D., Vijaykumar, A., Vilkha, A., Villa-Ortega, V., Vincent, E. T., Vinet, J. -Y., Viret, S., Virtuoso, A., Vitale, S., Vives, A., Vocca, H., Voigt, D., von Reis, E. R. G., von Wrangel, J. S. A., Vyatchanin, S. P., Wade, L. E., Wade, M., Wagner, K. J., Wajid, A., Walker, M., Wallace, G. S., Wallace, L., Wang, H., Wang, J. Z., Wang, W. H., Wang, Z., Waratkar, G., Warner, J., Was, M., Washimi, T., Washington, N. Y., Watarai, D., Wayt, K. E., Weaver, B. R., Weaver, B., Weaving, C. R., Webster, S. A., Weinert, M., Weinstein, A. J., Weiss, R., Wellmann, F., Wen, L., Weßels, P., Wette, K., Whelan, J. T., Whiting, B. F., Whittle, C., Wildberger, J. B., Wilk, O. S., Wilken, D., Wilkin, A. T., Willadsen, D. J., Willetts, K., Williams, D., Williams, M. J., Williams, N. S., Willis, J. L., Willke, B., Wils, M., Winterflood, J., Wipf, C. C., Woan, G., Woehler, J., Wofford, J. K., Wolfe, N. E., Wong, H. T., Wong, H. W. Y., Wong, I. C. F., Wright, J. L., Wright, M., Wu, C., Wu, D. S., Wu, H., Wuchner, E., Wysocki, D. M., Xu, V. A., Xu, Y., Yadav, N., Yamamoto, H., Yamamoto, K., Yamamoto, T. S., Yamamoto, T., Yamamura, S., Yamazaki, R., Yan, S., Yan, T., Yang, F. W., Yang, F., Yang, K. Z., Yang, Y., Yarbrough, Z., Yasui, H., Yeh, S. -W., Yelikar, A. B., Yin, X., Yokoyama, J., Yokozawa, T., Yoo, J., Yu, H., Yuan, S., Yuzurihara, H., Zadrożny, A., Zanolin, M., Zeeshan, M., Zelenova, T., Zendri, J. -P., Zeoli, M., Zerrad, M., Zevin, M., Zhang, A. C., Zhang, L., Zhang, R., Zhang, T., Zhang, Y., Zhao, C., Zhao, Yue, Zhao, Yuhang, Zheng, Y., Zhong, H., Zhou, R., Zhu, X. -J., Zhu, Z. -H., Zucker, M. E., and Zweizig, J.

Subjects
Astrophysics - High Energy Astrophysical Phenomena
Abstract

The magnetar SGR 1935+2154 is the only known Galactic source of fast radio bursts (FRBs). FRBs from SGR 1935+2154 were first detected by CHIME/FRB and STARE2 in 2020 April, after the conclusion of the LIGO, Virgo, and KAGRA Collaborations' O3 observing run. Here we analyze four periods of gravitational wave (GW) data from the GEO600 detector coincident with four periods of FRB activity detected by CHIME/FRB, as well as X-ray glitches and X-ray bursts detected by NICER and NuSTAR close to the time of one of the FRBs. We do not detect any significant GW emission from any of the events. Instead, using a short-duration GW search (for bursts $\leq$ 1 s) we derive 50\% (90\%) upper limits of $10^{48}$ ($10^{49}$) erg for GWs at 300 Hz and $10^{49}$ ($10^{50}$) erg at 2 kHz, and constrain the GW-to-radio energy ratio to $\leq 10^{14} - 10^{16}$. We also derive upper limits from a long-duration search for bursts with durations between 1 and 10 s. These represent the strictest upper limits on concurrent GW emission from FRBs., Comment: 15 pages of text including references, 4 figures, 5 tables

Published
2024

40. The structure of the token space for large language models

Author

Robinson, Michael, Dey, Sourya, and Sweet, Shauna

Subjects
Mathematics - Differential Geometry, Computer Science - Artificial Intelligence, 53Z50, 58Z05
Abstract

Large language models encode the correlational structure present in natural language by fitting segments of utterances (tokens) into a high dimensional ambient latent space upon which the models then operate. We assert that in order to develop a foundational, first-principles understanding of the behavior and limitations of large language models, it is crucial to understand the topological and geometric structure of this token subspace. In this article, we present estimators for the dimension and Ricci scalar curvature of the token subspace, and apply it to three open source large language models of moderate size: GPT2, LLEMMA7B, and MISTRAL7B. In all three models, using these measurements, we find that the token subspace is not a manifold, but is instead a stratified manifold, where on each of the individual strata, the Ricci curvature is significantly negative. We additionally find that the dimension and curvature correlate with generative fluency of the models, which suggest that these findings have implications for model behavior., Comment: 33 pages, 22 figures

Published
2024

41. Increasing the Difficulty of Automatically Generated Questions via Reinforcement Learning with Synthetic Preference

Author

Thorne, William, Robinson, Ambrose, Peng, Bohua, Lin, Chenghua, and Maynard, Diana

Subjects
Computer Science - Computation and Language, Computer Science - Artificial Intelligence, 68T50 (Primary) 91F20 (Secondary), I.2.7, J.5
Abstract

As the cultural heritage sector increasingly adopts technologies like Retrieval-Augmented Generation (RAG) to provide more personalised search experiences and enable conversations with collections data, the demand for specialised evaluation datasets has grown. While end-to-end system testing is essential, it's equally important to assess individual components. We target the final, answering task, which is well-suited to Machine Reading Comprehension (MRC). Although existing MRC datasets address general domains, they lack the specificity needed for cultural heritage information. Unfortunately, the manual creation of such datasets is prohibitively expensive for most heritage institutions. This paper presents a cost-effective approach for generating domain-specific MRC datasets with increased difficulty using Reinforcement Learning from Human Feedback (RLHF) from synthetic preference data. Our method leverages the performance of existing question-answering models on a subset of SQuAD to create a difficulty metric, assuming that more challenging questions are answered correctly less frequently. This research contributes: (1) A methodology for increasing question difficulty using PPO and synthetic data; (2) Empirical evidence of the method's effectiveness, including human evaluation; (3) An in-depth error analysis and study of emergent phenomena; and (4) An open-source codebase and set of three llama-2-chat adapters for reproducibility and adaptation., Comment: is to be published in NLP4DH 2024

Published
2024

42. On the Minimal Theory of Consciousness Implicit in Active Inference

Author

Whyte, Christopher J., Corcoran, Andrew W., Robinson, Jonathan, Smith, Ryan, Moran, Rosalyn J., Parr, Thomas, Friston, Karl J., Seth, Anil K., and Hohwy, Jakob

Subjects
Quantitative Biology - Neurons and Cognition
Abstract

The multifaceted nature of experience poses a challenge to the study of consciousness. Traditional neuroscientific approaches often concentrate on isolated facets, such as perceptual awareness or the global state of consciousness and construct a theory around the relevant empirical paradigms and findings. Theories of consciousness are, therefore, often difficult to compare; indeed, there might be little overlap in the phenomena such theories aim to explain. Here, we take a different approach: starting with active inference, a first principles framework for modelling behaviour as (approximate) Bayesian inference, and building up to a minimal theory of consciousness, which emerges from the shared features of computational models derived under active inference. We review a body of work applying active inference models to the study of consciousness and argue that there is implicit in all these models a small set of theoretical commitments that point to a minimal (and testable) theory of consciousness.

Published
2024

43. Generalized Euler Equation from Effective Action: Implications for the Smarr Formula in AdS Black Holes

Author

Mancilla, Robinson

Subjects
High Energy Physics - Theory, General Relativity and Quantum Cosmology
Abstract

We derived a generalized Euler equation, $\epsilon+p=sT+\mu q+y\frac{\partial p}{\partial y}$, using the effective field theory formulation of perfect fluids. This generalization was achieved by introducing a new variable $y$ into the effective action, which encodes geometrical information about the spacetime where the fluid is on. Notably, the generalized Euler equation is independent of the AdS/CFT correspondence. However, when applied to a holographic perfect fluid, this equation naturally recovers the Smarr formula for AdS black holes, thus situating the physical interpretation of the Smarr formula within the framework of Gauge/Gravity duality. Finally, our findings raise questions regarding the validity of the extended black hole thermodynamics proposal, which associates the cosmological constant $\Lambda$ with a thermodynamic variable., Comment: 21 pages

Published
2024

44. Electric Field Driven Domain Wall Dynamics in BaTiO3 Nanoparticles

Author

Liu, Jialun, Yang, David, Suzana, Ana F., Leake, Steven J., and Robinson, Ian K.

Subjects
Condensed Matter - Materials Science, Condensed Matter - Mesoscale and Nanoscale Physics
Abstract

We report a detailed investigation into the response of single BaTiO3 (BTO) nanocrystals under applied electric fields (E-field) using Bragg Coherent Diffraction Imaging (BCDI). Our study reveals pronounced domain wall migration and expansion of a sample measure in situ under applied electric field. The changes are most prominent at the surface of the nanocrystal, where the lack of external strain allows greater domain wall mobility. The observed domain shifts are correlated to the strength and orientation of the applied E-field, following a side-by-side domain model from Suzana et al. Notably, we identified a critical voltage threshold at +10 V, which leads to irreversible structural changes, suggesting plastic deformation. The findings highlight how surface effects and intrinsic defects contribute to the enhanced dielectric properties of BTO at the nanoscale, in contrast to bulk materials, where strain limits domain mobility. These findings deepen our understanding of nanoscale dielectric behaviour and inform the design of advanced nanoelectronic devices., Comment: 11 pages, 8 figures

Published
2024

45. T2V-Turbo-v2: Enhancing Video Generation Model Post-Training through Data, Reward, and Conditional Guidance Design

Author

Li, Jiachen, Long, Qian, Zheng, Jian, Gao, Xiaofeng, Piramuthu, Robinson, Chen, Wenhu, and Wang, William Yang

Subjects
Computer Science - Computer Vision and Pattern Recognition, Computer Science - Artificial Intelligence
Abstract

In this paper, we focus on enhancing a diffusion-based text-to-video (T2V) model during the post-training phase by distilling a highly capable consistency model from a pretrained T2V model. Our proposed method, T2V-Turbo-v2, introduces a significant advancement by integrating various supervision signals, including high-quality training data, reward model feedback, and conditional guidance, into the consistency distillation process. Through comprehensive ablation studies, we highlight the crucial importance of tailoring datasets to specific learning objectives and the effectiveness of learning from diverse reward models for enhancing both the visual quality and text-video alignment. Additionally, we highlight the vast design space of conditional guidance strategies, which centers on designing an effective energy function to augment the teacher ODE solver. We demonstrate the potential of this approach by extracting motion guidance from the training datasets and incorporating it into the ODE solver, showcasing its effectiveness in improving the motion quality of the generated videos with the improved motion-related metrics from VBench and T2V-CompBench. Empirically, our T2V-Turbo-v2 establishes a new state-of-the-art result on VBench, with a Total score of 85.13, surpassing proprietary systems such as Gen-3 and Kling., Comment: Project Page: https://t2v-turbo-v2.github.io/

Published
2024

46. Tutor CoPilot: A Human-AI Approach for Scaling Real-Time Expertise

Author

Wang, Rose E., Ribeiro, Ana T., Robinson, Carly D., Loeb, Susanna, and Demszky, Dora

Subjects
Computer Science - Computation and Language
Abstract

Generative AI, particularly Language Models (LMs), has the potential to transform real-world domains with societal impact, particularly where access to experts is limited. For example, in education, training novice educators with expert guidance is important for effectiveness but expensive, creating significant barriers to improving education quality at scale. This challenge disproportionately harms students from under-served communities, who stand to gain the most from high-quality education. We introduce Tutor CoPilot, a novel Human-AI approach that leverages a model of expert thinking to provide expert-like guidance to tutors as they tutor. This study is the first randomized controlled trial of a Human-AI system in live tutoring, involving 900 tutors and 1,800 K-12 students from historically under-served communities. Following a preregistered analysis plan, we find that students working with tutors that have access to Tutor CoPilot are 4 percentage points (p.p.) more likely to master topics (p<0.01). Notably, students of lower-rated tutors experienced the greatest benefit, improving mastery by 9 p.p. We find that Tutor CoPilot costs only $20 per-tutor annually. We analyze 550,000+ messages using classifiers to identify pedagogical strategies, and find that tutors with access to Tutor CoPilot are more likely to use high-quality strategies to foster student understanding (e.g., asking guiding questions) and less likely to give away the answer to the student. Tutor interviews highlight how Tutor CoPilot's guidance helps tutors to respond to student needs, though they flag issues in Tutor CoPilot, such as generating suggestions that are not grade-level appropriate. Altogether, our study of Tutor CoPilot demonstrates how Human-AI systems can scale expertise in real-world domains, bridge gaps in skills and create a future where high-quality education is accessible to all students., Comment: Our pre-registration for this randomized controlled trial can be found here: https://osf.io/8d6ha

Published
2024

47. Coal Mining Question Answering with LLMs

Author

Rivera, Antonio Carlos, Moore, Anthony, and Robinson, Steven

Subjects
Computer Science - Computation and Language
Abstract

In this paper, we present a novel approach to coal mining question answering (QA) using large language models (LLMs) combined with tailored prompt engineering techniques. Coal mining is a complex, high-risk industry where accurate, context-aware information is critical for safe and efficient operations. Current QA systems struggle to handle the technical and dynamic nature of mining-related queries. To address these challenges, we propose a multi-turn prompt engineering framework designed to guide LLMs, such as GPT-4, in answering coal mining questions with higher precision and relevance. By breaking down complex queries into structured components, our approach allows LLMs to process nuanced technical information more effectively. We manually curated a dataset of 500 questions from real-world mining scenarios and evaluated the system's performance using both accuracy (ACC) and GPT-4-based scoring metrics. Experiments comparing ChatGPT, Claude2, and GPT-4 across baseline, chain-of-thought (CoT), and multi-turn prompting methods demonstrate that our method significantly improves both accuracy and contextual relevance, with an average accuracy improvement of 15-18\% and a notable increase in GPT-4 scores. The results show that our prompt-engineering approach provides a robust, adaptable solution for domain-specific question answering in high-stakes environments like coal mining.

Published
2024

48. Search for quantum decoherence in neutrino oscillations with six detection units of KM3NeT/ORCA

Author

Aiello, S., Albert, A., Alhebsi, A. R., Alshamsi, M., Garre, S. Alves, Ambrosone, A., Ameli, F., Andre, M., Aphecetche, L., Ardid, M., Ardid, S., Atmani, H., Aublin, J., Badaracco, F., Bailly-Salins, L., Bardacova, Z., Baret, B., Bariego-Quintana, A., Becherini, Y., Bendahman, M., Benfenati, F., Benhassi, M., Bennani, M., Benoit, D. M., Berbee, E., Bertin, V., Biagi, S., Boettcher, M., Bonanno, D., Bouasla, A. B., Boumaaza, J., Bouta, M., Bouwhuis, M., Bozza, C., Bozza, R. M., Branzas, H., Bretaudeau, F., Breuhaus, M., Bruijn, R., Brunner, J., Bruno, R., Buis, E., Buompane, R., Busto, J., Caiffi, B., Calvo, D., Capone, A., Carenini, F., Carretero, V., Cartraud, T., Castaldi, P., Cecchini, V., Celli, S., Cerisy, L., Chabab, M., Chen, A., Cherubini, S., Chiarusi, T., Circella, M., Cocimano, R., Coelho, J. A. B., Coleiro, A., Condorelli, A., Coniglione, R., Coyle, P., Creusot, A., Cuttone, G., Dallier, R., De Benedittis, A., De Martino, B., De Wasseige, G., Decoene, V., Del Rosso, I., Di Mauro, L. S., Di Palma, I., Diaz, A. F., Diego-Tortosa, D., Distefano, C., Domi, A., Donzaud, C., Dornic, D., Drakopoulou, E., Drouhin, D., Ducoin, J. -G., Dvornicky, R., Eberl, T., Eckerova, E., Eddymaoui, A., van Eeden, T., Eff, M., van Eijk, D., Bojaddaini, I. El, Hedri, S. El, Ellajosyula, V., Enzenhoefer, A., Ferrara, G., Filipovic, M. D., Filippini, F., Franciotti, D., Fusco, L. A., Gagliardini, S., Gal, T., Mendez, J. Garcia, Soto, A. Garcia, Oliver, C. Gatius, Geißelbrecht, N., Genton, E., Ghaddari, H., Gialanella, L., Gibson, B. K., Giorgio, E., Goos, I., Goswami, P., Gozzini, S. R., Gracia, R., Guidi, C., Guillon, B., Gutierrez, M., Haack, C., van Haren, H., Heijboer, A., Hennig, L., Hernandez-Rey, J. J., Ibnsalih, W. Idrissi, Illuminati, G., Joly, D., de Jong, M., de Jong, P., Jung, B. J., Kistauri, G., Kopper, C., Kouchner, A., Kovalev, Y. Y., Kueviakoe, V., Kulikovskiy, V., Kvatadze, R., Labalme, M., Lahmann, R., Lamoureux, M., Larosa, G., Lastoria, C., Lazo, A., Stum, S. Le, Lehaut, G., Lemaitre, V., Leonora, E., Lessing, N., Levi, G., Clark, M. Lindsey, Longhitano, F., Magnani, F., Majumdar, J., Malerba, L., Mamedov, F., Manczak, J., Manfreda, A., Marconi, M., Margiotta, A., Marinelli, A., Markou, C., Martin, L., Mastrodicasa, M., Mastroianni, S., Mauro, J., Miele, G., Migliozzi, P., Migneco, E., Mitsou, M. L., Mollo, C. M., Morales-Gallegos, L., Moussa, A., Mateo, I. Mozun, Muller, R., Musone, M. R., Musumeci, M., Navas, S., Nayerhoda, A., Nicolau, C. A., Nkosi, B., Fearraigh, B. O., Oliviero, V., Orlando, A., Oukacha, E., Gonzalez, D. Paesaniy J. Palacios, Papalashvili, G., Parisi, V., Gomez, E. J. Pastor, Pastore, C., Paun, A. M., Pavala, G. E., Martinez, S. Pena, Perrin-Terrin, M., Pestel, V., Pestes, R., Piattelli, P., Plavin, A., Poire, C., Popa, V., Pradier, T., Prado, J., Pulvirenti, S., Quiroz-Rangel, C. A., Randazzo, N., Razzaque, S., Rea, I. C., Real, D., Robinson, G. Riccobene. J., Romanov, A., Ros, E., Saina, A., Greus, F. Salesa, Samtleben, D. F. E., Losa, A. Sanchez, Sanfilippo, S., Sanguineti, M., Santonocito, D., Sapienza, P., Schnabel, J., Schumann, J., Schutte, H. M., Seneca, J., Sgura, I., Shanidze, R., Sharma, A., Shitov, Y., Simkovic, F., Simonelli, A., Sinopoulou, A., Spisso, B., Spurio, M., Stavropoulos, D., Stekl, I., Stellacci, S. M., Taiuti, M., Tayalati, Y., Thiersen, H., Thoudam, S., Tosta, I., Melo, e, Trocme, B., Tsourapis, V., Tudorache, A., Tzamariudaki, E., Ukleja, A., Vacheret, A., Valsecchi, V., Van Elewyck, V., Vannoye, G., Vasileiadis, G., de Sola, F. Vazquez, Veutro, A., Viola, S., Vivolo, D., van Vliet, A., de Wolf, E., Lhenry-Yvon, I., Zavatarelli, S., Zegarelli, A., Zito, D., Zornoza, J. D., Zuniga, J., and Zywucka, N.

Subjects
High Energy Physics - Experiment
Abstract

Neutrinos described as an open quantum system may interact with the environment which introduces stochastic perturbations to their quantum phase. This mechanism leads to a loss of coherence along the propagation of the neutrino $-$ a phenomenon commonly referred to as decoherence $-$ and ultimately, to a modification of the oscillation probabilities. Fluctuations in space-time, as envisaged by various theories of quantum gravity, are a potential candidate for a decoherence-inducing environment. Consequently, the search for decoherence provides a rare opportunity to investigate quantum gravitational effects which are usually beyond the reach of current experiments. In this work, quantum decoherence effects are searched for in neutrino data collected by the KM3NeT/ORCA detector from January 2020 to November 2021. The analysis focuses on atmospheric neutrinos within the energy range of a few GeV to $100\,\mathrm{GeV}$. Adopting the open quantum system framework, decoherence is described in a phenomenological manner with the strength of the effect given by the parameters $\Gamma_{21}$ and $\Gamma_{31}$. Following previous studies, a dependence of the type $\Gamma_{ij} \propto (E/E_0)^n$ on the neutrino energy is assumed and the cases $n = -2,-1$ are explored. No significant deviation with respect to the standard oscillation hypothesis is observed. Therefore, $90\,\%$ CL upper limits are estimated as $\Gamma_{21} < 4.6\cdot 10^{-21}\,$GeV and $\Gamma_{31} < 8.4\cdot 10^{-21}\,$GeV for $n = -2$, and $\Gamma_{21} < 1.9\cdot 10^{-22}\,$GeV and $\Gamma_{31} < 2.7\cdot 10^{-22}\,$GeV for $n = -1$, respectively., Comment: 17 pages, 5 figures

Published
2024

49. Giant and Tunable Bosonic Quantum Interference Induced by Two-Dimensional Metals

Author

Zhang, Kunyan, Maniyara, Rinu Abraham, Wang, Yuanxi, Jain, Arpit, Wetherington, Maxwell T., Mai, Thuc T., Dong, Chengye, Bowen, Timothy, Wang, Ke, Rotkin, Slava V., Walker, Angela R. Hight, Crespi, Vincent H., Robinson, Joshua, and Huang, Shengxi

Subjects
Condensed Matter - Materials Science
Abstract

Harnessing quantum interference among bosons provides significant opportunities as bosons often carry longer coherence time than fermions. As an example of quantum interference, Fano resonance involving phonons or photons describes the coupling between discrete and continuous states, signified by an asymmetric spectral lineshape. Utilizing photon-based Fano resonance, molecule sensing with ultra-high sensitivity and ultrafast optical switching has been realized. However, phonon-based Fano resonance, which would expand the application space to a vaster regime, has been less exploited because of the weak coupling between discrete phonons with continuous states such as electronic continuum. In this work, we report the discovery of giant phonon-based Fano resonance in a graphene/2D Ag/SiC heterostructure. The Fano asymmetry, being proportional to the coupling strength, exceeds prior reports by two orders of magnitude. This Fano asymmetry arises from simultaneous frequency and lifetime matching between discrete and continuous phonons of SiC. The introduction of 2D Ag layers restructures SiC at the interface and facilitates resonant scattering to further enhance the Fano asymmetry, which is not achievable with conventional Ag thin films. With these unique properties, we demonstrated that the phonon-based Fano resonance can be used for ultrasensitive molecule detection at the single-molecule level. Our work highlights strong Fano resonance in the phononic system, opening avenues for engineering quantum interference based on bosons. Further, our findings provide opportunities for advancing phonon-related applications, including biochemical sensing, quantum transduction, and superconductor-based quantum computing.

Published
2024

50. Well-posedness and Stability of Discrete Approximations for Controlled Sweeping Processes with Time Delay

Author

Mordukhovich, Boris, Nguyen, Dao, Nguyen, Trang, Ortiz-Robinson, Norma, and Ríos, Vinicio

Subjects
Mathematics - Optimization and Control, 49J24, 49J25, 49J53, 49M25, 93B35
Abstract

This paper addresses, for the first time in the literature, optimal control problems for dynamic systems governed by a novel class of sweeping processes with time delay. We establish well-posedness of such processes, in the sense of the existence and uniqueness of feasible trajectories corresponding to feasible controls under fairly unrestrictive assumptions. Then we construct a well-posed family of discrete approximations and find efficient conditions under the discretized time-delayed sweeping process exhibits stability with respect to strong convergence of feasible and optimal solutions. This creates a bridge between optimization of continuous-time and discrete-time sweeping control systems and justifies the effective use of discrete approximations in deriving optimality conditions and numerical techniques to solve the original time-delayed sweeping control problems via discrete approximations.

Published
2024

Catalog

Books, media, physical & digital resources
See catalog results