Reviewerly/exHarmony huggingface dataset:
Object counting from aerial remote sensing images: application to wildlife and marine mammals

Anthropogenic activities pose threats to wildlife and marine fauna, prompting the need for efficient animal counting methods. This research study utilizes deep learning techniques to automate counting tasks. Inspired by previous studies on crowd and animal counting, a UNet model with various backbones is implemented, which uses Gaussian density maps for training, bypassing the need of training a detector. The new model is applied to the task of counting dolphins and elephants in aerial images. Quantitative evaluation shows promising results, with the EfficientNet-B5 backbone achieving the best performance for African elephants and the ResNet18 backbone for dolphins. The model accurately locates animals despite complex image background conditions. By leveraging artificial intelligence, this research contributes to wildlife conservation efforts and enhances coexistence between humans and wildlife through efficient object counting without detection from aerial remote sensing.
Weighted structure tensor total variation for image denoising

Based on the variational framework of the image denoising problem, we introduce a novel image denoising regularizer that combines anisotropic total variation model (ATV) and structure tensor total variation model (STV) in this paper. The model can effectively capture the first-order information of the image and maintain local features during the denoising process by applying the matrix weighting operator proposed in the ATV model to the patch-based Jacobian matrix in the STV model. Denoising experiments on grayscale and RGB color images demonstrate that the suggested model can produce better restoration quality in comparison to other well-known methods based on total-variation-based models and the STV model.
PERBEDAAN HASIL BELAJAR IPS DENGAN MENGGUNAKAN METODE PANEL DAN METODE CURAH GAGASAN (BRAINSTROMING) DI KELAS V SDN JATIRANGGON II

This study aims to find differences between the Panel Method and the Brainstorming Method on social studies learning outcomes of students. This research was conducted at SDN Jatiranggon 2 in semester 2 of the 2022-2023 school year. The population of this study was 62 students consisting of 32 students in class VA and 30 students in class 5 B. The sample used was a saturated sample. This study uses a Quasi design method. Before the research instrument is given to the research object, the instrument is tested first, namely the validity and reliability test. The validity test using the point biserial formula obtained 26 valid questions and 14 invalid questions, while the reliability test using the Kuder-Richardson formula (KR20) obtained rcount&gt; 1.0348 (0.361&gt; 1.0348). This means that the test has reliability. Hypothesis testing is done by calculating the t-test and obtaining tcount &gt; ttable (8.12 &gt; 2.00), which means Ho is rejected. Therefore, the results of this study concluded that there is a difference between the Panel Method and the Brainstorming Method on social studies learning outcomes of students.
Understanding Certified Training with Interval Bound Propagation

As robustness verification methods are becoming more precise, training certifiably robust neural networks is becoming ever more relevant. To this end, certified training methods compute and then optimize an upper bound on the worst-case loss over a robustness specification. Curiously, training methods based on the imprecise interval bound propagation (IBP) consistently outperform those leveraging more precise bounding methods. Still, we lack an understanding of the mechanisms making IBP so successful. In this work, we thoroughly investigate these mechanisms by leveraging a novel metric measuring the tightness of IBP bounds. We first show theoretically that, for deep linear models, tightness decreases with width and depth at initialization, but improves with IBP training, given sufficient network width. We, then, derive sufficient and necessary conditions on weight matrices for IBP bounds to become exact and demonstrate that these impose strong regularization, explaining the empirically observed trade-off between robustness and accuracy in certified training. Our extensive experimental evaluation validates our theoretical predictions for ReLU networks, including that wider networks improve performance, yielding state-of-the-art results. Interestingly, we observe that while all IBP-based training methods lead to high tightness, this is neither sufficient nor necessary to achieve high certifiable robustness. This hints at the existence of new training methods that do not induce the strong regularization required for tight IBP bounds, leading to improved robustness and standard accuracy.
Factors Affecting the Reading Performance of the Junior High School Learners

The study was conducted at Sil-ipon Integrated School (SIS) and aimed to assess the factors that affected the reading performance level of junior high students.The researcher evaluated the demographic profile of the learners, their reading proficiency levels, differences in reading performance based on their profiles, and a proposed reading intervention plan.Demographic profiles were assessed using frequency and percentage, which revealed that the majority of the respondents were 8 th grade students, mostly female, and ranged in age from 14 to 16 years old.They frequently had 1 to 3 siblings, and their parents were both high-school level with a monthly family income of below 5,000 pesos.Reading proficiency levels were evaluated through Phil-IRI 2018 assessment tool which measures the reading speed, word reading, and reading comprehension scores.The findings showed that junior high school students of SIS had a low/frustration proficiency level, indicating that they experienced difficulties in reading.To determine differences in reading proficiency scores based on learners group profile, T-tests and ANOVA were used.The results showed that grade level, age, and number of siblings significantly influenced the learners' reading proficiency level.Finally, a comprehensive reading intervention plan was proposed that involved providing targeted interventions, increasing access to non-print reading materials, and collaborating with families and the community.The study was conducted to help educators and school administrators improve the reading skills of the learners.
GenPose: Generative Category-level Object Pose Estimation via Diffusion Models

Object pose estimation plays a vital role in embodied AI and computer vision, enabling intelligent agents to comprehend and interact with their surroundings. Despite the practicality of category-level pose estimation, current approaches encounter challenges with partially observed point clouds, known as the multihypothesis issue. In this study, we propose a novel solution by reframing categorylevel object pose estimation as conditional generative modeling, departing from traditional point-to-point regression. Leveraging score-based diffusion models, we estimate object poses by sampling candidates from the diffusion model and aggregating them through a two-step process: filtering out outliers via likelihood estimation and subsequently mean-pooling the remaining candidates. To avoid the costly integration process when estimating the likelihood, we introduce an alternative method that trains an energy-based model from the original score-based model, enabling end-to-end likelihood estimation. Our approach achieves state-of-the-art performance on the REAL275 dataset, surpassing 50% and 60% on strict 5d2cm and 5d5cm metrics, respectively. Furthermore, our method demonstrates strong generalizability to novel categories sharing similar symmetric properties without fine-tuning and can readily adapt to object pose tracking tasks, yielding comparable results to the current state-of-the-art baselines.
A robust blind watermarking scheme based on lifting wavelet transform and hessenberg decomposition

In this paper, a novel robust blind grayscale image digital watermarking scheme is introduced based on lifting wavelet transform (LWT) in combination with discrete cosine transform (DCT), Hessenberg decomposition, and entropy analysis for copyright protection of multimedia information. At first, the two levels of LWT are applied to the host grayscale image to improve the imperceptibility of the watermarking scheme and then the high-frequency sub-band of the 2-level of LWT is decomposed by DCT. Next, the DCT coefficients are divided into 4×4 non-overlapping blocks. After that, Hessenberg decomposition performs on each selected block, whereas the first row, first column element of the upper Hessenberg matrix is utilized to hide the watermark. To evaluate the imperceptibility and robustness of the proposed digital watermarking scheme, the peak signal-to-noise ratio (PSNR), and normalized cross-correlation (NC) are utilized to measure the quality and the ability of the proposed watermarking scheme to robust against signal processing operations and geometric attacks. Experimental and analysis results have demonstrated that the proposed scheme is achieved a very good tradeoff between imperceptibility and robustness. The comparison with other scheme have shown that the proposed digital watermarking schemes have a superior performance in terms of imperceptibility and robustness than other.
Summarization from Leaderboards to Practice: Choosing A Representation Backbone and Ensuring Robustness

Academic literature does not give much guidance on how to build the best possible customer-facing summarization system from existing research components. Here we present analyses to inform the selection of a system backbone from popular models; we find that in both automatic and human evaluation, BART performs better than PEGASUS and T5. We also find that when applied cross-domain, summarizers exhibit considerably worse performance. At the same time, a system fine-tuned on heterogeneous domains performs well on all domains and will be most suitable for a broad-domain summarizer. Our work highlights the need for heterogeneous domain summarization benchmarks. We find considerable variation in system output that can be captured only with human evaluation and are thus unlikely to be reflected in standard leaderboards with only automatic evaluation.
SURT 2.0: Advances in Transducer-based Multi-talker Speech Recognition

The Streaming Unmixing and Recognition Transducer (SURT) model was proposed recently as an end-to-end approach for continuous, streaming, multi-talker speech recognition (ASR). Despite impressive results on multi-turn meetings, SURT has notable limitations: (i) it suffers from leakage and omission related errors; (ii) it is computationally expensive, due to which it has not seen adoption in academia; and (iii) it has only been evaluated on synthetic mixtures. In this work, we propose several modifications to the original SURT which are carefully designed to fix the above limitations. In particular, we (i) change the unmixing module to a mask estimator that uses dual-path modeling, (ii) use a streaming zipformer encoder and a stateless decoder for the transducer, (iii) perform mixture simulation using force-aligned subsegments, (iv) pre-train the transducer on single-speaker data, (v) use auxiliary objectives in the form of masking loss and encoder CTC loss, and (vi) perform domain adaptation for far-field recognition. We show that our modifications allow SURT 2.0 to outperform its predecessor in terms of multi-talker ASR results, while being efficient enough to train with academic resources. We conduct our evaluations on 3 publicly available meeting benchmarks -- LibriCSS, AMI, and ICSI, where our best model achieves WERs of 16.9%, 44.6% and 32.2%, respectively, on far-field unsegmented recordings. We release training recipes and pre-trained models: https://sites.google.com/view/surt2.
Quantum Algorithms for the Shortest Common Superstring and Text Assembling Problems

In this paper, we consider two versions of the Text Assembling problem. We are given a sequence of strings $s^1,\dots,s^n$ of total length $L$ that is a dictionary, and a string $t$ of length $m$ that is texts. The first version of the problem is assembling $t$ from the dictionary. The second version is the ``Shortest Superstring Problem''(SSP) or the ``Shortest Common Superstring Problem''(SCS). In this case, $t$ is not given, and we should construct the shortest string (we call it superstring) that contains each string from the given sequence as a substring. These problems are connected with the sequence assembly method for reconstructing a long DNA sequence from small fragments. For both problems, we suggest new quantum algorithms that work better than their classical counterparts. In the first case, we present a quantum algorithm with $O(m+\log m\sqrt{nL})$ running time. In the case of SSP, we present a quantum algorithm with running time $O(n^3 1.728^n +L +\sqrt{L}n^{1.5}+\sqrt{L}n\log^2L\log^2n)$.
MOSPC: MOS Prediction Based on Pairwise Comparison

As a subjective metric to evaluate the quality of synthesized speech, Mean opinion score~(MOS) usually requires multiple annotators to score the same speech. Such an annotation approach requires a lot of manpower and is also time-consuming. MOS prediction model for automatic evaluation can significantly reduce labor cost. In previous works, it is difficult to accurately rank the quality of speech when the MOS scores are close. However, in practical applications, it is more important to correctly rank the quality of synthesis systems or sentences than simply predicting MOS scores. Meanwhile, as each annotator scores multiple audios during annotation, the score is probably a relative value based on the first or the first few speech scores given by the annotator. Motivated by the above two points, we propose a general framework for MOS prediction based on pair comparison (MOSPC), and we utilize C-Mixup algorithm to enhance the generalization performance of MOSPC. The experiments on BVCC and VCC2018 show that our framework outperforms the baselines on most of the correlation coefficient metrics, especially on the metric KTAU related to quality ranking. And our framework also surpasses the strong baseline in ranking accuracy on each fine-grained segment. These results indicate that our framework contributes to improving the ranking accuracy of speech quality.
On Anti-Q-Fuzzy Deductive Systems of Hilbert Algebras

In this paper, the concept of anti-Q-fuzzy deductive systems concepts of Hilbert algebras are introduced and proved some results. Further, we discuss the relation between anti-Q-fuzzy deductive system and level subsets of a Q-fuzzy set. Anti Q-fuzzy deductive system is also applied in the Cartesian product of Hilbert algebras.
DropCompute: simple and more robust distributed synchronous training via compute variance reduction

Background: Distributed training is essential for large scale training of deep neural networks (DNNs). The dominant methods for large scale DNN training are synchronous (e.g. All-Reduce), but these require waiting for all workers in each step. Thus, these methods are limited by the delays caused by straggling workers. Results: We study a typical scenario in which workers are straggling due to variability in compute time. We find an analytical relation between compute time properties and scalability limitations, caused by such straggling workers. With these findings, we propose a simple yet effective decentralized method to reduce the variation among workers and thus improve the robustness of synchronous training. This method can be integrated with the widely used All-Reduce. Our findings are validated on large-scale training tasks using 200 Gaudi Accelerators.
GPU-Accelerated Verification of Machine Learning Models for Power Systems

Computational tools for rigorously verifying the performance of large-scale machine learning (ML) models have progressed significantly in recent years. The most successful solvers employ highly specialized, GPU-accelerated branch and bound routines. Such tools are crucial for the successful deployment of machine learning applications in safety-critical systems, such as power systems. Despite their successes, however, barriers prevent out-of-the-box application of these routines to power system problems. This paper addresses this issue in two key ways. First, for the first time to our knowledge, we enable the simultaneous verification of multiple verification problems (e.g., checking for the violation of all line flow constraints simultaneously and not by solving individual verification problems). For that, we introduce an exact transformation that converts the "worst-case" violation across a set of potential violations to a series of ReLU-based layers that augment the original neural network. This allows verifiers to interpret them directly. Second, power system ML models often must be verified to satisfy power flow constraints. We propose a dualization procedure which encodes linear equality and inequality constraints directly into the verification problem; and in a manner which is mathematically consistent with the specialized verification tools. To demonstrate these innovations, we verify problems associated with data-driven security constrained DC-OPF solvers. We build and test our first set of innovations using the $\alpha,\beta$-CROWN solver, and we benchmark against Gurobi 10.0. Our contributions achieve a speedup that can exceed 100x and allow higher degrees of verification flexibility.
Towards Stability of Autoregressive Neural Operators

Neural operators have proven to be a promising approach for modeling spatiotemporal systems in the physical sciences. However, training these models for large systems can be quite challenging as they incur significant computational and memory expense -- these systems are often forced to rely on autoregressive time-stepping of the neural network to predict future temporal states. While this is effective in managing costs, it can lead to uncontrolled error growth over time and eventual instability. We analyze the sources of this autoregressive error growth using prototypical neural operator models for physical systems and explore ways to mitigate it. We introduce architectural and application-specific improvements that allow for careful control of instability-inducing operations within these models without inflating the compute/memory expense. We present results on several scientific systems that include Navier-Stokes fluid flow, rotating shallow water, and a high-resolution global weather forecasting system. We demonstrate that applying our design principles to neural operators leads to significantly lower errors for long-term forecasts as well as longer time horizons without qualitative signs of divergence compared to the original models for these systems. We open-source our \href{https://github.com/mikemccabe210/stabilizing_neural_operators}{code} for reproducibility.
Embedding quantum optimization problems using AC driven quantum ferromagnets

Analog quantum optimization methods, such as quantum annealing, are promising and at least partially noise tolerant ways to solve hard optimization and sampling problems with quantum hardware. However, they have thus far failed to demonstrate broadly applicable quantum speedups, and an important contributing factor to this is slowdowns from embedding, the process of mapping logical variables to long chains of physical qubits, enabling arbitrary connectivity on the short-ranged 2d hardware grid. Beyond the spatial overhead in qubit count, embedding can lead to severe time overhead, arising from processes where individual chains ``freeze" into ferromagnetic states at different times during evolution, and once frozen the tunneling rate of this single logical variable decays exponentially in chain length. We show that this effect can be substantially mitigated by local AC variation of the qubit parameters as in the RFQA protocol (Kapit and Oganesyan, Quant. Sci. Tech. \textbf{6}, 025013 (2021)), through a mechanism we call Symphonic Tunneling. We provide general arguments and substantial numerical evidence to show that AC-driven multi-qubit tunneling is dramatically faster than its DC counterpart, and since ST is not a 1d-specific mechanism, this enhancement should extend to clusters of coupled chains as well. And unlike a uniform transverse field, in higher dimensions this method cannot be efficiently simulated classically. We explore schemes to synchronize the AC tones within chains to further improve performance. Implemented at scale, these methods could significantly improve the prospects for achieving quantum scaling advantages in near-term hardware.
Evolving Strategies for Competitive Multi-Agent Search

While evolutionary computation is well suited for automatic discovery in engineering, it can also be used to gain insight into how humans and organizations could perform more effectively. Using a real-world problem of innovation search in organizations as the motivating example, this article first formalizes human creative problem solving as competitive multi-agent search (CMAS). CMAS is different from existing single-agent and team search problems in that the agents interact through knowledge of other agents' searches and through the dynamic changes in the search landscape that result from these searches. The main hypothesis is that evolutionary computation can be used to discover effective strategies for CMAS; this hypothesis is verified in a series of experiments on the NK model, i.e.\ partially correlated and tunably rugged fitness landscapes. Different specialized strategies are evolved for each different competitive environment, and also general strategies that perform well across environments. These strategies are more effective and more complex than hand-designed strategies and a strategy based on traditional tree search. Using a novel spherical visualization of such landscapes, insight is gained about how successful strategies work, e.g.\ by tracking positive changes in the landscape. The article thus provides a possible framework for studying various human creative activities as competitive multi-agent search in the future.
On the Model-Misspecification in Reinforcement Learning

The success of reinforcement learning (RL) crucially depends on effective function approximation when dealing with complex ground-truth models. Existing sample-efficient RL algorithms primarily employ three approaches to function approximation: policy-based, value-based, and model-based methods. However, in the face of model misspecification (a disparity between the ground-truth and optimal function approximators), it is shown that policy-based approaches can be robust even when the policy function approximation is under a large locally-bounded misspecification error, with which the function class may exhibit a $\Omega(1)$ approximation error in specific states and actions, but remains small on average within a policy-induced state distribution. Yet it remains an open question whether similar robustness can be achieved with value-based and model-based approaches, especially with general function approximation. To bridge this gap, in this paper we present a unified theoretical framework for addressing model misspecification in RL. We demonstrate that, through meticulous algorithm design and sophisticated analysis, value-based and model-based methods employing general function approximation can achieve robustness under local misspecification error bounds. In particular, they can attain a regret bound of $\widetilde{O}\left(\text{poly}(d H)(\sqrt{K} + K\zeta) \right)$, where $d$ represents the complexity of the function class, $H$ is the episode length, $K$ is the total number of episodes, and $\zeta$ denotes the local bound for misspecification error. Furthermore, we propose an algorithmic framework that can achieve the same order of regret bound without prior knowledge of $\zeta$, thereby enhancing its practical applicability.