Reviewerly/exHarmony huggingface dataset:
Clip-Tuning: Towards Derivative-free Prompt Learning with a Mixture of Rewards

Derivative-free prompt learning has emerged as a lightweight alternative to prompt tuning, which only requires model inference to optimize the prompts. However, existing work did not take full advantage of the over-parameterized characteristics of large pre-trained language models (PLMs). In this paper, we propose Clip-Tuning, a simple yet effective method that adopts diverse frozen "thinned" networks of PLMs to obtain a mixture of rewards and thus advance the derivative-free prompt learning. The thinned networks consist of all the hidden units that survive a stationary dropout strategy, whose inference predictions reflect an ensemble of partial views over prompted training samples. Our method outperforms previous gradient-free prompt learning methods and achieves parity with gradient-based counterparts on seven language understanding benchmarks under few-shot settings.
HDHumans: A Hybrid Approach for High-fidelity Digital Humans

Photo-real digital human avatars are of enormous importance in graphics, as they enable immersive communication over the globe, improve gaming and entertainment experiences, and can be particularly beneficial for AR and VR settings. However, current avatar generation approaches either fall short in high-fidelity novel view synthesis, generalization to novel motions, reproduction of loose clothing, or they cannot render characters at the high resolution offered by modern displays. To this end, we propose HDHumans, which is the first method for HD human character synthesis that jointly produces an accurate and temporally coherent 3D deforming surface and highly photo-realistic images of arbitrary novel views and of motions not seen at training time. At the technical core, our method tightly integrates a classical deforming character template with neural radiance fields (NeRF). Our method is carefully designed to achieve a synergy between classical surface deformation and NeRF. First, the template guides the NeRF, which allows synthesizing novel views of a highly dynamic and articulated character and even enables the synthesis of novel motions. Second, we also leverage the dense pointclouds resulting from NeRF to further improve the deforming surface via 3D-to-3D supervision. We outperform the state of the art quantitatively and qualitatively in terms of synthesis quality and resolution, as well as the quality of 3D surface reconstruction.
Bootstrapping NLP tools across low-resourced African languages: an overview and prospects

Computing and Internet access are substantially growing markets in Southern Africa, which brings with it increasing demands for local content and tools in indigenous African languages. Since most of those languages are low-resourced, efforts have gone into the notion of bootstrapping tools for one African language from another. This paper provides an overview of these efforts for Niger-Congo B (`Bantu') languages. Bootstrapping grammars for geographically distant languages has been shown to still have positive outcomes for morphology and rules or grammar-based natural language generation. Bootstrapping with data-driven approaches to NLP tasks is difficult to use meaningfully regardless geographic proximity, which is largely due to lexical diversity due to both orthography and vocabulary. Cladistic approaches in comparative linguistics may inform bootstrapping strategies and similarity measures might serve as proxy for bootstrapping potential as well, with both fertile ground for further research.
Towards Improved Heliosphere Sky Map Estimation with Theseus

The Interstellar Boundary Explorer (IBEX) satellite has been in orbit since 2008 and detects energy-resolved energetic neutral atoms (ENAs) originating from the heliosphere. Different regions of the heliosphere generate ENAs at different rates. It is of scientific interest to take the data collected by IBEX and estimate spatial maps of heliospheric ENA rates (referred to as sky maps) at higher resolutions than before. These sky maps will subsequently be used to discern between competing theories of heliosphere properties that are not currently possible. The data IBEX collects present challenges to sky map estimation. The two primary challenges are noisy and irregularly spaced data collection and the IBEX instrumentation's point spread function. In essence, the data collected by IBEX are both noisy and biased for the underlying sky map of inferential interest. In this paper, we present a two-stage sky map estimation procedure called Theseus. In Stage 1, Theseus estimates a blurred sky map from the noisy and irregularly spaced data using an ensemble approach that leverages projection pursuit regression and generalized additive models. In Stage 2, Theseus deblurs the sky map by deconvolving the PSF with the blurred map using regularization. Unblurred sky map uncertainties are computed via bootstrapping. We compare Theseus to a method closely related to the one operationally used today by the IBEX Science Operation Center (ISOC) on both simulated and real data. Theseus outperforms ISOC in nearly every considered metric on simulated data, indicating that Theseus is an improvement over the current state of the art.
Do Content Management Systems Impact the Security of Free Content Websites? A Correlation Analysis

This paper investigates the potential causes of the vulnerabilities of free content websites to address risks and maliciousness. Assembling more than 1,500 websites with free and premium content, we identify their content management system (CMS) and malicious attributes. We use frequency analysis at both the aggregate and per category of content (books, games, movies, music, and software), utilizing the unpatched vulnerabilities, total vulnerabilities, malicious count, and percentiles to uncover trends and affinities of usage and maliciousness of CMS{'s} and their contribution to those websites. Moreover, we find that, despite the significant number of custom code websites, the use of CMS{'s} is pervasive, with varying trends across types and categories. Finally, we find that even a small number of unpatched vulnerabilities in popular CMS{'s} could be a potential cause for significant maliciousness.
Ollivier-Ricci Curvature for Hypergraphs: A Unified Framework

Bridging geometry and topology, curvature is a powerful and expressive invariant. While the utility of curvature has been theoretically and empirically confirmed in the context of manifolds and graphs, its generalization to the emerging domain of hypergraphs has remained largely unexplored. On graphs, the Ollivier-Ricci curvature measures differences between random walks via Wasserstein distances, thus grounding a geometric concept in ideas from probability theory and optimal transport. We develop ORCHID, a flexible framework generalizing Ollivier-Ricci curvature to hypergraphs, and prove that the resulting curvatures have favorable theoretical properties. Through extensive experiments on synthetic and real-world hypergraphs from different domains, we demonstrate that ORCHID curvatures are both scalable and useful to perform a variety of hypergraph tasks in practice.
Efficient Dataset Distillation Using Random Feature Approximation

Dataset distillation compresses large datasets into smaller synthetic coresets which retain performance with the aim of reducing the storage and computational burden of processing the entire dataset. Today's best-performing algorithm, \textit{Kernel Inducing Points} (KIP), which makes use of the correspondence between infinite-width neural networks and kernel-ridge regression, is prohibitively slow due to the exact computation of the neural tangent kernel matrix, scaling $O(|S|^2)$, with $|S|$ being the coreset size. To improve this, we propose a novel algorithm that uses a random feature approximation (RFA) of the Neural Network Gaussian Process (NNGP) kernel, which reduces the kernel matrix computation to $O(|S|)$. Our algorithm provides at least a 100-fold speedup over KIP and can run on a single GPU. Our new method, termed an RFA Distillation (RFAD), performs competitively with KIP and other dataset condensation algorithms in accuracy over a range of large-scale datasets, both in kernel regression and finite-width network training. We demonstrate the effectiveness of our approach on tasks involving model interpretability and privacy preservation.
Multitask Brain Tumor Inpainting with Diffusion Models: A Methodological Report

Despite the ever-increasing interest in applying deep learning (DL) models to medical imaging, the typical scarcity and imbalance of medical datasets can severely impact the performance of DL models. The generation of synthetic data that might be freely shared without compromising patient privacy is a well-known technique for addressing these difficulties. Inpainting algorithms are a subset of DL generative models that can alter one or more regions of an input image while matching its surrounding context and, in certain cases, non-imaging input conditions. Although the majority of inpainting techniques for medical imaging data use generative adversarial networks (GANs), the performance of these algorithms is frequently suboptimal due to their limited output variety, a problem that is already well-known for GANs. Denoising diffusion probabilistic models (DDPMs) are a recently introduced family of generative networks that can generate results of comparable quality to GANs, but with diverse outputs. In this paper, we describe a DDPM to execute multiple inpainting tasks on 2D axial slices of brain MRI with various sequences, and present proof-of-concept examples of its performance in a variety of evaluation scenarios. Our model and a public online interface to try our tool are available at: https://github.com/Mayo-Radiology-Informatics-Lab/MBTI
Modelling Control Arguments via Cooperation Logic in Unforeseen Scenarios

The intent of control argumentation frameworks is to specifically model strategic scenarios from the perspective of an agent by extending the standard model of argumentation framework in a way that takes unquantified uncertainty regarding arguments and attacks into account. They do not, however, adequately account for coalition formation and interactions among a set of agents in an uncertain environment. To address this challenge, we propose a formalism of a multi-agent scenario via cooperation logic and investigate agents' strategies and actions in a dynamic environment.
Formalizing Chemical Physics using the Lean Theorem Prover

Chemical theory can be made more rigorous using the Lean theorem prover, an interactive theorem prover for complex mathematics. We formalize the Langmuir and BET theories of adsorption, making each scientific premise clear and every step of the derivations explicit. Lean's math library, mathlib, provides formally verified theorems for infinite geometries series, which are central to BET theory. While writing these proofs, Lean prompts us to include mathematical constraints that were not originally reported. We also illustrate how Lean flexibly enables the reuse of proofs that build on more complex theories through the use of functions, definitions, and structures. Finally, we construct scientific frameworks for interoperable proofs, by creating structures for classical thermodynamics and kinematics, using them to formalize gas law relationships like Boyle's Law and equations of motion underlying Newtonian mechanics, respectively. This approach can be extended to other fields, enabling the formalization of rich and complex theories in science and engineering.
Targeted active learning for probabilistic models

A fundamental task in science is to design experiments that yield valuable insights about the system under study. Mathematically, these insights can be represented as a utility or risk function that shapes the value of conducting each experiment. We present PDBAL, a targeted active learning method that adaptively designs experiments to maximize scientific utility. PDBAL takes a user-specified risk function and combines it with a probabilistic model of the experimental outcomes to choose designs that rapidly converge on a high-utility model. We prove theoretical bounds on the label complexity of PDBAL and provide fast closed-form solutions for designing experiments with common exponential family likelihoods. In simulation studies, PDBAL consistently outperforms standard untargeted approaches that focus on maximizing expected information gain over the design space. Finally, we demonstrate the scientific potential of PDBAL through a study on a large cancer drug screen dataset where PDBAL quickly recovers the most efficacious drugs with a small fraction of the total number of experiments.
Final Iteration Convergence Bound of Q-Learning: Switching System Approach

Q-learning is known as one of the fundamental reinforcement learning (RL) algorithms. Its convergence has been the focus of extensive research over the past several decades. Recently, a new finitetime error bound and analysis for Q-learning was introduced using a switching system framework. This approach views the dynamics of Q-learning as a discrete-time stochastic switching system. The prior study established a finite-time error bound on the averaged iterates using Lyapunov functions, offering further insights into Q-learning. While valuable, the analysis focuses on error bounds of the averaged iterate, which comes with the inherent disadvantages: it necessitates extra averaging steps, which can decelerate the convergence rate. Moreover, the final iterate, being the original format of Q-learning, is more commonly used and is often regarded as a more intuitive and natural form in the majority of iterative algorithms. In this paper, we present a finite-time error bound on the final iterate of Q-learning based on the switching system framework. The proposed error bounds have different features compared to the previous works, and cover different scenarios. Finally, we expect that the proposed results provide additional insights on Q-learning via connections with discrete-time switching systems, and can potentially present a new template for finite-time analysis of more general RL algorithms.
Large Neural Networks Learning from Scratch with Very Few Data and without Explicit Regularization

Recent findings have shown that highly over-parameterized Neural Networks generalize without pretraining or explicit regularization. It is achieved with zero training error, i.e., complete over-fitting by memorizing the training data. This is surprising, since it is completely against traditional machine learning wisdom. In our empirical study we fortify these findings in the domain of fine-grained image classification. We show that very large Convolutional Neural Networks with millions of weights do learn with only a handful of training samples and without image augmentation, explicit regularization or pretraining. We train the architectures ResNet018, ResNet101 and VGG19 on subsets of the difficult benchmark datasets Caltech101, CUB_200_2011, FGVCAircraft, Flowers102 and StanfordCars with 100 classes and more, perform a comprehensive comparative study and draw implications for the practical application of CNNs. Finally, we show that a randomly initialized VGG19 with 140 million weights learns to distinguish airplanes and motorbikes with up to 95% accuracy using only 20 training samples per class.
DGL22: A practical Quantum key distribution

Abstract Quantum key distribution (QKD) protocols are unconditionally secure, providing that quantum devices are truthful. Device-independent quantum key distribution (DI-QKD) protocols offer the prospect of distributing secret keys with minimal assumptions. The DI-QKD protocols are hard to implement using the current technologies as they require all the quantum devices to be uncharacterized. Measurement device independent quantum key distribution (MDI-QKD) protocols assume that the measurement devices are not truthful; the adversary might make them. MDI-QKD is secure but more challenging to implement. Receiver-device-independent quantum key distribution (RDI-QKD) protocols assume that the receiver's measurement devices can be viewed as a black box while the sender's device can be trusted. RDI-QKD relies on reasonable assumptions that make it easy to implement using the current state-of-the-art technology. We propose an RDI-QKD protocol, called DGL22. DGL22 is secure against all known attacks that are allowed by quantum mechanics. DGL22 provides several benefits over previous protocols, including the capability to attain high communication and sifting efficiency.
Role of nonclassical temporal correlation in powering quantum random access codes

We explore the fundamental origin of the quantum advantage behind random access code. We propose new temporal inequalities compatible with noninvasive-realist models and show that any non-zero quantum advantage of n bits encoded to 1-bit random access code in the presence of shared randomness is equivalent to the violation of the corresponding temporal inequality. As an immediate consequence of this connection, we also prove that the maximal success probability of n bits encoded to 1-bit random access code can be obtained when the maximal violation of the corresponding inequality is achieved. We then show that any non-zero quantum advantage of n bits encoded to 1-bit random access code, or in other words, any non-zero violation of the corresponding temporal inequality can certify genuine randomness.
Governance Mode and Formation Mechanism of Continuing Education in Colleges and Universities from the Perspective of Stakeholders

Governance mode and formation mechanism of continuing education in colleges and universities from the perspective of stakeholders is studied in the paper. Continuing education is a kind of post-degree education, which is the extension and development of academic education; its main body of learning is adults, and it is a lifelong learning activity for social members who have received a certain degree of education or vocational education. Strengthening the technological innovation of enterprises is an important link to enhance the competitiveness of enterprises, and participating in the technological transformation of enterprises and developing new products and processes is an important content of university-industry research cooperation. Hence, this paper gives the novel ideas for improving the educational performance.
Specific protection of copyright and related rights

Legal protection regarding copyright and related rights is granted according to the legislation in force, and the legal norms regulate the relations that appear at the creation and capitalization of literary, artistic and scientific works (copyright), of interpretations, phonograms, videograms and broadcast programs (related rights), as well as other rights that are determined by intellectual activity. The principles of protection of copyright and related rights are based on the objective form of expression, originality, automatic protection, exclusivity of rights, freedom of creation and freedom of contract. The subject of copyright relations may be legal entities, both citizens of the Republic of Moldova and persons with foreign citizenship or stateless persons. The moral right of the author is inalienable: the right to paternity, the right to names, the right to respect the integrity of the work, the right to disclose the work, the right to withdraw the work. The successors of the copyright values, only the patrimonial rights, which can be transmitted to third parties. The registration of the object of copyright and / or related rights implies the completion and submission of the application to AGEPI, the payment of the state fee, the registration of the data regarding the registration in the State Register, the issuance of the registration certificate. From legal protection on copyright and related rights are excluded theories, scientific discoveries, procedures, methods of operation, mathematical concepts, inventions contained in a work, whatever the way of taking, explaining or expressing. Likewise, the protection of copyright related rights does not extend to administrative, political or judicial acts, nor to their official translations, state symbols and official state signs, folk expressions, news of the day and various facts that represent a simple information. Enforcement of copyright and related rights is ensured through civil, administrative and criminal protection. Violation of the rights recognized and guaranteed according to the legislation in force attracts civil, contravention or criminal liability.
Attitude of researchers in the Republic of Moldova regarding the openness and sharing of research data

The key to understanding what can be done to support the scientific community is to study and analyze the real behaviors of researchers. The article presents the researchers’ attitudes regarding the openness and sharing of research data extracted from a larger survey on Open Science conducted among researchers in the Republic of Moldova. The survey included 532 researchers. The results of the survey show that the vast majority of respondents are aware of the benefits and advantages of open research data, but they also mention a number of challenges and fears that diminish their desire to share their data. Achieving the objectives of Open Data and reducing barriers to access and sharing research results requires great efforts, efficient research data management practices, awareness, consolidation, assistance and training.
The role of the university library in the development of the Open Science literacy

The role of the university library in the development of Open Science literacy is analysed in the article. At the current stage, the university library is considered an organized ensemble of educational, informational, technological, methodological potential for the formation of the Open Science literacy of researchers. Using the extensive experience of libraries in the implementation of new information technologies will allow them to be a main point of access to scientific information, to form a culture of Open Science and to become an important segment of the infrastructure of the university.
Technologies for “Digital Mathematical Library – Moldova” (DML-MD)

The technologies used for building, maintaining and thriving digital repositories by fields of specialization using open source and free-to-use technologies in order to promote the digitization of the internationally recognized scientific heritage in mathematics and computer science are analyzed and presented.