Miracle-dz/UniFAR-FTUs huggingface dataset:
Relay Selection and Resource Allocation for Ultra-Reliable Uplink Transmission in Smart Factory Scenarios

In this paper, a relay-aided two-phase transmission protocol for the smart factory scenario is proposed. This protocol aims at enabling all robots' ultra-reliable target number of uplink critical data transmission within a latency constraint by jointly optimizing the relay selection, resource block (RB) assignment, and transmit power allocation. Such protocol design is formulated as a mixed-integer and strictly non-convex problem where optimization variables are mutual coupling, which is definitely challenging. Instead of conventional methods designed for solving the problem, we leverage the properties of the relative entropy function to equivalently transform the problem without introducing extra constraints. As the packet error probability requirements of each robot under two possible transmission modes are coupled in one overall reliability constraint, the big-M technique is applied to decouple it into two corresponding reliability constraints. One is for direct transmission mode, and the other is for cooperative transmission mode. Moreover, both non-convex penalty (NCP) and quadratic penalty (QP) approaches are utilized to deal with the binary indicator constraints. Based on such penalty methods, a sequence of penalized approximated convex problems can be iteratively solved for sub-optimal solutions. Numerical results demonstrate the efficiency of such two penalty methods from the perspectives of sub-optimal values of total transmit power and convergence rate. Further, the impacts of reliability, the number and location of relays, the number of robots, the target number of data bits on the total power consumption are analyzed.
Verification in the Loop: Correct-by-Construction Control Learning with Reach-avoid Guarantees

In the current control design of safety-critical autonomous systems, formal verification techniques are typically applied after the controller is designed to evaluate whether the required properties (e.g., safety) are satisfied. However, due to the increasing system complexity and the fundamental hardness of designing a controller with formal guarantees, such an open-loop process of design-then-verify often results in many iterations and fails to provide the necessary guarantees. In this paper, we propose a correct-by-construction control learning framework that integrates the verification into the control design process in a closed-loop manner, i.e., design-while-verify. Specifically, we leverage the verification results (computed reachable set of the system state) to construct feedback metrics for control learning, which measure how likely the current design of control parameters can meet the required reach-avoid property for safety and goal-reaching. We formulate an optimization problem based on such metrics for tuning the controller parameters, and develop an approximated gradient descent algorithm with a difference method to solve the optimization problem and learn the controller. The learned controller is formally guaranteed to meet the required reach-avoid property. By treating verifiability as a first-class objective and effectively leveraging the verification results during the control learning process, our approach can significantly improve the chance of finding a control design with formal property guarantees. This is demonstrated via a set of experiments on both linear and non-linear systems that use model-based or neural network based controllers.
Dynamic Resolution Network

Deep convolutional neural networks (CNNs) are often of sophisticated design with numerous learnable parameters for the accuracy reason. To alleviate the expensive costs of deploying them on mobile devices, recent works have made huge efforts for excavating redundancy in pre-defined architectures. Nevertheless, the redundancy on the input resolution of modern CNNs has not been fully investigated, i.e., the resolution of input image is fixed. In this paper, we observe that the smallest resolution for accurately predicting the given image is different using the same neural network. To this end, we propose a novel dynamic-resolution network (DRNet) in which the input resolution is determined dynamically based on each input sample. Wherein, a resolution predictor with negligible computational costs is explored and optimized jointly with the desired network. Specifically, the predictor learns the smallest resolution that can retain and even exceed the original recognition accuracy for each image. During the inference, each input image will be resized to its predicted resolution for minimizing the overall computation burden. We then conduct extensive experiments on several benchmark networks and datasets. The results show that our DRNet can be embedded in any off-the-shelf network architecture to obtain a considerable reduction in computational complexity. For instance, DR-ResNet-50 achieves similar performance with an about 34% computation reduction, while gaining 1.4% accuracy increase with 10% computation reduction compared to the original ResNet-50 on ImageNet.
Mitigating Covariate Shift in Imitation Learning via Offline Data Without Great Coverage

This paper studies offline Imitation Learning (IL) where an agent learns to imitate an expert demonstrator without additional online environment interactions. Instead, the learner is presented with a static offline dataset of state-action-next state transition triples from a potentially less proficient behavior policy. We introduce Model-based IL from Offline data (MILO): an algorithmic framework that utilizes the static dataset to solve the offline IL problem efficiently both in theory and in practice. In theory, even if the behavior policy is highly sub-optimal compared to the expert, we show that as long as the data from the behavior policy provides sufficient coverage on the expert state-action traces (and with no necessity for a global coverage over the entire state-action space), MILO can provably combat the covariate shift issue in IL. Complementing our theory results, we also demonstrate that a practical implementation of our approach mitigates covariate shift on benchmark MuJoCo continuous control tasks. We demonstrate that with behavior policies whose performances are less than half of that of the expert, MILO still successfully imitates with an extremely low number of expert state-action pairs while traditional offline IL method such as behavior cloning (BC) fails completely. Source code is provided at https://github.com/jdchang1/milo.
Excitons and carriers in transient absorption and time-resolved ARPES spectroscopy: An 
ab initio
 approach

I present a fully ab–initio scheme to model transient spectroscopy signals in presence of strongly bound excitons. Using LiF as a prototype material, I show that the scheme is able to capture the exciton signature both in time-resolved ARPES and transient absorption experiments. The approach is completely general and can become the reference scheme for modelling pump and probe experiment in a wide range of materials.
Meta-research on COVID-19: An overview of the early trends

COVID-19 is having a dramatic impact on research and researchers. The pandemic has underlined the severity of known challenges in research and surfaced new ones, but also accelerated the adoption of innovations and manifested new opportunities. This review considers early trends emerging from meta-research on COVID-19. In particular, it focuses on the following topics: i) mapping COVID-19 research;ii) data and machine learning;iii) research practices including open access and open data, reviewing, publishing and funding;iv) communicating research to the public;v) the impact of COVID-19 on researchers, in particular with respect to gender and career trajectories. This overview finds that most early meta-research on COVID-19 has been reactive and focused on short-term questions, while more recently a shift to consider the long-term consequences of COVID-19 is taking place. Based on these findings, the author speculates that some aspects of doing research during COVID-19 are more likely to persist than others. These include: the shift to virtual for academic events such as conferences;the use of openly accessible pre-prints;the `datafication' of scholarly literature and consequent broader adoption of machine learning in science communication;the public visibility of research and researchers on social and online media.
Lexical Semantic Change Discovery

While there is a large amount of research in the field of Lexical Semantic Change Detection, only few approaches go beyond a standard benchmark evaluation of existing models. In this paper, we propose a shift of focus from change detection to change discovery, i.e., discovering novel word senses over time from the full corpus vocabulary. By heavily fine-tuning a type-based and a token-based approach on recently published German data, we demonstrate that both models can successfully be applied to discover new words undergoing meaning change. Furthermore, we provide an almost fully automated framework for both evaluation and discovery.
Conditional Contrastive Learning: Removing Undesirable Information in Self-Supervised Representations

Self-supervised learning is a form of unsupervised learning that leverages rich information in data to learn representations. However, data sometimes contains certain information that may be undesirable for downstream tasks. For instance, gender information may lead to biased decisions on many gender-irrelevant tasks. In this paper, we develop conditional contrastive learning to remove undesirable information in self-supervised representations. To remove the effect of the undesirable variable, our proposed approach conditions on the undesirable variable (i.e., by ﬁxing the variations of it) during the contrastive learning process. In particular, inspired by the contrastive objective InfoNCE, we introduce Conditional InfoNCE (C-InfoNCE), and its computationally efﬁcient variant, Weak-Conditional InfoNCE (WeaC-InfoNCE), for conditional contrastive learning. We demonstrate empirically that our methods can successfully learn self-supervised representations for downstream tasks while removing a great level of information related to the undesirable variables. We study three scenarios, each with a different type of undesirable variables: task-irrelevant meta-information for self-supervised speech representation learning, sensitive attributes for fair representation learning, and domain speciﬁcation for multi-domain visual representation learning.
Massively Parallel and Dynamic Algorithms for Minimum Size Clustering

In this paper, we study the $r$-gather problem, a natural formulation of minimum-size clustering in metric spaces. The goal of $r$-gather is to partition $n$ points into clusters such that each cluster has size at least $r$, and the maximum radius of the clusters is minimized. This additional constraint completely changes the algorithmic nature of the problem, and many clustering techniques fail. Also previous dynamic and parallel algorithms do not achieve desirable complexity. We propose algorithms both in the Massively Parallel Computation (MPC) model and in the dynamic setting. Our MPC algorithm handles input points from the Euclidean space $\mathbb{R}^d$. It computes an $O(1)$-approximate solution of $r$-gather in $O(\log^{\varepsilon} n)$ rounds using total space $O(n^{1+\gamma}\cdot d)$ for arbitrarily small constants $\varepsilon,\gamma>0$. In addition our algorithm is fully scalable, i.e., there is no lower bound on the memory per machine. Our dynamic algorithm maintains an $O(1)$-approximate $r$-gather solution under insertions/deletions of points in a metric space with doubling dimension $d$. The update time is $r \cdot 2^{O(d)}\cdot \log^{O(1)}\Delta$ and the query time is $2^{O(d)}\cdot \log^{O(1)}\Delta$, where $\Delta$ is the ratio between the largest and the smallest distance.
Testing the Kerr Black Hole Hypothesis with GRS 1716-249 by Combining the Continuum Fitting and the Iron-line Methods

The continuum-fitting and the iron-line methods are currently the two leading techniques for measuring the spins of accreting black holes. In the past few years, these two methods have been developed for testing fundamental physics. In the present work, we employ state-of-the-art models to test black holes through the continuum-fitting and the iron-line methods and we analyze three NuSTAR observations of the black hole binary GRS 1716-249 during its outburst in 2016–2017. In these three observations, the source was in a hard-intermediate state and the spectra show both a strong thermal component and prominent relativistic reflection features. Our analysis confirms the Kerr nature of the black hole in GRS 1716-249 and provides quite stringent constraints on possible deviations from the predictions of general relativity.
Negotiation-Aware Reachability-Based Safety Verification for AutonomousDriving in Interactive Scenarios

Safety assurance is a critical yet challenging aspect when developing self-driving technologies. Hamilton-Jacobi backward-reachability analysis is a formal verification tool for verifying the safety of dynamic systems in the presence of disturbances. However, the standard approach is too conservative to be applied to self-driving applications due to its worst-case assumption on humans' behaviors (i.e., guard against worst-case outcomes). In this work, we integrate a learning-based prediction algorithm and a game-theoretic human behavioral model to online update the conservativeness of backward-reachability analysis. We evaluate our approach using real driving data. The results show that, with reasonable assumptions on human behaviors, our approach can effectively reduce the conservativeness of the standard approach without sacrificing its safety verification ability.
Boucksom-Zariski and Weyl chambers on irreducible holomorphic symplectic manifolds

Zariski decomposition is a fundamental tool for studying linear systems of divisors on algebraic surfaces. Bauer, K\"uronya and Szemberg obtained a decomposition of the big cone of a smooth projective surface into chambers, called Zariski chambers, in each of which the support of the negative part of the Zariski decomposition is constant. On the other hand, thanks to the work of Boucksom, on a compact complex manifold we have the divisorial Zariski decomposition which, on an irreducible holomorphic symplectic manifold (IHS), is a higher dimensional Zariski decomposition with respect to the Beauville-Bogomolov-Fujiki quadratic form. Similarly to the case of surfaces, we provide for the big cone of a projective irreducible holomorphic symplectic manifold a decomposition into chambers (which we describe in detail), in each of which the support of the negative part of the divisorial Zariski decomposition is constant. As for surfaces, the obtained decomposition of the big cone allows to describe the volume function, which turns out to behave very well. Moreover, always inspired by the surface case, we also see that the big cone of a projective IHS manifold admits a decomposition into simple Weyl chambers, which we compare to that induced by the divisorial Zariski decomposition. To conclude, we investigate the boundary of the big cone and determine the structure of the algebraic pseudo-effective cone.
Network Estimation by Mixing: Adaptivity and More

Networks analysis has been commonly used to study the interactions between units of complex systems. One problem of particular interest is learning the network's underlying connection pattern given a single and noisy instantiation. While many methods have been proposed to address this problem in recent years, they usually assume that the true model belongs to a known class, which is not verifiable in most real-world applications. Consequently, network modeling based on these methods either suffers from model misspecification or relies on additional model selection procedures that are not well understood in theory and can potentially be unstable in practice. To address this difficulty, we propose a mixing strategy that leverages available arbitrary models to improve their individual performances. The proposed method is computationally efficient and almost tuning-free; thus, it can be used as an off-the-shelf method for network modeling. We show that the proposed method performs equally well as the oracle estimate when the true model is included as individual candidates. More importantly, the method remains robust and outperforms all current estimates even when the models are misspecified. Extensive simulation examples are used to verify the advantage of the proposed mixing method. Evaluation of link prediction performance on 385 real-world networks from six domains also demonstrates the universal competitiveness of the mixing method across multiple domains.
Tight Lower Bound for the RMR Complexity of Recoverable Mutual Exclusion

We present a tight RMR complexity lower bound for the recoverable mutual exclusion (RME) problem, defined by Golab and Ramaraju [9]. In particular, we show that any n-process RME algorithm using only atomic read, write, fetch-and-store, fetch-and-increment, and compare-and-swap operations, has an RMR complexity of Ω(log n/log log n) on the CC and DSM model. This lower bound covers all realistic synchronization primitives that have been used in RME algorithms and matches the best upper bounds of algorithms employing swap objects (e.g.,[6,7,11]). Algorithms with better RMR complexity than that have only been obtained by either(i) assuming that all failures are system-wide [8], (ii) employing fetch-and-add objects of size (log n)ω;(1) [13], or (iii) using artificially defined synchronization primitives that are not available in actual systems [7, 10].
Unbiased Self-Play

We present a general optimization framework for emergent belief-state representation without any supervision. We employed the common conﬁguration of multiagent reinforcement learning and communication to improve exploration coverage over an environment by leveraging the knowledge of each agent. In this paper, we obtained that recurrent neural nets (RNNs) with shared weights are highly biased in partially observable environments because of their noncooperativity. To address this, we designated an unbiased version of self-play via mechanism design, also known as reverse game theory , to clarify unbiased knowledge at the Bayesian Nash equilibrium. The key idea is to add imaginary rewards using the peer prediction mechanism (Miller et al., 2005), i.e., a mechanism for mutually criticizing information in a decentralized environment. Numerical analyses, including StarCraft exploration tasks with up to 20 agents and off-the-shelf RNNs, demonstrate the state-of-the-art performance.
Simulating a measurement-induced phase transition for trapped-ion circuits

The rise of programmable quantum devices has motivated the exploration of circuit models which could realize novel physics. A promising candidate is a class of hybrid circuits, where entangling unitary dynamics compete with disentangling measurements. Novel phase transitions between different entanglement regimes have been identified in their dynamical states, with universal properties hinting at unexplored critical phenomena. Trapped ion hardware is a leading contender for the experimental realization of such physics, which requires not only traditional two-qubit entangling gates, but a constant rate of local measurements accurately addressed throughout the circuit. Recent progress in engineering high-precision optical addressing of individual ions makes preparing a constant rate of measurements throughout a unitary circuit feasible. Using tensor network simulations, we show that the resulting class of hybrid circuits, prepared with native gates, exhibits a volume-law to area-law transition in the entanglement entropy. This displays universal hallmarks of a measurement-induced phase transition. Our simulations are able to characterize the critical exponents using circuit sizes with tens of qubits and thousands of gates. We argue that this transition should be robust against additional sources of experimental noise expected in modern trapped ion hardware, and will rather be limited by statistical requirements on post selection. Our work highlights the powerful role that tensor network simulations can play in advancing the theoretical and experimental frontiers of critical phenomena.
Optimal transmit power and antenna selection to achieve energy-efficient and low-complexity in 5G massive MIMO systems

This paper investigates joint antenna selection and optimal transmit power in multi cell massive multiple input multiple output systems. The pilot interference and activated transmit antenna selection plays an essential role in maximizing energy efficiency. We derived the closed-form of maximal energy efficiency with complete knowledge of large-scale fading with maximum ratio transmission while accounting for channel estimation and eliminated pilot contamination when the antennas approach infinity. We investigated joint optimal antenna selection and optimal transmit power under minimized reuse of pilot sequences based on a novel iterative low-complexity algorithm for Lagrange multiplayer and Newton methods. The two scenarios of achievable high data rate and total transmit power allocation are critical to the performance maximal energy efficiency. We propose new power consumption for each antenna based on the transmit power amplifier and circuit power consumption to analyze exact power consumption. The simulation results show that maximal energy efficiency could be achieved using the iterative low complexity algorithm based on the reasonable maximum transmit power when the noise power was less than the power received pilot. The proposed low complexity iterative algorithm offers maximum energy efficiency by repeating a minimized pilot signal until the optimal antenna selection and transmission power are achieved.
Multi-agent Battery Storage Management using MPC-based Reinforcement Learning

In this paper, we present the use of Model Predictive Control (MPC) based on Reinforcement Learning (RL) to find the optimal policy for a multi-agent battery storage system. A time-varying prediction of the power price and production-demand uncertainty are considered. We focus on optimizing an economic objective cost while avoiding very low or very high state of charge, which can damage the battery. We consider the bounded power provided by the main grid and the constraints on the power input and state of each agent. A parametrized MPC-scheme is used as a function approximator for the deterministic policy gradient method and RL optimizes the closed-loop performance by updating the parameters. Simulation results demonstrate that the proposed method is able to tackle the constraints and deliver the optimal policy.
Extracting Weighted Automata for Approximate Minimization in Language Modelling

In this paper we study the approximate minimization problem for language modelling. We assume we are given some language model as a black box. The objective is to obtain a weighted finite automaton (WFA) that fits within a given size constraint and which mimics the behaviour of the original model while minimizing some notion of distance between the black box and the extracted WFA. We provide an algorithm for the approximate minimization of black boxes trained for language modelling of sequential data over a one-letter alphabet. By reformulating the problem in terms of Hankel matrices, we leverage classical results on the approximation of Hankel operators, namely the celebrated Adamyan-Arov-Krein (AAK) theory. This allows us to use the spectral norm to measure the distance between the black box and the WFA. We provide theoretical guarantees to study the potentially infinite-rank Hankel matrix of the black box, without accessing the training data, and we prove that our method returns an asymptotically-optimal approximation.