Miracle-dz/UniFAR-FTUs huggingface dataset:
Learning a General Model of Single Phase Flow in Complex 3D Porous Media

Modeling effective transport properties of 3D porous media, such as permeability, at multiple scales is challenging as a result of the combined complexity of the pore structures and fluid physics - in particular, confinement effects which vary across the nanoscale to the microscale. While numerical simulation is possible, the computational cost is prohibitive for realistic domains, which are large and complex. Although machine learning models have been proposed to circumvent simulation, none so far has simultaneously accounted for heterogeneous 3D structures, fluid confinement effects, and multiple simulation resolutions. By utilizing numerous computer science techniques to improve the scalability of training, we have for the first time developed a general flow model that accounts for the pore-structure and corresponding physical phenomena at scales from Angstrom to the micrometer. Using synthetic computational domains for training, our machine learning model exhibits strong performance (R$^2$=0.9) when tested on extremely diverse real domains at multiple scales.
HallusionBench: You See What You Think? Or You Think What You See? An Image-Context Reasoning Benchmark Challenging for GPT-4V(ision), LLaVA-1.5, and Other Multi-modality Models

Large language models (LLMs), after being aligned with vision models and integrated into vision-language models (VLMs), can bring impressive improvement in image reasoning tasks. This was shown by the recently released GPT-4V(ison), LLaVA-1.5, etc. However, the strong language prior in these SOTA LVLMs can be a double-edged sword: they may ignore the image context and solely rely on the (even contradictory) language prior for reasoning. In contrast, the vision modules in VLMs are weaker than LLMs and may result in misleading visual representations, which are then translated to confident mistakes by LLMs. To study these two types of VLM mistakes, i.e., language hallucination and visual illusion , we curated “H ALLUSION B ENCH 1 ,” an image-context reasoning benchmark that is still challenging to even GPT-4V and LLaVA-1.5. We provide a detailed analysis of examples in H ALLUSION B ENCH , which sheds novel insights on the illusion or hallucination of VLMs and how to improve them in the future. The benchmark and codebase will be released at https://github.com/tianyi-lab/HallusionBench.
K-Nearest-Neighbors Induced Topological PCA for Single Cell RNA-Sequence Data Analysis

Single-cell RNA sequencing (scRNA-seq) is widely used to reveal heterogeneity in cells, which has given us insights into cell-cell communication, cell differentiation, and differential gene expression. However, analyzing scRNA-seq data is a challenge due to sparsity and the large number of genes involved. Therefore, dimensionality reduction and feature selection are important for removing spurious signals and enhancing downstream analysis. Traditional PCA, a main workhorse in dimensionality reduction, lacks the ability to capture geometrical structure information embedded in the data, and previous graph Laplacian regularizations are limited by the analysis of only a single scale. We propose a topological Principal Components Analysis (tPCA) method by the combination of persistent Laplacian (PL) technique and L2,1 norm regularization to address multiscale and multiclass heterogeneity issues in data. We further introduce a k-Nearest-Neighbor (kNN) persistent Laplacian technique to improve the robustness of our persistent Laplacian method. The proposed kNN-PL is a new algebraic topology technique which addresses the many limitations of the traditional persistent homology. Rather than inducing filtration via the varying of a distance threshold, we introduced kNN-tPCA, where filtrations are achieved by varying the number of neighbors in a kNN network at each step, and find that this framework has significant implications for hyper-parameter tuning. We validate the efficacy of our proposed tPCA and kNN-tPCA methods on 11 diverse benchmark scRNA-seq datasets, and showcase that our methods outperform other unsupervised PCA enhancements from the literature, as well as popular Uniform Manifold Approximation (UMAP), t-Distributed Stochastic Neighbor Embedding (tSNE), and Projection Non-Negative Matrix Factorization (NMF) by significant margins. For example, tPCA provides up to 628%, 78%, and 149% improvements to UMAP, tSNE, and NMF, respectively on classification in the F1 metric, and kNN-tPCA offers 53%, 63%, and 32% improvements to UMAP, tSNE, and NMF, respectively on clustering in the ARI metric.
Merging Generated and Retrieved Knowledge for Open-Domain QA

Open-domain question answering (QA) systems are often built with retrieval modules. However, retrieving passages from a given source is known to suffer from insufficient knowledge coverage. Alternatively, prompting large language models (LLMs) to generate contextual passages based on their parametric knowledge has been shown to improve QA performance. Yet, LLMs tend to"hallucinate"content that conflicts with the retrieved knowledge. Based on the intuition that answers supported by both sources are more likely to be correct, we propose COMBO, a Compatibility-Oriented knowledge Merging for Better Open-domain QA framework, to effectively leverage the two sources of information. Concretely, we match LLM-generated passages with retrieved counterparts into compatible pairs, based on discriminators trained with silver compatibility labels. Then a Fusion-in-Decoder-based reader model handles passage pairs to arrive at the final answer. Experiments show that COMBO outperforms competitive baselines on three out of four tested open-domain QA benchmarks. Further analysis reveals that our proposed framework demonstrates greater efficacy in scenarios with a higher degree of knowledge conflicts.
Optimized Absorption of Light in Perovskite Nanowire Solar Cells.

Metal halide perovskite nanowires (PrvNWs) have recently emerged as an interesting path for nanostructured solar cells. Here, we model the absorption of light in PrvNW arrays for varying diameter and length of the PrvNWs and period for the array by solving the Maxwell equations. For long enough bare PrvNW arrays, we find that the optimum diameter is fixed to that which places the absorption peak from the HE11waveguide mode in the PrvNWs to the vicinity of the bandgap wavelength. In contrast, when we include a transparent conductive oxide (TCO) top contact layer, the optimum diameter shifts to a larger value by 100 nm. The origin of this shift is traced to a reduced reflection at the interface between the TCO layer and the PrvNW array when the PrvNW's diameter is larger. Overall, we find that 1500 nm long PrvNWs can reach 90% of the broadband absorption potential, making this system of high interest for photovoltaics.
Quantitative Sobolev regularity of quasiregular maps

We quantify the Sobolev space norm of the Beltrami resolvent $(I- \mu \mathcal S)^{-1}$, where $\mathcal S$ is the Beurling-Ahlfors transform, in terms of the corresponding Sobolev space norm of the dilatation $\mu$ in the critical and supercrticial ranges. Our estimate entails as a consequence quantitative self-improvement inequalities of Caccioppoli type for quasiregular distributions with dilatations in $W^{1,p}$, $p \ge 2$. Our proof strategy is then adapted to yield quantitative estimates for the resolvent $(I-\mu \mathcal S_\Omega)^{-1}$ of the Beltrami equation on a sufficiently regular domain $\Omega$, with $\mu\in W^{1,p}(\Omega)$. Here, $\mathcal S_\Omega$ is the compression of $\mathcal S$ to a domain $\Omega$. Our proofs do not rely on the compactness or commutator arguments previously employed in related literature. Instead, they leverage the weighted Sobolev estimates for compressions of Calder\'on-Zygmund operators to domains, recently obtained by the authors, to extend the Astala-Iwaniec-Saksman technique to higher regularities.
Convergence of spectral truncations for compact metric groups

We consider Gromov-Hausdorff convergence of state spaces for spectral truncations of a compact metric group $G$. We work in the context of order-unit spaces and consider orthogonal projections $P_\Lambda$ in $L^2(G)$ corresponding to finite subsets of irreducible representations $\Lambda \subseteq \widehat G$. We then prove that the sequence of truncated state spaces $\{ S(P_\Lambda C(G) P_\Lambda)\}_\Lambda$ Gromov-Hausdorff converges to the original state space $S(C(G))$, when these are equipped with a metric associated to a Lip-norm which in turn is induced by the action of $G$.
Understanding Read Disturbance in High Bandwidth Memory: An Experimental Analysis of Real HBM2 DRAM Chips

DRAM read disturbance is a significant and worsening safety, security, and reliability issue of modern DRAM chips that can be exploited to break memory isolation. Two prominent examples of read-disturb phenomena are RowHammer and RowPress. However, no prior work extensively studies read-disturb phenomena in modern high-bandwidth memory (HBM) chips. In this work, we experimentally demonstrate the effects of read disturbance and uncover the inner workings of undocumented in-DRAM read disturbance mitigation mechanisms in HBM. Our characterization of six real HBM2 DRAM chips shows that (1) the number of read disturbance bitflips and the number of row activations needed to induce the first read disturbance bitflip significantly varies between different HBM2 chips and different 3D-stacked channels, pseudo channels, banks, and rows inside an HBM2 chip. (2) The DRAM rows at the end and in the middle of a DRAM bank exhibit significantly fewer read disturbance bitflips than the rest of the rows. (3) It takes fewer additional activations to induce more read disturbance bitflips in a DRAM row if the row exhibits the first bitflip already at a relatively high activation count. (4) HBM2 chips exhibit read disturbance bitflips with only two row activations when rows are kept active for an extremely long time. We show that a modern HBM2 DRAM chip implements undocumented read disturbance defenses that can track potential aggressor rows based on how many times they are activated, and refresh their victim rows with every 17 periodic refresh operations. We draw key takeaways from our observations and discuss their implications for future read disturbance attacks and defenses. We explain how our findings could be leveraged to develop both i) more powerful read disturbance attacks and ii) more efficient read disturbance defense mechanisms.
A Dual-Stream Neural Network Explains the Functional Segregation of Dorsal and Ventral Visual Pathways in Human Brains

The human visual system uses two parallel pathways for spatial processing and object recognition. In contrast, computer vision systems tend to use a single feedforward pathway, rendering them less robust, adaptive, or efficient than human vision. To bridge this gap, we developed a dual-stream vision model inspired by the human eyes and brain. At the input level, the model samples two complementary visual patterns to mimic how the human eyes use magnocellular and parvocellular retinal ganglion cells to separate retinal inputs to the brain. At the backend, the model processes the separate input patterns through two branches of convolutional neural networks (CNN) to mimic how the human brain uses the dorsal and ventral cortical pathways for parallel visual processing. The first branch (WhereCNN) samples a global view to learn spatial attention and control eye movements. The second branch (WhatCNN) samples a local view to represent the object around the fixation. Over time, the two branches interact recurrently to build a scene representation from moving fixations. We compared this model with the human brains processing the same movie and evaluated their functional alignment by linear transformation. The WhereCNN and WhatCNN branches were found to differentially match the dorsal and ventral pathways of the visual cortex, respectively, primarily due to their different learning objectives. These model-based results lead us to speculate that the distinct responses and representations of the ventral and dorsal streams are more influenced by their distinct goals in visual attention and object recognition than by their specific bias or selectivity in retinal inputs. This dual-stream model takes a further step in brain-inspired computer vision, enabling parallel neural networks to actively explore and understand the visual surroundings.
Evaluation Metrics in the Era of GPT-4: Reliably Evaluating Large Language Models on Sequence to Sequence Tasks

Large Language Models (LLMs) evaluation is a patchy and inconsistent landscape, and it is becoming clear that the quality of automatic evaluation metrics is not keeping up with the pace of development of generative models. We aim to improve the understanding of current models' performance by providing a preliminary and hybrid evaluation on a range of open and closed-source generative LLMs on three NLP benchmarks: text summarisation, text simplification and grammatical error correction (GEC), using both automatic and human evaluation. We also explore the potential of the recently released GPT-4 to act as an evaluator. We find that ChatGPT consistently outperforms many other popular models according to human reviewers on the majority of metrics, while scoring much more poorly when using classic automatic evaluation metrics. We also find that human reviewers rate the gold reference as much worse than the best models' outputs, indicating the poor quality of many popular benchmarks. Finally, we find that GPT-4 is capable of ranking models' outputs in a way which aligns reasonably closely to human judgement despite task-specific variations, with a lower alignment in the GEC task.
Quantum theory of the magnetochiral anisotropy coefficient in 
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:msub><mml:mi>ZrTe</mml:mi><mml:mn>5</mml:mn></mml:msub></mml:math>

Recent experiments performed the nonreciprocal magneotransport in ZrTe$_5$ and obtained a giant magnetochiral anisotropy (MCA) coefficient $\gamma'$. The existing theoretical analysis was based on the semiclassical Boltzmann equation. In this paper, we develop a full quantum theory to calculate $\gamma'$ and further explore the underlying physics. We reveal that the $xz$-mirror symmetry breaking term also breaks the parity symmetry of the system and leads to mixed selection rules and nonvanishing second-order conductivity $\sigma_{xxx}$. The calculations show that $\gamma'$ decreases with the magnetic field, survives only to weak impurity scatterings, and exhibits a nonmonotonous dependence on the strength of the $xz$-mirror symmetry breaking. Our paper can provide a deeper insight into the intrinsic nonreciprocal magnetotransport phenomena in the topological semimetal material.
The effects of cavitation position on the velocity of a laser-induced microjet extracted using explainable artificial intelligence

The control of the velocity of a high-speed laser-induced microjet is crucial in applications such as needle-free injection. Previous studies have indicated that the jet velocity is heavily influenced by the volumes of secondary cavitation bubbles generated through laser absorption. However, there has been a lack of investigation of the relationship between the positions of cavitation bubbles and the jet velocity. In this study, we investigate the effects of cavitation bubbles on the jet velocity of laser-induced microjets extracted using explainable artificial intelligence (XAI). An XAI is used to classify the jet velocity from images of cavitation bubbles and to extract features from the images through visualization of the classification process. For this purpose, we run 1000 experiments and collect the corresponding images. The XAI model, which is a feedforward neural network (FNN), is trained to classify the jet velocity from the images of cavitation bubbles. After achieving a high classification accuracy, we analyze the classification process of the FNN. The predictions of the FNN, when considering the cavitation positions, show a higher correlation with the jet velocity than the results considering only cavitation volumes. Further investigation suggested that cavitation that occurs closer to the laser focus position has a higher acceleration effect. These results suggest that the velocity of a high-speed microjet is also affected by the cavitation position.
Leveraging Image-Text Similarity and Caption Modification for the DataComp Challenge: Filtering Track and BYOD Track

Large web crawl datasets have already played an important role in learning multimodal features with high generalization capabilities. However, there are still very limited studies investigating the details or improvements of data design. Recently, a DataComp challenge has been designed to propose the best training data with the fixed models. This paper presents our solution to both filtering track and BYOD track of the DataComp challenge. Our solution adopts large multimodal models CLIP and BLIP-2 to filter and modify web crawl data, and utilize external datasets along with a bag of tricks to improve the data quality. Experiments show our solution significantly outperforms DataComp baselines (filtering track: 6.6% improvement, BYOD track: 48.5% improvement).
One is More: Diverse Perspectives within a Single Network for Efficient DRL

Deep reinforcement learning has achieved remarkable performance in various domains by leveraging deep neural networks for approximating value functions and policies. However, using neural networks to approximate value functions or policy functions still faces challenges, including low sample efficiency and overfitting. In this paper, we introduce OMNet, a novel learning paradigm utilizing multiple subnetworks within a single network, offering diverse outputs efficiently. We provide a systematic pipeline, including initialization, training, and sampling with OMNet. OMNet can be easily applied to various deep reinforcement learning algorithms with minimal additional overhead. Through comprehensive evaluations conducted on MuJoCo benchmark, our findings highlight OMNet's ability to strike an effective balance between performance and computational cost.
Graph Convolutional Network with Connectivity Uncertainty for EEG-based Emotion Recognition

Automatic emotion recognition based on multichannel Electroencephalography (EEG) holds great potential in advancing human-computer interaction. However, several significant challenges persist in existing research on algorithmic emotion recognition. These challenges include the need for a robust model to effectively learn discriminative node attributes over long paths, the exploration of ambiguous topological information in EEG channels and effective frequency bands, and the mapping between intrinsic data qualities and provided labels. To address these challenges, this study introduces the distribution-based uncertainty method to represent spatial dependencies and temporal-spectral relativeness in EEG signals based on Graph Convolutional Network (GCN) architecture that adaptively assigns weights to functional aggregate node features, enabling effective long-path capturing while mitigating over-smoothing phenomena. Moreover, the graph mixup technique is employed to enhance latent connected edges and mitigate noisy label issues. Furthermore, we integrate the uncertainty learning method with deep GCN weights in a one-way learning fashion, termed Connectivity Uncertainty GCN (CU-GCN). We evaluate our approach on two widely used datasets, namely SEED and SEEDIV, for emotion recognition tasks. The experimental results demonstrate the superiority of our methodology over previous methods, yielding positive and significant improvements. Ablation studies confirm the substantial contributions of each component to the overall performance.
Betelgeuse as a Merger of a Massive Star with a Companion

We investigate the merger between a 16M ⊙ star, on its way to becoming a red supergiant (RSG), and a 4M ⊙ main-sequence companion. Our study employs three-dimensional hydrodynamic simulations using the state-of-the-art adaptive mesh refinement code Octo-Tiger. The initially corotating binary undergoes interaction and mass transfer, resulting in the accumulation of mass around the companion and its subsequent loss through the second Lagrangian point (L2). The companion eventually plunges into the envelope of the primary, leading to its spin-up and subsequent merger with the helium core. We examine the internal structural properties of the post-merger star, as well as the merger environment and the outflow driven by the merger. Our findings reveal the ejection of approximately ∼0.6 M ⊙ of material in an asymmetric and somewhat bipolar outflow. We import the post-merger stellar structure into the MESA stellar evolution code to model its long-term nuclear evolution. In certain cases, the post-merger star exhibits persistent rapid equatorial surface rotation as it evolves in the H–R diagram toward the observed location of Betelgeuse. These cases demonstrate surface rotation velocities of a similar magnitude to those observed in Betelgeuse, along with a chemical composition resembling that of Betelgeuse. In other cases, efficient rotationally induced mixing leads to slower surface rotation. This pioneering study aims to model stellar mergers across critical timescales, encompassing dynamical, thermal, and nuclear evolutionary stages.
The Safety Challenges of Deep Learning in Real-World Type 1 Diabetes Management

Blood glucose simulation allows the effectiveness of type 1 diabetes (T1D) management strategies to be evaluated without patient harm. Deep learning algorithms provide a promising avenue for extending simulator capabilities; however, these algorithms are limited in that they do not necessarily learn physiologically correct glucose dynamics and can learn incorrect and potentially dangerous relationships from confounders in training data. This is likely to be more important in real-world scenarios, as data is not collected under strict research protocol. This work explores the implications of using deep learning algorithms trained on real-world data to model glucose dynamics. Free-living data was processed from the OpenAPS Data Commons and supplemented with patient-reported tags of challenging diabetes events, constituting one of the most detailed real-world T1D datasets. This dataset was used to train and evaluate state-of-the-art glucose simulators, comparing their prediction error across safety critical scenarios and assessing the physiological appropriateness of the learned dynamics using Shapley Additive Explanations (SHAP). While deep learning prediction accuracy surpassed the widely-used mathematical simulator approach, the model deteriorated in safety critical scenarios and struggled to leverage self-reported meal and exercise information. SHAP value analysis also indicated the model had fundamentally confused the roles of insulin and carbohydrates, which is one of the most basic T1D management principles. This work highlights the importance of considering physiological appropriateness when using deep learning to model real-world systems in T1D and healthcare more broadly, and provides recommendations for building models that are robust to real-world data constraints.