Miracle-dz/UniFAR-FTUs huggingface dataset:
Memory Injections: Correcting Multi-Hop Reasoning Failures During Inference in Transformer-Based Language Models

Answering multi-hop reasoning questions requires retrieving and synthesizing information from diverse sources. Large Language Models (LLMs) struggle to perform such reasoning consistently. Here we propose an approach to pinpoint and rectify multi-hop reasoning failures through targeted memory injections on LLM attention heads. First, we analyze the per-layer activations of GPT-2 models in response to single and multi-hop prompts. We then propose a mechanism that allows users to inject pertinent prompt-specific information, which we refer to as “memories,” at critical LLM locations during inference. By thus enabling the LLM to incorporate additional relevant information during inference, we enhance the quality of multi-hop prompt completions. We show empirically that a simple, efficient, and targeted memory injection into a key attention layer can often increase the probability of the desired next token in multi-hop tasks, by up to 424%.
Combinatorics of pre-Lie products sharing a Lie bracket

We study in detail the operad controlling several pre-Lie algebra structures sharing the same Lie bracket. Specifically, we show that this operad admits a combinatorial description similar to that of Chapoton and Livernet for the pre-Lie operad, and that it has many of the remarkable algebraic properties of the pre-Lie operad.
Safe Adaptive Control of Hyperbolic PDE-ODE Cascades

Adaptive safe control employing conventional continuous infinite-time adaptation requires that the initial conditions be restricted to a subset of the safe set due to parametric uncertainty, where the safe set is shrunk in inverse proportion to the adaptation gain. The recent regulation-triggered adaptive control approach with batch least-squares identification (BaLSI, pronounced ``ballsy'') completes perfect parameter identification in finite time and offers a previously unforeseen advantage in adaptive safe control, which we elucidate in this paper. Since the true challenge of safe control is exhibited for CBF of a high relative degree, we undertake a safe BaLSI design in this paper for a class of systems that possess a particularly extreme relative degree: ODE-PDE-ODE sandwich systems. Such sandwich systems arise in various applications, including delivery UAV with a cable-suspended load. Collision avoidance of the payload with the surrounding environment is required. The considered class of plants is $2\times2$ hyperbolic PDEs sandwiched by a strict-feedback nonlinear ODE and a linear ODE, where the unknown coefficients, whose bounds are known and arbitrary, are associated with the PDE in-domain coupling terms that can cause instability and with the input signal of the distal ODE. This is the first safe adaptive control design for PDEs, where we introduce the concept of PDE CBF whose non-negativity as well as the ODE CBF's non-negativity are ensured with a backstepping-based safety filter. Our safe adaptive controller is explicit and operates in the entire original safe set.
Good-looking but Lacking Faithfulness: Understanding Local Explanation Methods through Trend-based Testing

While enjoying the great achievements brought by deep learning (DL), people are also worried about the decision made by DL models, since the high degree of non-linearity of DL models makes the decision extremely difficult to understand. Consequently, attacks such as adversarial attacks are easy to carry out, but difficult to detect and explain, which has led to a boom in the research on local explanation methods for explaining model decisions. In this paper, we evaluate the faithfulness of explanation methods and find that traditional tests on faithfulness encounter the random dominance problem, i.e., the random selection performs the best, especially for complex data. To further solve this problem, we propose three trend-based faithfulness tests and empirically demonstrate that the new trend tests can better assess faithfulness than traditional tests on image, natural language and security tasks. We implement the assessment system and evaluate ten popular explanation methods. Benefiting from the trend tests, we successfully assess the explanation methods on complex data for the first time, bringing unprecedented discoveries and inspiring future research. Downstream tasks also greatly benefit from the tests. For example, model debugging equipped with faithful explanation methods performs much better for detecting and correcting accuracy and security problems.
On well-posedness of a mildly dissipative family of active scalar equations in borderline Sobolev spaces

This paper considers a family of active scalar equations which modify the generalized surface quasi-geostrophic (gSQG) equations through its constitutive law or dissipative perturbations. These modifications are characteristically mild in the sense that they are logarithmic. The problem of well-posedness, in the sense of Hadamard, is then studied in a borderline setting of regularity in analog to the scaling-critical spaces of the gSQG equations. A novelty of the system considered is the nuanced form of smoothing provided by the proposed mild form of dissipation, which is able to support global well-posedness at the Euler endpoint, but in a setting where the inviscid counterpart is known to be ill-posed. A novelty of the analysis lies in the simultaneous treatment of modifications in the constitutive law, dissipative mechanism, and functional setting, which the existing literature has typically treated separately. A putatively sharp relation is identified between each of the distinct system-modifiers that is consistent with previous studies that considered these modifications in isolation. This unified perspective is afforded by the introduction of a linear model equation, referred to as the protean system, that successfully incorporates the more delicate commutator structure collectively possessed by the gSQG family and upon which each facet of well-posedness can be reduced to its study.
MANEJO DA IRRIGAÇÃO PARA OTIMIZAÇÃO DA PRODUTIVIDADE E QUALIDADE DE FRUTOS DE TOMATEIRO EM SISTEMA DE PLANTIO DIRETO

JOSE ALOISIO ALVES MOREIRA; ATALITA FRANCIS CARDOSO; LILIAN L COSTA; MARCOS S. RODRIGUES; NEI PEIXOTO e LEILA T. BRAZ Embrapa Milho e Sorgo, C. P. 285 – 35.701-970 – Sete Lagoas-MG, jaloisio@cnpms.embrapa. br; UNESP/FCAV– Departamento de Producao Vegetal, Via de Acesso Prof. Paulo Donato Castellane, s/n – 14884-900 – Jaboticabal-SP, atalitacardoso@yahoo.com. br; lilianlcosta@yahoo.com. br, ltb@fcav.unesp. br; UNESP/FCAV– Departamento de Solos e Adubos, Via de Acesso Prof. Paulo Donato Castellane, s/n – 14884900 – Jaboticabal-SP; agrobytem@gmail.com; UEG-Unidade de Ipameri–Rodovia GO 330, km 241, Anel Viario – 75780-000– Ipameri-GO, nei.p@terra.com. br; UNESP-FCAV, Depto. Prod. Vegetal.
CitDet: A Benchmark Dataset for Citrus Fruit Detection

In this letter, we present a new dataset to advance the state of the art in detecting citrus fruit and accurately estimate yield on trees affected by the Huanglongbing (HLB) disease in orchard environments via imaging. Despite the fact that significant progress has been made in solving the fruit detection problem, the lack of publicly available datasets has complicated direct comparison of results. For instance, citrus detection has long been of interest in the agricultural research community, yet there is an absence of work, particularly involving public datasets of citrus affected by HLB. To address this issue, we enhance state-of-the-art object detection methods for use in typical orchard settings. Concretely, we provide high-resolution images of citrus trees located in an area known to be highly affected by HLB, along with high-quality bounding box annotations of citrus fruit. Fruit on both the trees and the ground are labeled to allow for identification of fruit location, which contributes to advancements in yield estimation and potential measure of HLB impact via fruit drop. The dataset consists of over 32,000 bounding box annotations for fruit instances contained in 579 high-resolution images. In summary, our contributions are the following: (i) we introduce a novel dataset along with baseline performance benchmarks on multiple contemporary object detection algorithms, (ii) we show the ability to accurately capture fruit location on tree or on ground, and finally (ii) we present a correlation of our results with yield estimations.
Annotating Data for Fine-Tuning a Neural Ranker? Current Active Learning Strategies are not Better than Random Selection

Search methods based on Pretrained Language Models (PLM) have demonstrated great effectiveness gains compared to statistical and early neural ranking models. However, fine-tuning PLM-based rankers requires a great amount of annotated training data. Annotating data involves a large manual effort and thus is expensive, especially in domain specific tasks. In this paper we investigate fine-tuning PLM-based rankers under limited training data and budget. We investigate two scenarios: fine-tuning a ranker from scratch, and domain adaptation starting with a ranker already fine-tuned on general data, and continuing fine-tuning on a target dataset. We observe a great variability in effectiveness when fine-tuning on different randomly selected subsets of training data. This suggests that it is possible to achieve effectiveness gains by actively selecting a subset of the training data that has the most positive effect on the rankers. This way, it would be possible to fine-tune effective PLM rankers at a reduced annotation budget. To investigate this, we adapt existing Active Learning (AL) strategies to the task of fine-tuning PLM rankers and investigate their effectiveness, also considering annotation and computational costs. Our extensive analysis shows that AL strategies do not significantly outperform random selection of training subsets in terms of effectiveness. We further find that gains provided by AL strategies come at the expense of more assessments (thus higher annotation costs) and AL strategies underperform random selection when comparing effectiveness given a fixed annotation cost. Our results highlight that “optimal” subsets of training data that provide high effectiveness at low annotation cost do exist, but current mainstream AL strategies applied to PLM rankers are not capable of identifying them.
Low-Energy Supernovae Bounds on Sterile Neutrinos

Sterile neutrinos can be produced through mixing with active neutrinos in the hot and dense core of a core-collapse supernova (SN). The standard bounds on the active-sterile mixing ($\sin^2 \theta$) from SN arise from SN1987A energy-loss, requiring $E_{\text{loss}}<10^{52}~{\rm erg}$. In this letter, we discuss a novel bound on sterile neutrino parameter space arising from the energy deposition through its decays inside the SN envelope. Using the observed underluminous SN IIP population, this energy deposition is constrained to be below $\sim 10^{50}~{\rm erg}$. Focusing on sterile neutrino mixing only with the tau neutrino, for heavy sterile masses $m_s$ in the range $100$-$500$ MeV, we find stringent constraints on $\sin^2 \theta_\tau$ reaching two orders of magnitude lower than those from the SN1987A energy-loss argument. Similar bounds will also be applicable to sterile mixing only with muons ($\sin^2 \theta_\mu$).
Instabilities in Convnets for Raw Audio

What makes waveform-based deep learning so hard? Despite numerous attempts at training convolutional neural networks (convnets) for filterbank design, they often fail to outperform hand-crafted baselines. These baselines are linear time-invariant systems: as such, they can be approximated by convnets with wide receptive fields. Yet, in practice, gradient-based optimization leads to suboptimal approximations. In our article, we approach this phenomenon from the perspective of initialization. We present a theory of large deviations for the energy response of FIR filterbanks with random Gaussian weights. We find that deviations worsen for large filters and locally periodic input signals, which are both typical for audio signal processing applications. Numerical simulations align with our theory and suggest that the condition number of a convolutional layer follows a logarithmic scaling law between the number and length of the filters, which is reminiscent of discrete wavelet bases.
Panama's Canal: What Happens When the United States Gives a Small Country What It Wants

On the last day of 1999, the United States turns over full possession of the Panama Canal and adjacent lands to Panama - and ends nine decades of presence in the isthmus. The author analyzes Panama's complicated society and politics, reviews the treaties, and evaluates Panama's comanagement of the canal with the United States and the canal's continuing viability, including environmental and modernizing needs. But this book is about more than a particular problem or even the future of Panama. This is also a parable for other small countries. Every act of liberation carries a corresponding burden of responsibility. The author casts into sharp relief the challenges facing many former colonial and dependent countries as we enter the post - anti-imperialist age.
Band-gap regression with architecture-optimized message-passing neural networks

Graph-based neural networks and, specifically, message-passing neural networks (MPNNs) have shown great potential in predicting physical properties of solids. In this work, we train an MPNN to first classify materials through density functional theory data from the AFLOW database as being metallic or semiconducting/insulating. We then perform a neural-architecture search to explore the model architecture and hyperparameter space of MPNNs to predict the band gaps of the materials identified as non-metals. The parameters in the search include the number of message-passing steps, latent size, and activation-function, among others. The top-performing models from the search are pooled into an ensemble that significantly outperforms existing models from the literature. Uncertainty quantification is evaluated with Monte-Carlo Dropout and ensembling, with the ensemble method proving superior. The domain of applicability of the ensemble model is analyzed with respect to the crystal systems, the inclusion of a Hubbard parameter in the density functional calculations, and the atomic species building up the materials.
Knowledge-Guided Short-Context Action Anticipation in Human-Centric Videos

This work focuses on anticipating long-term human actions, particularly using short video segments, which can speed up editing workflows through improved suggestions while fostering creativity by suggesting narratives. To this end, we imbue a transformer network with a symbolic knowledge graph for action anticipation in video segments by boosting certain aspects of the transformer's attention mechanism at run-time. Demonstrated on two benchmark datasets, Breakfast and 50Salads, our approach outperforms current state-of-the-art methods for long-term action anticipation using short video context by up to 9%.
Mitigating the Alignment Tax of RLHF

LLMs acquire a wide range of abilities during pre-training, but aligning LLMs under Reinforcement Learning with Human Feedback (RLHF) can lead to forgetting, which is also known as the alignment tax. To empirically verify this hypothesis, we conducted experiments with existing RLHF algorithms using OpenLLaMA-3B, which revealed a pronounced alignment tax in NLP tasks. On the other hand, despite various techniques to mitigate forgetting, they are often at odds with the RLHF performance, leading to a trade-off between reward maximization and forgetting mitigation. In light of the above pressing issue in aligning LLMs, in this paper we explore model averaging, which interpolates between pre and post RLHF model weights, to achieve a more efficient reward-tax Pareto front. To understand its effectiveness, We offer theoretical insights into model averaging, revealing that it enhances performance Pareto front by increasing feature diversity on the layers where tasks share overlapped feature spaces. Empirical evidence corroborates our analysis by showing the benefits of averaging low-level transformer layers. Building on the analysis and the observation that averaging different layers of the transformer leads to significantly different reward-tax trade-offs, we propose Adaptive Model Averaging (AMA) to adaptively find various combination ratios of model layers. AMA seeks to maximize the alignment reward while incurring minimal alignment tax. Moreover, we validate AMA's performance across a range of RLHF algorithms over OpenLLaMA-3B and further extend our findings to Mistral-7B.
Revisiting Energy Based Models as Policies: Ranking Noise Contrastive Estimation and Interpolating Energy Models

A crucial design decision for any robot learning pipeline is the choice of policy representation: what type of model should be used to generate the next set of robot actions? Owing to the inherent multi-modal nature of many robotic tasks, combined with the recent successes in generative modeling, researchers have turned to state-of-the-art probabilistic models such as diffusion models for policy representation. In this work, we revisit the choice of energy-based models (EBM) as a policy class. We show that the prevailing folklore -- that energy models in high dimensional continuous spaces are impractical to train -- is false. We develop a practical training objective and algorithm for energy models which combines several key ingredients: (i) ranking noise contrastive estimation (R-NCE), (ii) learnable negative samplers, and (iii) non-adversarial joint training. We prove that our proposed objective function is asymptotically consistent and quantify its limiting variance. On the other hand, we show that the Implicit Behavior Cloning (IBC) objective is actually biased even at the population level, providing a mathematical explanation for the poor performance of IBC trained energy policies in several independent follow-up works. We further extend our algorithm to learn a continuous stochastic process that bridges noise and data, modeling this process with a family of EBMs indexed by scale variable. In doing so, we demonstrate that the core idea behind recent progress in generative modeling is actually compatible with EBMs. Altogether, our proposed training algorithms enable us to train energy-based models as policies which compete with -- and even outperform -- diffusion models and other state-of-the-art approaches in several challenging multi-modal benchmarks: obstacle avoidance path planning and contact-rich block pushing.
Temporal Action Localization with Enhanced Instant Discriminability

Temporal action detection (TAD) aims to detect all action boundaries and their corresponding categories in an untrimmed video. The unclear boundaries of actions in videos often result in imprecise predictions of action boundaries by existing methods. To resolve this issue, we propose a one-stage framework named TriDet. First, we propose a Trident-head to model the action boundary via an estimated relative probability distribution around the boundary. Then, we analyze the rank-loss problem (i.e. instant discriminability deterioration) in transformer-based methods and propose an efficient scalable-granularity perception (SGP) layer to mitigate this issue. To further push the limit of instant discriminability in the video backbone, we leverage the strong representation capability of pretrained large models and investigate their performance on TAD. Last, considering the adequate spatial-temporal context for classification, we design a decoupled feature pyramid network with separate feature pyramids to incorporate rich spatial context from the large model for localization. Experimental results demonstrate the robustness of TriDet and its state-of-the-art performance on multiple TAD datasets, including hierarchical (multilabel) TAD datasets.
A Note on the Extended Kalman Filter on a Manifold

The kinematics of many control systems, especially in the robotics field, naturally live on smooth manifolds. Most classical state-estimation algorithms, including the extended Kalman filter, are posed on Euclidean space. Although any filter algorithm can be adapted to a manifold setting by implementing it in local coordinates and ignoring the geometric structure, it has always been clear that there would be advantages in taking the geometric structure into consideration in developing the algorithm. In this paper, we argue that the minimum geometric structure required to adapt the extended Kalman filter to a manifold is that of an affine connection. With this structure, we show that a naive coordinate implementation of the EKF fails to account for geometry of the manifold in the update step and in the reset step. We provide geometric modifications to the classical EKF based on parallel transport of the measurement covariance (for the update) and a-posteriori state covariance (for the reset) that address these limitations. Preliminary results for attitude estimation with two directional measurements demonstrate that the proposed modifications significantly improve the transient behavior of the filter.
Negative spectrum of Schr\"odinger Operators with Rapidly Oscillating Potentials

For Schr\"odinger operators with potentials that are asymptotically homogeneous of degree $-2$, the size of the coupling determines whether it has finite or infinitely many negative eigenvalues. In the latter case the asymptotic accumulation of these eigenvalues at zero has been determined by Kirsch and Simon. A similar regime occurs for potentials which are not asymptotically monotone, but oscillatory. In this case when the ratio between the amplitude and frequency of oscillation is asymptotically homogeneous of degree $-1$ the coupling determines the finiteness of the negative spectrum. We present a new proof of this fact by making use of a ground state representation. As a consequence of this approach we derive an asymptotic formula analogous to that of Kirsch and Simon.
Classification of Quantum Computer Fault Injection Attacks

The rapid growth of interest in quantum computing has brought about the need to secure these powerful machines against a range of physical attacks. As qubit counts increase and quantum computers achieve higher levels of fidelity, their potential to execute novel algorithms and generate sensitive intellectual property becomes more promising. However, there is a significant gap in our understanding of the vulnerabilities these computers face in terms of security and privacy attacks. Among the potential threats are physical attacks, including those orchestrated by malicious insiders within data centers where the quantum computers are located, which could compromise the integrity of computations and resulting data. This paper presents an exploration of fault-injection attacks as one class of physical attacks on quantum computers. This work first introduces a classification of fault-injection attacks and strategies, including the domain of fault-injection attacks, the fault targets, and fault manifestations in quantum computers. The resulting classification highlights the potential threats that exist. By shedding light on the vulnerabilities of quantum computers to fault-injection attacks, this work contributes to the development of robust security measures for this emerging technology.
On the Landis conjecture for the fractional Schrödinger equation

In this paper, we study a Landis-type conjecture for the general fractional Schr\"{o}dinger equation $((-P)^{s}+q)u=0$. As a byproduct, we also proved the additivity and boundedness of the linear operator $(-P)^{s}$ for non-smooth coefficents. For differentiable potentials $q$, if a solution decays at a rate $\exp(-|x|^{1+})$, then the solution vanishes identically. For non-differentiable potentials $q$, if a solution decays at a rate $\exp(-|x|^{\frac{4s}{4s-1}+})$, then the solution must again be trivial. The proof relies on delicate Carleman estimates. This study is an extension of the work by R\"{u}land-Wang (2019).