Miracle-dz/UniFAR-FTUs huggingface dataset:
4DHumanOutfit: a multi-subject 4D dataset of human motion sequences in varying outfits exhibiting large displacements

This work presents 4DHumanOutfit, a new dataset of densely sampled spatio-temporal 4D human motion data of different actors, outfits and motions. The dataset is designed to contain different actors wearing different outfits while performing different motions in each outfit. In this way, the dataset can be seen as a cube of data containing 4D motion sequences along 3 axes with identity, outfit and motion. This rich dataset has numerous potential applications for the processing and creation of digital humans, e.g. augmented reality, avatar creation and virtual try on. 4DHumanOutfit is released for research purposes at https://kinovis.inria. fr/4dhumanoutfit/. In addition to image data and 4D reconstructions, the dataset includes reference solutions for each axis. We present independent baselines along each axis that demonstrate the value of these reference solutions for evaluation tasks.
Combined two-loop self-energy corrections at finite and zero temperatures

In this paper we investigate higher-order corrections to the energies of bound states in hydrogen subjected to the external blackbody radiation field. In particular, within the framework of thermal quantum electrodynamics and $S$-matrix approach we analyze combined type of two-loop self-energy corrections, including one zero-vacuum and one loop at finite temperature. By utilizing the method of dimensional regularization, we derive closed analytical expressions for the energy shifts of atomic levels. Our numerical calculations demonstrate that even at room temperature these corrections can be significant for excited states, reaching the magnitude of the thermal induced Stark contribution.
Quantum Circuit Designs of Point Doubling for Binary Elliptic Curves

In the past years, research on Shor's algorithm for solving elliptic curves for discrete logarithm problems (Shor's ECDLP), the basis for cracking elliptic curve-based cryptosystems (ECC), has started to garner more significant interest. To achieve this, most works focus on quantum point addition subroutines to realize the double scalar multiplication circuit, an essential part of Shor's ECDLP, whereas the point doubling subroutines are often overlooked. In this paper, we investigate the quantum point doubling circuit for the stricter assumption of Shor's algorithm when doubling a point should also be taken into consideration. In particular, we analyze the challenges on implementing the circuit and provide the solution. Subsequently, we design and optimize the corresponding quantum circuit, and analyze the high-level quantum resource cost of the circuit. Additionally, we discuss the implications of our findings, including the concerns for its integration with point addition for a complete double scalar multiplication circuit and the potential opportunities resulting from its implementation. Our work lays the foundation for further evaluation of Shor's ECDLP.
Stability and Fluctuations in Complex Ecological Systems

From 08-12 August, 2022, 32 individuals participated in a workshop, Stability and Fluctuations in Complex Ecological Systems, at the Lorentz Center, located in Leiden, The Netherlands. An interdisciplinary dialogue between ecologists, mathematicians, and physicists provided a foundation of important problems to consider over the next 5-10 years. This paper outlines eight areas including (1) improving our understanding of the effect of scale, both temporal and spatial, for both deterministic and stochastic problems; (2) clarifying the different terminologies and definitions used in different scientific fields; (3) developing a comprehensive set of data analysis techniques arising from different fields but which can be used together to improve our understanding of existing data sets; (4) having theoreticians/computational scientists collaborate closely with empirical ecologists to determine what new data should be collected; (5) improving our knowledge of how to protect and/or restore ecosystems; (6) incorporating socio-economic effects into models of ecosystems; (7) improving our understanding of the role of deterministic and stochastic fluctuations; (8) studying the current state of biodiversity at the functional level, taxa level and genome level.
NeuS-PIR: Learning Relightable Neural Surface using Pre-Integrated Rendering

This paper presents a method, namely NeuS-PIR, for recovering relightable neural surfaces using pre-integrated rendering from multi-view images or video. Unlike methods based on NeRF and discrete meshes, our method utilizes implicit neural surface representation to reconstruct high-quality geometry, which facilitates the factorization of the radiance field into two components: a spatially varying material field and an all-frequency lighting representation. This factorization, jointly optimized using an adapted differentiable pre-integrated rendering framework with material encoding regularization, in turn addresses the ambiguity of geometry reconstruction and leads to better disentanglement and refinement of each scene property. Additionally, we introduced a method to distil indirect illumination fields from the learned representations, further recovering the complex illumination effect like inter-reflection. Consequently, our method enables advanced applications such as relighting, which can be seamlessly integrated with modern graphics engines. Qualitative and quantitative experiments have shown that NeuS-PIR outperforms existing methods across various tasks on both synthetic and real datasets. Source code is available at https://github.com/Sheldonmao/NeuSPIR
Holographic RG from ERG: Locality and General Coordinate Invariance in the Bulk

In earlier papers it was shown that the correct kinetic term for scalar, vector gauge field and the spin two field in $AdS_{D+1}$ space is obtained starting from the ERG equation for a $CFT_D$ perturbed by scalar composite, conserved vector current and conserved traceless energy momentum tensor respectively. In this paper interactions are studied and it is shown that a flipped version of Polchinski ERG equation that evolves towards the UV can be written down and is useful for making contact with the usual AdS/CFT prescriptions for correlation function calculations. The scalar-scalar-spin-2 interaction in the bulk is derived from the ERG equation in the large $N$ semiclasical approximation. It is also shown that after mapping to AdS the interaction is local on a scale of the bare cutoff rather than the moving cutoff (which would have corresponded to the AdS scale). The map to $AdS_{D+1}$ plays a crucial role in this locality. The local nature of the coupling ensures that this interaction term in the bulk action is obtained by gauge fixing a general coordinate invariant scalar kinetic term in the bulk action. A wave function renormalization of the scalar field is found to be required for a mutually consistent map of the two fields to $AdS_{D+1}$.
Optimal Inference in Contextual Stochastic Block Models

The contextual stochastic block model (cSBM) was proposed for unsupervised community detection on attributed graphs where both the graph and the high-dimensional node information correlate with node labels. In the context of machine learning on graphs, the cSBM has been widely used as a synthetic dataset for evaluating the performance of graph-neural networks (GNNs) for semi-supervised node classification. We consider a probabilistic Bayes-optimal formulation of the inference problem and we derive a belief-propagation-based algorithm for the semi-supervised cSBM; we conjecture it is optimal in the considered setting and we provide its implementation. We show that there can be a considerable gap between the accuracy reached by this algorithm and the performance of the GNN architectures proposed in the literature. This suggests that the cSBM, along with the comparison to the performance of the optimal algorithm, readily accessible via our implementation, can be instrumental in the development of more performant GNN architectures.
Least-Squares Neural Network (LSNN) Method For Linear Advection-Reaction Equation: Non-constant Jumps

The least-squares ReLU neural network (LSNN) method was introduced and studied for solving linear advection-reaction equation with discontinuous solution in \cite{Cai2021linear,cai2023least}. The method is based on an equivalent least-squares formulation and employs ReLU neural network (NN) functions with $\lceil \log_2(d+1)\rceil+1$-layer representations for approximating solutions. In this paper, we show theoretically that the method is also capable of approximating non-constant jumps along discontinuous interfaces that are not necessarily straight lines. Numerical results for test problems with various non-constant jumps and interfaces show that the LSNN method with $\lceil \log_2(d+1)\rceil+1$ layers approximates solutions accurately with degrees of freedom less than that of mesh-based methods and without the common Gibbs phenomena along discontinuous interfaces.
STUDY: Socially Aware Temporally Causal Decoder Recommender Systems

Recommender systems are widely used to help people find items that are tailored to their interests. These interests are often influenced by social networks, making it important to use social network information effectively in recommender systems. This is especially true for demographic groups with interests that differ from the majority. This paper introduces STUDY, a Socially-aware Temporally caUsal Decoder recommender sYstem. STUDY introduces a new socially-aware recommender system architecture that is significantly more efficient to learn and train than existing methods. STUDY performs joint inference over socially connected groups in a single forward pass of a modified transformer decoder network. We demonstrate the benefits of STUDY in the recommendation of books for students who are dyslexic, or struggling readers. Dyslexic students often have difficulty engaging with reading material, making it critical to recommend books that are tailored to their interests. We worked with our non-profit partner Learning Ally to evaluate STUDY on a dataset of struggling readers. STUDY was able to generate recommendations that more accurately predicted student engagement, when compared with existing methods.
Freaky Leaky SMS: Extracting User Locations by Analyzing SMS Timings

Short Message Service (SMS) remains one of the most popular communication channels since its introduction in 2G cellular networks. In this paper, we demonstrate that merely receiving silent SMS messages regularly opens a stealthy side-channel that allows other regular network users to infer the whereabouts of the SMS recipient. The core idea is that receiving an SMS inevitably generates Delivery Reports whose reception bestows a timing attack vector at the sender. We conducted experiments across various countries, operators, and devices to show that an attacker can deduce the location of an SMS recipient by analyzing timing measurements from typical receiver locations. Our results show that, after training an ML model, the SMS sender can accurately determine multiple locations of the recipient. For example, our model achieves up to 96% accuracy for locations across different countries, and 86% for two locations within Belgium. Due to the way cellular networks are designed, it is difficult to prevent Delivery Reports from being returned to the originator making it challenging to thwart this covert attack without making fundamental changes to the network architecture.
Shear and interface modes in neutron stars with pasta structures

We carefully examine the shear and interface modes, which are excited due to the presence of crust elasticity, in neutron stars with pasta structures, adopting the relativistic Cowling approximation. We find that the shear modes are independent of the presence of the cylindrical-hole and spherical-hole nuclei at least up to a few kilohertz, while the interface modes strongly depend on the presence of the cylindrical-hole and spherical-hole nuclei. In addition, we find empirical relations for the interface mode frequencies multiplied by the stellar mass and for the shear mode frequencies multiplied by the stellar radius. These relations are expressed as a function of the stellar compactness almost independently of the stiffness in a higher-density region inside the neutron star, once one selects the crust equation of state. Thus, if one would simultaneously observe the shear and interface modes from a neutron star, one might extract the neutron star mass and radius with the help of the constraint on the crust stiffness obtained from terrestrial experiments.
Differentially Private One Permutation Hashing and Bin-wise Consistent Weighted Sampling

Minwise hashing (MinHash) is a standard algorithm widely used in the industry, for large-scale search and learning applications with the binary (0/1) Jaccard similarity. One common use of MinHash is for processing massive n-gram text representations so that practitioners do not have to materialize the original data (which would be prohibitive). Another popular use of MinHash is for building hash tables to enable sub-linear time approximate near neighbor (ANN) search. MinHash has also been used as a tool for building large-scale machine learning systems. The standard implementation of MinHash requires applying $K$ random permutations. In comparison, the method of one permutation hashing (OPH), is an efficient alternative of MinHash which splits the data vectors into $K$ bins and generates hash values within each bin. OPH is substantially more efficient and also more convenient to use. In this paper, we combine the differential privacy (DP) with OPH (as well as MinHash), to propose the DP-OPH framework with three variants: DP-OPH-fix, DP-OPH-re and DP-OPH-rand, depending on which densification strategy is adopted to deal with empty bins in OPH. A detailed roadmap to the algorithm design is presented along with the privacy analysis. An analytical comparison of our proposed DP-OPH methods with the DP minwise hashing (DP-MH) is provided to justify the advantage of DP-OPH. Experiments on similarity search confirm the merits of DP-OPH, and guide the choice of the proper variant in different practical scenarios. Our technique is also extended to bin-wise consistent weighted sampling (BCWS) to develop a new DP algorithm called DP-BCWS for non-binary data. Experiments on classification tasks demonstrate that DP-BCWS is able to achieve excellent utility at around $\epsilon = 5\sim 10$, where $\epsilon$ is the standard parameter in the language of $(\epsilon, \delta)$-DP.
GPT-Calls: Enhancing Call Segmentation and Tagging by Generating Synthetic Conversations via Large Language Models

Transcriptions of phone calls are of significant value across diverse fields, such as sales, customer service, healthcare, and law enforcement. Nevertheless, the analysis of these recorded conversations can be an arduous and time-intensive process, especially when dealing with extended or multifaceted dialogues. In this work, we propose a novel method, GPT-distilled Calls Segmentation and Tagging (GPT-Calls), for efficient and accurate call segmentation and topic extraction. GPT-Calls is composed of offline and online phases. The offline phase is applied once to a given list of topics and involves generating a distribution of synthetic sentences for each topic using a GPT model and extracting anchor vectors. The online phase is applied to every call separately and scores the similarity between the transcripted conversation and the topic anchors found in the offline phase. Then, time domain analysis is applied to the similarity scores to group utterances into segments and tag them with topics. The proposed paradigm provides an accurate and efficient method for call segmentation and topic extraction that does not require labeled data, thus making it a versatile approach applicable to various domains. Our algorithm operates in production under Dynamics 365 Sales Conversation Intelligence, and our research is based on real sales conversations gathered from various Dynamics 365 Sales tenants.
Synapse: Trajectory-as-Exemplar Prompting with Memory for Computer Control

Building agents with large language models (LLMs) for computer control is a burgeoning research area, where the agent receives computer states and performs actions to complete complex tasks. Previous computer agents have demonstrated the benefits of in-context learning (ICL); however, their performance is hindered by several issues. First, the limited context length of LLMs and complex computer states restrict the number of exemplars, as a single webpage can consume the entire context. Second, the exemplars in current methods, such as high-level plans and multi-choice questions, cannot represent complete trajectories, leading to suboptimal performance in long-horizon tasks. Third, existing computer agents rely on task-specific exemplars and overlook the similarity among tasks, resulting in poor generalization to novel tasks. To address these challenges, we introduce Synapse, a computer agent featuring three key components: i) state abstraction, which filters out task-irrelevant information from raw states, allowing more exemplars within the limited context, ii) trajectory-as-exemplar prompting, which prompts the LLM with complete trajectories of the abstracted states and actions to improve multi-step decision-making, and iii) exemplar memory, which stores the embeddings of exemplars and retrieves them via similarity search for generalization to novel tasks. We evaluate Synapse on MiniWoB++, a standard task suite, and Mind2Web, a real-world website benchmark. In MiniWoB++, Synapse achieves a 99.2% average success rate (a 10% relative improvement) across 64 tasks using demonstrations from only 48 tasks. Notably, Synapse is the first ICL method to solve the book-flight task in MiniWoB++. Synapse also exhibits a 56% relative improvement in average step success rate over the previous state-of-the-art prompting scheme in Mind2Web.
An Approach to Nonparametric Inference on the Causal Dose Response Function

The causal dose response curve is commonly selected as the statistical parameter of interest in studies where the goal is to understand the effect of a continuous exposure on an outcome.Most of the available methodology for statistical inference on the dose-response function in the continuous exposure setting requires strong parametric assumptions on the probability distribution. Such parametric assumptions are typically untenable in practice and lead to invalid inference. It is often preferable to instead use nonparametric methods for inference, which only make mild assumptions about the data-generating mechanism. We propose a nonparametric test of the null hypothesis that the dose-response function is equal to a constant function. We argue that when the null hypothesis holds, the dose-response function has zero variance. Thus, one can test the null hypothesis by assessing whether there is sufficient evidence to claim that the variance is positive. We construct a novel estimator for the variance of the dose-response function, for which we can fully characterize the null limiting distribution and thus perform well-calibrated tests of the null hypothesis. We also present an approach for constructing simultaneous confidence bands for the dose-response function by inverting our proposed hypothesis test. We assess the validity of our proposal in a simulation study. In a data example, we study, in a population of patients who have initiated treatment for HIV, how the distance required to travel to an HIV clinic affects retention in care.
SoK: Modeling Explainability in Security Analytics for Interpretability, Trustworthiness, and Usability

Interpretability, trustworthiness, and usability are key considerations in high-stake security applications, especially when utilizing deep learning models. While these models are known for their high accuracy, they behave as black boxes in which identifying important features and factors that led to a classification or a prediction is difficult. This can lead to uncertainty and distrust, especially when an incorrect prediction results in severe consequences. Thus, explanation methods aim to provide insights into the inner working of deep learning models. However, most explanation methods provide inconsistent explanations, have low fidelity, and are susceptible to adversarial manipulation, which can reduce model trustworthiness. This paper provides a comprehensive analysis of explainable methods and demonstrates their efficacy in three distinct security applications: anomaly detection using system logs, malware prediction, and detection of adversarial images. Our quantitative and qualitative analysis1 reveals serious limitations and concerns in state-of-the-art explanation methods in all three applications. We show that explanation methods for security applications necessitate distinct characteristics, such as stability, fidelity, robustness, and usability, among others, which we outline as the prerequisites for trustworthy explanation methods.
Assessment of listing and categorisation of animal diseases within the framework of the Animal Health Law (Regulation (EU) No 2016/429): infectious pancreatic necrosis (IPN)

Abstract Infectious pancreatic necrosis (IPN) was assessed according to the criteria of the Animal Health Law (AHL), in particular, the criteria of Article 7 on disease profile and impacts, Article 5 on its eligibility to be listed, Annex IV for its categorisation according to disease prevention and control rules as in Article 9, and Article 8 for listing animal species related to IPN. The assessment was performed following a methodology previously published. The outcome reported is the median of the probability ranges provided by the experts, which indicates whether each criterion is fulfilled (lower bound ≥ 66%) or not (upper bound ≤ 33%), or whether there is uncertainty about fulfilment. Reasoning points are reported for criteria with an uncertain outcome. According to the assessment here performed, it is uncertain whether IPN can be considered eligible to be listed for Union intervention according to Article 5 of the AHL (50–90% probability). According to the criteria in Annex IV, for the purpose of categorisation related to the level of prevention and control as in Article 9 of the AHL, the AHAW Panel concluded that IPN does not meet the criteria in Section 1 (Category A; 0–1% probability of meeting the criteria) and it is uncertain whether it meets the criteria in Sections 2, 3, 4 and 5 (Categories B, C, D and E; 33–66%, 33–66%, 50–90% and 50–99% probability of meeting the criteria, respectively). The animal species to be listed for IPN according to Article 8 criteria are provided.