Search

Passive acoustic monitoring (PAM) studies generate thousands of hours of audio, which may be used to monitor specific animal populations, conduct broad biodiversity surveys, detect threats such as poachers, and more. Machine learning classifiers for species identification are increasingly being used to process the vast amount of audio generated by bioacoustic surveys, expediting analysis and increasing the utility of PAM as a management tool. In common practice, a threshold is applied to classifier output scores, and scores above the threshold are aggregated into a detection count. The choice of threshold produces biased counts of vocalizations, which are subject to false positive/negative rates that may vary across subsets of the dataset. In this work, we advocate for directly estimating call density: The proportion of detection windows containing the target vocalization, regardless of classifier score. Our approach targets a desirable ecological estimator and provides a more rigorous grounding for identifying the core problems caused by distribution shifts -- when the defining characteristics of the data distribution change -- and designing strategies to mitigate them. We propose a validation scheme for estimating call density in a body of data and obtain, through Bayesian reasoning, probability distributions of confidence scores for both the positive and negative classes. We use these distributions to predict site-level densities, which may be subject to distribution shifts. We test our proposed methods on a real-world study of Hawaiian birds and provide simulation results leveraging existing fully annotated datasets, demonstrating robustness to variations in call density and classifier model quality., Comment: 14 pages, 6 figures, 3 tables; submitted to Frontiers in Bird Science; Our Hawaiian PAM dataset and classifier scores, as well as annotation information for the three study species, can be found on Zenodo at https://doi.org/10.5281/zenodo.10581530. The fully annotated Powdermill dataset assembled by Chronister et al. that was used in this study is available at https://doi.org/10.1002/ecy.3329

We study a family of excitonic quantum phase transitions describing the evolution of a bilayer metallic state to an inter-layer coherent state where excitons condense. We argue that such transitions can be continuous and exhibit a non-Fermi liquid counterflow response ${\rho_{\mathrm{counterflow}}(\omega)\sim\omega^{2/z}}$ that directly encodes the dynamical critical exponent $z$. Our calculations are performed within a controlled expansion around $z = 2$. This physics is relevant to any system with spin, valley, or layer degrees of freedom. We consider two contexts for excitonic quantum criticality: (1) a weakly interacting graphene bilayer, and (2) a system of two narrow, half-filled Chern bands at zero external magnetic field, with total Chern number $C_{\mathrm{tot}}=0$, which may soon be realizable in moir\'{e} materials. The latter system hosts a time-reversed pair of composite Fermi liquid states, and the condensation of excitons of the composite fermions leads to an exotic exciton insulator* state with a charge neutral Fermi surface. Our work sheds new light on the physics of inter-layer coherence transitions in 2D materials., Comment: 30 pages + 26 pages appendices, 8 figures. (v2) Includes the effect of momentum dependence in the fermion self energy, which was neglected in (v1). Appendix A has been expanded to clarify the relationship between this work and the existing literature on ferromagnetic transitions in metals

We study a matching problem between agents and public goods, in settings without monetary transfers. Since goods are public, they have no capacity constraints. There is no exogenously defined budget of goods to be provided. Rather, each provided good must justify its cost, leading to strong complementarities in the "preferences" of goods. Furthermore, goods that are in high demand given other already-provided goods must also be provided. The question of the existence of a stable solution (a menu of public goods to be provided) exhibits a rich combinatorial structure. We uncover sufficient conditions and necessary conditions for guaranteeing the existence of a stable solution, and derive both positive and negative results for strategyproof stable matching.

We introduce the Visual Experience Dataset (VEDB), a compilation of over 240 hours of egocentric video combined with gaze- and head-tracking data that offers an unprecedented view of the visual world as experienced by human observers. The dataset consists of 717 sessions, recorded by 58 observers ranging from 6-49 years old. This paper outlines the data collection, processing, and labeling protocols undertaken to ensure a representative sample and discusses the potential sources of error or bias within the dataset. The VEDB's potential applications are vast, including improving gaze tracking methodologies, assessing spatiotemporal image statistics, and refining deep neural networks for scene and activity recognition. The VEDB is accessible through established open science platforms and is intended to be a living dataset with plans for expansion and community contributions. It is released with an emphasis on ethical considerations, such as participant privacy and the mitigation of potential biases. By providing a dataset grounded in real-world experiences and accompanied by extensive metadata and supporting code, the authors invite the research community to utilize and contribute to the VEDB, facilitating a richer understanding of visual perception and behavior in naturalistic settings., Comment: 40 pages, 1 table, 9 figures

Optimization constrained by high-fidelity computational models has potential for transformative impact. However, such optimization is frequently unattainable in practice due to the complexity and computational intensity of the model. An alternative is to optimize a low-fidelity model and use limited evaluations of the high-fidelity model to assess the quality of the solution. This article develops a framework to use limited high-fidelity simulations to update the optimization solution computed using the low-fidelity model. Building off a previous article [22], which introduced hyper-differential sensitivity analysis with respect to model discrepancy, this article provides novel extensions of the algorithm to enable uncertainty quantification of the optimal solution update via a Bayesian framework. Specifically, we formulate a Bayesian inverse problem to estimate the model discrepancy and propagate the posterior model discrepancy distribution through the post-optimality sensitivity operator for the low-fidelity optimization problem. We provide a rigorous treatment of the Bayesian formulation, a computationally efficient algorithm to compute posterior samples, a guide to specify and interpret the algorithm hyper-parameters, and a demonstration of the approach on three examples which highlight various types of discrepancy between low and high-fidelity models.

Morpho-evolution (ME) refers to the simultaneous optimisation of a robot's design and controller to maximise performance given a task and environment. Many genetic encodings have been proposed which are capable of representing design and control. Previous research has provided empirical comparisons between encodings in terms of their performance with respect to an objective function and the diversity of designs that are evaluated, however there has been no attempt to explain the observed findings. We address this by applying Local Optima Network (LON) analysis to investigate the structure of the fitness landscapes induced by three different encodings when evolving a robot for a locomotion task, shedding new light on the ease by which different fitness landscapes can be traversed by a search process. This is the first time LON analysis has been applied in the field of ME despite its popularity in combinatorial optimisation domains; the findings will facilitate design of new algorithms or operators that are customised to ME landscapes in the future., Comment: Submitted to GECCO-2024

Hall and Robinson (2009) proposed and analyzed the use of bagged cross-validation to choose the bandwidth of a kernel density estimator. They established that bagging greatly reduces the noise inherent in ordinary cross-validation, and hence leads to a more efficient bandwidth selector. The asymptotic theory of Hall and Robinson (2009) assumes that $N$, the number of bagged subsamples, is $\infty$. We expand upon their theoretical results by allowing $N$ to be finite, as it is in practice. Our results indicate an important difference in the rate of convergence of the bagged cross-validation bandwidth for the cases $N=\infty$ and $N<\infty$. Simulations quantify the improvement in statistical efficiency and computational speed that can result from using bagged cross-validation as opposed to a binned implementation of ordinary cross-validation. The performance of thebagged bandwidth is also illustrated on a real, very large, data set. Finally, a byproduct of our study is the correction of errors appearing in the Hall and Robinson (2009) expression for the asymptotic mean squared error of the bagging selector., Comment: 37 pages, 9 figures

Computer-based scene understanding has influenced fields ranging from urban planning to autonomous vehicle performance, yet little is known about how well these technologies work across social differences. We investigate the biases of deep convolutional neural networks (dCNNs) in scene classification, using nearly one million images from global and US sources, including user-submitted home photographs and Airbnb listings. We applied statistical models to quantify the impact of socioeconomic indicators such as family income, Human Development Index (HDI), and demographic factors from public data sources (CIA and US Census) on dCNN performance. Our analyses revealed significant socioeconomic bias, where pretrained dCNNs demonstrated lower classification accuracy, lower classification confidence, and a higher tendency to assign labels that could be offensive when applied to homes (e.g., "ruin", "slum"), especially in images from homes with lower socioeconomic status (SES). This trend is consistent across two datasets of international images and within the diverse economic and racial landscapes of the United States. This research contributes to understanding biases in computer vision, emphasizing the need for more inclusive and representative training datasets. By mitigating the bias in the computer vision pipelines, we can ensure fairer and more equitable outcomes for applied computer vision, including home valuation and smart home security systems. There is urgency in addressing these biases, which can significantly impact critical decisions in urban development and resource allocation. Our findings also motivate the development of AI systems that better understand and serve diverse communities, moving towards technology that equitably benefits all sectors of society., Comment: 20 pages, 3 figures, 3 tables

Machine-learning approaches to algorithm-selection typically take data describing an instance as input. Input data can take the form of features derived from the instance description or fitness landscape, or can be a direct representation of the instance itself, i.e. an image or textual description. Regardless of the choice of input, there is an implicit assumption that instances that are similar will elicit similar performance from algorithm, and that a model is capable of learning this relationship. We argue that viewing algorithm-selection purely from an instance perspective can be misleading as it fails to account for how an algorithm `views' similarity between instances. We propose a novel `algorithm-centric' method for describing instances that can be used to train models for algorithm-selection: specifically, we use short probing trajectories calculated by applying a solver to an instance for a very short period of time. The approach is demonstrated to be promising, providing comparable or better results to computationally expensive landscape-based feature-based approaches. Furthermore, projecting the trajectories into a 2-dimensional space illustrates that functions that are similar from an algorithm-perspective do not necessarily correspond to the accepted categorisation of these functions from a human perspective., Comment: To appear in the proceedings of the 27th International Conference, EvoApplications 2024

Reservoir computing is a machine learning framework that has been shown to be able to replicate the chaotic attractor, including the fractal dimension and the entire Lyapunov spectrum, of the dynamical system on which it is trained. We quantitatively relate the generalized synchronization dynamics of a driven reservoir during the training stage to the performance of the trained reservoir computer at the attractor reconstruction task. We show that, in order to obtain successful attractor reconstruction and Lyapunov spectrum estimation, the largest conditional Lyapunov exponent of the driven reservoir must be significantly more negative than the most negative Lyapunov exponent of the target system. We also find that the maximal conditional Lyapunov exponent of the reservoir depends strongly on the spectral radius of the reservoir adjacency matrix, and therefore, for attractor reconstruction and Lyapunov spectrum estimation, small spectral radius reservoir computers perform better in general. Our arguments are supported by numerical examples on well-known chaotic systems.

Accelerator based neutrino oscillation experiments seek to measure the relative number of electron and muon neutrinos and antineutrinos at different $L/E$ values. However high statistics studies of neutrino interactions are almost exclusively measured using muon neutrinos and antineutrinos since the dominant flavor of neutrinos produced by accelerator based beams are of the muon type. This work reports new measurements of electron neutrino and antineutrino interactions in hydrocarbon, obtained by strongly suppressing backgrounds initiated by muon flavor neutrinos and antineutrinos. Double differential cross sections as a function of visible energy transfer, $E_\text{avail}$, and transverse momentum transfer, $p_T$, or three momentum transfer, $q_3$ are presented., Comment: 25 pages, 32 figures and 7 tables, accepted for publication in Physical Review D. Revised to add content updated in review process

In high-energy particle collisions, the reconstruction of secondary vertices from heavy-flavour hadron decays is crucial for identifying and studying jets initiated by $b$- or $c$-quarks. Traditional methods, while effective, require extensive manual optimisation and struggle to perform consistently across wide regions of phase space. Meanwhile, recent advancements in machine learning have improved performance but are unable to fully reconstruct multiple vertices. In this work we propose a novel approach to secondary vertex reconstruction based on recent advancements in object detection and computer vision. Our method directly predicts the presence and properties of an arbitrary number of vertices in a single model. This approach overcomes the limitations of existing techniques. Applied to simulated proton-proton collision events, our approach demonstrates significant improvements in vertex finding efficiency, achieving a 10% improvement over an existing state-of-the-art method. Moreover, it enables vertex fitting, providing accurate estimates of key vertex properties such as transverse momentum, radial flight distance, and angular displacement from the jet axis. When integrated into a flavour tagging pipeline, our method yields a 50% improvement in light-jet rejection and a 15% improvement in $c$-jet rejection at a $b$-jet selection efficiency of 70%. These results demonstrate the potential of adapting advanced object detection techniques for particle physics, and pave the way for more powerful and flexible reconstruction tools in high-energy physics experiments., Comment: 10 pages, 5 figures

In-situ Electron Energy Loss Spectroscopy (EELS) is an instrumental technique that has traditionally been used to understand how the choice of materials processing has the ability to change local structure and composition. However, more recent advances to observe and react to transient changes occurring at the ultrafast timescales that are now possible with EELS and Transmission Electron Microscopy (TEM) will require new frameworks for characterization and analysis. We describe a machine learning (ML) framework for the rapid assessment and characterization of in operando EELS Spectrum Images (EELS-SI) without the need for many labeled training datapoints as typically required for deep learning classification methods. By embedding computationally generated structures and experimental datasets into an equivalent latent space through Variational Autoencoders (VAE), we effectively predict the structural changes at latency scales relevant to closed-loop processing within the TEM. The framework described in this study is a critical step in enabling automated, on-the-fly synthesis and characterization which will greatly advance capabilities for materials discovery and precision engineering of functional materials at the atomic scale., Comment: 17 pages, 8 figures

We use the frozen phonon method to calculate the anharmonic potential energy surface and to model the ultrafast ferroelectric polarization reversal in LiNbO3 driven by intense pulses of THz light. Before stable switching of the polarization occurs, there exists a region of excitation field-strengths where transient switching can occur, as observed experimentally [Physical Review Letters 118, 197601 (2017)]. By varying the excitation frequency from 4 to 20 THz, our modeling suggests that more efficient, permanent polarization switching can occur by directly exciting the soft mode at 7 THz, compared to nonlinear phononic-induced switching driven by exciting a high frequency mode at 18 THz. We also show that neglecting anharmonic coupling pathways in the modeled experiment can lead to significant differences in the modeled switching field strengths., Comment: 8 pages, 3 figures

Researchers in natural science need reliable methods for quantifying animal behavior. Recently, numerous computer vision methods emerged to automate the process. However, observing wild species at remote locations remains a challenging task due to difficult lighting conditions and constraints on power supply and data storage. Event cameras offer unique advantages for battery-dependent remote monitoring due to their low power consumption and high dynamic range capabilities. We use this novel sensor to quantify a behavior in Chinstrap penguins called ecstatic display. We formulate the problem as a temporal action detection task, determining the start and end times of the behavior. For this purpose, we recorded a colony of breeding penguins in Antarctica for several weeks and labeled event data on 16 nests. The developed method consists of a generator of candidate time intervals (proposals) and a classifier of the actions within them. The experiments show that the event cameras' natural response to motion is effective for continuous behavior monitoring and detection, reaching a mean average precision (mAP) of 58% (which increases to 63% in good weather conditions). The results also demonstrate the robustness against various lighting conditions contained in the challenging dataset. The low-power capabilities of the event camera allow it to record significantly longer than with a conventional camera. This work pioneers the use of event cameras for remote wildlife observation, opening new interdisciplinary opportunities. https://tub-rip.github.io/eventpenguins/, Comment: 13 pages, 8 figures, 12 tables, Project page: https://tub-rip.github.io/eventpenguins/

Many material properties can be traced back to properties of their grain boundaries. Grain boundary energy (GBE), as a result, is a key quantity of interest in the analysis and modeling of microstructure. A standard method for calculating grain boundary energy is molecular dynamics (MD); however, on-the-fly MD calculations are not tenable due to the extensive computational time required. Lattice matching (LM) is a reduced-order method for estimating GBE quickly; however, it has only been tested against a relatively limited set of data, and does not have a suitable means for assessing error. In this work, we use the recently published dataset of Homer et al. [1] to assess the performance of LM over the full range of GB space, and to equip LM with a metric for error estimation. LM is used to generate energy estimates, along with predictions of facet morphology, for each of the 7,304 boundaries in the Homer dataset. In keeping with prior work, it is observed that LM predictions of low energy boundaries matches well with MD results. Moreover, there is a good general agreement between LM and MD, and it is apparent that the error scales approximately linearly with the predicted energy value; this makes it possible to establish an empirical estimate on error for future LM calculations. An essential part of the LM method is the faceting relaxation, which corrects the expected energy by convexification across the compact space (S2) of boundary plane orientations. The original Homer dataset did not allow for faceting, but upon extended annealing, it was shown that facet patterns similar to those predicted by LM were emerging.