Miracle-dz/UniFAR-FTUs huggingface dataset:
A tree-based varying coefficient model

The paper introduces a tree-based varying coefficient model (VCM) where the varying coefficients are modelled using the cyclic gradient boosting machine (CGBM) from Delong et al. (2023). Modelling the coefficient functions using a CGBM allows for dimension-wise early stopping and feature importance scores. The dimension-wise early stopping not only reduces the risk of dimension-specific overfitting, but also reveals differences in model complexity across dimensions. The use of feature importance scores allows for simple feature selection and easy model interpretation. The model is evaluated on the same simulated and real data examples as those used in Richman and W\"uthrich (2023), and the results show that it produces results in terms of out of sample loss that are comparable to those of their neural network-based VCM called LocalGLMnet.
Localizing Acoustic Energy in Sound Field Synthesis by Directionally Weighted Exterior Radiation Suppression

A method for synthesizing the desired sound field while suppressing the exterior radiation power with directional weighting is proposed. The exterior radiation from the loudspeakers in sound field synthesis systems can be problematic in practical situations. Although several methods to suppress the exterior radiation have been proposed, suppression in all outward directions is generally difficult, especially when the number of loudspeakers is not sufficiently large. We propose the directionally weighted exterior radiation representation to prioritize the suppression directions by incorporating it into the optimization problem of sound field synthesis. By using the proposed representation, the exterior radiation in the prioritized directions can be significantly reduced while maintaining high interior synthesis accuracy, owing to the relaxed constraint on the exterior radiation. Its performance is evaluated with the application of the proposed representation to amplitude matching in numerical experiments.
The Distributional Reward Critic Architecture for Perturbed-Reward Reinforcement Learning

We study reinforcement learning in the presence of an unknown reward perturbation. Existing methodologies for this problem make strong assumptions including reward smoothness, known perturbations, and/or perturbations that do not modify the optimal policy. We study the case of unknown arbitrary perturbations that discretize and shuffle reward space, but have the property that the true reward belongs to the most frequently observed class after perturbation. This class of perturbations generalizes existing classes (and, in the limit, all continuous bounded perturbations) and defeats existing methods. We introduce an adaptive distributional reward critic and show theoretically that it can recover the true rewards under technical conditions. Under the targeted perturbation in discrete and continuous control tasks, we win/tie the highest return in 40/57 settings (compared to 16/57 for the best baseline). Even under the untargeted perturbation, we still win an edge over the baseline designed especially for that setting.
Towards Safe Load Balancing based on Control Barrier Functions and Deep Reinforcement Learning

Deep Reinforcement Learning (DRL) algorithms have recently made significant strides in improving network performance. Nonetheless, their practical use is still limited in the absence of safe exploration and safe decision-making. In the context of commercial solutions, reliable and safe-to-operate systems are of paramount importance. Taking this problem into account, we propose a safe learning-based load balancing algorithm for Software Defined-Wide Area Network (SD-WAN), which is empowered by Deep Reinforcement Learning (DRL) combined with a Control Barrier Function (CBF). It safely projects unsafe actions into feasible ones during both training and testing, and it guides learning towards safe policies. We successfully implemented the solution on GPU to accelerate training by approximately 110x times and achieve model updates for on-policy methods within a few seconds, making the solution practical. We show that our approach delivers near-optimal Quality-of-Service (QoS performance in terms of end-to-end delay while respecting safety requirements related to link capacity constraints. We also demonstrated that on-policy learning based on Proximal Policy Optimization (PPO) performs better than off-policy learning with Deep Deterministic Policy Gradient (DDPG) when both are combined with a CBF for safe load balancing.
MatSAM: Efficient Extraction of Microstructures of Materials via Visual Large Model

Efficient and accurate extraction of microstructures in micrographs of materials is essential in process optimization and the exploration of structure-property relationships. Deep learning-based image segmentation techniques that rely on manual annotation are laborious and time-consuming and hardly meet the demand for model transferability and generalization on various source images. Segment Anything Model (SAM), a large visual model with powerful deep feature representation and zero-shot generalization capabilities, has provided new solutions for image segmentation. In this paper, we propose MatSAM, a general and efficient microstructure extraction solution based on SAM. A simple yet effective point-based prompt generation strategy is designed, grounded on the distribution and shape of microstructures. Specifically, in an unsupervised and training-free way, it adaptively generates prompt points for different microscopy images, fuses the centroid points of the coarsely extracted region of interest (ROI) and native grid points, and integrates corresponding post-processing operations for quantitative characterization of microstructures of materials. For common microstructures including grain boundary and multiple phases, MatSAM achieves superior zero-shot segmentation performance to conventional rule-based methods and is even preferable to supervised learning methods evaluated on 16 microscopy datasets whose micrographs are imaged by the optical microscope (OM) and scanning electron microscope (SEM). Especially, on 4 public datasets, MatSAM shows unexpected competitive segmentation performance against their specialist models. We believe that, without the need for human labeling, MatSAM can significantly reduce the cost of quantitative characterization and statistical analysis of extensive microstructures of materials, and thus accelerate the design of new materials.
Block-Diagonal Orthogonal Relation and Matrix Entity for Knowledge Graph Embedding

The primary aim of Knowledge Graph embeddings (KGE) is to learn low-dimensional representations of entities and relations for predicting missing facts. While rotation-based methods like RotatE and QuatE perform well in KGE, they face two challenges: limited model flexibility requiring proportional increases in relation size with entity dimension, and difficulties in generalizing the model for higher-dimensional rotations. To address these issues, we introduce OrthogonalE, a novel KGE model employing matrices for entities and block-diagonal orthogonal matrices with Riemannian optimization for relations. This approach enhances the generality and flexibility of KGE models. The experimental results indicate that our new KGE model, OrthogonalE, is both general and flexible, significantly outperforming state-of-the-art KGE models while substantially reducing the number of relation parameters.
Neoproterozoic granitic gneiss offshore the Shandong Peninsula of Eastern China: the eastward extension of the Sulu Orogenic Belt

ABSTRACT The Sulu Orogenic Belt in eastern China has experienced a multistage tectonic evolutionary history. However, its geological evolution has not yet been corroborated by sufficient direct evidence from basement rocks. Chaolian Island on the Qianliyan Uplift provides an opportunity to study the formation and evolution of the Sulu Orogenic Belt using direct geochronological and geochemical evidence. We determined that the characteristic mineral assemblage in the study region is quartz + K-feldspar + perthite + biotite + muscovite. The samples are silica- (SiO2 = 72.8%–75.8%) and alkali-rich (ALK(Na2O+K2O) = 8.7%–9.3%), with high iron-magnesium ratios (FeO*/(FeO*+MgO) = 0.92–0.96) and low CaO and MgO concentrations. Furthermore, they are rich in large-ion lithophile elements K, Rb, Ba, and U, but depleted in high field strength elements Nb, Ta, and Zr. They exhibit high Ga/Al values (Ga × 104/Al = 3.33–3.74) and significant fractionation between light and heavy rare earth elements. The samples are A-type granites. In the discrimination diagrams for granite genesis types, the samples plotted in the post-orogenic A2-type granite region. Secondary ion mass spectrometer (SIMS) zircon U–Pb dating results indicated that the granitic gneiss formed ~782.6–802.3 Ma (Middle Neoproterozoic), consistent with the timing of the breakup of the Rodinia supercontinent on the northeastern margin of the Yangtze Plate. Comparing geochemical characteristics and zircon U–Pb ages of the A-type granitic gneisses of the Sulu Orogenic Belt, the Qianliyan Uplift appears to be an extension of the belt across the ocean and is affiliated with the Yangtze Plate. The granitic gneiss on Chaolian Island is related to the formation of a mantle superplume during the breakup of Rodinia, and the northeastern margin of the Yangtze Plate during the Middle Neoproterozoic was located in a back-arc extension setting induced by the subduction of oceanic plates.
A Universal Scaling Law for Intrinsic Fracture Energy of Networks

Networks of interconnected materials permeate throughout nature, biology, and technology due to exceptional mechanical performance. Despite the importance of failure resistance in network design and utility, no existing physical model effectively links strand mechanics and connectivity to predict bulk fracture. Here, we reveal a universal scaling law that bridges these levels to predict the intrinsic fracture energy of diverse networks. Simulations and experiments demonstrate its remarkable applicability to a breadth of strand constitutive behaviors, topologies, dimensionalities, and length scales. We show that local strand rupture and nonlocal energy release contribute synergistically to the measured intrinsic fracture energy in networks. These effects coordinate such that the intrinsic fracture energy scales independent of the energy to rupture a strand; it instead depends on the strand rupture force, breaking length, and connectivity. Our scaling law establishes a physical basis for understanding network fracture and a framework for fabricating tough materials from networks across multiple length scales.
Cross-extrapolation reconstruction of low-rank functions and application to quantum many-body observables in the strong coupling regime

We present a general-purpose algorithm to extrapolate a low rank function of two variables from a small domain to a larger one. It is based on the cross-interpolation formula. We apply it to reconstruct physical quantities in some quantum many-body perturbative expansions in the real time Keldysh formalism, considered as a function of time $t$ and interaction $U$. These functions are of remarkably low rank. This property, combined with the convergence of the perturbative expansion in $U$ both at finite $t$ (for any $U$), and small $U$ (for any $t$), is sufficient for our algorithm to reconstruct the physical quantity at long time, strong coupling regime. Our method constitutes an alternative to standard resummation techniques in perturbative methods, such as diagrammatic Quantum Monte Carlo. We benchmark it on the single impurity Anderson model and show that it is successful even in some regime where standard conformal mapping resummation techniques fail.
Securing an Application Layer Gateway: An Industrial Case Study

Application Layer Gateways (ALGs) play a crucial role in securing critical systems, including railways, industrial automation, and defense applications, by segmenting networks at different levels of criticality. However, they require rigorous security testing to prevent software vulnerabilities, not only at the network level but also at the application layer (e.g., deep traffic inspection components). This paper presents a vulnerability-driven methodology for the comprehensive security testing of ALGs. We present the methodology in the context of an industrial case study in the railways domain, and a simulation-based testing environment to support the methodology.
The velocity field and Birkhoff-Rott integral for non-decaying, non-periodic vortex sheets

The Birkhoff-Rott integral expresses the fluid velocity on a vortex sheet. This integral converges if certain quantities decay at horizontal infinity, but can also be summed over periodic images in the horizontally periodic case. However, non-decaying, non-periodic cases are also of interest, such as the interaction of periodic wavetrains with non-commensurate periods (i.e. spatially quasiperiodic solutions), or non-periodic disturbances to periodic wavetrains. We therefore develop a more general single formula for the Birkhoff-Rott integral, which unifies and extends the cases of decay and periodicity. We verify that under some reasonable conditions this new version of the Birkhoff-Rott integral is the restriction to the vortex sheet of an incompressible, irrotational velocity field, with continuous normal component but with a jump in tangential velocity across the vortex sheet. We give a number of examples of non-decaying, non-periodic sheet positions and sheet strengths for which our assumptions may be verified. While we develop this in the case of two-dimensional fluids, the methodology applies equally well to three-dimensional fluids.
Current Effect-eliminated Optimal Target Assignment and Motion Planning for a Multi-UUV System

The paper presents an innovative approach (CBNNTAP) that addresses the complexities and challenges introduced by ocean currents when optimizing target assignment and motion planning for a multi-unmanned underwater vehicle (UUV) system. The core of the proposed algorithm involves the integration of several key components. Firstly, it incorporates a bio-inspired neural network-based (BINN) approach which predicts the most efficient paths for individual UUVs while simultaneously ensuring collision avoidance among the vehicles. Secondly, an efficient target assignment component is integrated by considering the path distances determined by the BINN algorithm. In addition, a critical innovation within the CBNNTAP algorithm is its capacity to address the disruptive effects of ocean currents, where an adjustment component is seamlessly integrated to counteract the deviations caused by these currents, which enhances the accuracy of both motion planning and target assignment for the UUVs. The effectiveness of the CBNNTAP algorithm is demonstrated through comprehensive simulation results and the outcomes underscore the superiority of the developed algorithm in nullifying the effects of static and dynamic ocean currents in 2D and 3D scenarios.
A Lightweight Energy Management Method for Hybrid PV/Battery/Load Systems

In this paper, a computationally lightweight algorithm is introduced for hybrid PV/Battery/Load systems that is price responsive, responds fast, does not require powerful hardware, and considers the operational limitations of the system. The method is applied to two buildings equipped with PV and battery. Simulation results show that the method can give results that are up to 3.9% more expensive than the Model predictive control (MPC) approach while the runtime of the program is up to 1000 times less than the MPC. Also, while the runtime of the proposed method is in the range of the self-consumption maximization (SCM) approach as the fastest method, its electricity cost is about 3.2% cheaper than the SCM method. Simulation results also show that in case of providing grid services by the battery the difference between electricity cost of the proposed approach and MPC can reduce which makes the method good for such applications.
Probing Structured Semantics Understanding and Generation of Language Models via Question Answering

Recent advancement in the capabilities of large language models (LLMs) has triggered a new surge in LLMs' evaluation. Most recent evaluation works tends to evaluate the comprehensive ability of LLMs over series of tasks. However, the deep structure understanding of natural language is rarely explored. In this work, we examine the ability of LLMs to deal with structured semantics on the tasks of question answering with the help of the human-constructed formal language. Specifically, we implement the inter-conversion of natural and formal language through in-context learning of LLMs to verify their ability to understand and generate the structured logical forms. Extensive experiments with models of different sizes and in different formal languages show that today's state-of-the-art LLMs' understanding of the logical forms can approach human level overall, but there still are plenty of room in generating correct logical forms, which suggest that it is more effective to use LLMs to generate more natural language training data to reinforce a small model than directly answering questions with LLMs. Moreover, our results also indicate that models exhibit considerable sensitivity to different formal languages. In general, the formal language with the lower the formalization level, i.e. the more similar it is to natural language, is more LLMs-friendly.
Cross-modal Retrieval for Knowledge-based Visual Question Answering

Knowledge-based Visual Question Answering about Named Entities is a challenging task that requires retrieving information from a multimodal Knowledge Base. Named entities have diverse visual representations and are therefore difficult to recognize. We argue that cross-modal retrieval may help bridge the semantic gap between an entity and its depictions, and is foremost complementary with mono-modal retrieval. We provide empirical evidence through experiments with a multimodal dual encoder, namely CLIP, on the recent ViQuAE, InfoSeek, and Encyclopedic-VQA datasets. Additionally, we study three different strategies to fine-tune such a model: mono-modal, cross-modal, or joint training. Our method, which combines mono-and cross-modal retrieval, is competitive with billion-parameter models on the three datasets, while being conceptually simpler and computationally cheaper.
DREQ: Document Re-Ranking Using Entity-based Query Understanding

While entity-oriented neural IR models have advanced significantly, they often overlook a key nuance: the varying degrees of influence individual entities within a document have on its overall relevance. Addressing this gap, we present DREQ, an entity-oriented dense document re-ranking model. Uniquely, we emphasize the query-relevant entities within a document's representation while simultaneously attenuating the less relevant ones, thus obtaining a query-specific entity-centric document representation. We then combine this entity-centric document representation with the text-centric representation of the document to obtain a"hybrid"representation of the document. We learn a relevance score for the document using this hybrid representation. Using four large-scale benchmarks, we show that DREQ outperforms state-of-the-art neural and non-neural re-ranking methods, highlighting the effectiveness of our entity-oriented representation approach.
An Unobtrusive and Lightweight Ear-worn System for Continuous Epileptic Seizure Detection

Epilepsy is one of the most common neurological diseases globally, affecting around 50 million people worldwide. Fortunately, up to 70 percent of people with epilepsy could live seizure-free if properly diagnosed and treated, and a reliable technique to monitor the onset of seizures could improve the quality of life of patients who are constantly facing the fear of random seizure attacks. The scalp-based EEG test, despite being the gold standard for diagnosing epilepsy, is costly, necessitates hospitalization, demands skilled professionals for operation, and is discomforting for users. In this paper, we propose EarSD, a novel lightweight, unobtrusive, and socially acceptable ear-worn system to detect epileptic seizure onsets by measuring the physiological signals from behind the user's ears. EarSD includes an integrated custom-built sensing, computing, and communication PCB to collect and amplify the signals of interest, remove the noises caused by motion artifacts and environmental impacts, and stream the data wirelessly to the computer or mobile phone nearby, where data are uploaded to the host computer for further processing. We conducted both in-lab and in-hospital experiments with epileptic seizure patients who were hospitalized for seizure studies. The preliminary results confirm that EarSD can detect seizures with up to 95.3 percent accuracy by just using classical machine learning algorithms.
Optimal Linear Signal: An Unsupervised Machine Learning Framework to Optimize PnL with Linear Signals

This study presents an unsupervised machine learning approach for optimizing Profit and Loss (PnL) in quantitative finance. Our algorithm, akin to an unsupervised variant of linear regression, maximizes the Sharpe Ratio of PnL generated from signals constructed linearly from exogenous variables. The methodology employs a linear relationship between exogenous variables and the trading signal, with the objective of maximizing the Sharpe Ratio through parameter optimization. Empirical application on an ETF representing U.S. Treasury bonds demonstrates the model's effectiveness, supported by regularization techniques to mitigate overfitting. The study concludes with potential avenues for further development, including generalized time steps and enhanced corrective terms.
Topology-Driven Parallel Trajectory Optimization in Dynamic Environments

Ground robots navigating in complex, dynamic environments must compute collision-free trajectories to avoid obstacles safely and efficiently. Nonconvex optimization is a popular method to compute a trajectory in real-time. However, these methods often converge to locally optimal solutions and frequently switch between different local minima, leading to inefficient and unsafe robot motion. In this work, We propose a novel topology-driven trajectory optimization strategy for dynamic environments that plans multiple distinct evasive trajectories to enhance the robot's behavior and efficiency. A global planner iteratively generates trajectories in distinct homotopy classes. These trajectories are then optimized by local planners working in parallel. While each planner shares the same navigation objectives, they are locally constrained to a specific homotopy class, meaning each local planner attempts a different evasive maneuver. The robot then executes the feasible trajectory with the lowest cost in a receding horizon manner. We demonstrate, on a mobile robot navigating among pedestrians, that our approach leads to faster and safer trajectories than existing planners.