753,214 results on '"CAMPBELL, A"'
Search Results
2. Inner-City Teachers More Authoritarian.
- Author
-
Williamson, John A. and Campbell, Lloyd P.
- Abstract
Findings of this study indicate that preservice teachers engaged in student teaching tend to become less humanistic and more authoritarian in their relations with students as the student teaching experience progresses. In addition, inner-city student teachers tend to be more custodial before they begin student teaching than are suburban student teachers after they complete student teaching. The sample for the study consisted of fifty-eight secondary school student teachers in suburban schools and twenty-seven secondary student teachers in inner-city schools. Subjects were administered the Pupil Control Ideology Inventory Questionnaire during prestudent teaching orientation and again during the last week of student teaching. Survey results indicate that student teachers tend to enter student teaching with an idealistic and sometimes erroneous concept of what is involved regarding discipline maintenance in the classroom, thus undergoing a marked change toward more dominant classroom control forms as the experience progresses. The more stringent screening process for student teachers in inner-city schools appears to account in part for the finding that these student teachers are more custodial before they begin student teaching than are suburban student teachers after they complete student teaching. (MB)
- Published
- 2024
3. Where Dragon Veins Meet: The Kangxi Emperor and His Estate at Rehe by Stephen H. Whiteman (review)
- Author
-
Campbell, Aurelia
- Published
- 2023
- Full Text
- View/download PDF
4. Consecrating the Imperial City: Tibetan Stupas in Yuan Dadu
- Author
-
Campbell, Aurelia
- Published
- 2023
- Full Text
- View/download PDF
5. Facilitating the Research Writing Process with Generative Artificial Intelligence
- Author
-
Laurie O. Campbell and Thomas D. Cox
- Abstract
In higher education, generative chatbots have infiltrated teaching and learning. Concerns about how and if to utilize chatbots in the classroom are at the forefront of scholarly discussion. This quick-hit article presents a plan to teach learners about generative AI writing tools and their ethical use for writing purposes. As generative AI tools continue to emerge, this guide can support instructors from all disciplines to engage learners in getting the most accurate information.
- Published
- 2024
6. Preparing International Scholarship Students for Graduate Education: The Case of the Open Society Foundations' Pre-Academic Summer Program
- Author
-
Campbell, Anne C. and Basi, Rasjit
- Published
- 2022
7. MindScape Study: Integrating LLM and Behavioral Sensing for Personalized AI-Driven Journaling Experiences
- Author
-
Nepal, Subigya, Pillai, Arvind, Campbell, William, Massachi, Talie, Heinz, Michael V., Kunwar, Ashmita, Choi, Eunsol Soul, Xu, Orson, Kuc, Joanna, Huckins, Jeremy, Holden, Jason, Preum, Sarah M., Depp, Colin, Jacobson, Nicholas, Czerwinski, Mary, Granholm, Eric, and Campbell, Andrew T.
- Subjects
Computer Science - Human-Computer Interaction ,Computer Science - Artificial Intelligence ,H.5.0 ,H.5.3 ,H.5.m ,J.0 - Abstract
Mental health concerns are prevalent among college students, highlighting the need for effective interventions that promote self-awareness and holistic well-being. MindScape pioneers a novel approach to AI-powered journaling by integrating passively collected behavioral patterns such as conversational engagement, sleep, and location with Large Language Models (LLMs). This integration creates a highly personalized and context-aware journaling experience, enhancing self-awareness and well-being by embedding behavioral intelligence into AI. We present an 8-week exploratory study with 20 college students, demonstrating the MindScape app's efficacy in enhancing positive affect (7%), reducing negative affect (11%), loneliness (6%), and anxiety and depression, with a significant week-over-week decrease in PHQ-4 scores (-0.25 coefficient), alongside improvements in mindfulness (7%) and self-reflection (6%). The study highlights the advantages of contextual AI journaling, with participants particularly appreciating the tailored prompts and insights provided by the MindScape app. Our analysis also includes a comparison of responses to AI-driven contextual versus generic prompts, participant feedback insights, and proposed strategies for leveraging contextual AI journaling to improve well-being on college campuses. By showcasing the potential of contextual AI journaling to support mental health, we provide a foundation for further investigation into the effects of contextual AI journaling on mental health and well-being., Comment: arXiv admin note: text overlap with arXiv:2404.00487
- Published
- 2024
8. Measurement of interstellar extinction for classical T Tauri stars using far-UV H2 line fluxes
- Author
-
Fuhrmeister, B., Schneider, P. C., Sperling, Th., France, K., Campbell-White, J., and Eislöffel, J.
- Subjects
Astrophysics - Solar and Stellar Astrophysics ,Astrophysics - Astrophysics of Galaxies - Abstract
Understanding the interstellar and potentially circumstellar extinction in the sight lines of classical T Tauri stars is an important ingredient for constructing reliable spectral energy distributions, which catalyze protoplanetary disk chemistry, for example. Therefore, some attempts of measuring $A_{V}$ toward individual stars have been made using partly different wavelength regimes and different underlying assumptions. We used strong lines of Ly{\alpha} fluorescent H2 and derived the extinction based on the assumption of optically thin transitions. We investigated a sample of 72 classical T Tauri stars observed with the Hubble Space Telescope in the framework of the ULLYSES program. We computed $A_{V}$ and $R_{V}$ values for the 34 objects with sufficient data quality and an additionally $A_{V}$ value for the canonical $R_{V}$ = 3.1 value. Our results agree largely with values obtained from optical data. Moreover, we confirm the degeneracy between $A_{V}$ and $R_{V}$ and present possibilities to break this. Finally, we discuss whether the assumption of optical thin lines is valid., Comment: 12 pages, 6 figures, accepted to A&A
- Published
- 2024
9. Molecular gas stratification and disturbed kinematics in the Seyfert galaxy MCG-05-23-16 revealed by JWST and ALMA
- Author
-
Esparza-Arredondo, D., Almeida, C. Ramos, Audibert, A., Pereira-Santaella, M., García-Bernete, I., García-Burillo, S., Shimizu, T., Davies, R., Muñoz, L. Hermosa, Alonso-Herrero, A., Combes, F., Speranza, G., Zhang, L., Campbell, S., Bellocchi, E., Bunker, A. J., Díaz-Santos, T., García-Lorenzo, B., González-Martín, O., Hicks, E. K. S., Labiano, A., Levenson, N. A., Ricci, C., Rosario, D., Hoenig, S., Packham, C., Stalevski, M., Fuller, L., Izumi, T., López-Rodríguez, E., Rigopoulou, D., Rouan, D., and Ward, M.
- Subjects
Astrophysics - Astrophysics of Galaxies - Abstract
Understanding the processes that drive the morphology and kinematics of molecular gas in galaxies is crucial for comprehending star formation and, ultimately, galaxy evolution. Using data obtained with the James Webb Space Telescope (JWST) and the Atacama Large Millimeter/submillimeter Array (ALMA), we study the behavior of the warm molecular gas at temperatures of hundreds of Kelvin and the cold molecular gas at tens of Kelvin in the galaxy MCG$-$05$-$23$-$16, which hosts an active galactic nucleus (AGN). Hubble Space Telescope (HST) images of this spheroidal galaxy, classified in the optical as S0, show a dust lane resembling a nuclear spiral and a surrounding ring. These features are also detected in CO(2$-$1) and H2, and their morphologies and kinematics are consistent with rotation plus local inward gas motions along the kinematic minor axis in the presence of a nuclear bar. The H2 transitions 0-0 S(3), 0-0 S(4), and 0-0 S(5), which trace warmer and more excited gas, show more disrupted kinematics than 0-0 S(1) and 0-0 S(2), including clumps of high-velocity dispersion (of up to $\sim$ 160 km/s), in regions devoid of CO(2$-$1). The kinematics of one of these clumps, located at $\sim$ 350 pc westward from the nucleus, are consistent with outflowing gas, possibly driven by localized star formation traced by Polycyclic Aromatic Hydrocarbon (PAH) emission at 11.3 ${\mu}$m. Overall, we observe a stratification of the molecular gas, with the colder gas located in the nuclear spiral, ring, and connecting arms, while most warmer gas with higher velocity-dispersion fills the inter-arm space. The compact jet, approximately 200 pc in size, detected with Very Large Array (VLA) observations, does not appear to significantly affect the distribution and kinematics of the molecular gas, possibly due to its limited intersection with the molecular gas disc., Comment: 19 pages, 15 figures, 2. Accepted for publication in A&A
- Published
- 2024
10. HEIGHT: Heterogeneous Interaction Graph Transformer for Robot Navigation in Crowded and Constrained Environments
- Author
-
Liu, Shuijing, Xia, Haochen, Pouria, Fatemeh Cheraghi, Hong, Kaiwen, Chakraborty, Neeloy, and Driggs-Campbell, Katherine
- Subjects
Computer Science - Robotics ,Computer Science - Artificial Intelligence ,Computer Science - Machine Learning - Abstract
We study the problem of robot navigation in dense and interactive crowds with environmental constraints such as corridors and furniture. Previous methods fail to consider all types of interactions among agents and obstacles, leading to unsafe and inefficient robot paths. In this article, we leverage a graph-based representation of crowded and constrained scenarios and propose a structured framework to learn robot navigation policies with deep reinforcement learning. We first split the representations of different components in the environment and propose a heterogeneous spatio-temporal (st) graph to model distinct interactions among humans, robots, and obstacles. Based on the heterogeneous st-graph, we propose HEIGHT, a novel navigation policy network architecture with different components to capture heterogeneous interactions among entities through space and time. HEIGHT utilizes attention mechanisms to prioritize important interactions and a recurrent network to track changes in the dynamic scene over time, encouraging the robot to avoid collisions adaptively. Through extensive simulation and real-world experiments, we demonstrate that HEIGHT outperforms state-of-the-art baselines in terms of success and efficiency in challenging navigation scenarios. Furthermore, we demonstrate that our pipeline achieves better zero-shot generalization capability than previous works when the densities of humans and obstacles change. More videos are available at https://sites.google.com/view/crowdnav-height/home.
- Published
- 2024
11. A Non-Primordial Origin for the Widest Binaries in the Kuiper Belt
- Author
-
Campbell, Hunter M., Anderson, Kalee E., and Kaib, Nathan A.
- Subjects
Astrophysics - Earth and Planetary Astrophysics - Abstract
Nearly one-third of objects occupying the most circular, coplanar Kuiper belt orbits (the cold classical belt) are binary, and several percent of them are "ultra-wide" binaries (UWBs): 100-km-sized companions spaced by tens of thousands of km. UWBs are dynamically fragile, and their existence is thought to constrain early Solar System processes and conditions. However, we demonstrate that UWBs can instead attain their wide architectures well after the Solar System's earliest epochs, when Neptune's orbital migration implants the modern non-cold, or "dynamic", Kuiper belt population. During this implantation, cold classical belt binaries are likely to have close encounters with many planetesimals scattered across the region, which can efficiently dissociate any existing UWBs and widen a small fraction of tighter binaries into UWB-like arrangements. Thus, today's UWBs may not be primordial and cannot be used to constrain the early Solar System as directly as previously surmised., Comment: 27 pages, 12 figures
- Published
- 2024
- Full Text
- View/download PDF
12. Strategies for entanglement distribution in optical fiber networks
- Author
-
McAleese, Hannah, Agrawal, Anuj, Vasan, Vivek, Campbell, Conall J., Hawkins, Adam G., Kilper, Daniel C., Paternostro, Mauro, and Ruffini, Marco
- Subjects
Quantum Physics - Abstract
Distributing entanglement over long distances remains a challenge due to its fragility when exposed to environmental effects. In this work, we compare various entanglement distribution protocols in a realistic noisy fiber network. We focus specifically on two schemes that only require the sending of a non-entangled carrier photon to remote nodes of the network. These protocols rely on optical CNOT gates and we vary the probability with which they can be successfully performed. Encoding our entangled states in photon polarization, we analyse the effect of depolarizing noise on the photonic states as the carrier passes through the fibers. Building a robust model of photon loss and calculating the distillable entanglement of the noisy states, we find the entanglement distribution rate. We discover that methods involving a separable carrier can reach a higher rate than the standard entanglement distribution protocol, provided that the success probability of the optical CNOT gates is sufficiently high., Comment: 12 pages, 10 figures. Comments welcome
- Published
- 2024
13. Quantifying artificial intelligence through algebraic generalization
- Author
-
Ito, Takuya, Campbell, Murray, Horesh, Lior, Klinger, Tim, and Ram, Parikshit
- Subjects
Computer Science - Artificial Intelligence ,Computer Science - Computation and Language ,Computer Science - Machine Learning ,Computer Science - Logic in Computer Science - Abstract
The rapid development of modern artificial intelligence (AI) systems has created an urgent need for their scientific quantification. While their fluency across a variety of domains is impressive, modern AI systems fall short on tests requiring symbolic processing and abstraction - a glaring limitation given the necessity for interpretable and reliable technology. Despite a surge of reasoning benchmarks emerging from the academic community, no comprehensive and theoretically-motivated framework exists to quantify reasoning (and more generally, symbolic ability) in AI systems. Here, we adopt a framework from computational complexity theory to explicitly quantify symbolic generalization: algebraic circuit complexity. Many symbolic reasoning problems can be recast as algebraic expressions. Thus, algebraic circuit complexity theory - the study of algebraic expressions as circuit models (i.e., directed acyclic graphs) - is a natural framework to study the complexity of symbolic computation. The tools of algebraic circuit complexity enable the study of generalization by defining benchmarks in terms of their complexity-theoretic properties (i.e., the difficulty of a problem). Moreover, algebraic circuits are generic mathematical objects; for a given algebraic circuit, an arbitrarily large number of samples can be generated for a specific circuit, making it an optimal testbed for the data-hungry machine learning algorithms that are used today. Here, we adopt tools from algebraic circuit complexity theory, apply it to formalize a science of symbolic generalization, and address key theoretical and empirical challenges for its successful application to AI science and its impact on the broader community.
- Published
- 2024
14. Tailoring Dynamical Codes for Biased Noise: The X$^3$Z$^3$ Floquet Code
- Author
-
Setiawan, F. and McLauchlan, Campbell
- Subjects
Quantum Physics - Abstract
We propose the X$^3$Z$^3$ Floquet code, a type of dynamical code with improved performance under biased noise compared to other Floquet codes. The enhanced performance is attributed to a simplified decoding problem resulting from a persistent symmetry under infinitely biased noise, which suprisingly exists in a code without constant stabilisers. Even if such a symmetry is allowed, we prove that a general dynamical code with two-qubit parity measurements cannot admit one-dimensional decoding graphs, a key feature resulting in the high performance of bias-tailored stabiliser codes. Despite this limitation, we demonstrate through our comprehensive numerical simulations that the symmetry of the X$^3$Z$^3$ Floquet code renders its performance under biased noise far better than several leading Floquet code candidates. Furthermore, to maintain high-performance implementation in hardware without native two-qubit parity measurements, we introduce ancilla-assisted bias-preserving parity measurement circuits. Our work establishes the X$^3$Z$^3$ code as a prime quantum error-correcting code candidate, particularly for devices with reduced connectivity, such as the honeycomb and heavy-hexagonal architectures., Comment: 13 pages + 9 pages of Appendix, 18 figures
- Published
- 2024
15. Internal state cooling of an atom with thermal light
- Author
-
Younes, Amanda, Putnam, Randall, Hamilton, Paul, and Campbell, Wesley C.
- Subjects
Quantum Physics ,Physics - Atomic Physics - Abstract
A near-minimal instance of optical cooling is experimentally presented wherein the internal-state entropy of a single atom is reduced more than twofold by illuminating it with broadband, incoherent light. Since the rate of optical pumping by a thermal state increases monotonically with its temperature, the cooling power in this scenario increases with higher thermal occupation, an example of a phenomenon known as cooling by heating. In contrast to optical pumping by coherent, narrow-band laser light, here we perform the same task with fiber-coupled, broadband sunlight, the brightest laboratory-accessible source of continuous blackbody radiation., Comment: 4 pages
- Published
- 2024
16. HandCraft: Anatomically Correct Restoration of Malformed Hands in Diffusion Generated Images
- Author
-
Qin, Zhenyue, Zhang, Yiqun, Liu, Yang, and Campbell, Dylan
- Subjects
Computer Science - Computer Vision and Pattern Recognition - Abstract
Generative text-to-image models, such as Stable Diffusion, have demonstrated a remarkable ability to generate diverse, high-quality images. However, they are surprisingly inept when it comes to rendering human hands, which are often anatomically incorrect or reside in the "uncanny valley". In this paper, we propose a method HandCraft for restoring such malformed hands. This is achieved by automatically constructing masks and depth images for hands as conditioning signals using a parametric model, allowing a diffusion-based image editor to fix the hand's anatomy and adjust its pose while seamlessly integrating the changes into the original image, preserving pose, color, and style. Our plug-and-play hand restoration solution is compatible with existing pretrained diffusion models, and the restoration process facilitates adoption by eschewing any fine-tuning or training requirements for the diffusion models. We also contribute MalHand datasets that contain generated images with a wide variety of malformed hands in several styles for hand detector training and hand restoration benchmarking, and demonstrate through qualitative and quantitative evaluation that HandCraft not only restores anatomical correctness but also maintains the integrity of the overall image., Comment: Accepted by WACV 2025
- Published
- 2024
17. Can Custom Models Learn In-Context? An Exploration of Hybrid Architecture Performance on In-Context Learning Tasks
- Author
-
Campbell, Ryan, Lojo, Nelson, Viswanadha, Kesava, Tryggestad, Christoffer Grondal, Sun, Derrick Han, Vijapurapu, Sriteja, Rolfsen, August, and Sahai, Anant
- Subjects
Computer Science - Machine Learning ,Computer Science - Artificial Intelligence - Abstract
In-Context Learning (ICL) is a phenomenon where task learning occurs through a prompt sequence without the necessity of parameter updates. ICL in Multi-Headed Attention (MHA) with absolute positional embedding has been the focus of more study than other sequence model varieties. We examine implications of architectural differences between GPT-2 and LLaMa as well as LlaMa and Mamba. We extend work done by Garg et al. (2022) and Park et al. (2024) to GPT-2/LLaMa hybrid and LLaMa/Mamba hybrid models - examining the interplay between sequence transformation blocks and regressive performance in-context. We note that certain architectural changes cause degraded training efficiency/ICL accuracy by converging to suboptimal predictors or converging slower. We also find certain hybrids showing optimistic performance improvements, informing potential future ICL-focused architecture modifications. Additionally, we propose the "ICL regression score", a scalar metric describing a model's whole performance on a specific task. Compute limitations impose restrictions on our architecture-space, training duration, number of training runs, function class complexity, and benchmark complexity. To foster reproducible and extensible research, we provide a typed, modular, and extensible Python package on which we run all experiments., Comment: 18 pages, 16 figures
- Published
- 2024
18. Bottom-up approach to scalable growth of molecules capable of optical cycling
- Author
-
Lao, Guanming, Khvorost, Taras, Macias, Jr., Antonio, Morgan, Harry W. T., Lavroff, Robert H., Choi, Ryan, Zhou, Haowen, Usvyat, Denis, Zhu, Guo-Zhu, García-Garibay, Miguel A., Alexandrova, Anastassia N., Hudson, Eric R., and Campbell, Wesley C.
- Subjects
Physics - Chemical Physics ,Physics - Atomic Physics - Abstract
Gas-phase molecules capable of repeatable, narrow-band spontaneous photon scattering are prized for direct laser cooling and quantum state detection. Recently, large molecules incorporating phenyl rings have been shown to exhibit similar vibrational closure to the small molecules demonstrated so far, and it is not yet known if the high vibrational-mode density of even larger species will eventually compromise optical cycling. Here, we systematically increase the size of hydrocarbon ligands attached to single alkaline-earth-phenoxides from (-H) to -C$_{14}$H$_{19}$ while measuring the vibrational branching fractions of the optical transition. We find that varying the ligand size from 1 to more than 30 atoms does not systematically reduce the cycle closure, which remains around 90%. Theoretical extensions to larger diamondoids and bulk diamond surface suggest that alkaline earth phenoxides may maintain the desirable scattering behavior as the system size grows further, with no indication of an upper limit., Comment: 9 pages, 5 figures, SI(34 pages)
- Published
- 2024
19. MuCol Milestone Report No. 5: Preliminary Parameters
- Author
-
Accettura, Carlotta, Adrian, Simon, Agarwal, Rohit, Ahdida, Claudia, Aimé, Chiara, Aksoy, Avni, Alberghi, Gian Luigi, Alden, Siobhan, Alfonso, Luca, Amapane, Nicola, Amorim, David, Andreetto, Paolo, Anulli, Fabio, Appleby, Rob, Apresyan, Artur, Asadi, Pouya, Mahmoud, Mohammed Attia, Auchmann, Bernhard, Back, John, Badea, Anthony, Bae, Kyu Jung, Bahng, E. J., Balconi, Lorenzo, Balli, Fabrice, Bandiera, Laura, Barbagallo, Carmelo, Barlow, Roger, Bartoli, Camilla, Bartosik, Nazar, Barzi, Emanuela, Batsch, Fabian, Bauce, Matteo, Begel, Michael, Berg, J. Scott, Bersani, Andrea, Bertarelli, Alessandro, Bertinelli, Francesco, Bertolin, Alessandro, Bhat, Pushpalatha, Bianchi, Clarissa, Bianco, Michele, Bishop, William, Black, Kevin, Boattini, Fulvio, Bogacz, Alex, Bonesini, Maurizio, Bordini, Bernardo, de Sousa, Patricia Borges, Bottaro, Salvatore, Bottura, Luca, Boyd, Steven, Breschi, Marco, Broggi, Francesco, Brunoldi, Matteo, Buffat, Xavier, Buonincontri, Laura, Burrows, Philip Nicholas, Burt, Graeme Campbell, Buttazzo, Dario, Caiffi, Barbara, Calatroni, Sergio, Calviani, Marco, Calzaferri, Simone, Calzolari, Daniele, Cantone, Claudio, Capdevilla, Rodolfo, Carli, Christian, Carrelli, Carlo, Casaburo, Fausto, Casarsa, Massimo, Castelli, Luca, Catanesi, Maria Gabriella, Cavallucci, Lorenzo, Cavoto, Gianluca, Celiberto, Francesco Giovanni, Celona, Luigi, Cemmi, Alessia, Ceravolo, Sergio, Cerri, Alessandro, Cerutti, Francesco, Cesarini, Gianmario, Cesarotti, Cari, Chancé, Antoine, Charitonidis, Nikolaos, Chiesa, Mauro, Chiggiato, Paolo, Ciccarella, Vittoria Ludovica, Puviani, Pietro Cioli, Colaleo, Anna, Colao, Francesco, Collamati, Francesco, Costa, Marco, Craig, Nathaniel, Curtin, David, Damerau, Heiko, Da Molin, Giacomo, D'Angelo, Laura, Dasu, Sridhara, de Blas, Jorge, De Curtis, Stefania, De Gersem, Herbert, Delahaye, Jean-Pierre, Del Moro, Tommaso, Denisov, Dmitri, Denizli, Haluk, Dermisek, Radovan, Valdor, Paula Desiré, Desponds, Charlotte, Di Luzio, Luca, Di Meco, Elisa, Diociaiuti, Eleonora, Di Petrillo, Karri Folan, Di Sarcina, Ilaria, Dorigo, Tommaso, Dreimanis, Karlis, Pree, Tristan du, Yildiz, Hatice Duran, Edgecock, Thomas, Fabbri, Siara, Fabbrichesi, Marco, Farinon, Stefania, Ferrand, Guillaume, Somoza, Jose Antonio Ferreira, Fieg, Max, Filthaut, Frank, Fox, Patrick, Franceschini, Roberto, Ximenes, Rui Franqueira, Gallinaro, Michele, Garcia-Sciveres, Maurice, Garcia-Tabares, Luis, Gargiulo, Ruben, Garion, Cedric, Garzelli, Maria Vittoria, Gast, Marco, Generoso, Lisa, Gerber, Cecilia E., Giambastiani, Luca, Gianelle, Alessio, Gianfelice-Wendt, Eliana, Gibson, Stephen, Gilardoni, Simone, Giove, Dario Augusto, Giovinco, Valentina, Giraldin, Carlo, Glioti, Alfredo, Gorzawski, Arkadiusz, Greco, Mario, Grojean, Christophe, Grudiev, Alexej, Gschwendtner, Edda, Gueli, Emanuele, Guilhaudin, Nicolas, Han, Chengcheng, Han, Tao, Hauptman, John Michael, Herndon, Matthew, Hillier, Adrian D, Hillman, Micah, Holmes, Tova Ray, Homiller, Samuel, Jana, Sudip, Jindariani, Sergo, Johannesson, Sofia, Johnson, Benjamin, Jones, Owain Rhodri, Jurj, Paul-Bogdan, Kahn, Yonatan, Kamath, Rohan, Kario, Anna, Karpov, Ivan, Kelliher, David, Kilian, Wolfgang, Kitano, Ryuichiro, Kling, Felix, Kolehmainen, Antti, Kong, K. C., Kosse, Jaap, Krintiras, Georgios, Krizka, Karol, Kumar, Nilanjana, Kvikne, Erik, Kyle, Robert, Laface, Emanuele, Lane, Kenneth, Latina, Andrea, Lechner, Anton, Lee, Junghyun, Lee, Lawrence, Lee, Seh Wook, Lefevre, Thibaut, Leonardi, Emanuele, Lerner, Giuseppe, Li, Peiran, Li, Qiang, Li, Tong, Li, Wei, Lindroos, Mats, Lipton, Ronald, Liu, Da, Liu, Miaoyuan, Liu, Zhen, Voti, Roberto Li, Lombardi, Alessandra, Lomte, Shivani, Long, Kenneth, Longo, Luigi, Lorenzo, José, Losito, Roberto, Low, Ian, Lu, Xianguo, Lucchesi, Donatella, Luo, Tianhuan, Lupato, Anna, Ma, Yang, Machida, Shinji, Madlener, Thomas, Magaletti, Lorenzo, Maggi, Marcello, Durand, Helene Mainaud, Maltoni, Fabio, Manczak, Jerzy Mikolaj, Mandurrino, Marco, Marchand, Claude, Mariani, Francesco, Marin, Stefano, Mariotto, Samuele, Martin-Haugh, Stewart, Masullo, Maria Rosaria, Mauro, Giorgio Sebastiano, Mazzolari, Andrea, Mękała, Krzysztof, Mele, Barbara, Meloni, Federico, Meng, Xiangwei, Mentink, Matthias, Métral, Elias, Miceli, Rebecca, Milas, Natalia, Mohammadi, Abdollah, Moll, Dominik, Montella, Alessandro, Morandin, Mauro, Morrone, Marco, Mulder, Tim, Musenich, Riccardo, Nardecchia, Marco, Nardi, Federico, Nenna, Felice, Neuffer, David, Newbold, David, Novelli, Daniel, Olvegård, Maja, Onel, Yasar, Orestano, Domizia, Osborne, John, Otten, Simon, Torres, Yohan Mauricio Oviedo, Paesani, Daniele, Griso, Simone Pagan, Pagani, Davide, Pal, Kincso, Palmer, Mark, Pampaloni, Alessandra, Panci, Paolo, Pani, Priscilla, Papaphilippou, Yannis, Paparella, Rocco, Paradisi, Paride, Passeri, Antonio, Pasternak, Jaroslaw, Pastrone, Nadia, Pellecchia, Antonello, Piccinini, Fulvio, Piekarz, Henryk, Pieloni, Tatiana, Plouin, Juliette, Portone, Alfredo, Potamianos, Karolos, Potdevin, Joséphine, Prestemon, Soren, Puig, Teresa, Qiang, Ji, Quettier, Lionel, Rabemananjara, Tanjona Radonirina, Radicioni, Emilio, Radogna, Raffaella, Rago, Ilaria Carmela, Ratkus, Andris, Resseguie, Elodie, Reuter, Juergen, Ribani, Pier Luigi, Riccardi, Cristina, Ricciardi, Stefania, Robens, Tania, Robert, Youri, Rogers, Chris, Rojo, Juan, Romagnoni, Marco, Ronald, Kevin, Rosser, Benjamin, Rossi, Carlo, Rossi, Lucio, Rozanov, Leo, Ruhdorfer, Maximilian, Ruiz, Richard, Saini, Saurabh, Sala, Filippo, Salierno, Claudia, Salmi, Tiina, Salvini, Paola, Salvioni, Ennio, Sammut, Nicholas, Santini, Carlo, Saputi, Alessandro, Sarra, Ivano, Scarantino, Giuseppe, Schneider-Muntau, Hans, Schulte, Daniel, Scifo, Jessica, Sen, Tanaji, Senatore, Carmine, Senol, Abdulkadir, Sertore, Daniele, Sestini, Lorenzo, Rêgo, Ricardo César Silva, Simone, Federica Maria, Skoufaris, Kyriacos, Sorbello, Gino, Sorbi, Massimo, Sorti, Stefano, Soubirou, Lisa, Spataro, David, Queiroz, Farinaldo S., Stamerra, Anna, Stapnes, Steinar, Stark, Giordon, Statera, Marco, Stechauner, Bernd Michael, Su, Shufang, Su, Wei, Sun, Xiaohu, Sytov, Alexei, Tang, Jian, Tang, Jingyu, Taylor, Rebecca, Kate, Herman Ten, Testoni, Pietro, Thiele, Leonard Sebastian, Garcia, Rogelio Tomas, Topp-Mugglestone, Max, Torims, Toms, Torre, Riccardo, Tortora, Luca, Tortora, Ludovico, Trifinopoulos, Sokratis, Udongwo, Sosoho-Abasi, Vai, Ilaria, Valente, Riccardo Umberto, van Rienen, Ursula, Van Weelderen, Rob, Vanwelde, Marion, Velev, Gueorgui, Venditti, Rosamaria, Vendrasco, Adam, Verna, Adriano, Vernassa, Gianluca, Verweij, Arjan, Verwilligen, Piet, Villamizar, Yoxara, Vittorio, Ludovico, Vitulo, Paolo, Vojskovic, Isabella, Wang, Dayong, Wang, Lian-Tao, Wang, Xing, Wendt, Manfred, Widorski, Markus, Wozniak, Mariusz, Wu, Yongcheng, Wulzer, Andrea, Xie, Keping, Yang, Yifeng, Yap, Yee Chinn, Yonehara, Katsuya, Yoo, Hwi Dong, You, Zhengyun, Zanetti, Marco, Zaza, Angela, Zhang, Liang, Zhu, Ruihu, Zlobin, Alexander, Zuliani, Davide, and Zurita, José Francisco
- Subjects
Physics - Accelerator Physics - Abstract
This document is comprised of a collection of updated preliminary parameters for the key parts of the muon collider. The updated preliminary parameters follow on from the October 2023 Tentative Parameters Report. Particular attention has been given to regions of the facility that are believed to hold greater technical uncertainty in their design and that have a strong impact on the cost and power consumption of the facility. The data is collected from a collaborative spreadsheet and transferred to overleaf.
- Published
- 2024
- Full Text
- View/download PDF
20. A probabilistic diagnostic for Laplace approximations: Introduction and experimentation
- Author
-
McDonald, Shaun and Campbell, David
- Subjects
Statistics - Methodology - Abstract
Many models require integrals of high-dimensional functions: for instance, to obtain marginal likelihoods. Such integrals may be intractable, or too expensive to compute numerically. Instead, we can use the Laplace approximation (LA). The LA is exact if the function is proportional to a normal density; its effectiveness therefore depends on the function's true shape. Here, we propose the use of the probabilistic numerical framework to develop a diagnostic for the LA and its underlying shape assumptions, modelling the function and its integral as a Gaussian process and devising a "test" by conditioning on a finite number of function values. The test is decidedly non-asymptotic and is not intended as a full substitute for numerical integration - rather, it is simply intended to test the feasibility of the assumptions underpinning the LA with as minimal computation. We discuss approaches to optimize and design the test, apply it to known sample functions, and highlight the challenges of high dimensions.
- Published
- 2024
21. FRODO: A novel approach to micro-macro multilevel regression
- Author
-
McDonald, Shaun, Leblanc, Alexandre, Muthukumarana, Saman, and Campbell, David
- Subjects
Statistics - Methodology - Abstract
Within the field of hierarchical modelling, little attention is paid to micro-macro models: those in which group-level outcomes are dependent on covariates measured at the level of individuals within groups. Although such models are perhaps underrepresented in the literature, they have applications in economics, epidemiology, and the social sciences. Despite the strong mathematical similarities between micro-macro and measurement error models, few efforts have been made to apply the much better-developed methodology of the latter to the former. Here, we present a new empirical Bayesian technique for micro-macro data, called FRODO (Functional Regression On Densities of Observations). The method jointly infers group-specific densities for multilevel covariates and uses them as functional predictors in a functional linear regression, resulting in a model that is analogous to a generalized additive model (GAM). In doing so, it achieves a level of generality comparable to more sophisticated methods developed for errors-in-variables models, while further leveraging the larger group sizes characteristic of multilevel data to provide richer information about the within-group covariate distributions. After explaining the hierarchical structure of FRODO, its power and versatility are demonstrated on several simulated datasets, showcasing its ability to accommodate a wide variety of covariate distributions and regression models.
- Published
- 2024
22. Raspberry PhenoSet: A Phenology-based Dataset for Automated Growth Detection and Yield Estimation
- Author
-
Jafary, Parham, Bazangeya, Anna, Pham, Michelle, Campbell, Lesley G., Saeedi, Sajad, Zareinia, Kourosh, and Bougherara, Habiba
- Subjects
Computer Science - Computer Vision and Pattern Recognition ,Computer Science - Robotics - Abstract
The future of the agriculture industry is intertwined with automation. Accurate fruit detection, yield estimation, and harvest time estimation are crucial for optimizing agricultural practices. These tasks can be carried out by robots to reduce labour costs and improve the efficiency of the process. To do so, deep learning models should be trained to perform knowledge-based tasks, which outlines the importance of contributing valuable data to the literature. In this paper, we introduce Raspberry PhenoSet, a phenology-based dataset designed for detecting and segmenting raspberry fruit across seven developmental stages. To the best of our knowledge, Raspberry PhenoSet is the first fruit dataset to integrate biology-based classification with fruit detection tasks, offering valuable insights for yield estimation and precise harvest timing. This dataset contains 1,853 high-resolution images, the highest quality in the literature, captured under controlled artificial lighting in a vertical farm. The dataset has a total of 6,907 instances of mask annotations, manually labelled to reflect the seven phenology stages. We have also benchmarked Raspberry PhenoSet using several state-of-the-art deep learning models, including YOLOv8, YOLOv10, RT-DETR, and Mask R-CNN, to provide a comprehensive evaluation of their performance on the dataset. Our results highlight the challenges of distinguishing subtle phenology stages and underscore the potential of Raspberry PhenoSet for both deep learning model development and practical robotic applications in agriculture, particularly in yield prediction and supply chain management. The dataset and the trained models are publicly available for future studies.
- Published
- 2024
23. Understanding the Limits of Vision Language Models Through the Lens of the Binding Problem
- Author
-
Campbell, Declan, Rane, Sunayana, Giallanza, Tyler, De Sabbata, Nicolò, Ghods, Kia, Joshi, Amogh, Ku, Alexander, Frankland, Steven M., Griffiths, Thomas L., Cohen, Jonathan D., and Webb, Taylor W.
- Subjects
Computer Science - Artificial Intelligence ,Computer Science - Computer Vision and Pattern Recognition ,Computer Science - Machine Learning ,Quantitative Biology - Neurons and Cognition - Abstract
Recent work has documented striking heterogeneity in the performance of state-of-the-art vision language models (VLMs), including both multimodal language models and text-to-image models. These models are able to describe and generate a diverse array of complex, naturalistic images, yet they exhibit surprising failures on basic multi-object reasoning tasks -- such as counting, localization, and simple forms of visual analogy -- that humans perform with near perfect accuracy. To better understand this puzzling pattern of successes and failures, we turn to theoretical accounts of the binding problem in cognitive science and neuroscience, a fundamental problem that arises when a shared set of representational resources must be used to represent distinct entities (e.g., to represent multiple objects in an image), necessitating the use of serial processing to avoid interference. We find that many of the puzzling failures of state-of-the-art VLMs can be explained as arising due to the binding problem, and that these failure modes are strikingly similar to the limitations exhibited by rapid, feedforward processing in the human brain.
- Published
- 2024
24. Optimizing Temperature Distributions for Training Neural Quantum States using Parallel Tempering
- Author
-
Smith, Conor, Campbell, Quinn T., and Albash, Tameem
- Subjects
Quantum Physics - Abstract
Parameterized artificial neural networks (ANNs) can be very expressive ansatzes for variational algorithms, reaching state-of-the-art energies on many quantum many-body Hamiltonians. Nevertheless, the training of the ANN can be slow and stymied by the presence of local minima in the parameter landscape. One approach to mitigate this issue is to use parallel tempering methods, and in this work we focus on the role played by the temperature distribution of the parallel tempering replicas. Using an adaptive method that adjusts the temperatures in order to equate the exchange probability between neighboring replicas, we show that this temperature optimization can significantly increase the success rate of the variational algorithm with negligible computational cost by eliminating bottlenecks in the replicas' random walk. We demonstrate this using two different neural networks, a restricted Boltzmann machine and a feedforward network, which we use to study a toy problem based on a permutation invariant Hamiltonian with a pernicious local minimum and the J1-J2 model on a rectangular lattice.
- Published
- 2024
25. Structural and Nucleosynthetic Evolution of Metal-poor & Metal-free Low- and Intermediate-Mass Stars
- Author
-
Campbell, Simon Wattana
- Subjects
Astrophysics - Solar and Stellar Astrophysics - Abstract
In this PhD thesis we investigate stellar evolution and nucleosynthesis in the low- and extremely-low metallicity regime - including models of stars with a pure Big Bang composition (i.e. $\rm{Z} = 0$). The metallicity range of the extremely metal-poor (EMP) models calculated is $-6.5 < \rm{[Fe/H]} < -3.0$, with a mass range $0.85 < \rm{M} < 3.0~\rm{M}_{\odot}$. We have also calculated a series of models with a metallicity of $\rm{[Fe/H]} = -1.4$, to compare with observations of abundance patterns in Galactic globular cluster stars. Many of the extremely metal-poor (EMP) and $\rm{Z} = 0$ models experience violent evolutionary episodes not seen at higher metallicities. We refer to these events as `Dual Flashes' (DF) since they are characterised by peaks in the hydrogen and helium burning luminosities occurring at the same time. Some of the material processed by these events is later dredged up by the convective envelope, causing very significant surface pollution. We have calculated the entire evolution of the $\rm{Z} = 0$ and EMP models, including detailed nucleosynthesis and yields. Although subject to many uncertainties these are, as far as we are aware, the only yields available in this mass and metallicity range. We find that our models predict an increased number of carbon-rich stars at the lowest metallicities. This is mainly due to the extra pollution provided by the DF events - which do not occur in higher metallicity models. This concurs well with the observations that show the proportion of carbon-enhanced metal-poor (CEMP) stars in the Galactic Halo to be higher at lower metallicities. We also compare the chemical pollution arising from our models with the detailed abundance patterns available for some of the most metal-poor CEMP stars, and find mixed results. Fluid dynamics calculations are likely needed to model the violent DF episodes. [Abridged], Comment: PhD thesis, conferred 2008, 428 pages. Monash University, Australia
- Published
- 2024
26. Symbolic Graph Inference for Compound Scene Understanding
- Author
-
Aryan, FNU, Stepputtis, Simon, Bhagat, Sarthak, Campbell, Joseph, Lee, Kwonjoon, Mahjoub, Hossein Nourkhiz, and Sycara, Katia
- Subjects
Computer Science - Computer Vision and Pattern Recognition - Abstract
Scene understanding is a fundamental capability needed in many domains, ranging from question-answering to robotics. Unlike recent end-to-end approaches that must explicitly learn varying compositions of the same scene, our method reasons over their constituent objects and analyzes their arrangement to infer a scene's meaning. We propose a novel approach that reasons over a scene's scene- and knowledge-graph, capturing spatial information while being able to utilize general domain knowledge in a joint graph search. Empirically, we demonstrate the feasibility of our method on the ADE20K dataset and compare it to current scene understanding approaches.
- Published
- 2024
27. Summability for State Integrals of hyperbolic knots
- Author
-
Fantini, Veronica and Wheeler, Campbell
- Subjects
Mathematics - Geometric Topology ,High Energy Physics - Theory ,Mathematics - Complex Variables - Abstract
We prove conjectures of Garoufalidis-Gu-Mari\~no that perturbative series associated with the hyperbolic knots $4_1$ and $5_2$ are resurgent and Borel summable. In the process, we give an algorithm that can be used to explicitly compute the Borel-Laplace resummation as a combination of state integrals of Andersen-Kashaev. This gives a complete description of the resurgent structure in these examples and allows for explicit computations of Stokes constants., Comment: 44 pages, 32 figures
- Published
- 2024
28. A tell-tale tracer for externally irradiated protoplanetary disks: comparing the [CI] 8727 A line and ALMA observations in proplyds
- Author
-
Aru, Mari-Liis, Mauco, Karina, Manara, Carlo F., Haworth, Thomas J., Ballering, Nick, Boyden, Ryan, Campbell-White, Justyn, Facchini, Stefano, Rosotti, Giovanni P., Winter, Andrew, Miotello, Anna, McLeod, Anna F., Robberto, Massimo, Petr-Gotzens, Monika G., Ballabio, Giulia, Vicente, Silvia, Ansdell, Megan, and Cleeves, L. Ilsedore
- Subjects
Astrophysics - Solar and Stellar Astrophysics ,Astrophysics - Earth and Planetary Astrophysics ,Astrophysics - Astrophysics of Galaxies - Abstract
The evolution of protoplanetary disks in regions with massive OB stars is influenced by externally driven winds that deplete the outer parts of disks. These winds have previously been studied via forbidden oxygen emission lines, which also arise in isolated disks in low-mass star forming-regions (SFRs) with weak external UV fields in photoevaporative or magnetic (internal) disk winds. It is crucial to determine how to disentangle external winds from internal ones. Here, we report a proxy for unambiguously identifying externally driven winds with a forbidden line of neutral atomic carbon, [C i] 8727 A. We compare for the first time the spatial location of the emission in the [O i] 5577 A, [O i] 6300 A, and [C i] 8727 A lines traced by VLT/MUSE-NFM, with the ALMA Band 7 continuum disk emission in a sample of 12 proplyds in the Orion Nebula Cluster (ONC). We confirm that the [O i] 5577 A emission is co-spatial with the disk emission, whereas the [O i] 6300 A is emitted both on the disk surface and on the ionization front of the proplyds. We show for the first time that the [C i] 8727 A line is also co-spatial with the disk surface in proplyds, as seen in the MUSE and ALMA data comparison. To verify whether the [C i] 8727 A line is detected in regions where external photoevaporation is not expected, we examine VLT/X-Shooter spectra for young stars in low-mass SFRs. Although the [O i] lines are well detected in all these targets, there is <<10% detection rate in the case of the [C i] 8727 A line. This number increases substantially to a ~40% detection rate in sigma-Orionis, a region with intermediate UV radiation. The spatial location of the [C i] 8727 A line emission and the lack of its detection in isolated disks in low-mass SFRs strongly suggest that this line is a tell-tale tracer of externally driven photoevaporative winds, which agrees with recent excitation models., Comment: Accepted to A&A on October 25, 2024
- Published
- 2024
29. Upconversion of Phonon Modes into Microwave Photons in a Lithium Niobate Bulk Acoustic Wave Resonator Coupled to a Microwave Cavity
- Author
-
Parashar, S., Campbell, W. M., Bourhill, J., Ivanov, E. N., Goryachev, M., and Tobar, M. E.
- Subjects
Quantum Physics ,Physics - Applied Physics ,Physics - Optics - Abstract
The coupling between acoustic vibrations in a lithium niobate bulk acoustic wave resonator and microwave photons of a re-entrant microwave cavity was investigated at a temperature close to 4 K. Coupling was achieved by placing the acoustic resonator in the location of the re-entrant cavity electric field maxima, in a symmetric "split-post" configuration, with a large overlap between the microwave field and the acoustic mode, allowing acoustic modulations of the microwave frequency. We show that the acoustic modes in this setup retain large inherent quality factors of greater than $10^6$. A maximum optomechanical coupling rate was determined to be $g_0$ = 0.014 mHz, four orders of magnitude larger than previous results obtained using a quartz BAW at 4 K in a similar experimental setup, but using a single post-re-entrant cavity resonator., Comment: Accepted Version
- Published
- 2024
30. Red Stellar Populations and Dust Extinction toward W3
- Author
-
Campbell, J. L., Martin, P. G., Song, S., Rahman, M., and Einstein, L.
- Subjects
Astrophysics - Astrophysics of Galaxies - Abstract
We explore red stellar populations toward the W3 giant molecular cloud through the use of optical-to-infrared (IR) photometry and Gaia DR 3 data, simultaneously characterizing stellar content and properties of dust in the molecular medium. We use a Rayleigh-Jeans Color Excess (RJCE) method modified to de-redden stellar observations of both red giants (RGs) and OB stars, and construct an IR Hertzsprung-Russell diagram validated against the Besanccon Galactic model. Taking advantage of the near-universal IR interstellar extinction law and precise Gaia measurements, we develop a method for obtaining the spectral classification, foreground extinction, and distance moduli of stars, validated by spectroscopically-confirmed OB stars. We constrain the observed parallax and proper motion of OB stars in W3, demonstrating the importance of considering systematic effects in the parallax bias, and assign parallax- and proper motion-based cloud membership to our stellar samples. While it has been assumed that all spectroscopic OB stars are inside the W3 cloud, we find evidence of seven background B stars and three potential runaway OB stars. The methods developed here based on known stellar populations enable us to identify 82 new OB candidates that are confidently within the cloud. We quantify several dust-to-dust empirical correlations, in particular the IR color excess $E(H-[4.5])$ and the optical depth $\tau_1$ of submillimeter dust emission at 1 THz using RGs behind W3, measuring a best fit of $E(H-[4.5]) = (1.07 \pm 0.04) \times 10^3 \, \tau_{1,\,\mathrm{HOTT}} + (0.00 \pm 0.02)$ mags., Comment: accepted for publication in ApJ, 39 pages, 20 figures
- Published
- 2024
31. Enhancing Battery Storage Energy Arbitrage with Deep Reinforcement Learning and Time-Series Forecasting
- Author
-
Sage, Manuel, Campbell, Joshua, and Zhao, Yaoyao Fiona
- Subjects
Computer Science - Machine Learning ,Computer Science - Artificial Intelligence ,Computer Science - Operating Systems ,Electrical Engineering and Systems Science - Systems and Control - Abstract
Energy arbitrage is one of the most profitable sources of income for battery operators, generating revenues by buying and selling electricity at different prices. Forecasting these revenues is challenging due to the inherent uncertainty of electricity prices. Deep reinforcement learning (DRL) emerged in recent years as a promising tool, able to cope with uncertainty by training on large quantities of historical data. However, without access to future electricity prices, DRL agents can only react to the currently observed price and not learn to plan battery dispatch. Therefore, in this study, we combine DRL with time-series forecasting methods from deep learning to enhance the performance on energy arbitrage. We conduct a case study using price data from Alberta, Canada that is characterized by irregular price spikes and highly non-stationary. This data is challenging to forecast even when state-of-the-art deep learning models consisting of convolutional layers, recurrent layers, and attention modules are deployed. Our results show that energy arbitrage with DRL-enabled battery control still significantly benefits from these imperfect predictions, but only if predictors for several horizons are combined. Grouping multiple predictions for the next 24-hour window, accumulated rewards increased by 60% for deep Q-networks (DQN) compared to the experiments without forecasts. We hypothesize that multiple predictors, despite their imperfections, convey useful information regarding the future development of electricity prices through a "majority vote" principle, enabling the DRL agent to learn more profitable control policies., Comment: Accepted for publication at the 18th ASME International Conference on Energy Sustainability
- Published
- 2024
- Full Text
- View/download PDF
32. 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
33. Treewidth, Hadwiger Number, and Induced Minors
- Author
-
Campbell, Rutger, Davies, James, Distel, Marc, Frederickson, Bryce, Gollin, J. Pascal, Hendrey, Kevin, Hickingbotham, Robert, Wiederrecht, Sebastian, Wood, David R., and Yepremyan, Liana
- Subjects
Mathematics - Combinatorics ,05C99 ,G.2.2 - Abstract
Treewidth and Hadwiger number are two of the most important parameters in structural graph theory. This paper studies graph classes in which large treewidth implies the existence of a large complete graph minor. To formalise this, we say that a graph class $\mathcal{G}$ is (tw,had)-bounded if there is a function $f$ (called the (tw,had)-bounding function) such that tw$(G)$ $\leq$ $f$(had$(G)$) for every graph $G \in \mathcal{G}$. We characterise (tw,had)-bounded graph classes as those that exclude some planar graph as an induced minor, and use this characterisation to show that every proper vertex-minor-closed class is (tw,had)-bounded. Furthermore, we demonstrate that any (tw,had)-bounded graph class has a (tw,had)-bounding function in O(had$(G)^9$polylog(had$(G)$)). Our bound comes from the bound for the Grid Minor Theorem given by Chuzhoy and Tan, and any quantitative improvement to their result will lead directly to an improvement to our result. More strongly, we conjecture that every (tw,had)-bounded graph class has a linear (tw,had)-bounding function. In support of this conjecture, we show that it holds for the class of outer-string graphs, and for a natural generalisation of outer-string graphs: intersection graphs of strings rooted at the boundary of a fixed surface. We also verify our conjecture for low-rank perturbations of circle graphs, which is an important step towards verifying it for all proper vertex-minor-closed classes., Comment: 26 pages, 6 Figures
- Published
- 2024
34. Tuning-free coreset Markov chain Monte Carlo
- Author
-
Chen, Naitong, Huggins, Jonathan H., and Campbell, Trevor
- Subjects
Statistics - Computation ,Computer Science - Machine Learning - Abstract
A Bayesian coreset is a small, weighted subset of a data set that replaces the full data during inference to reduce computational cost. The state-of-the-art coreset construction algorithm, Coreset Markov chain Monte Carlo (Coreset MCMC), uses draws from an adaptive Markov chain targeting the coreset posterior to train the coreset weights via stochastic gradient optimization. However, the quality of the constructed coreset, and thus the quality of its posterior approximation, is sensitive to the stochastic optimization learning rate. In this work, we propose a learning-rate-free stochastic gradient optimization procedure, Hot-start Distance over Gradient (Hot DoG), for training coreset weights in Coreset MCMC without user tuning effort. Empirical results demonstrate that Hot DoG provides higher quality posterior approximations than other learning-rate-free stochastic gradient methods, and performs competitively to optimally-tuned ADAM.
- Published
- 2024
35. AutoStep: Locally adaptive involutive MCMC
- Author
-
Liu, Tiange, Surjanovic, Nikola, Biron-Lattes, Miguel, Bouchard-Côté, Alexandre, and Campbell, Trevor
- Subjects
Statistics - Computation ,Computer Science - Machine Learning ,Statistics - Machine Learning - Abstract
Many common Markov chain Monte Carlo (MCMC) kernels can be formulated using a deterministic involutive proposal with a step size parameter. Selecting an appropriate step size is often a challenging task in practice; and for complex multiscale targets, there may not be one choice of step size that works well globally. In this work, we address this problem with a novel class of involutive MCMC methods -- AutoStep MCMC -- that selects an appropriate step size at each iteration adapted to the local geometry of the target distribution. We prove that AutoStep MCMC is $\pi$-invariant and has other desirable properties under mild assumptions on the target distribution $\pi$ and involutive proposal. Empirical results examine the effect of various step size selection design choices, and show that AutoStep MCMC is competitive with state-of-the-art methods in terms of effective sample size per unit cost on a range of challenging target distributions.
- Published
- 2024
36. Navigating Noisy Feedback: Enhancing Reinforcement Learning with Error-Prone Language Models
- Author
-
Lin, Muhan, Shi, Shuyang, Guo, Yue, Chalaki, Behdad, Tadiparthi, Vaishnav, Pari, Ehsan Moradi, Stepputtis, Simon, Campbell, Joseph, and Sycara, Katia
- Subjects
Computer Science - Artificial Intelligence - Abstract
The correct specification of reward models is a well-known challenge in reinforcement learning. Hand-crafted reward functions often lead to inefficient or suboptimal policies and may not be aligned with user values. Reinforcement learning from human feedback is a successful technique that can mitigate such issues, however, the collection of human feedback can be laborious. Recent works have solicited feedback from pre-trained large language models rather than humans to reduce or eliminate human effort, however, these approaches yield poor performance in the presence of hallucination and other errors. This paper studies the advantages and limitations of reinforcement learning from large language model feedback and proposes a simple yet effective method for soliciting and applying feedback as a potential-based shaping function. We theoretically show that inconsistent rankings, which approximate ranking errors, lead to uninformative rewards with our approach. Our method empirically improves convergence speed and policy returns over commonly used baselines even with significant ranking errors, and eliminates the need for complex post-processing of reward functions., Comment: 13 pages, 8 figures, The 2024 Conference on Empirical Methods in Natural Language Processing
- Published
- 2024
37. Direct measurement of 2DEG states in shallow Si:Sb $\delta$-layers
- Author
-
Strand, Frode S., Cooil, Simon P., Campbell, Quinn T., Flounders, John J., Røst, Håkon I., Åsland, Anna Cecilie, Skarpeid, Alv Johan, Stalsberg, Marte P., Hu, Jinbang, Bakkelund, Johannes, Bjelland, Victoria, Preobrajenski, Alexei B., Li, Zheshen, Bianchi, Marco, Miwa, Jill A., and Wells, Justin W.
- Subjects
Condensed Matter - Materials Science - Abstract
We investigate the electronic structure of high-density layers of Sb dopants in a silicon host, so-called Si:Sb $\delta$-layers. We show that, in spite of the known challenges in producing highly confined Sb $\delta$-layers, sufficient confinement is created such that the lowest conduction band states ($\Gamma$ states, studied in depth in other silicon $\delta$-layers), become occupied and can be observed using angle-resolved photoemission spectroscopy. The electronic structure of the Si:Sb $\delta$-layers closely resembles that of Si:P systems, where the observed conduction band is near-parabolic and slightly anisotropic in the $\mathbf{k}_\parallel$ plane. The observed $\Gamma$ state extends ~ 1 nm in the out-of-plane direction, which is slightly wider than the 1/3 monolayer thick dopant distribution. This is caused by a small segregation of the dopant layer, which is nevertheless minimal when comparing with earlier published attempts. Our results serve to demonstrate that Sb is still a feasible dopant alternative for use in the semiconductor $\delta$-layer platform, providing similar electronic functionality to Si:P systems. Additionally, it has the advantages of being less expensive, more controllable, safer to handle, and more compatible with industrial patterning techniques. Si:Sb is therefore a viable platform for emerging quantum device applications.
- Published
- 2024
38. CAMO-S: A meteor-tracking spectrograph at the Canadian Automated Meteor Observatory
- Author
-
Mazur, Michael, Campbell-Brown, Margaret, Brown, Peter, Vida, Denis, Gural, Pete, and Yang, Zhangqing
- Subjects
Astrophysics - Earth and Planetary Astrophysics ,Astrophysics - Instrumentation and Methods for Astrophysics ,Physics - Instrumentation and Detectors - Abstract
The Canadian Automated Meteor Observatory (CAMO) mirror tracking system has been in operation since 2009 and has, to date, produced more than 20,000 two-station meteor observations at meter-level spatial and 10 ms temporal resolution. In 2020, a spectral tracking camera was added in parallel at one of the CAMO stations. To date, it has recorded the spectra of hundreds of faint meteors. Engineering testing from 2020-2023 resulted in the selection of a 150 lpmm grating and an EMCCD camera to achieve a spectral resolution of about 1 nm/pixel in the final configuration. The CAMO spectral system can resolve spectra from individual meteoroid fragments, record spectra for meteors of +2 peak magnitude to as faint as +4 in parts of the lightcurve and produce relative abundance estimates for Mg, Fe and Na. Our preliminary results also show identification of the H and K lines of CA(II). Meteors with strong iron lines were found to have unusual fragmentation behaviour, involving gross fragmentation rather than continuously shedding small particles. The spectra of individual fragments can be resolved in some cases, showing that these Fe-rich objects do not differ in composition among fragments. Our calibration procedure and hardware configuration are discussed together with preliminary results., Comment: Accepted (Oct. 22, 2024) for publication in Publications of the Astronomical Society of the Pacific
- Published
- 2024
39. Binding energies, charge radii, spins and moments: odd-odd Ag isotopes and discovery of a new isomer
- Author
-
Borne, B. van den, Stryjczyk, M., de Groote, R. P., Kankainen, A., Nesterenko, D. A., Ayoubi, L. Al, Ascher, P., Beliuskina, O., Bissell, M. L., Bonnard, J., Campbell, P., Canete, L., Cheal, B., Delafosse, C., de Roubin, A., Devlin, C. S., Eronen, T., Ruiz, R. F. Garcia, Geldhof, S., Gerbaux, M., Gins, W., Grévy, S., Hukkanen, M., Husson, A., Imgram, P., Koszorús, Á., Mathieson, R., Moore, I. D., Neyens, G., Pohjalainen, I., Reponen, M., Rinta-Antila, S., Vilen, M., Virtanen, V., Weaver, A. P., and Zadvornaya, A.
- Subjects
Nuclear Experiment ,Physics - Atomic Physics - Abstract
We report on the masses and hyperfine structure of ground and isomeric states in $^{114,116,118,120}$Ag isotopes, measured with the phase-imaging ion-cyclotron-resonance technique (PI-ICR) with the JYFLTRAP mass spectrometer and the collinear laser spectroscopy beamline at the Ion Guide Isotope Separator On-Line (IGISOL) facility, Jyv\"askyl\"a, Finland. We measured the masses and excitation energies, electromagnetic moments, and charge radii, and firmly established the nuclear spins of the long-lived states. A new isomer was discovered in $^{118}$Ag and the half-lives of $^{118}$Ag long-lived states were reevaluated. We unambiguously pinned down the level ordering of all long-lived states, placing the inversion of the $I = 0^-$ and $I = 4^+$ states at $A = 118$ $(N = 71)$. Lastly, we compared the electromagnetic moments of each state to empirical single-particle moments to identify the dominant configuration where possible., Comment: 11 pages paper (excl. references) + 3 pages of supplementary material
- Published
- 2024
40. On-chip cryogenic multiplexing of Si/SiGe quantum devices
- Author
-
Wolfe, M. A., McJunkin, Thomas, Ward, Daniel R., Campbell, DeAnna, Friesen, Mark, and Eriksson, M. A.
- Subjects
Condensed Matter - Mesoscale and Nanoscale Physics ,Quantum Physics - Abstract
The challenges of operating qubits in a cryogenic environment point to a looming bottleneck for large-scale quantum processors, limited by the number of input-output connections. Classical processors solve this problem via multiplexing; however, on-chip multiplexing circuits have not been shown to have similar benefits for cryogenic quantum devices. In this work we integrate classical circuitry and Si/SiGe quantum devices on the same chip, providing a test bed for qubit scale-up. Our method uses on-chip field-effect transistors (FETs) to multiplex a grid of work zones, achieving a nearly tenfold reduction in control wiring. We leverage this set-up to probe device properties across a 6x6mm$^2$ array of 16 Hall bars. We successfully operate the array at cryogenic temperatures and high magnetic fields where the quantum Hall effect is observed. Building upon these results, we propose a vision for readout in a large-scale silicon quantum processor with a limited number of control connections.
- Published
- 2024
41. Multi-modal graph neural networks for localized off-grid weather forecasting
- Author
-
Yang, Qidong, Giezendanner, Jonathan, Civitarese, Daniel Salles, Jakubik, Johannes, Schmitt, Eric, Chandra, Anirban, Vila, Jeremy, Hohl, Detlef, Hill, Chris, Watson, Campbell, and Wang, Sherrie
- Subjects
Computer Science - Machine Learning ,Physics - Atmospheric and Oceanic Physics - Abstract
Urgent applications like wildfire management and renewable energy generation require precise, localized weather forecasts near the Earth's surface. However, weather forecast products from machine learning or numerical weather models are currently generated on a global regular grid, on which a naive interpolation cannot accurately reflect fine-grained weather patterns close to the ground. In this work, we train a heterogeneous graph neural network (GNN) end-to-end to downscale gridded forecasts to off-grid locations of interest. This multi-modal GNN takes advantage of local historical weather observations (e.g., wind, temperature) to correct the gridded weather forecast at different lead times towards locally accurate forecasts. Each data modality is modeled as a different type of node in the graph. Using message passing, the node at the prediction location aggregates information from its heterogeneous neighbor nodes. Experiments using weather stations across the Northeastern United States show that our model outperforms a range of data-driven and non-data-driven off-grid forecasting methods. Our approach demonstrates how the gap between global large-scale weather models and locally accurate predictions can be bridged to inform localized decision-making.
- Published
- 2024
42. MultiCamCows2024 -- A Multi-view Image Dataset for AI-driven Holstein-Friesian Cattle Re-Identification on a Working Farm
- Author
-
Yu, Phoenix, Burghardt, Tilo, Dowsey, Andrew W, and Campbell, Neill W
- Subjects
Computer Science - Computer Vision and Pattern Recognition - Abstract
We present MultiCamCows2024, a farm-scale image dataset filmed across multiple cameras for the biometric identification of individual Holstein-Friesian cattle exploiting their unique black and white coat-patterns. Captured by three ceiling-mounted visual sensors covering adjacent barn areas over seven days on a working dairy farm, the dataset comprises 101, 329 images of 90 cows, plus the underlying original CCTV footage. The dataset is provided alongside full computer vision recognition baselines, that is both a supervised and self-supervised learning framework for individual cow identification trained on cattle tracklets. We report a performance above 96% single image identification accuracy from the dataset and demonstrate that combining data from multiple cameras during learning enhances self-supervised identification. We show that our framework enables fully automatic cattle identification, barring only the simple human verification of tracklet integrity during data collection. Crucially, our study highlights that multi-camera, supervised and self-supervised components in tandem not only deliver highly accurate individual cow identification but also achieve this efficiently with no labelling of cattle identities by humans at all. We argue that this improvement in efficacy has practical implications for livestock management, behaviour analysis, and agricultural monitoring. For full reproducibility and practical ease of use, we publish all key software and code including re-identification components and the species detector with this paper., Comment: 26 pages, 10 figures
- Published
- 2024
43. Large Language Models for Medical OSCE Assessment: A Novel Approach to Transcript Analysis
- Author
-
Shakur, Ameer Hamza, Holcomb, Michael J., Hein, David, Kang, Shinyoung, Dalton, Thomas O., Campbell, Krystle K., Scott, Daniel J., and Jamieson, Andrew R.
- Subjects
Computer Science - Computation and Language ,Computer Science - Artificial Intelligence - Abstract
Grading Objective Structured Clinical Examinations (OSCEs) is a time-consuming and expensive process, traditionally requiring extensive manual effort from human experts. In this study, we explore the potential of Large Language Models (LLMs) to assess skills related to medical student communication. We analyzed 2,027 video-recorded OSCE examinations from the University of Texas Southwestern Medical Center (UTSW), spanning four years (2019-2022), and several different medical cases or "stations." Specifically, our focus was on evaluating students' ability to summarize patients' medical history: we targeted the rubric item 'did the student summarize the patients' medical history?' from the communication skills rubric. After transcribing speech audio captured by OSCE videos using Whisper-v3, we studied the performance of various LLM-based approaches for grading students on this summarization task based on their examination transcripts. Using various frontier-level open-source and proprietary LLMs, we evaluated different techniques such as zero-shot chain-of-thought prompting, retrieval augmented generation, and multi-model ensemble methods. Our results show that frontier LLM models like GPT-4 achieved remarkable alignment with human graders, demonstrating a Cohen's kappa agreement of 0.88 and indicating strong potential for LLM-based OSCE grading to augment the current grading process. Open-source models also showed promising results, suggesting potential for widespread, cost-effective deployment. Further, we present a failure analysis identifying conditions where LLM grading may be less reliable in this context and recommend best practices for deploying LLMs in medical education settings.
- Published
- 2024
44. Unobserved Object Detection using Generative Models
- Author
-
Bhattacharjee, Subhransu S., Campbell, Dylan, and Shome, Rahul
- Subjects
Computer Science - Computer Vision and Pattern Recognition ,Computer Science - Artificial Intelligence ,Computer Science - Robotics - Abstract
Can we detect an object that is not visible in an image? This study introduces the novel task of 2D and 3D unobserved object detection for predicting the location of objects that are occluded or lie outside the image frame. We adapt several state-of-the-art pre-trained generative models to solve this task, including 2D and 3D diffusion models and vision--language models, and show that they can be used to infer the presence of objects that are not directly observed. To benchmark this task, we propose a suite of metrics that captures different aspects of performance. Our empirical evaluations on indoor scenes from the RealEstate10k dataset with COCO object categories demonstrate results that motivate the use of generative models for the unobserved object detection task. The current work presents a promising step towards compelling applications like visual search and probabilistic planning that can leverage object detection beyond what can be directly observed., Comment: 16 pages; 41 figures
- Published
- 2024
45. Universality for roots of derivatives of entire functions via finite free probability
- Author
-
Campbell, Andrew, O'Rourke, Sean, and Renfrew, David
- Subjects
Mathematics - Probability ,Mathematics - Combinatorics ,Mathematics - Complex Variables - Abstract
A universality conjecture of Farmer and Rhoades [Trans. Amer. Math. Soc., 357(9):3789--3811, 2005] and Farmer [Adv. Math., 411:Paper No. 108781, 14, 2022] asserts that, under some natural conditions, the roots of an entire function should become perfectly spaced in the limit of repeated differentiation. This conjecture is known as Cosine Universality. We establish this conjecture for a class of even entire functions with only real roots which are real on the real line. Along the way, we establish a number of additional universality results for Jensen polynomials of entire functions, including the Hermite Universality conjecture of Farmer [Adv. Math., 411:Paper No. 108781, 14, 2022]. Our proofs are based on finite free probability theory. We establish finite free probability analogs of the law of large numbers, central limit theorem, and Poisson limit theorem for sequences of deterministic polynomials under repeated differentiation, under optimal moment conditions, which are of independent interest., Comment: 30 pages, 1 figure
- Published
- 2024
46. Think While You Generate: Discrete Diffusion with Planned Denoising
- Author
-
Liu, Sulin, Nam, Juno, Campbell, Andrew, Stärk, Hannes, Xu, Yilun, Jaakkola, Tommi, and Gómez-Bombarelli, Rafael
- Subjects
Computer Science - Machine Learning ,Computer Science - Artificial Intelligence ,Computer Science - Computation and Language ,Computer Science - Computer Vision and Pattern Recognition ,Statistics - Machine Learning - Abstract
Discrete diffusion has achieved state-of-the-art performance, outperforming or approaching autoregressive models on standard benchmarks. In this work, we introduce Discrete Diffusion with Planned Denoising (DDPD), a novel framework that separates the generation process into two models: a planner and a denoiser. At inference time, the planner selects which positions to denoise next by identifying the most corrupted positions in need of denoising, including both initially corrupted and those requiring additional refinement. This plan-and-denoise approach enables more efficient reconstruction during generation by iteratively identifying and denoising corruptions in the optimal order. DDPD outperforms traditional denoiser-only mask diffusion methods, achieving superior results on language modeling benchmarks such as text8, OpenWebText, and token-based generation on ImageNet $256 \times 256$. Notably, in language modeling, DDPD significantly reduces the performance gap between diffusion-based and autoregressive methods in terms of generative perplexity. Code is available at https://github.com/liusulin/DDPD.
- Published
- 2024
47. Characterizing real-representable matroids with large average hyperplane-size
- Author
-
Campbell, Rutger, Kroeker, Matthew E., and Lund, Ben
- Subjects
Mathematics - Combinatorics - Abstract
Generalizing a theorem of the first two authors and Geelen for planes, we show that, for a real-representable matroid $M$, either the average hyperplane-size in $M$ is at most a constant depending only on its rank, or each hyperplane of $M$ contains one of a set of at most $r(M)-2$ lines. Additionally, in the latter case, the ground set of $M$ has a partition $(E_{1}, E_{2})$, where $E_{1}$ can be covered by few flats of relatively low rank and $|E_{2}|$ is bounded. Finally, we formulate a high-dimensional generalization of a classic problem of Motzkin, Gr\"unbaum, Erd\H{o}s and Purdy on sets of red and blue points in the plane with no monochromatic blue line. We show that the solution to this problem gives a tight upper bound on $|E_{2}|$. We also discuss this high-dimensional problem in its own right, and prove some initial results.
- Published
- 2024
48. Demonstrating real-time and low-latency quantum error correction with superconducting qubits
- Author
-
Caune, Laura, Skoric, Luka, Blunt, Nick S., Ruban, Archibald, McDaniel, Jimmy, Valery, Joseph A., Patterson, Andrew D., Gramolin, Alexander V., Majaniemi, Joonas, Barnes, Kenton M., Bialas, Tomasz, Buğdaycı, Okan, Crawford, Ophelia, Gehér, György P., Krovi, Hari, Matekole, Elisha, Topal, Canberk, Poletto, Stefano, Bryant, Michael, Snyder, Kalan, Gillespie, Neil I., Jones, Glenn, Johar, Kauser, Campbell, Earl T., and Hill, Alexander D.
- Subjects
Quantum Physics - Abstract
Quantum error correction (QEC) will be essential to achieve the accuracy needed for quantum computers to realise their full potential. The field has seen promising progress with demonstrations of early QEC and real-time decoded experiments. As quantum computers advance towards demonstrating a universal fault-tolerant logical gate set, implementing scalable and low-latency real-time decoding will be crucial to prevent the backlog problem, avoiding an exponential slowdown and maintaining a fast logical clock rate. Here, we demonstrate low-latency feedback with a scalable FPGA decoder integrated into the control system of a superconducting quantum processor. We perform an 8-qubit stability experiment with up to $25$ decoding rounds and a mean decoding time per round below $1$ ${\mu}s$, showing that we avoid the backlog problem even on superconducting hardware with the strictest speed requirements. We observe logical error suppression as the number of decoding rounds is increased. We also implement and time a fast-feedback experiment demonstrating a decoding response time of $9.6$ ${\mu}s$ for a total of $9$ measurement rounds. The decoder throughput and latency developed in this work, combined with continued device improvements, unlock the next generation of experiments that go beyond purely keeping logical qubits alive and into demonstrating building blocks of fault-tolerant computation, such as lattice surgery and magic state teleportation., Comment: 11 pages, 4 figures, Supplementary Information
- Published
- 2024
49. A lift of chromatic symmetric functions to $\textsf{NSym}$
- Author
-
Campbell, John M.
- Subjects
Mathematics - Combinatorics ,05E05 - Abstract
If we consider previously introduced extensions of Stanley's chromatic symmetric function $X_{G}(x_1, x_2, \ldots)$ for a graph $G$ to elements in the algebra $\textsf{QSym}$ of quasisymmetric functions and in the algebra $\textsf{NCSym}$ of symmetric functions in noncommuting variables, this motivates our introduction of a lifting of $X_{G}$ to the dual of $\textsf{QSym}$, i.e., the algebra $\textsf{NSym}$ of noncommutative symmetric functions, as opposed to $\textsf{NCSym}$. For an unlabelled directed graph $D$, our extension of chromatic symmetric functions provides an element $\text{{X}}_{D}$ in $\textsf{NSym}$, in contrast to the analogue $Y_{G} \in \textsf{NCSym}$ of $X_{G}$ due to Gebhard and Sagan. Letting $G$ denote the undirected graph underlying $D$, our construction is such that the commutative image of $\text{{X}}_{D}$ is $ X_{G}$. This projection property is achieved by lifting Stanley's power sum expansion for chromatic symmetric functions, with the use of the $\Psi$-basis of $\textsf{NSym}$, so that the orderings of the entries of the indexing compositions are determined by the directed edges of $D$. We then construct generating sets for $\textsf{NSym}$ consisting of expressions of the form $\text{{X}}_{D}$, building on the work of Cho and van Willigenburg on chromatic generating sets for $\textsf{Sym}$., Comment: Submitted for publication
- Published
- 2024
50. High-precision mass measurement of $^{103}$Sn restores smoothness of the mass surface
- Author
-
Ireland, C. M., Maier, F. M., Bollen, G., Campbell, S. E., Chen, X., Erington, H., Gamage, N. D., Gutiérrez, M. J., Izzo, C., Leistenschneider, E., Lykiardopoulou, E. M., Orford, R., Porter, W. S., Puentes, D., Redshaw, M., Ringle, R., Rogers, S., Schwarz, S., Stackable, L., Sumithrarachchi, C. S., Valverde, A. A., Villari, A. C. C., and Yandow, I. T.
- Subjects
Nuclear Experiment - Abstract
As a step towards the ultimate goal of a high-precision mass measurement of doubly-magic $^{100}$Sn, the mass of $^{103}$Sn was measured at the Low Energy Beam and Ion Trap (LEBIT) located at the Facility for Rare Isotope Beams (FRIB). Utilizing the time-of-flight ion cyclotron resonance (ToF-ICR) technique, a mass uncertainty of 3.7~keV was achieved, an improvement by more than an order of magnitude compared to a recent measurement performed in 2023 at the Cooler Storage Ring (CSRe) in Lanzhou. Although the LEBIT and CSRe mass measurements of $^{103}$Sn are in agreement, they diverge from the experimental mass value reported in the 2016 version of the Atomic Mass Evaluation (AME2016), which was derived from the measured $Q_{\beta^+}$ value and the mass of $^{103}$In. In AME2020, this indirectly measured $^{103}$Sn mass was classified as a `seriously irregular mass' and replaced with an extrapolated value, which aligns with the most recent measured values from CSRe and LEBIT. As such, the smoothness of the mass surface is confidently reestablished for $^{103}$Sn. Furthermore, LEBIT's mass measurement of $^{103}$Sn enabled a significant reduction in the mass uncertainties of five parent isotopes which are now dominated by uncertainties in their respective $Q$-values.
- Published
- 2024
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.