Miracle-dz/UniFAR-FTUs huggingface dataset:
A Survey on Query-based API Recommendation

Application Programming Interfaces (APIs) are designed to help developers build software more effectively. Recommending the right APIs for specific tasks has gained increasing attention among researchers and developers in recent years. To comprehensively understand this research domain, we have surveyed to analyze API recommendation studies published in the last 10 years. Our study begins with an overview of the structure of API recommendation tools. Subsequently, we systematically analyze prior research and pose four key research questions. For RQ1, we examine the volume of published papers and the venues in which these papers appear within the API recommendation field. In RQ2, we categorize and summarize the prevalent data sources and collection methods employed in API recommendation research. In RQ3, we explore the types of data and common data representations utilized by API recommendation approaches. We also investigate the typical data extraction procedures and collection approaches employed by the existing approaches. RQ4 delves into the modeling techniques employed by API recommendation approaches, encompassing both statistical and deep learning models. Additionally, we compile an overview of the prevalent ranking strategies and evaluation metrics used for assessing API recommendation tools. Drawing from our survey findings, we identify current challenges in API recommendation research that warrant further exploration, along with potential avenues for future research.
RedCore: Relative Advantage Aware Cross-modal Representation Learning for Missing Modalities with Imbalanced Missing Rates

Multimodal learning is susceptible to modality missing, which poses a major obstacle for its practical applications and, thus, invigorates increasing research interest. In this paper, we investigate two challenging problems: 1) when modality missing exists in the training data, how to exploit the incomplete samples while guaranteeing that they are properly supervised? 2) when the missing rates of different modalities vary, causing or exacerbating the imbalance among modalities, how to address the imbalance and ensure all modalities are well-trained. To tackle these two challenges, we first introduce the variational information bottleneck (VIB) method for the cross-modal representation learning of missing modalities, which capitalizes on the available modalities and the labels as supervision. Then, accounting for the imbalanced missing rates, we define relative advantage to quantify the advantage of each modality over others. Accordingly, a bi-level optimization problem is formulated to adaptively regulate the supervision of all modalities during training. As a whole, the proposed approach features Relative advantage aware Cross-modal representation learning (abbreviated as RedCore) for missing modalities with imbalanced missing rates. Extensive empirical results demonstrate that RedCore outperforms competing models in that it exhibits superior robustness against either large or imbalanced missing rates. The code is available at: https://github.com/sunjunaimer/RedCore.
HyperPIE: Hyperparameter Information Extraction from Scientific Publications

Automatic extraction of information from publications is key to making scientific knowledge machine readable at a large scale. The extracted information can, for example, facilitate academic search, decision making, and knowledge graph construction. An important type of information not covered by existing approaches is hyperparameters. In this paper, we formalize and tackle hyperparameter information extraction (HyperPIE) as an entity recognition and relation extraction task. We create a labeled data set covering publications from a variety of computer science disciplines. Using this data set, we train and evaluate BERT-based fine-tuned models as well as five large language models: GPT-3.5, GALACTICA, Falcon, Vicuna, and WizardLM. For fine-tuned models, we develop a relation extraction approach that achieves an improvement of 29% F1 over a state-of-the-art baseline. For large language models, we develop an approach leveraging YAML output for structured data extraction, which achieves an average improvement of 5.5% F1 in entity recognition over using JSON. With our best performing model we extract hyperparameter information from a large number of unannotated papers, and analyze patterns across disciplines. All our data and source code is publicly available at https://github.com/IllDepence/hyperpie
Deep Similarity Learning Loss Functions in Data Transformation for Class Imbalance

Improving the classification of multi-class imbalanced data is more difficult than its two-class counterpart. In this paper, we use deep neural networks to train new representations of tabular multi-class data. Unlike the typically developed re-sampling pre-processing methods, our proposal modifies the distribution of features, i.e. the positions of examples in the learned embedded representation, and it does not modify the class sizes. To learn such embedded representations we introduced various definitions of triplet loss functions: the simplest one uses weights related to the degree of class imbalance, while the next proposals are intended for more complex distributions of examples and aim to generate a safe neighborhood of minority examples. Similarly to the resampling approaches, after applying such preprocessing, different classifiers can be trained on new representations. Experiments with popular multi-class imbalanced benchmark data sets and three classifiers showed the advantage of the proposed approach over popular pre-processing methods as well as basic versions of neural networks with classical loss function formulations.
Joint estimation of a two-phase spin rotation beyond classical limit

Quantum metrology employs entanglement to enhance measurement precision. The focus and progress so far have primarily centered on estimating a single parameter. In diverse application scenarios, the estimation of more than one single parameter is often required. Joint estimation of multiple parameters can benefit from additional advantages for further enhanced precision. Here we report quantum-enhanced measurement of simultaneous spin rotations around two orthogonal axes, making use of spin-nematic squeezing in an atomic Bose-Einstein condensate. Aided by the $F=2$ atomic ground hyperfine manifold coupled to the nematic-squeezed $F=1$ states as an auxiliary field through a sequence of microwave (MW) pulses, simultaneous measurement of multiple spin-1 observables is demonstrated, reaching an enhancement of 3.3 to 6.3 decibels (dB) beyond the classical limit over a wide range of rotation angles. Our work realizes the first enhanced multi-parameter estimation using entangled massive particles as a probe. The techniques developed and the protocols implemented also highlight the application of two-mode squeezed vacuum states in quantum-enhanced sensing of noncommuting spin rotations simultaneously.
Can Offline A/B Testing Be Automated for Data-Driven Requirement Engineering?

Online A/B testing has been widely used by software companies to evaluate the impact of new technologies by offering it to a groups of users and comparing against the unmodified product. However, running online A/B testing needs not only efforts in design, implementation and stakeholders' approval to be served in production, but also several weeks to collect the data in iterations. To address these issues, a recent emerging topic, called \textit{offline A/B testing}, is getting increasing attention, with the goal to conduct offline evaluation of a new technology by estimating historical logged data. Although this approach is promising due to lower implementation effort, faster turnaround time and no potential user harm, for it to be effectively prioritized as requirements in practice, several limitations need to be addressed, including its discrepancy with online A/B test results, and lack of systematic updates on new data. In response, in this vision paper, we introduce AutoOffAB, an idea to automatically runs variants of offline A/B testing against recent logging and update the offline evaluation results, which are used to make decisions on requirements more reliably and systematically.
Skein valued cluster transformation in enumerative geometry of Legendrian mutation

Under certain hypotheses, we show that Legendrian surfaces related by disk surgery will have q-deformed augmentation spaces that are related by q-deformed cluster transformation. The proof is geometric, via considerations of moduli of holomorphic curves. In fact, our results naturally give a more general HOMFLYPT"skein-valued cluster transformation", of which the q-cluster transformation is the U(1) specialization. We apply our methods to the Legendrians associated to cubic planar graphs, where mutation of graphs lifts to Legendrian disk surgery. We show that their skein-valued mirrors transform by skein-valued cluster transformation, and give a formula for the skein-valued curve counts on their fillings.
On the Development of a Large Scale Corpus for Native Language Identification

Native Language Identification (NLI) is the task of identifying an author’s native language from their writings in a second language. In this paper, we introduce a new corpus (italki), which is larger than the current corpora. It can be used for training machine learning based systems for classifying and identifying the native language of authors of English text. To examine the usefulness of italki, we evaluate it by using it to train and test some of the well performing NLI systems presented in the 2017 NLI shared task. In this paper, we present some aspects of italki. We show the impact of the variation of italki’s training dataset size of some languages on systems performance. From our empirical finding, we highlight the potential of italki as a large scale corpus for training machine learning classifiers for classifying the native language of authors from their written English text. We obtained promising results that show the potential of italki to improve the performance of current NLI systems. More importantly, we found that training the current NLI systems on italki generalize better than training them on the current corpora.
A system of dual quaternion matrix equations with its applications

We employ the M-P inverses and ranks of quaternion matrices to establish the necessary and sufficient conditions for solving a system of the dual quaternion matrix equations $(AX, XC) = (B, D)$, along with providing an expression for its general solution. Serving as an application, we investigate the solutions to the dual quaternion matrix equations $AX = B$ and $XC=D$, including $\eta$-Hermitian solutions. Lastly, we design a numerical example to validate the main research findings of this paper.
Relations between Markovian and non-Markovian correlations in multi-time quantum processes

In the dynamics of open quantum systems, information may propagate in time through either the system or the environment, giving rise to Markovian and non-Markovian temporal correlations, respectively. However, despite their notable coexistence in most physical situations, it is not yet clear how these two quantities may limit the existence of one another. Here, we address this issue by deriving several inequalities relating the temporal correlations of general multi-time quantum processes. The dynamics are described by process tensors and the correlations are quantified by the mutual information between subsystems of their Choi states. First, we prove a set of upper bounds to the non-Markovianity of a process given the degree of Markovianity in each of its steps. This immediately implies a non-trivial maximum value for the non-Markovianity of any process, independently of its Markovianity. Finally, we obtain how the non-Markovianity limits the amount of total temporal correlations that could be present in a given process. These results show that, although any multi-time process must pay a price in total correlations to have a given amount of non-Markovianity, this price vanishes exponentially with the number of steps of the process, while the maximum non-Markovianity grows only linearly. This implies that even a highly non-Markovian process might be arbitrarily close to having maximum total correlations if it has a sufficiently large number of steps.
Fragile magnetic order in metallic quasicrystals

Inspired by recent experimental studies of local magnetic moments interacting with a metallic quasicrystal, we study the low-temperature fate of spins placed in the two-dimensional Ammann-Beenker tiling. In the diluted local moment limit, we calculate the spin relaxation rate $1/T_{1}$, as measured by electron spin resonance, and show that it displays a marked dependence on the system size $N$ and the Fermi energy of the electronic bath. For a finite concentration of spins, we integrate out the conduction electrons and generate an effective magnetic coupling between the local moments, which we treat as Ising spins. Despite the strongly frustrating nature of the magnetic couplings and the lack of periodicity in the problem, we find long-range orders for finite $N$ in our large-scale Monte Carlo simulations. However, the resulting magnetically state is fragile, as clusters of essentially free spins fluctuate down to very low temperatures.
A new method color MS-BSIF Features learning for the robust kinship verification

the paper presents a new method color MS-BSIF learning and MS-LBP for the kinship verification is the machine's ability to identify the genetic and blood the relationship and its degree between the facial images of humans. Facial verification of kinship refers to the task of training a machine to recognize the blood relationship between a pair of faces parent and non-parent (verification) based on features extracted from facial images, and determining the exact type or degree of this genetic relationship. We use the LBP and color BSIF learning features for the comparison and the TXQDA method for dimensionality reduction and data classification. We let's test the kinship facial verification application is namely the kinface Cornell database. This system improves the robustness of learning while controlling efficiency. The experimental results obtained and compared to other methods have proven the reliability of our framework and surpass the performance of other state-of-the-art techniques.
Adaptive Computation Modules: Granular Conditional Computation For Efficient Inference

The computational cost of transformer models makes them inefficient in low-latency or low-power applications. While techniques such as quantization or linear attention can reduce the computational load, they may incur a reduction in accuracy. In addition, globally reducing the cost for all inputs may be sub-optimal. We observe that for each layer, the full width of the layer may be needed only for a small subset of tokens inside a batch and that the"effective"width needed to process a token can vary from layer to layer. Motivated by this observation, we introduce the Adaptive Computation Module (ACM), a generic module that dynamically adapts its computational load to match the estimated difficulty of the input on a per-token basis. An ACM consists of a sequence of learners that progressively refine the output of their preceding counterparts. An additional gating mechanism determines the optimal number of learners to execute for each token. We also describe a distillation technique to replace any pre-trained model with an"ACMized"variant. The distillation phase is designed to be highly parallelizable across layers while being simple to plug-and-play into existing networks. Our evaluation of transformer models in computer vision and speech recognition demonstrates that substituting layers with ACMs significantly reduces inference costs without degrading the downstream accuracy for a wide interval of user-defined budgets.
Quantitative Measurement of adhesion energy between nanolayers and substrates using a nanowire-supported bridging method

The measurement of adhesion energy between nanolayers and substrates holds significant importance for the design, fabrication, and stability assessment of micro-/nanoscale devices relying on nanolayers. In this study, we propose a nanowire-supported bridging method based on an optical microscope-based nanomanipulation technique to quantitatively measure the adhesion energy between nanolayers and substrates. Using this innovative approach, we conducted adhesion energy measurements between mica nanolayers and Si substrates, revealing a value of approximately 110 J/m2. Additionally, we discuss the applicable conditions of this new method. The proposed technique allows measurements in atmospheric conditions and is, in principle, applicable to all types of nanolayers and substrates. Consequently, it holds promise as a universal method for assessing adhesion energy between nanolayers and substrates, considering environmental factors such as atmosphere and roughness.
Enhancing Cognitive Diagnosis using Un-interacted Exercises: A Collaboration-aware Mixed Sampling Approach

Cognitive diagnosis is a crucial task in computer-aided education, aimed at evaluating students' proficiency levels across various knowledge concepts through exercises. Current models, however, primarily rely on students' answered exercises, neglecting the complex and rich information contained in un-interacted exercises. While recent research has attempted to leverage the data within un-interacted exercises linked to interacted knowledge concepts, aiming to address the long-tail issue, these studies fail to fully explore the informative, un-interacted exercises related to broader knowledge concepts. This oversight results in diminished performance when these models are applied to comprehensive datasets. In response to this gap, we present the Collaborative-aware Mixed Exercise Sampling (CMES) framework, which can effectively exploit the information present in un-interacted exercises linked to un-interacted knowledge concepts. Specifically, we introduce a novel universal sampling module where the training samples comprise not merely raw data slices, but enhanced samples generated by combining weight-enhanced attention mixture techniques. Given the necessity of real response labels in cognitive diagnosis, we also propose a ranking-based pseudo feedback module to regulate students' responses on generated exercises. The versatility of the CMES framework bolsters existing models and improves their adaptability. Finally, we demonstrate the effectiveness and interpretability of our framework through comprehensive experiments on real-world datasets.
Single-Stage Optimization of Open-loop Stable Limit Cycles with Smooth, Symbolic Derivatives

Open-loop stable limit cycles are foundational to the dynamics of legged robots. They impart a self-stabilizing character to the robot's gait, thus alleviating the need for compute-heavy feedback-based gait correction. This paper proposes a general approach to rapidly generate limit cycles with explicit stability constraints for a given dynamical system. In particular, we pose the problem of open-loop limit cycle stability as a single-stage constrained-optimization problem (COP), and use Direct Collocation to transcribe it into a nonlinear program (NLP) with closed-form expressions for constraints, objectives, and their gradients. The COP formulations of stability are developed based (1) on the spectral radius of a discrete return map, and (2) on the spectral radius of the system's monodromy matrix, where the spectral radius is bounded using different constraint-satisfaction formulations of the eigenvalue problem. We compare the performance and solution qualities of each approach, but specifically highlight the Schur decomposition of the monodromy matrix as a formulation which boasts wider applicability through weaker assumptions and attractive numerical convergence properties. Moreover, we present results from our experiments on a spring-loaded inverted pendulum model of a robot, where our method generated actuation trajectories for open-loop stable hopping in under 2 seconds (on the Intel Core i7-6700K), and produced energy-minimizing actuation trajectories even under tight stability constraints.
Integrated Multi‐Color Raman Microlasers with Ultra‐Low Pump Levels in Single High‐Q Lithium Niobate Microdisks

Integrated Raman microlasers, particularly discrete multi‐color lasers which are crucial for extending the emission wavelength range of chip‐scale laser sources to much shorter wavelengths, are highly in demand for various spectroscopy, microscopy analysis, and biological detection applications. However, integrated multi‐color Raman microlasers have yet to be demonstrated because of the requirement of high‐Q microresonators possessing large χ(2) nonlinearity, strong Raman phonon branches, and the challenge in the cavity‐enhanced multi‐photon hyper‐Raman scattering parametric process. In this work, integrated multi‐color Raman lasers have been demonstrated for the first time at weak pump levels, via the excitation of high‐Q (> 6 × 106) phase‐matched modes in single thin‐film lithium niobate (TFLN) microresonators by dispersion engineering. Raman lasing is observed at 1712 nm for a 1547‐nm pump threshold power of only 620 µW, representing the state of the art in the TFLN platform. Furthermore, multi‐color Raman lasers are realized at discrete wavelengths of 1712, 813, 533, and 406 nm with pump levels as low as 1.60 mW, which is more than two orders of magnitude lower than the current records (i.e., 200 mW) in bulk resonators, allowed by the fulfillment of the requisite conditions consisting of broadband natural phase match, multiple‐resonance, and high‐Q factors.
Certified Minimax Unlearning with Generalization Rates and Deletion Capacity

We study the problem of $(\epsilon,\delta)$-certified machine unlearning for minimax models. Most of the existing works focus on unlearning from standard statistical learning models that have a single variable and their unlearning steps hinge on the direct Hessian-based conventional Newton update. We develop a new $(\epsilon,\delta)$-certified machine unlearning algorithm for minimax models. It proposes a minimax unlearning step consisting of a total-Hessian-based complete Newton update and the Gaussian mechanism borrowed from differential privacy. To obtain the unlearning certification, our method injects calibrated Gaussian noises by carefully analyzing the"sensitivity"of the minimax unlearning step (i.e., the closeness between the minimax unlearning variables and the retraining-from-scratch variables). We derive the generalization rates in terms of population strong and weak primal-dual risk for three different cases of loss functions, i.e., (strongly-)convex-(strongly-)concave losses. We also provide the deletion capacity to guarantee that a desired population risk can be maintained as long as the number of deleted samples does not exceed the derived amount. With training samples $n$ and model dimension $d$, it yields the order $\mathcal O(n/d^{1/4})$, which shows a strict gap over the baseline method of differentially private minimax learning that has $\mathcal O(n/d^{1/2})$. In addition, our rates of generalization and deletion capacity match the state-of-the-art rates derived previously for standard statistical learning models.