Miracle-dz/UniFAR-FTUs huggingface dataset:
Skills-in-Context Prompting: Unlocking Compositionality in Large Language Models

We consider the problem of eliciting compositional generalization capabilities in large language models (LLMs) with a novel type of prompting strategy. Compositional generalization empowers the LLMs to solve problems that are harder than the ones they have seen (i.e., easy-to-hard generalization), which is a critical reasoning capability of human-like intelligence. However, even the current state-of-the-art LLMs still struggle with this form of reasoning. To bridge this gap, we propose skills-in-context (SKiC) prompting, which instructs LLMs how to compose basic skills to resolve more complex problems. We find that it is crucial to demonstrate both the skills and the compositional examples within the same prompting context. With as few as two examplars, our SKiC prompting initiates strong synergies between skills and their composition capabilities. Notably, it empowers LLMs to solve unseen problems that require innovative skill compositions, achieving near-perfect generalization on a broad range of challenging compositionality tasks. Intriguingly, SKiC prompting unlocks the latent potential of LLMs, enabling them to leverage pre-existing internal skills acquired during earlier pre-training stages, even when these skills are not explicitly presented in the prompting context. This results in the capability of LLMs to solve unseen complex problems by activating and composing internal competencies. With such prominent features, SKiC prompting is able to achieve state-of-the-art performance on challenging mathematical reasoning benchmarks (e.g., MATH).
The Algonauts Project 2023 Challenge: UARK-UAlbany Team Solution

This work presents our solutions to the Algonauts Project 2023 Challenge. The primary objective of the challenge revolves around employing computational models to anticipate brain responses captured during participants' observation of intricate natural visual scenes. The goal is to predict brain responses across the entire visual brain, as it is the region where the most reliable responses to images have been observed. We constructed an image-based brain encoder through a two-step training process to tackle this challenge. Initially, we created a pretrained encoder using data from all subjects. Next, we proceeded to fine-tune individual subjects. Each step employed different training strategies, such as different loss functions and objectives, to introduce diversity. Ultimately, our solution constitutes an ensemble of multiple unique encoders. The code is available at https://github.com/uark-cviu/Algonauts2023
Toward Zero-shot Character Recognition: A Gold Standard Dataset with Radical-level Annotations

Optical character recognition (OCR) methods have been applied to diverse tasks, e.g., street view text recognition and document analysis. Recently, zero-shot OCR has piqued the interest of the research community because it considers a practical OCR scenario with unbalanced data distribution. However, there is a lack of benchmarks for evaluating such zero-shot methods that apply a divide-and-conquer recognition strategy by decomposing characters into radicals. Meanwhile, radical recognition, as another important OCR task, also lacks radical-level annotation for model training. In this paper, we construct an ancient Chinese character image dataset that contains both radical-level and character-level annotations to satisfy the requirements of the above-mentioned methods, namely, ACCID, where radical-level annotations include radical categories, radical locations, and structural relations. To increase the adaptability of ACCID, we propose a splicing-based synthetic character algorithm to augment the training samples and apply an image denoising method to improve the image quality. By introducing character decomposition and recombination, we propose a baseline method for zero-shot OCR. The experimental results demonstrate the validity of ACCID and the baseline model quantitatively and qualitatively.
The current state of disk wind observations in BHLMXBs through X-ray absorption lines in the iron band

The presence of blueshifted absorption lines in the X-ray spectra of Black Hole Low Mass X-ray Binaries is the telltale of massive outflows called winds. These signatures are found almost exclusively in soft states of high-inclined systems, hinting at equatorial ejections originating from the accretion disk and deeply intertwined with the evolution of the outburst patterns displayed by these systems. In the wake of the launch of the new generation of X-ray spectrometers, studies of wind signatures remain mostly restricted to single sources and outbursts, with some of the recent detections departing from the commonly expected behaviors. We thus give an update to the current state of iron band absorption lines detections, through the analysis of all publicly available XMM-$Newton$-PN and $Chandra$-HETG exposures of known Black Hole Low-Mass X-ray Binary candidates. Our results agree with previous studies, with wind detections exclusively found in dipping, high-inclined sources, and almost exclusively in bright ($L_{X}>0.01L_{Edd}$) soft ($HR<0.8$) states, with blueshift values generally restricted to few 100 km s$^{-1}$. The line parameters indicate similar properties between objects and outbursts of single sources, and despite more than 20 years of data, very few sources have the HID sampling necessary to properly study the evolution of the wind during single outbursts. We provide an online tool with details of the wind signatures and outburst evolution data for all sources in the sample.
Near-Field Communications: A Degree-of-Freedom Perspective

Multiple-antenna technologies are advancing towards large-scale aperture sizes and extremely high frequencies, leading to the emergence of near-field communications (NFC) in future wireless systems. To this context, we investigate the degree of freedom (DoF) in near-field multiple-input multiple-output (MIMO) systems. We consider both spatially discrete (SPD) antennas and continuous aperture (CAP) antennas. Additionally, we explore three important DoF-related performance metrics and examine their relationships with the classic DoF. Numerical results demonstrate the benefits of NFC over far-field communications (FFC) in terms of providing increased spatial DoFs. We also identify promising research directions for NFC from a DoF perspective.
Position Uncertainty in a Sequential Public Goods Game: An Experiment

Gallice and Monz\'on (2019) present a natural environment that sustains full co-operation in one-shot social dilemmas among a finite number of self-interested agents. They demonstrate that in a sequential public goods game, where agents lack knowledge of their position in the sequence but can observe some predecessors' actions, full contribution emerges in equilibrium due to agents' incentive to induce potential successors to follow suit. In this study, we aim to test the theoretical predictions of this model through an economic experiment. We conducted three treatments, varying the amount of information about past actions that a subject can observe, as well as their positional awareness. Through rigorous structural econometric analysis, we found that approximately 25% of the subjects behaved in line with the theoretical predictions. However, we also observed the presence of alternative behavioural types among the remaining subjects. The majority were classified as conditional co-operators, showing a willingness to cooperate based on others' actions. Some subjects exhibited altruistic tendencies, while only a small minority engaged in free-riding behaviour.
Trajectory Tracking via Multiscale Continuous Attractor Networks

Animals and insects showcase remarkably robust and adept navigational abilities, up to literally circumnavigating the globe. Primary progress in robotics inspired by these natural systems has occurred in two areas: highly theoretical computational neuroscience models, and handcrafted systems like RatSLAM and NeuroSLAM. In this research, we present work bridging the gap between the two, in the form of Multiscale Continuous Attractor Networks (MCAN), that combine the multiscale parallel spatial neural networks of the previous theoretical models with the real-world robustness of the robot-targeted systems, to enable trajectory tracking over large velocity ranges. To overcome the limitations of the reliance of previous systems on hand-tuned parameters, we present a genetic algorithm-based approach for automated tuning of these networks, substantially improving their usability. To provide challenging navigational scale ranges, we open source a flexible city-scale navigation simulator that adapts to any street network, enabling high throughput experimentation11https://github.com/theresejoseph/Trajectory_ Tracking_via_MCAN/ • In extensive experiments using the city-scale navigation environment and Kitti, we show that the system is capable of stable dead reckoning over a wide range of velocities and environmental scales, where a single-scale approach fails.
On the Analysis of Boolean Functions and Fourier-Entropy-Influence Conjecture

This manuscript includes some classical results we select apart from the new results we've found on the Analysis of Boolean Functions and Fourier-Entropy-Influence conjecture. We try to ensure the self-completeness of this work so that readers could probably read it independently. Among the new results, what is the most remarkable is that we prove that the entropy of a boolean function $f$ could be upper bounded by $O(I(f))+O(\sum\limits_{k}I_k(f)\log (1/I_k(f)))$.
Doubly Robust Instance-Reweighted Adversarial Training

Assigning importance weights to adversarial data has achieved great success in training adversarially robust networks under limited model capacity. However, existing instance-reweighted adversarial training (AT) methods heavily depend on heuristics and/or geometric interpretations to determine those importance weights, making these algorithms lack rigorous theoretical justification/guarantee. Moreover, recent research has shown that adversarial training suffers from a severe non-uniform robust performance across the training distribution, e.g., data points belonging to some classes can be much more vulnerable to adversarial attacks than others. To address both issues, in this paper, we propose a novel doubly-robust instance reweighted AT framework, which allows to obtain the importance weights via exploring distributionally robust optimization (DRO) techniques, and at the same time boosts the robustness on the most vulnerable examples. In particular, our importance weights are obtained by optimizing the KL-divergence regularized loss function, which allows us to devise new algorithms with a theoretical convergence guarantee. Experiments on standard classification datasets demonstrate that our proposed approach outperforms related state-of-the-art baseline methods in terms of average robust performance, and at the same time improves the robustness against attacks on the weakest data points. Codes will be available soon.
Interpretable Stereotype Identification through Reasoning

Given that language models are trained on vast datasets that may contain inherent biases, there is a potential danger of inadvertently perpetuating systemic discrimination. Consequently, it becomes essential to examine and address biases in language models, integrating fairness into their development to ensure these models are equitable and free from bias. In this work, we demonstrate the importance of reasoning in zero-shot stereotype identification based on Vicuna-13B-v1.3. While we do observe improved accuracy by scaling from 13B to 33B, we show that the performance gain from reasoning significantly exceeds the gain from scaling up. Our findings suggest that reasoning could be a key factor that enables LLMs to trescend the scaling law on out-of-domain tasks such as stereotype identification. Additionally, through a qualitative analysis of select reasoning traces, we highlight how reasoning enhances not just accuracy but also the interpretability of the decision.
Deformational symmetries of smooth functions on non-orientable surfaces

Given a compact surface $M$, consider the natural right action of the group of diffeomorphisms $\mathcal{D}(M)$ of $M$ on $\mathcal{C}^{\infty}(M,\mathbb{R})$ given by $(f,h)\mapsto f\circ h$ for $f\in \mathcal{C}^{\infty}(M,\mathbb{R})$ and $h\in\mathcal{D}(M)$. Denote by $\mathcal{F}(M)$ the subset of $\mathcal{C}^{\infty}(M,\mathbb{R})$ consisting of function $f:M\to\mathbb{R}$ taking constant values on connected components of $\partial{M}$, having no critical points on $\partial{M}$, and such that at each of its critical points $z$ the function $f$ is $\mathcal{C}^{\infty}$ equivalent to some homogenenous polynomial without multiple factors. In particular, $\mathcal{F}(M)$ contains all Morse maps. Let also $\mathcal{O}(f) = \{ f\circ h \mid h\in\mathcal{D}(M) \}$ be the orbit of $f$. Previously it was computed the algebraic structure of $\pi_1\mathcal{O}(f)$ for all $f\in\mathcal{F}(M)$, where $M$ is any orientable compact surface distinct from $2$-sphere. In the present paper we compute the group $\pi_0\mathcal{S}(f,\partial\mathbb{M})$, where $\mathbb{M}$ is a M\"obius band. As a consequence we obtain an explicit algebraic description of $\pi_1\mathcal{O}(f)$ for all non-orientable surfaces distinct from Klein bottle and projective plane.
Understanding the effect of Prandtl number on momentum and scalar mixing rates in neutral and stably stratified flows using gradient field dynamics

Recently, direct numerical simulations (DNS) of stably stratified turbulence have shown that as the Prandtl number ($Pr$) is increased from 1 to 7, the mean turbulent potential energy dissipation rate (TPE-DR) drops dramatically, while the mean turbulent kinetic energy dissipation rate (TKE-DR) increases significantly. Through an analysis of the equations governing the fluctuating velocity and density gradients we provide a mechanistic explanation for this surprising behavior and test the predictions using DNS. We show that the mean density gradient gives rise to a mechanism that opposes the production of fluctuating density gradients, and this is connected to the emergence of ramp-cliffs. The same term appears in the velocity gradient equation but with the opposite sign, and is the contribution from buoyancy. This term is ultimately the reason why the TPE-DR reduces while the TKE-DR increases with increasing $Pr$. Our analysis also predicts that the effects of buoyancy on the smallest scales of the flow become stronger as $Pr$ is increased, and this is confirmed by our DNS data. A consequence of this is that the standard buoyancy Reynolds number does not correctly estimate the impact of buoyancy at the smallest scales when $Pr$ deviates from 1, and we derive a suitable alternative parameter. Finally, an analysis of the filtered gradient equations reveals that the mean density gradient term changes sign at sufficiently large scales, such that buoyancy acts as a source for velocity gradients at small scales, but as a sink at large scales.
Benchmarking Ultra-High-Definition Image Reflection Removal

Deep learning based methods have achieved significant success in the task of single image reflection removal (SIRR). However, the majority of these methods are focused on High-Definition/Standard-Definition (HD/SD) images, while ignoring higher resolution images such as Ultra-High-Definition (UHD) images. With the increasing prevalence of UHD images captured by modern devices, in this paper, we aim to address the problem of UHD SIRR. Specifically, we first synthesize two large-scale UHD datasets, UHDRR4K and UHDRR8K. The UHDRR4K dataset consists of $2,999$ and $168$ quadruplets of images for training and testing respectively, and the UHDRR8K dataset contains $1,014$ and $105$ quadruplets. To the best of our knowledge, these two datasets are the first largest-scale UHD datasets for SIRR. Then, we conduct a comprehensive evaluation of six state-of-the-art SIRR methods using the proposed datasets. Based on the results, we provide detailed discussions regarding the strengths and limitations of these methods when applied to UHD images. Finally, we present a transformer-based architecture named RRFormer for reflection removal. RRFormer comprises three modules, namely the Prepossessing Embedding Module, Self-attention Feature Extraction Module, and Multi-scale Spatial Feature Extraction Module. These modules extract hypercolumn features, global and partial attention features, and multi-scale spatial features, respectively. To ensure effective training, we utilize three terms in our loss function: pixel loss, feature loss, and adversarial loss. We demonstrate through experimental results that RRFormer achieves state-of-the-art performance on both the non-UHD dataset and our proposed UHDRR datasets. The code and datasets are publicly available at https://github.com/Liar-zzy/Benchmarking-Ultra-High-Definition-Single-Image-Reflection-Removal.
Program Repair by Fuzzing over Patch and Input Space

Fuzz testing (fuzzing) is a well-known method for exposing bugs/vulnerabilities in software systems. Popular fuzzers, such as AFL, use a biased random search over the domain of program inputs, where 100s or 1000s of inputs (test cases) are executed per second in order to expose bugs. If a bug is discovered, it can either be fixed manually by the developer or fixed automatically using an Automated Program Repair (APR) tool. Like fuzzing, many existing APR tools are search-based, but over the domain of patches rather than inputs. In this paper, we propose search-based program repair as patch-level fuzzing. The basic idea is to adapt a fuzzer (AFL) to fuzz over the patch space rather than the input space. Thus we use a patch-space fuzzer to explore a patch space, while using a traditional input level fuzzer to rule out patch candidates and help in patch selection. To improve the throughput, we propose a compilation-free patch validation methodology, where we execute the original (unpatched) program natively, then selectively interpret only the specific patched statements and expressions. Since this avoids (re)compilation, we show that compilation-free patch validation can achieve a similar throughput as input-level fuzzing (100s or 1000s of execs/sec). We show that patch-level fuzzing and input-level fuzzing can be combined, for a co-exploration of both spaces in order to find better quality patches. Such a collaboration between input-level fuzzing and patch-level fuzzing is then employed to search over candidate fix locations, as well as patch candidates in each fix location.
Exploring how a Generative AI interprets music

We use Google's MusicVAE, a Variational Auto-Encoder with a 512-dimensional latent space to represent a few bars of music, and organize the latent dimensions according to their relevance in describing music. We find that, on average, most latent neurons remain silent when fed real music tracks: we call these"noise"neurons. The remaining few dozens of latent neurons that do fire are called"music neurons". We ask which neurons carry the musical information and what kind of musical information they encode, namely something that can be identified as pitch, rhythm or melody. We find that most of the information about pitch and rhythm is encoded in the first few music neurons: the neural network has thus constructed a couple of variables that non-linearly encode many human-defined variables used to describe pitch and rhythm. The concept of melody only seems to show up in independent neurons for longer sequences of music.
Adaptive Sliding Mode Controller and Observer for Altitude and Attitude Control of a Quadrotor

In this paper an adaptive sliding mode control approach for a quadrotor stabilization and trajectory tracking is presented. The closed loop control consists of three parts; the first part is quadrotor altitude and attitude stabilization, and trajectory tracking. Second part is used for parameters estimation where we focus in mass estimation, while the third part is the full states observation. Disturbances, sensors noise and parameter uncertainties, are taken into consideration. Sliding mode control law and observer adaptation are developed based on Lyapunov stability principle. Numerical simulations show the effectiveness of the proposed control technique
Beyond One-Hot-Encoding: Injecting Semantics to Drive Image Classifiers

Images are loaded with semantic information that pertains to real-world ontologies: dog breeds share mammalian similarities, food pictures are often depicted in domestic environments, and so on. However, when training machine learning models for image classification, the relative similarities amongst object classes are commonly paired with one-hot-encoded labels. According to this logic, if an image is labelled as 'spoon', then 'tea-spoon' and 'shark' are equally wrong in terms of training loss. To overcome this limitation, we explore the integration of additional goals that reflect ontological and semantic knowledge, improving model interpretability and trustworthiness. We suggest a generic approach that allows to derive an additional loss term starting from any kind of semantic information about the classification label. First, we show how to apply our approach to ontologies and word embeddings, and discuss how the resulting information can drive a supervised learning process. Second, we use our semantically enriched loss to train image classifiers, and analyse the trade-offs between accuracy, mistake severity, and learned internal representations. Finally, we discuss how this approach can be further exploited in terms of explainability and adversarial robustness. Code repository: https://github.com/S1M0N38/semantic-encodings
Noisy circumnutations facilitate self-organized shade avoidance in sunflowers

Circumnutations are widespread in plants and typically associated with exploratory movements, however a quantitative understanding of their role remains elusive. In this study we report, for the first time, the role of noisy circumnutations in facilitating an optimal growth pattern within a crowded group of mutually shading plants. We revisit the problem of self-organization observed for sunflowers, mediated by shade response interactions. Our analysis reveals that circumnutation movements conform to a bounded random walk characterized by a remarkably broad distribution of velocities, covering three orders of magnitude. In motile animal systems such wide distributions of movement velocities are frequently identified with enhancement of behavioral processes, suggesting that circumnutations may serve as a source of functional noise. To test our hypothesis, we developed a parsimonious model of interacting growing disks, informed by experiments, successfully capturing the characteristic dynamics of individual and multiple interacting plants. Employing our simulation framework we examine the role of circumnutations in the system, and find that the observed breadth of the velocity distribution confers advantageous effects by facilitating exploration of potential configurations, leading to an optimized arrangement with minimal shading. These findings represent the first report of functional noise in plant movements, and establishes a theoretical foundation for investigating how plants navigate their environment by employing computational processes such as task-oriented processes, optimization, and active sensing. One sentence summary of paper The study highlights noisy circumnutations as a strategy plants use for optimizing growth in crowded conditions.