Miracle-dz/UniFAR-FTUs huggingface dataset:
Do Large Language Models Mirror Cognitive Language Processing?

Large language models (LLMs) have demonstrated remarkable capabilities in text comprehension and logical reasoning, achiving or even surpassing human-level performance in numerous cognition tasks. As LLMs are trained from massive textual outputs of human language cognition, it is natural to ask whether LLMs mirror cognitive language processing. Or to what extend LLMs resemble cognitive language processing? In this paper, we propose a novel method that bridge between LLM representations and human cognition signals to evaluate how effectively LLMs simulate cognitive language processing. We employ Representational Similarity Analysis (RSA) to mearsure the alignment between 16 mainstream LLMs and fMRI signals of the brain. We empirically investigate the impact of a variety of factors (e.g., model scaling, alignment training, instruction appending) on such LLM-brain alignment. Experimental results indicate that model scaling is positively correlated with LLM-brain similarity, and alignment training can significantly improve LLM-brain similarity. Additionally, the performance of a wide range of LLM evaluations (e.g., MMLU, Chatbot Arena) is highly correlated with the LLM-brain similarity.
Mitigating Barriers to Public Social Interaction with Meronymous Communication

In communities with social hierarchies, fear of judgment can discourage communication. While anonymity may alleviate some social pressure, fully anonymous spaces enable toxic behavior and hide the social context that motivates people to participate and helps them tailor their communication. We explore a design space of meronymous communication, where people can reveal carefully chosen aspects of their identity and also leverage trusted endorsers to gain credibility. We implemented these ideas in a system for scholars to meronymously seek and receive paper recommendations on Twitter and Mastodon. A formative study with 20 scholars confirmed that scholars see benefits to participating but are deterred due to social anxiety. From a month-long public deployment, we found that with meronymity, junior scholars could comfortably ask ``newbie'' questions and get responses from senior scholars who they normally found intimidating. Responses were also tailored to the aspects about themselves that junior scholars chose to reveal.
PIMSYN: Synthesizing Processing-in-memory CNN Accelerators

Processing-in-memory architectures have been regarded as a promising solution for CNN acceleration. Existing PIM accelerator designs rely heavily on the experience of experts and require significant manual design overhead. Manual design cannot effectively optimize and explore architecture implementations. In this work, we develop an automatic framework PIMSYN for synthesizing PIM-based CNN accelerators, which greatly facilitates architecture design and helps generate energyefficient accelerators. PIMSYN can automatically transform CNN applications into execution workflows and hardware construction of PIM accelerators. To systematically optimize the architecture, we embed an architectural exploration flow into the synthesis framework, providing a more comprehensive design space. Experiments demonstrate that PIMSYN improves the power efficiency by several times compared with existing works. PIMSYN can be obtained from https://github.com/lixixi-jook/PIMSYN-NN.
A Relational Inductive Bias for Dimensional Abstraction in Neural Networks

The human cognitive system exhibits remarkable flexibility and generalization capabilities, partly due to its ability to form low-dimensional, compositional representations of the environment. In contrast, standard neural network architectures often struggle with abstract reasoning tasks, overfitting, and requiring extensive data for training. This paper investigates the impact of the relational bottleneck -- a mechanism that focuses processing on relations among inputs -- on the learning of factorized representations conducive to compositional coding and the attendant flexibility of processing. We demonstrate that such a bottleneck not only improves generalization and learning efficiency, but also aligns network performance with human-like behavioral biases. Networks trained with the relational bottleneck developed orthogonal representations of feature dimensions latent in the dataset, reflecting the factorized structure thought to underlie human cognitive flexibility. Moreover, the relational network mimics human biases towards regularity without pre-specified symbolic primitives, suggesting that the bottleneck fosters the emergence of abstract representations that confer flexibility akin to symbols.
REPrune: Channel Pruning via Kernel Representative Selection

Channel pruning is widely accepted to accelerate modern convolutional neural networks (CNNs). The resulting pruned model benefits from its immediate deployment on general-purpose software and hardware resources. However, its large pruning granularity, specifically at the unit of a convolution filter, often leads to undesirable accuracy drops due to the inflexibility of deciding how and where to introduce sparsity to the CNNs. In this paper, we propose REPrune, a novel channel pruning technique that emulates kernel pruning, fully exploiting the finer but structured granularity. REPrune identifies similar kernels within each channel using agglomerative clustering. Then, it selects filters that maximize the incorporation of kernel representatives while optimizing the maximum cluster coverage problem. By integrating with a simultaneous training-pruning paradigm, REPrune promotes efficient, progressive pruning throughout training CNNs, avoiding the conventional train-prune-finetune sequence. Experimental results highlight that REPrune performs better in computer vision tasks than existing methods, effectively achieving a balance between acceleration ratio and performance retention.
Feature Denoising For Low-Light Instance Segmentation Using Weighted Non-Local Blocks

Instance segmentation for low-light imagery remains largely unexplored due to the challenges imposed by such conditions, for example shot noise due to low photon count, color distortions and reduced contrast. In this paper, we propose an end-to-end solution to address this challenging task. Based on Mask R-CNN, our proposed method implements weighted non-local (NL) blocks in the feature extractor. This integration enables an inherent denoising process at the feature level. As a result, our method eliminates the need for aligned ground truth images during training, thus supporting training on real-world low-light datasets. We introduce additional learnable weights at each layer in order to enhance the network's adaptability to real-world noise characteristics, which affect different feature scales in different ways. Experimental results show that the proposed method outperforms the pretrained Mask R-CNN with an Average Precision (AP) improvement of +10.0, with the introduction of weighted NL Blocks further enhancing AP by +1.0.
A Lightweight Low-Light Image Enhancement Network via Channel Prior and Gamma Correction

Human vision relies heavily on available ambient light to perceive objects. Low-light scenes pose two distinct challenges: information loss due to insufficient illumination and undesirable brightness shifts. Low-light image enhancement (LLIE) refers to image enhancement technology tailored to handle this scenario. We introduce CPGA-Net, an innovative LLIE network that combines dark/bright channel priors and gamma correction via deep learning and integrates features inspired by the Atmospheric Scattering Model and the Retinex Theory. This approach combines the use of traditional and deep learning methodologies, designed within a simple yet efficient architectural framework that focuses on essential feature extraction. The resulting CPGA-Net is a lightweight network with only 0.025 million parameters and 0.030 seconds for inference time, yet it achieves superior performance over existing LLIE methods on both objective and subjective evaluation criteria. Furthermore, we utilized knowledge distillation with explainable factors and proposed an efficient version that achieves 0.018 million parameters and 0.006 seconds for inference time. The proposed approaches inject new solution ideas into LLIE, providing practical applications in challenging low-light scenarios.
Calibration requirement for Epoch of Reionization 21-cm signal observation -- III. Bias and variance in uGMRT ELAIS-N1 field power spectrum

Power spectrum of \HI 21-cm radiation is one of the promising probes to study large scale structure of the universe and understand galaxy formation and evolution. The presence of foregrounds, that are orders of magnitude larger in the same frequency range of the redshifted 21-cm signal has been one of the largest observational challenges. The foreground contamination also hinders the calibration procedures and introduces residual calibration errors in the interferometric data. It has been shown that the calibration errors can introduce bias in the 21-cm power spectrum estimates and introduce additional systematics. In this work, we assess the efficacy of 21-cm power spectrum estimation for the uGMRT Band-3 observations of the ELAIS-N1 field. We first evaluate the statistics of the residual gain errors and perform additional flagging based on these statistics. We then use an analytical method to estimate the bias and variance in the power spectrum. We found that (a) the additional flagging based on calibration accuracy help reduce the bias and systematics in the power spectrum, (b) the majority of the systematics at the lower angular scales, $\ell<6000$, are due to the residual gain errors, (c) for the uGMRT baseline configuration and system parameters, the variance is always higher than the bias in the power spectrum estimates. Based on our analysis we observe that for an angular multipole of $\ell \sim3000$, $2000$ hours of `on source time' is required with the uGMRT to detect redshifted 21-cm signal at $3-\sigma$ significance from a redshift of $2.55$. In this work we only consider the power spectrum measurement in the plane of the sky, an assessment of residual gain statistics and its effect on multifrequency angular power spectrum estimation for the uGMRT and the SKA like telescopes will be presented in a companion paper.
Stable LM 2 1.6B Technical Report

We introduce StableLM 2 1.6B, the first in a new generation of our language model series. In this technical report, we present in detail the data and training procedure leading to the base and instruction-tuned versions of StableLM 2 1.6B. The weights for both models are available via Hugging Face for anyone to download and use. The report contains thorough evaluations of these models, including zero- and few-shot benchmarks, multilingual benchmarks, and the MT benchmark focusing on multi-turn dialogues. At the time of publishing this report, StableLM 2 1.6B was the state-of-the-art open model under 2B parameters by a significant margin. Given its appealing small size, we also provide throughput measurements on a number of edge devices. In addition, we open source several quantized checkpoints and provide their performance metrics compared to the original model.
Out-of-Domain Generalization in Dynamical Systems Reconstruction

In science we are interested in finding the governing equations, the dynamical rules, underlying empirical phenomena. While traditionally scientific models are derived through cycles of human insight and experimentation, recently deep learning (DL) techniques have been advanced to reconstruct dynamical systems (DS) directly from time series data. State-of-the-art dynamical systems reconstruction (DSR) methods show promise in capturing invariant and long-term properties of observed DS, but their ability to generalize to unobserved domains remains an open challenge. Yet, this is a crucial property we would expect from any viable scientific theory. In this work, we provide a formal framework that addresses generalization in DSR. We explain why and how out-of-domain (OOD) generalization (OODG) in DSR profoundly differs from OODG considered elsewhere in machine learning. We introduce mathematical notions based on topological concepts and ergodic theory to formalize the idea of learnability of a DSR model. We formally prove that black-box DL techniques, without adequate structural priors, generally will not be able to learn a generalizing DSR model. We also show this empirically, considering major classes of DSR algorithms proposed so far, and illustrate where and why they fail to generalize across the whole phase space. Our study provides the first comprehensive mathematical treatment of OODG in DSR, and gives a deeper conceptual understanding of where the fundamental problems in OODG lie and how they could possibly be addressed in practice.
Prosocial and Financial Incentives for Biodiversity Conservation: A Field Experiment Using a Smartphone App

Ascertaining the number, type, and location of plant, insect, and animal species is essential for biodiversity conservation. However, comprehensively monitoring the situation only through public fixed-point surveys is challenging, and therefore information voluntarily provided by citizens assists in ascertaining the species distribution. To effectively encourage the citizens' data sharing behavior, this study proposed a prosocial incentive scheme in which, if they provide species information, donations are made to activities for saving endangered species. We conducted a field experiment with users (N=830) of a widely-used Japanese smartphone app to which they post species photos and measured the incentive's effect on their posting behavior. In addition, we measured the effect of a financial incentive scheme that provides monetary rewards for posting species photos and compared the two incentives' effects. The analyses revealed that while the prosocial incentive did not increase the number of posts on average, it did change the contents of posts, increasing the proportion of posts on rare species. On the contrary, the financial incentive statistically significantly increased the number of posts, in particular, on less rare and invasive species. Our findings suggest that the prosocial and financial incentives could stimulate different motivations and encourage different posting behaviors.
Deep Confident Steps to New Pockets: Strategies for Docking Generalization

Accurate blind docking has the potential to lead to new biological breakthroughs, but for this promise to be realized, docking methods must generalize well across the proteome. Existing benchmarks, however, fail to rigorously assess generalizability. Therefore, we develop DockGen, a new benchmark based on the ligand-binding domains of proteins, and we show that existing machine learning-based docking models have very weak generalization abilities. We carefully analyze the scaling laws of ML-based docking and show that, by scaling data and model size, as well as integrating synthetic data strategies, we are able to significantly increase the generalization capacity and set new state-of-the-art performance across benchmarks. Further, we propose Confidence Bootstrapping, a new training paradigm that solely relies on the interaction between diffusion and confidence models and exploits the multi-resolution generation process of diffusion models. We demonstrate that Confidence Bootstrapping significantly improves the ability of ML-based docking methods to dock to unseen protein classes, edging closer to accurate and generalizable blind docking methods.
Evaluating Very Long-Term Conversational Memory of LLM Agents

Existing works on long-term open-domain dialogues focus on evaluating model responses within contexts spanning no more than five chat sessions. Despite advancements in long-context large language models (LLMs) and retrieval augmented generation (RAG) techniques, their efficacy in very long-term dialogues remains unexplored. To address this research gap, we introduce a machine-human pipeline to generate high-quality, very long-term dialogues by leveraging LLM-based agent architectures and grounding their dialogues on personas and temporal event graphs. Moreover, we equip each agent with the capability of sharing and reacting to images. The generated conversations are verified and edited by human annotators for long-range consistency and grounding to the event graphs. Using this pipeline, we collect LoCoMo, a dataset of very long-term conversations, each encompassing 300 turns and 9K tokens on avg., over up to 35 sessions. Based on LoCoMo, we present a comprehensive evaluation benchmark to measure long-term memory in models, encompassing question answering, event summarization, and multi-modal dialogue generation tasks. Our experimental results indicate that LLMs exhibit challenges in understanding lengthy conversations and comprehending long-range temporal and causal dynamics within dialogues. Employing strategies like long-context LLMs or RAG can offer improvements but these models still substantially lag behind human performance.
Unraveling the complexity of the Dzyaloshinskii-Moriya interaction in layered magnets: Towards its full magnitude and chirality control

Chirality is an inherent characteristics of some objects in nature. In magnetism chiral magnetic textures can be formed in systems with broken inversion symmetry and due to an antisymmetric magnetic interaction, known as Dzyaloshinskii--Moriya interaction (DMI). Here, aiming on a fundamental understanding of this chiral interaction on the atomic scale, we design several synthetic layered structures composed of alternating atomic layers of 3d ferromagnetic metals epitaxially grown on Ir(001). We demonstrate both experimentally and theoretically that the atomistic DMI depends critically not only on the orbital occupancy of the interface magnetic layer but also on the sequence of the atomic layers. The effect is attributed to the complexity of the electronic structure and the contribution of different orbitals to the hybridization and DMI. We anticipate that our results provide guidelines for controlling both the chirality and the magnitude of the atomistic DMI.
Velocity models and hypocenter relocations for the Charlevoix Seismic Zone

Three‐dimensional P and S wave velocity (Vp and Vs) models and hypocenter relocations are determined for the Charlevoix Seismic Zone (CSZ) using local arrival time tomography. The CSZ is located along the St. Lawrence River about 100 km downstream from Quebec City, Canada, and is one of the most active seismic zones in eastern North America. Earthquakes occur in Grenvillian basement rocks affected by Iapetan Ocean rifting and a large Devonian meteor impact. Low Vp and Vs are associated with the impact structure to a depth of 12 km. Relocated hypocenters form a semicircle delineating the eastern margin of the impact structure. Northeast of the impact, hypocenters cluster into two groups separated by a region of high Vp and Vs velocity. Hypocenters within each group align along planar surfaces, suggesting the presence of distinct seismogenic faults. The planes trend NE, in the same direction as the Iapetan rift faults, and dip to the SE. One plane is located beneath the north shore of the St. Lawrence River and extends to a depth of at least 30 km. Two other planes with shallower dips are located beneath the river and extend to depths of 12 and 15 km. All three planes are disrupted within the impact zone but can be followed, suggesting partial preservation of rift‐parallel fault fabric.
All in a Single Image: Large Multimodal Models are In-Image Learners

This paper introduces a new in-context learning (ICL) mechanism called In-Image Learning (I$^2$L) that combines demonstration examples, visual cues, and instructions into a single image to enhance the capabilities of GPT-4V. Unlike previous approaches that rely on converting images to text or incorporating visual input into language models, I$^2$L consolidates all information into one image and primarily leverages image processing, understanding, and reasoning abilities. This has several advantages: it avoids inaccurate textual descriptions of complex images, provides flexibility in positioning demonstration examples, reduces the input burden, and avoids exceeding input limits by eliminating the need for multiple images and lengthy text. To further combine the strengths of different ICL methods, we introduce an automatic strategy to select the appropriate ICL method for a data example in a given task. We conducted experiments on MathVista and Hallusionbench to test the effectiveness of I$^2$L in complex multimodal reasoning tasks and mitigating language hallucination and visual illusion. Additionally, we explored the impact of image resolution, the number of demonstration examples, and their positions on the effectiveness of I$^2$L. Our code is publicly available at https://github.com/AGI-Edgerunners/IIL.
Moduli of stable sheaves on quadric threefold

For each $0<\alpha<\frac{1}{2}$, there exists a Bayer--Lahoz--Macr{\`{\i}}--Stellari's inducing Bridgeland stability condition $\sigma(\alpha)$ on a Kuznetsov component $\mathrm{Ku}(Q)$ of the smooth quadric threefold $Q$. We obtain the non-empty of the moduli space $M_{\sigma(\alpha)}([\mathcal{P}_{x}])$ of $\sigma(\alpha)$-semistable objects in $\mathrm{Ku}(Q)$ with the numerical class $[\mathcal{P}_{x}]$, where $\mathcal{P}_{x}\in \mathrm{Ku}(Q)$ is the projection sheaf of the skyscraper sheaf at a closed point $x\in Q$. We show that the moduli space $\overline{M}_{Q}(\mathbf{v})$ of Gieseker semistable sheaves with Chern character $\mathbf{v}=\mathrm{ch}(\mathcal{P}_{x})$ is smooth and irreducible of dimension four, and prove that the moduli space $M_{\sigma(\alpha)}([\mathcal{P}_{x}])$ is isomorphic to $\overline{M}_{Q}(\mathbf{v})$. As an application, we show that the quadric threefold $Q$ can be reinterpreted as a Brill--Noether locus in the Bridgeland moduli space $M_{\sigma(\alpha)}([\mathcal{P}_{x}])$. In the appendices, we show that the moduli space $M_{\sigma(\alpha)}([S])$ contains only one single point corresponding to the spinor bundle $S$ and give a Bridgeland moduli interpretation for the Hilbert scheme of lines in $Q$.
Stochastic Approximation with Biased MCMC for Expectation Maximization

The expectation maximization (EM) algorithm is a widespread method for empirical Bayesian inference, but its expectation step (E-step) is often intractable. Employing a stochastic approximation scheme with Markov chain Monte Carlo (MCMC) can circumvent this issue, resulting in an algorithm known as MCMC-SAEM. While theoretical guarantees for MCMC-SAEM have previously been established, these results are restricted to the case where asymptotically unbiased MCMC algorithms are used. In practice, MCMC-SAEM is often run with asymptotically biased MCMC, for which the consequences are theoretically less understood. In this work, we fill this gap by analyzing the asymptotics and non-asymptotics of SAEM with biased MCMC steps, particularly the effect of bias. We also provide numerical experiments comparing the Metropolis-adjusted Langevin algorithm (MALA), which is asymptotically unbiased, and the unadjusted Langevin algorithm (ULA), which is asymptotically biased, on synthetic and real datasets. Experimental results show that ULA is more stable with respect to the choice of Langevin stepsize and can sometimes result in faster convergence.