Miracle-dz/UniFAR-FTUs huggingface dataset:
Learned Harmonic Mean Estimation of the Marginal Likelihood with Normalizing Flows

Computing the marginal likelihood (also called the Bayesian model evidence) is an important task in Bayesian model selection, providing a principled quantitative way to compare models. The learned harmonic mean estimator solves the exploding variance problem of the original harmonic mean estimation of the marginal likelihood. The learned harmonic mean estimator learns an importance sampling target distribution that approximates the optimal distribution. While the approximation need not be highly accurate, it is critical that the probability mass of the learned distribution is contained within the posterior in order to avoid the exploding variance problem. In previous work a bespoke optimization problem is introduced when training models in order to ensure this property is satisfied. In the current article we introduce the use of normalizing flows to represent the importance sampling target distribution. A flow-based model is trained on samples from the posterior by maximum likelihood estimation. Then, the probability density of the flow is concentrated by lowering the variance of the base distribution, i.e. by lowering its"temperature", ensuring its probability mass is contained within the posterior. This approach avoids the need for a bespoke optimisation problem and careful fine tuning of parameters, resulting in a more robust method. Moreover, the use of normalizing flows has the potential to scale to high dimensional settings. We present preliminary experiments demonstrating the effectiveness of the use of flows for the learned harmonic mean estimator. The harmonic code implementing the learned harmonic mean, which is publicly available, has been updated to now support normalizing flows.
Artifacts Mapping: Multi-Modal Semantic Mapping for Object Detection and 3D Localization

Geometric navigation is nowadays a well-established field of robotics and the research focus is shifting towards higher-level scene understanding, such as Semantic Mapping. When a robot needs to interact with its environment, it must be able to comprehend the contextual information of its surroundings. This work focuses on classifying and localising objects within a map, which is under construction (SLAM) or already built. To further explore this direction, we propose a framework that can autonomously detect and localize predefined objects in a known environment using a multi-modal sensor fusion approach (combining RGB and depth data from an RGB-D camera and a lidar). The framework consists of three key elements: understanding the environment through RGB data, estimating depth through multi-modal sensor fusion, and managing artifacts (i.e., filtering and stabilizing measurements). The experiments show that the proposed framework can accurately detect 98% of the objects in the real sample environment, without post-processing, while 85% and 80% of the objects were mapped using the single RGBD camera or RGB + lidar setup respectively. The comparison with single-sensor (camera or lidar) experiments is performed to show that sensor fusion allows the robot to accurately detect near and far obstacles, which would have been noisy or imprecise in a purely visual or laser-based approach.
A Proximal Algorithm for Network Slimming

As a popular channel pruning method for convolutional neural networks (CNNs), network slimming (NS) has a three-stage process: (1) it trains a CNN with $\ell_1$ regularization applied to the scaling factors of the batch normalization layers; (2) it removes channels whose scaling factors are below a chosen threshold; and (3) it retrains the pruned model to recover the original accuracy. This time-consuming, three-step process is a result of using subgradient descent to train CNNs. Because subgradient descent does not exactly train CNNs towards sparse, accurate structures, the latter two steps are necessary. Moreover, subgradient descent does not have any convergence guarantee. Therefore, we develop an alternative algorithm called proximal NS. Our proposed algorithm trains CNNs towards sparse, accurate structures, so identifying a scaling factor threshold is unnecessary and fine tuning the pruned CNNs is optional. Using Kurdyka-{\L}ojasiewicz assumptions, we establish global convergence of proximal NS. Lastly, we validate the efficacy of the proposed algorithm on VGGNet, DenseNet and ResNet on CIFAR 10/100. Our experiments demonstrate that after one round of training, proximal NS yields a CNN with competitive accuracy and compression.
Solving break minimization problems in mirrored double round-robin tournament with QUBO solver

The break minimization problem is a fundamental problem in sports scheduling. Recently, its quadratic unconstrained binary optimization (QUBO) formulation has been proposed, which has gained much interest with the rapidly growing field of quantum computing. In this paper, we demonstrate that the state-of-the-art QUBO solver outperforms the general mixed integer quadratic programming (MIQP) solver on break minimization problems in a mirrored double round-robin tournament. Moreover, we demonstrate that it still outperforms or is competitive even if we add practical constraints, such as consecutive constraints, to the break minimization problem.
Modeling the High-energy Ionizing Output from Simple Stellar and X-Ray Binary Populations

We present a methodology for modeling the joint ionizing impact due to a “simple X-ray population” (SXP) and its corresponding simple stellar population (SSP), where “simple” refers to a single age and metallicity population. We construct composite spectral energy distributions (SEDs) including contributions from ultraluminous X-ray sources and stars, with physically meaningful and consistent consideration of the relative contributions of each component as a function of instantaneous burst age and stellar metallicity. These composite SEDs are used as input for photoionization modeling with Cloudy, from which we produce a grid for the time- and metallicity-dependent nebular emission from these composite populations. We make the results from the photoionization simulations publicly available. We find that the addition of the SXP prolongs the high-energy ionizing output from the population—and correspondingly increases the intensity of nebular lines such as He ii λ1640,4686, [Ne v] λ3426,14.3 μm, and [O iv] 25.9 μm by factors of at least two relative to models without an SXP spectral component. This effect is most pronounced for instantaneous bursts of star formation on timescales >10 Myr and at low metallicities (∼0.1 Z ⊙), due to the imposed time- and metallicity-dependent behavior of the SXP relative to the SSP. We propose nebular emission line diagnostics accessible with JWST suitable for inferring the presence of a composite SXP + SSP, and we discuss how the ionization signatures compare to models for sources such as intermediate-mass black holes.
5G Wings: Investigating 5G-Connected Drones Performance in Non-Urban Areas

Unmanned aerial vehicles (UAVs) have become extremely popular for both military and civilian applications due to their ease of deployment, cost-effectiveness, high maneuverability, and availability. Both applications, however, need reliable communication for command and control (C2) and/or data transmission. Utilizing commercial cellular networks for drone communication can enable beyond visual line of sight (BVLOS) operation, high data rate transmission, and secure communication. However, deployment of cellular-connected drones over commercial LTE/5G networks still presents various challenges such as sparse coverage outside urban areas, and interference caused to the network as the UAV is visible to many towers. Commercial 5G networks can offer various features for aerial user equipment (UE) far beyond what LTE could provide by taking advantage of mmWave, flexible numerology, slicing, and the capability of applying AI-based solutions. Limited experimental data is available to investigate the operation of aerial UEs over current, without any modification, commercial 5G networks, particularly in suburban and NON-URBAN areas. In this paper, we perform a comprehensive study of drone communications over the existing low-band and mid-band 5G networks in a suburban area for different velocities and elevations, comparing the performance against that of LTE. It is important to acknowledge that the network examined in this research is primarily designed and optimized to meet the requirements of terrestrial users, and may not adequately address the needs of aerial users. This paper not only reports the Key Performance Indicators (KPIs) compared among all combinations of the test cases but also provides recommendations for aerial users to enhance their communication quality by controlling their trajectory.
Revisiting Sample Size Determination in Natural Language Understanding

Knowing exactly how many data points need to be labeled to achieve a certain model performance is a hugely beneficial step towards reducing the overall budgets for annotation. It pertains to both active learning and traditional data annotation, and is particularly beneficial for low resource scenarios. Nevertheless, it remains a largely under-explored area of research in NLP. We therefore explored various techniques for estimating the training sample size necessary to achieve a targeted performance value. We derived a simple yet effective approach to predict the maximum achievable model performance based on small amount of training samples - which serves as an early indicator during data annotation for data quality and sample size determination. We performed ablation studies on four language understanding tasks, and showed that the proposed approach allows us to forecast model performance within a small margin of mean absolute error (~ 0.9%) with only 10% data.
Kernelizing Problems on Planar Graphs in Sublinear Space and Polynomial Time

In this paper, we devise a scheme for kernelizing, in sublinear space and polynomial time, various problems on planar graphs. The scheme exploits planarity to ensure that the resulting algorithms run in polynomial time and use O((sqrt(n) + k) log n) bits of space, where n is the number of vertices in the input instance and k is the intended solution size. As examples, we apply the scheme to Dominating Set and Vertex Cover. For Dominating Set, we also show that a well-known kernelization algorithm due to Alber et al. (JACM 2004) can be carried out in polynomial time and space O(k log n). Along the way, we devise restricted-memory procedures for computing region decompositions and approximating the aforementioned problems, which might be of independent interest.
CardiGraphormer: Unveiling the Power of Self-Supervised Learning in Revolutionizing Drug Discovery

In the expansive realm of drug discovery, with approximately 15,000 known drugs and only around 4,200 approved, the combinatorial nature of the chemical space presents a formidable challenge. While Artificial Intelligence (AI) has emerged as a powerful ally, traditional AI frameworks face significant hurdles. This manuscript introduces CardiGraphormer, a groundbreaking approach that synergizes self-supervised learning (SSL), Graph Neural Networks (GNNs), and Cardinality Preserving Attention to revolutionize drug discovery. CardiGraphormer, a novel combination of Graphormer and Cardinality Preserving Attention, leverages SSL to learn potent molecular representations and employs GNNs to extract molecular fingerprints, enhancing predictive performance and interpretability while reducing computation time. It excels in handling complex data like molecular structures and performs tasks associated with nodes, pairs of nodes, subgraphs, or entire graph structures. CardiGraphormer's potential applications in drug discovery and drug interactions are vast, from identifying new drug targets to predicting drug-to-drug interactions and enabling novel drug discovery. This innovative approach provides an AI-enhanced methodology in drug development, utilizing SSL combined with GNNs to overcome existing limitations and pave the way for a richer exploration of the vast combinatorial chemical space in drug discovery.
musif: a Python package for symbolic music feature extraction

In this work, we introduce musif, a Python package that facilitates the automatic extraction of features from symbolic music scores. The package includes the implementation of a large number of features, which have been developed by a team of experts in musicology, music theory, statistics, and computer science. Additionally, the package allows for the easy creation of custom features using commonly available Python libraries. musif is primarily geared towards processing high-quality musicological data encoded in MusicXML format, but also supports other formats commonly used in music information retrieval tasks, including MIDI, MEI, Kern, and others. We provide comprehensive documentation and tutorials to aid in the extension of the framework and to facilitate the introduction of new and inexperienced users to its usage.
ROAR: Robust Adaptive Reconstruction of Shapes Using Planar Projections

The majority of existing large 3D shape datasets contain meshes that lend themselves extremely well to visual applications such as rendering, yet tend to be topologically invalid (i.e, contain non-manifold edges and vertices, disconnected components, self-intersections). Therefore, it is of no surprise that state of the art studies in shape understanding do not explicitly use this 3D information. In conjunction with this, triangular meshes remain the dominant shape representation for many downstream tasks, and their connectivity remain a relatively untapped source of potential for more profound shape reasoning. In this paper, we introduce ROAR, an iterative geometry/topology evolution approach to reconstruct 2-manifold triangular meshes from arbitrary 3D shape representations, that is highly suitable for large existing in-the-wild datasets. ROAR leverages the visual prior large datasets exhibit by evolving the geometry of the mesh via a 2D render loss, and a novel 3D projection loss, the Planar Projection. After each geometry iteration, our system performs topological corrections. Self-intersections are reduced following a geometrically motivated attenuation term, and resolution is added to required regions using a novel face scoring function. These steps alternate until convergence is achieved, yielding a high-quality manifold mesh. We evaluate ROAR on the notoriously messy yet popular dataset ShapeNet, and present ShapeROAR - a topologically valid yet still geometrically accurate version of ShapeNet. We compare our results to state-of-the-art reconstruction methods and demonstrate superior shape faithfulness, topological correctness, and triangulation quality. In addition, we demonstrate reconstructing a mesh from neural Signed Distance Functions (SDF), and achieve comparable Chamfer distance with much fewer SDF sampling operations than the commonly used Marching Cubes approach.
Comparison of empirical likelihood and its dual likelihood under density ratio model

ABSTRACT Density ratio models (DRMs) are commonly used semiparametric models to link related populations. Empirical likelihood (EL) under DRM has been demonstrated to be a flexible and useful platform for semiparametric inferences. Since DRM-based EL has the same maximum point and maximum likelihood as its dual form (dual EL), EL-based inferences under DRM are usually made through the latter. A natural question comes up: is there any efficiency loss of doing so? We make a careful comparison of the dual EL and DRM-based EL estimation methods from theory and numerical simulations. We find that their point estimators for any parameter are exactly the same, while they may have different performances in interval estimation. In terms of coverage accuracy, the two intervals are comparable for non- or moderate skewed populations, and the DRM-based EL interval can be much superior for severely skewed populations. A real data example is analysed for illustration purpose.
Communication-Efficient Multi-Robot Exploration Using Coverage-Biased Distributed Q-Learning

Frontier exploration and reinforcement learning have historically been used to solve the problem of enabling many mobile robots to autonomously and cooperatively explore complex surroundings. These methods need to keep an internal global map for navigation, but they do not consider the high costs of communication and information sharing between robots. This study offers CQLite, a novel distributed Q-learning technique that minimizes data communication between robots while achieving rapid convergence and thorough coverage in multi-robot exploration. The proposed CQLite method uses ad hoc map merging, and selectively shares updated Q-values at recently identified frontiers to reduce communication costs significantly. The theoretical analysis of CQLite's convergence and efficiency and extensive numerical verification on simulated indoor maps utilizing several robots demonstrate the method's novelty. With over 2× reductions in computation and communication alongside improved mapping performance, CQLite outperformed cutting-edge multi-robot exploration techniques like Rapidly-exploring Random Trees and Deep Reinforcement Learning.
SketchMetaFace: A Learning-based Sketching Interface for High-fidelity 3D Character Face Modeling

Modeling 3D avatars benefits various application scenarios such as AR/VR, gaming, and filming. Character faces contribute significant diversity and vividity as a vital component of avatars. However, building 3D character face models usually requires a heavy workload with commercial tools, even for experienced artists. Various existing sketch-based tools fail to support amateurs in modeling diverse facial shapes and rich geometric details. In this paper, we present SketchMetaFace - a sketching system targeting amateur users to model high-fidelity 3D faces in minutes. We carefully design both the user interface and the underlying algorithm. First, curvature-aware strokes are adopted to better support the controllability of carving facial details. Second, considering the key problem of mapping a 2D sketch map to a 3D model, we develop a novel learning-based method termed "Implicit and Depth Guided Mesh Modeling" (IDGMM). It fuses the advantages of mesh, implicit, and depth representations to achieve high-quality results with high efficiency. In addition, to further support usability, we present a coarse-to-fine 2D sketching interface design and a data-driven stroke suggestion tool. User studies demonstrate the superiority of our system over existing modeling tools in terms of the ease to use and visual quality of results. Experimental analyses also show that IDGMM reaches a better trade-off between accuracy and efficiency.
Replication of financial derivatives under extreme market models given marginals

The Black-Scholes-Merton model is a mathematical model for the dynamics of a financial market that includes derivative investment instruments, and its formula provides a theoretical price estimate of European-style options. The model's fundamental idea is to eliminate risk by hedging the option by purchasing and selling the underlying asset in a specific way, that is, to replicate the payoff of the option with a portfolio (which continuously trades the underlying) whose value at each time can be verified. One of the most crucial, yet restrictive, assumptions for this task is that the market follows a geometric Brownian motion, which has been relaxed and generalized in various ways. The concept of robust finance revolves around developing models that account for uncertainties and variations in financial markets. Martingale Optimal Transport, which is an adaptation of the Optimal Transport theory to the robust financial framework, is one of the most prominent directions. In this paper, we consider market models with arbitrarily many underlying assets whose values are observed over arbitrarily many time periods, and demonstrates the existence of a portfolio sub- or super-hedging a general path-dependent derivative security in terms of trading European options and underlyings, as well as the portfolio replicating the derivative payoff when the market model yields the extremal price of the derivative given marginal distributions of the underlyings. In mathematical terms, this paper resolves the question of dual attainment for the multi-period vectorial martingale optimal transport problem.
Self-interacting dipolar boson stars and their dynamics

We construct and dynamically evolve dipolar, self-interacting scalar boson stars in a model with sextic (+ quartic) self-interactions. The domain of existence of such dipolar $Q$-stars has a similar structure to that of the fundamental monopolar stars of the same model. For the latter it is structured in a Newtonian plus a relativistic branch, wherein perturbatively stable solutions exist, connected by a middle unstable branch. Our evolutions support similar dynamical properties of the dipolar $Q$-stars that: 1) in the Newtonian and relativistic branches are dynamically robust over time scales longer than those for which dipolar stars without self-interactions are seen to decay; 2) in the middle branch migrate to either the Newtonian or the relativistic branch; 3) beyond the relativistic branch decay to black holes. Overall, these results strengthen the observation, seen in other contexts, that self-interactions can mitigate dynamical instabilities of scalar boson star models.
Properties and conjectures regarding discrete renewal sequences

In this work we review and derive some elementary properties of the discrete renewal sequences based on a positive, finite and integer-valued random variable. Our results consider these sequences as dependent on the probability masses of the underlying random variable. In particular we study the minima and the maxima of these sequences and prove that they are attained for indices of the sequences smaller or equal than the support of the underlying random variable. Noting that the minimum itself is a minimum of multi-variate polynomials we conjecture that one universal polynomial envelopes the minimum from below and that it is maximal in some sense and largest in another. We prove this conjecture in a special case.
FlakyFix: Using Large Language Models for Predicting Flaky Test Fix Categories and Test Code Repair

Flaky tests are problematic because they non-deterministically pass or fail for the same software version under test, causing confusion and wasting development effort. While machine learning models have been used to predict flakiness and its root causes, there is much less work on providing support to fix the problem. To address this gap, in this paper, we focus on predicting the type of fix that is required to remove flakiness and then repair the test code on that basis. We do this for a subset of flaky test cases where the root cause of flakiness is in the test case itself and not in the production code. Our key idea is to guide the repair process with additional knowledge about the test's flakiness in the form of its predicted fix category. Thus, we first propose a framework that automatically generates labeled datasets for 13 fix categories and trains models to predict the fix category of a flaky test by analyzing the test code only. Our experimental results using code models and few-shot learning show that we can correctly predict most of the fix categories. To show the usefulness of such fix category labels for automatically repairing flakiness, in addition to informing testers, we augment a Large Language Model (LLM) like GPT with such extra knowledge to ask the LLM for repair suggestions. The results show that our suggested fix category labels significantly enhance the capability of GPT 3.5 Turbo, in generating fixes for flaky tests.