Miracle-dz/UniFAR-FTUs huggingface dataset:
Revisiting the Evaluation of Image Synthesis with GANs

A good metric, which promises a reliable comparison between solutions, is essential for any well-defined task. Unlike most vision tasks that have per-sample ground-truth, image synthesis tasks target generating unseen data and hence are usually evaluated through a distributional distance between one set of real samples and another set of generated samples. This study presents an empirical investigation into the evaluation of synthesis performance, with generative adversarial networks (GANs) as a representative of generative models. In particular, we make in-depth analyses of various factors, including how to represent a data point in the representation space, how to calculate a fair distance using selected samples, and how many instances to use from each set. Extensive experiments conducted on multiple datasets and settings reveal several important findings. Firstly, a group of models that include both CNN-based and ViT-based architectures serve as reliable and robust feature extractors for measurement evaluation. Secondly, Centered Kernel Alignment (CKA) provides a better comparison across various extractors and hierarchical layers in one model. Finally, CKA is more sample-efficient and enjoys better agreement with human judgment in characterizing the similarity between two internal data correlations. These findings contribute to the development of a new measurement system, which enables a consistent and reliable re-evaluation of current state-of-the-art generative models.
Catalog of Planetary Nebulae Detected by GALEX and Corollary Optical Surveys

Planetary nebulae (PNs) consist of an ionized envelope surrounding a hot central star (CSPN) that emits mostly at ultraviolet (UV) wavelengths. UV observations, therefore, provide important information on both the CSPN and the nebula. We have matched the PNs in the Hong Kong/Australian Astronomical Observatory/Strasbourg Hα catalog with the Galaxy Evolution Explorer (GALEX) UV sky surveys, the Sloan Digital Sky Survey (SDSS) data release 16, and the Panoramic Survey Telescope and Rapid Response System (Pan-STARRS) PS1 second release. A total of 671 PNs were observed by GALEX with the far-UV (FUV; 1344 Å–1786 Å) and/or the near-UV (NUV; 1771 Å–2831 Å) detectors on (GUVPNcat); 83 were observed by SDSS (PNcatxSDSSDR16) and 1819 by Pan-STARRS (PNcatxPS1MDS). We merged a distilled version of these matched catalogs into GUVPNcatxSDSSDR16xPS1MDS, which contains a total of 375 PNs with both UV and optical photometry over a total spectral coverage of ∼1540 Å–9610 Å. We analyzed separately 170 PNs resolved in GALEX images and determined their UV radius by applying a flux profile analysis. The CSPN flux could be extracted separately from the PN emission for 8 and 50 objects with SDSS and Pan-STARRS counterparts, respectively. The multiband photometry was used to distinguish between compact and extended PNs and CSPNs (binary CSPNs) by color–color diagram analysis. We found that compact PN candidates could be identified by using the r − i < − 0.4 and −1 < FUV−NUV < 1 colors, whereas binary CSPN candidates in given T eff ranges (all with color r−i > −0.4) can be identified in the color region (FUV−NUV) ≤ 6(r−i)+1.3, −0.8 < FUV−NUV < 0.4, and r−i < 0.75.
A statistical framework for analyzing shape in a time series of random geometric objects

We introduce a new framework to analyze shape descriptors that capture the geometric features of an ensemble of point clouds. At the core of our approach is the point of view that the data arises as sampled recordings from a metric space-valued stochastic process, possibly of nonstationary nature, thereby integrating geometric data analysis into the realm of functional time series analysis. We focus on the descriptors coming from topological data analysis. Our framework allows for natural incorporation of spatial-temporal dynamics, heterogeneous sampling, and the study of convergence rates. Further, we derive complete invariants for classes of metric space-valued stochastic processes in the spirit of Gromov, and relate these invariants to so-called ball volume processes. Under mild dependence conditions, a weak invariance principle in $D([0,1]\times [0,\mathscr{R}])$ is established for sequential empirical versions of the latter, assuming the probabilistic structure possibly changes over time. Finally, we use this result to introduce novel test statistics for topological change, which are distribution free in the limit under the hypothesis of stationarity.
Nuclear mass table in density functional approach inspired by neutron-star observations

Background: Nuclear energy-density functional (EDF) approach has been widely used to describe nuclear-matter equations of state (EoS) and properties of finite nuclei. Recent advancements in neutron-star (NS) observations have put constraints on the nuclear EoS. The Korea-IBS-Daegu-SKKU (KIDS) functional has been then developed to satisfy the NS observations and applied to homogeneous nuclear matter and spherical nuclei. Purpose: We examine the performance of the KIDS functional by calculating the masses and charge radii of even-even nuclei towards the drip lines. Method: The Kohn-Sham-Bogoliubov equation is solved by taking into account the axial deformation. Results: The root-mean-square deviation of the binding energy and the charge radius for the KIDS functional is 4.5--5.1 MeV and 0.03--0.04 fm, which is comparable to that for existing EDFs. The emergence and development of nuclear deformation in open-shell nuclei are well described. The location of the neutron drip line is according to the nuclear-matter parameter characterizing the low-mass NS. Conclusions: The NS-observation-inspired EDF offers a reasonable reproduction of the structures of finite nuclei. A future global optimization including more nuclear data will give better accuracy and high predictive power of neutron-rich nuclei.
MEnsA: Mix-up Ensemble Average for Unsupervised Multi Target Domain Adaptation on 3D Point Clouds

Unsupervised domain adaptation (UDA) addresses the problem of distribution shift between the unlabeled target domain and labelled source domain. While the single target domain adaptation (STDA) is well studied in both 2D and 3D vision literature, multi-target domain adaptation (MTDA) is barely explored for 3D data despite its wide real-world applications such as autonomous driving systems for various geographical and climatic conditions. We establish an MTDA baseline for 3D point cloud data by proposing to mix the feature representations from all domains together to achieve better domain adaptation performance by an ensemble average, which we call Mixup Ensemble Average or MEnsA. With the mixed representation, we use a domain classifier to improve at distinguishing the feature representations of source domain from those of target domains in a shared latent space. In extensive empirical validations on the challenging PointDA-10 dataset, we showcase a clear benefit of our simple method over previous unsupervised STDA and MTDA methods by large margins (up to 17.10% and 4.76% on averaged over all domain shifts). We make the code publicly available here 1.
Wearable Sensor-based Multimodal Physiological Responses of Socially Anxious Individuals across Social Contexts

Correctly identifying an individual's social context from passively worn sensors holds promise for delivering just-in-time adaptive interventions (JITAIs) to treat social anxiety disorder. In this study, we present results using passively collected data from a within-subject experiment that assessed physiological response across different social contexts (i.e, alone vs. with others), social phases (i.e., pre- and post-interaction vs. during an interaction), social interaction sizes (i.e., dyadic vs. group interactions), and levels of social threat (i.e., implicit vs. explicit social evaluation). Participants in the study ($N=46$) reported moderate to severe social anxiety symptoms as assessed by the Social Interaction Anxiety Scale ($\geq$34 out of 80). Univariate paired difference tests, multivariate random forest models, and follow-up cluster analyses were used to explore physiological response patterns across different social and non-social contexts. Our results suggest that social context is more reliably distinguishable than social phase, group size, or level of social threat, but that there is considerable variability in physiological response patterns even among these distinguishable contexts. Implications for real-world context detection and deployment of JITAIs are discussed.
Fast flavor evolution in dense neutrino systems, as described in quantum field theory

Investigations of dense neutrino cloud evolution through quantum kinetic equations led to the possibility of ``fast flavor"(FF) processes. It is shown here that the usual quantum kinetic equations, while signaling the instabilities that make some instances of FF possible, are being erroneously interpreted. Approaching the subject directly from the quantum field theory that defines the standard model shows the computational structures in most of the recent FF literature to be completely invalid. Our revisions also underlie what promise to be new early universe applications and a general result for relic supernova neutrinos that could be tested as a feature of the diffuse neutrino spectrum.
Accelerated Parallel MRI Using Memory Efficient and Robust Monotone Operator Learning (MOL)

Model-based deep learning methods that combine imaging physics with learned regularization priors have been emerging as powerful tools for parallel MRI acceleration. The main focus of this paper is to determine the utility of the monotone operator learning (MOL) framework in the parallel MRI setting. The MOL algorithm alternates between a gradient descent step using a monotone convolutional neural network (CNN) and a conjugate gradient algorithm to encourage data consistency. The benefits of this approach include similar guarantees as compressive sensing algorithms including uniqueness, convergence, and stability, while being significantly more memory efficient than unrolled methods. We validate the proposed scheme by comparing it with different unrolled algorithms in the context of accelerated parallel MRI for static and dynamic settings.
HarsanyiNet: Computing Accurate Shapley Values in a Single Forward Propagation

The Shapley value is widely regarded as a trustworthy attribution metric. However, when people use Shapley values to explain the attribution of input variables of a deep neural network (DNN), it usually requires a very high computational cost to approximate relatively accurate Shapley values in real-world applications. Therefore, we propose a novel network architecture, the HarsanyiNet, which makes inferences on the input sample and simultaneously computes the exact Shapley values of the input variables in a single forward propagation. The HarsanyiNet is designed on the theoretical foundation that the Shapley value can be reformulated as the redistribution of Harsanyi interactions encoded by the network.
Isolated hypersurface singularities, spectral invariants, and quantum cohomology

We study the relation between isolated hypersurface singularities (e.g., ADE) and the quantum cohomology ring by using spectral invariants, which are symplectic measurements coming from Floer theory. We prove, under the assumption that the quantum cohomology ring is semi-simple, that (1) if the smooth Fano variety degenerates to a Fano variety with an isolated hypersurface singularity, then the singularity has to be an A m {A_{m}} -singularity, (2) if the symplectic manifold contains an A m {A_{m}} -configuration of Lagrangian spheres, then there are consequences for the Hofer geometry, and that (3) the Dehn twist reduces spectral invariants.
Learning Personalized Models with Clustered System Identification

We address the problem of learning linear system models by observing multiple trajectories from systems with differing dynamics. This framework encompasses a collaborative scenario where several systems seeking to estimate their dynamics are partitioned into clusters according to system similarity. Thus, the systems within the same cluster can benefit from the observations made by the others. Considering this framework, we present an algorithm where each system alternately estimates its cluster identity and performs an estimation of its dynamics. This is then aggregated to update the model of each cluster. We show that under mild assumptions, our algorithm correctly estimates the cluster identities and achieves an $\varepsilon$-approximate solution with a sample complexity that scales inversely with the number of systems in the cluster, thus facilitating a more efficient and personalized system identification.
Attrition-Aware Adaptation for Multi-Agent Patrolling

Multi-agent patrolling is a key problem in a variety of domains such as intrusion detection, area surveillance, and policing which involves repeated visits by a group of agents to specified points in an environment. While the problem is well-studied, most works do not provide performance guarantees and either do not consider agent attrition or impose significant communication requirements to enable adaptation. In this work, we present the Adaptive Heuristic-based Patrolling Algorithm, which is capable of adaptation to agent loss using minimal communication by taking advantage of Voronoi partitioning, and which meets guaranteed performance bounds. Additionally, we provide new centralized and distributed mathematical programming formulations of the patrolling problem, analyze the properties of Voronoi partitioning, and finally, show the value of our adaptive heuristic algorithm by comparison with various benchmark algorithms using a realistic simulation environment based on the Robot Operating System (ROS) 2.
Reducing Discretization Error in the Frank-Wolfe Method

The Frank-Wolfe algorithm is a popular method in structurally constrained machine learning applications, due to its fast per-iteration complexity. However, one major limitation of the method is a slow rate of convergence that is difficult to accelerate due to erratic, zig-zagging step directions, even asymptotically close to the solution. We view this as an artifact of discretization; that is to say, the Frank-Wolfe \emph{flow}, which is its trajectory at asymptotically small step sizes, does not zig-zag, and reducing discretization error will go hand-in-hand in producing a more stabilized method, with better convergence properties. We propose two improvements: a multistep Frank-Wolfe method that directly applies optimized higher-order discretization schemes; and an LMO-averaging scheme with reduced discretization error, and whose local convergence rate over general convex sets accelerates from a rate of $O(1/k)$ to up to $O(1/k^{3/2})$.
Large Language Models are Edge-Case Fuzzers: Testing Deep Learning Libraries via FuzzGPT

Deep Learning (DL) library bugs affect downstream DL applications, emphasizing the need for reliable systems. Generating valid input programs for fuzzing DL libraries is challenging due to the need for satisfying both language syntax/semantics and constraints for constructing valid computational graphs. Recently, the TitanFuzz work demonstrates that modern Large Language Models (LLMs) can be directly leveraged to implicitly learn all the constraints to generate valid DL programs for fuzzing. However, LLMs tend to generate ordinary programs following similar patterns seen in their massive training corpora, while fuzzing favors unusual inputs that cover edge cases or are unlikely to be manually produced. To fill this gap, this paper proposes FuzzGPT, the first technique to prime LLMs to synthesize unusual programs for fuzzing. FuzzGPT is built on the well-known hypothesis that historical bug-triggering programs may include rare/valuable code ingredients important for bug finding. Traditional techniques leveraging such historical information require intensive human efforts to design dedicated generators and ensure the validity of generated programs. FuzzGPT demonstrates that this process can be fully automated via the intrinsic capabilities of LLMs (including fine-tuning and in-context learning), while being generalizable and applicable to challenging domains. While FuzzGPT can be applied with different LLMs, this paper focuses on the powerful GPT-style models: Codex and CodeGen. Moreover, FuzzGPT also shows the potential of directly leveraging the instruct-following capability of the recent ChatGPT for effective fuzzing. Evaluation on two popular DL libraries (PyTorch and TensorFlow) shows that FuzzGPT can substantially outperform TitanFuzz, detecting 76 bugs, with 49 already confirmed as previously unknown bugs, including 11 high-priority bugs or security vulnerabilities.
The maximum principle for optimal control of diffusions with partial information

We derive necessary conditions for the optimal control of a system that satisfies an Ito equation with control entering the drift term. The control is a function of a noise corrupted observation of the state, and the cost is the expectation of an integral and a final term. The robust form of the Zakai equation from nonlinear filtering is used to compute the variation of the cost due to a strong or “needle” variation of a control. This gives rise to an explicit formula for the adjoint process, much as in the case with complete information.
Equivariant Parameter Sharing for Porous Crystalline Materials

Efficiently predicting properties of porous crystalline materials has great potential to accelerate the high throughput screening process for developing new materials, as simulations carried out using first principles model are often computationally expensive. To effectively make use of Deep Learning methods to model these materials, we need to utilize the symmetries present in the crystals, which are defined by their space group. Existing methods for crystal property prediction either have symmetry constraints that are too restrictive or only incorporate symmetries between unit cells. In addition, these models do not explicitly model the porous structure of the crystal. In this paper, we develop a model which incorporates the symmetries of the unit cell of a crystal in its architecture and explicitly models the porous structure. We evaluate our model by predicting the heat of adsorption of CO$_2$ for different configurations of the mordenite zeolite. Our results confirm that our method performs better than existing methods for crystal property prediction and that the inclusion of pores results in a more efficient model.
Approaches for Retrieving Sulfur Species Abundances from Dual X–Ka-band Radio Occultations of Venus with EnVision and VERITAS

The EnVision and VERITAS missions to Venus will fly with X- and Ka-band telecommunications channels, which can be used to conduct radio occultation studies of Venus’ atmosphere. While link attenuation measurements during prior S- and X-band occultation experiments have been used to determine vertical profiles of H2SO4 vapor abundance, the addition of the Ka-band channel introduces greater sensitivity to the abundances of H2SO4 aerosols and SO2 gas, permitting the retrieval of their vertical profiles from dual-band measurements. Such measurements would be valuable in the assessment of chemical and dynamical processes governing short- and long-term variability in Venus’ atmosphere. This paper considers the sensitivity of the X–Ka-band radio attenuation measurement to these atmospheric constituents, as well as uncertainties and regularization approaches for conducting retrievals of these atmospheric sulfur species from future occultation experiments. We introduce methods for seeding maximum likelihood estimation retrievals using shape models and simple atmospheric transport constraints. From simulated retrievals, we obtain mean errors of the order of 0.5 ppm, 20 ppm, and 10 mg m−3 for H2SO4 vapor, SO2, and H2SO4 aerosol abundances, respectively, for simultaneous retrieval.
RARE: Robust Masked Graph Autoencoder

Masked graph autoencoder (MGAE) has emerged as a promising self-supervised graph pre-training (SGP) paradigm due to its simplicity and effectiveness. However, existing efforts perform the mask-then-reconstruct operation in the raw data space as is done in computer vision (CV) and natural language processing (NLP) areas, while neglecting the important non-Euclidean property of graph data. As a result, the highly unstable local connection structures largely increase the uncertainty in inferring masked data and decrease the reliability of the exploited self-supervision signals, leading to inferior representations for downstream evaluations. To address this issue, we propose a novel SGP method termed Robust mAsked gRaph autoEncoder (RARE) to improve the certainty in inferring masked data and the reliability of the self-supervision mechanism by further masking and reconstructing node samples in the high-order latent feature space. Through both theoretical and empirical analyses, we have discovered that performing a joint mask-then-reconstruct strategy in both latent feature and raw data spaces could yield improved stability and performance. To this end, we elaborately design a masked latent feature completion scheme, which predicts latent features of masked nodes under the guidance of high-order sample correlations that are hard to be observed from the raw data perspective. Specifically, we first adopt a latent feature predictor to predict the masked latent features from the visible ones. Next, we encode the raw data of masked samples with a momentum graph encoder and subsequently employ the resulting representations to improve predicted results through latent feature matching. Extensive experiments on seventeen datasets have demonstrated the effectiveness and robustness of RARE against state-of-the-art (SOTA) competitors across three downstream tasks.
BugNIST - a Large Volumetric Dataset for Object Detection under Domain Shift

Domain shift significantly influences the performance of deep learning algorithms, particularly for object detection within volumetric 3D images. Annotated training data is essential for deep learning-based object detection. However, annotating densely packed objects is time-consuming and costly. Instead, we suggest training models on individually scanned objects, causing a domain shift between training and detection data. To address this challenge, we introduce the BugNIST dataset, comprising 9154 micro-CT volumes of 12 bug types and 388 volumes of tightly packed bug mixtures. This dataset is characterized by having objects with the same appearance in the source and target domain, which is uncommon for other benchmark datasets for domain shift. During training, individual bug volumes labeled by class are utilized, while testing employs mixtures with center point annotations and bug type labels. Together with the dataset, we provide a baseline detection analysis, aiming at advancing the field of 3D object detection methods.