Miracle-dz/UniFAR-FTUs huggingface dataset:
Hierarchical Deep Reinforcement Learning for VWAP Strategy Optimization

Designing an intelligent volume-weighted average price (VWAP) strategy is a critical concern for brokers, since traditional rule-based strategies are relatively static that cannot achieve a lower transaction cost in a dynamic market. Many studies have tried to minimize the cost via reinforcement learning, but there are bottlenecks in improvement, especially for long-duration strategies such as the VWAP strategy. To address this issue, we propose a deep learning and hierarchical reinforcement learning jointed architecture termed Macro-Meta-Micro Trader (M3T) to capture market patterns and execute orders from different temporal scales. The Macro Trader first allocates a parent order into tranches based on volume profiles as the traditional VWAP strategy does, but a long short-term memory neural network is used to improve the forecasting accuracy. Then the Meta Trader selects a short-term subgoal appropriate to instant liquidity within each tranche to form a mini-tranche. The Micro Trader consequently extracts the instant market state and fulfils the subgoal with the lowest transaction cost. Our experiments over stocks listed on the Shanghai stock exchange demonstrate that our approach outperforms baselines in terms of VWAP slippage, with an average cost saving of 1.16 base points compared to the optimal baseline.
1st Place Solution for YouTubeVOS Challenge 2022: Referring Video Object Segmentation

The task of referring video object segmentation aims to segment the object in the frames of a given video to which the referring expressions refer. Previous methods adopt multi-stage approach and design complex pipelines to obtain promising results. Recently, the end-to-end method based on Transformer has proved its superiority. In this work, we draw on the advantages of the above methods to provide a simple and effective pipeline for RVOS. Firstly, We improve the state-of-the-art one-stage method ReferFormer to obtain mask sequences that are strongly correlated with language descriptions. Secondly, based on a reliable and high-quality keyframe, we leverage the supe-rior performance of video object segmentation model to further enhance the quality and temporal consistency of the mask results. Our single model reaches 70.3 J & F on the Referring Youtube-VOS validation set and 63.0 on the test set. After ensemble, we achieve 64.1 on the ﬁnal leaderboard, ranking 1st place on CVPR2022 Referring Youtube-VOS challenge. Code will be available at https://github.com/Zhiweihhh/cvpr2022-rvos-challenge.git .
System Log Parsing: A Survey

Modern information and communication systems have become increasingly challenging to manage. The ubiquitous system logs contain plentiful information and are thus widely exploited as an alternative source for system management. As log files usually encompass large amounts of raw data, manually analyzing them is laborious and error-prone. Consequently, many research endeavors have been devoted to automatic log analysis. However, these works typically expect structured input and struggle with the heterogeneous nature of raw system logs. Log parsing closes this gap by converting the unstructured system logs to structured records. Many parsers were proposed during the last decades to accommodate various log analysis applications. However, due to the ample solution space and lack of systematic evaluation, it is not easy for practitioners to find ready-made solutions that fit their needs. This paper aims to provide a comprehensive survey on log parsing. We begin with an exhaustive taxonomy of existing log parsers. Then we empirically analyze the critical performance and operational features for 17 open-source solutions both quantitatively and qualitatively, and whenever applicable discuss the merits of alternative approaches. We also elaborate on future challenges and discuss the relevant research directions. We envision this survey as a helpful resource for system administrators and domain experts to choose the most desirable open-source solution or implement new ones based on application-specific requirements.
Identification of the Pollution Source by Using a Semi-Discretization Approach

This article Considers an inverse problem for identifying a pollution source in a watershed. The pollution concentration is governed by a linear advection-dispersion-reaction equation with a point pollution source modeled by the Dirac function. Firstly, a system of first-order ordinary differential equations is obtained by using the semi-discretization approach and the approximation of the Dirac function. Then the location of the point source is identified from the measurements. Secondly, the numerical scheme is established for recovering the strength of pollution based on the above semi-discretization scheme and the location of the point source. Thirdly, the error analysis was investigated from two aspects: both the semi-discretization and the approximation of the Dirac function. At last, the numerical results show that the presented method is effective.
Voices of Workers: Why a Worker-Centered Approach to Crowd Work Is Challenging

How can we better understand the broad, diverse, shifting, and invisible crowd workforce, so that we can better support it? We present findings from online observations and analysis of publicly available postings from a community forum of crowd workers. In particular, we observed recurring tensions between crowd workers and journalists regarding media depictions of crowd work. We found that crowd diversity makes any one-dimensional representation inadequate in addressing the wide-ranging experiences of crowd work. We argue that the scale, diversity, invisibility, and the crowds' resistance to publicity make a worker-centered approach to crowd work particularly challenging, necessitating better understanding the diversity of workers and their lived experiences.
A Combined Method for Concentric Circles Detection in Image of O-Shape Rubber Ring

Traditional Hough transform (HT) methods based on parameters decomposition do not give good result for concentric circle detection, for the reasons of its large amount of calculations, high demand of storage space and low efficiency in real-time application. To compensate the weaknesses, this paper employs a kind of improved Hough transform method which aims at reducing the parameters space. In this paper, the detection method is further improved through adding an edge detection procedure based on global threshold. The experimental results show that this algorithm meets the on-line detection of high accuracy requirement, with superior real-time performance and stronger anti-interference ability.
ExReg: Wide-range Photo Exposure Correction via a Multi-dimensional Regressor with Attention

Photo exposure correction is widely investigated, but fewer studies focus on correcting under and over-exposed images simultaneously. Three issues remain open to handle and correct under and over-exposed images in a unified way. First, a locally-adaptive exposure adjustment may be more flexible instead of learning a global mapping. Second, it is an ill-posed problem to determine the suitable exposure values locally. Third, photos with the same content but different exposures may not reach consistent adjustment results. To this end, we proposed a novel exposure correction network, ExReg, to address the challenges by formulating exposure correction as a multi-dimensional regression process. Given an input image, a compact multi-exposure generation network is introduced to generate images with different exposure conditions for multi-dimensional regression and exposure correction in the next stage. An auxiliary module is designed to predict the region-wise exposure values, guiding the mainly proposed Encoder-Decoder ANP (Attentive Neural Processes) to regress the final corrected image. The experimental results show that ExReg can generate well-exposed results and outperform the SOTA method by 1.3dB in PSNR for extensive exposure problems. In addition, given the same image but under various exposure for testing, the corrected results are more visually consistent and physically accurate.
Finding similarity of orbits between two discrete dynamical systems via optimal principle

Whether there is similarity between two physical processes in the movement of objects and the complexity of behavior is an essential problem in science. How to seek similarity through the adoption of quantitative and qualitative research techniques still remains an urgent challenge we face. To this end, the concepts of similarity transformation matrix and similarity degree are innovatively introduced to describe similarity of orbits between two complicated discrete dynamical systems that seem to be irrelevant. Furthermore, we present a general optimal principle, giving a strict characterization from the perspective of dynamical systems combined with optimization theory. For well-known examples of chaotic dynamical systems, such as Lorenz attractor, Chua's circuit, R$\rm\ddot{o}$ssler attractor, Chen attractor, L$\rm\ddot{u}$ attractor and hybrid system, with using of the homotopy idea, some numerical simulation results demonstrate that similarity can be found in rich characteristics and complex behaviors of chaotic dynamics via the optimal principle we presented.
Local Learning on Transformers via Feature Reconstruction

Transformers are becoming increasingly popular due to their superior performance over conventional convolutional neural networks(CNNs). However, transformers usually require a much larger amount of memory to train than CNNs, which prevents their application in many low resource settings. Local learning, which divides the network into several distinct modules and trains them individually, is a promising alternative to the end-to-end (E2E) training approach to reduce the amount of memory for training and to increase parallelism. This paper is the first to apply Local Learning on transformers for this purpose. The standard CNN-based local learning method, InfoPro [32], reconstructs the input images for each module in a CNN. However, reconstructing the entire image does not generalize well. In this paper, we propose a new mechanism for each local module, where instead of reconstructing the entire image, we reconstruct its input features, generated from previous modules. We evaluate our approach on 4 commonly used datasets and 3 commonly used decoder structures on Swin-Tiny. The experiments show that our approach outperforms InfoPro-Transformer, the InfoPro with Transfomer backbone we introduced, by at up to 0.58% on CIFAR-10, CIFAR-100, STL-10 and SVHN datasets, while using up to 12% less memory. Compared to the E2E approach, we require 36% less GPU memory when the network is divided into 2 modules and 45% less GPU memory when the network is divided into 4 modules.
Controllable Mechanical-domain Energy Accumulators

Springs are efficient in storing and returning elastic potential energy but are unable to hold the energy they store in the absence of an external load. Lockable springs use clutches to hold elastic potential energy in the absence of an external load, but have not yet been widely adopted in applications, partly because clutches introduce design complexity, reduce energy efficiency, and typically do not afford high fidelity control over the energy stored by the spring. Here, we present the design of a novel lockable compression spring that uses a small capstan clutch to passively lock a mechanical spring. The capstan clutch can lock over 1000 N force at any arbitrary deflection, unlock the spring in less than 10 ms with a control force less than 1% of the maximal spring force, and provide an 80% energy storage and return efficiency (comparable to a highly efficient electric motor operated at constant nominal speed). By retaining the form factor of a regular spring while providing high-fidelity locking capability even under large spring forces, the proposed design could facilitate the development of energy-efficient spring-based actuators and robots.
Resolution recovery on list mode MLEM reconstruction for dynamic cardiac SPECT system

The Dynamic Cardiac SPECT (DC-SPECT) system is being developed at the Massachusetts General Hospital, featuring a static cardio focus asymmetrical geometry enabling simultaneous high-resolution and high-sensitivity imaging. Among 14 design iterations of the DC-SPECT with varying number of detector heads, system sensitivity and resolution, the current version under development features 10 mm FWHM geometrical resolution (without resolution recovery) and 0.07% sensitivity at the center of the FOV, this is 1.5× resolution gain and 7× sensitivity gain compared to a conventional dual head gamma camera (0.01% sensitivity and 15-mm resolution). This work presents improvement in imaging resolution by implementing a spatially variant point spread function (SV-PSF) with list mode MLEM reconstruction. A resolution recovery method by PSF deconvolution is validated on list mode MLEM reconstruction for the DC-SPECT. A spatial invariant PSF is included as an additional test to show the influence of the PSF modelling accuracy on reconstructed image quality. We compare the MLEM reconstruction with and without PSF deconvolution; an analytic model is used for the calculation of system response, and the results are compared to the reconstruction with system modelling using Monte Carlo (MC) based methods. Results show that with PSF modelling applied, the quality of the reconstructed image is improved, and the DC-SPECT system can achieve a 4.5 mm central spatial resolution with average 795 counts/Mbq. Both the SV-PSF and the spatial-invariant PSF improve the image quality, and the reconstruction with SV-PSF generates line profiles closer to the ground truth. The results show substantial improvement over the GE Discovery 570c performance (7 mm spatial resolution with an average 460 counts/MBq, 5.8 mm resolution at the FOV center). The impact of PSF deconvolution is significant, improvement of the reconstructed image quality is evident in comparison to MC simulated system matrix with the same sampling size in the simulation.
Visual CPG-RL: Learning Central Pattern Generators for Visually-Guided Quadruped Navigation

—In this paper, we present a framework for learning quadruped navigation by integrating central pattern generators (CPGs), i.e. systems of coupled oscillators, into the deep reinforcement learning (DRL) framework. Through both exteroceptive and proprioceptive sensing, the agent learns to modulate the intrinsic oscillator setpoints (amplitude and frequency) and coordinate rhythmic behavior among different oscillators to track velocity commands while avoiding collisions with the environment. We compare different neural network architectures (i.e. memory-free and memory-enabled) which learn implicit interoscillator couplings, as well as varying the strength of the explicit coupling weights in the oscillator dynamics equations. We train our policies in simulation and perform a sim-to-real transfer to the Unitree Go1 quadruped, where we observe robust navigation in a variety of scenarios. Our results show that both memory-enabled policy representations and explicit interoscillator couplings are beneﬁcial for a successful sim-to-real transfer for navigation tasks. Video results can be found at https://youtu.be/O_LX1oLZOe0 .
Conflict Avoidance in Social Navigation - a Survey

A major goal in robotics is to enable intelligent mobile robots to operate smoothly in shared human-robot environments. One of the most fundamental capabilities in service of this goal is competent navigation in this “social” context. As a result, there has been a recent surge of research on social navigation; and especially as it relates to the handling of conflicts between agents during social navigation. These developments introduce a variety of models and algorithms, however as this research area is inherently interdisciplinary, many of the relevant papers are not comparable and there is no shared standard vocabulary. This survey aims to bridge this gap by introducing such a common language, using it to survey existing work, and highlighting open problems. It starts by defining the boundaries of this survey to a limited, yet highly common type of social navigation – conflict avoidance. Within this proposed scope, this survey introduces a detailed taxonomy of the conflict avoidance components. This survey then maps existing work into this taxonomy, while discussing papers using its framing. Finally, this paper proposes some future research directions and open problems that are currently on the frontier of social navigation to aid ongoing and future research.
Unsupervised Open Domain Recognition by Semantic Discrepancy Minimization

We address the unsupervised open domain recognition (UODR) problem, where categories in labeled source domain S is only a subset of those in unlabeled target domain T. The task is to correctly classify all samples in T including known and unknown categories. UODR is challenging due to the domain discrepancy, which becomes even harder to bridge when a large number of unknown categories exist in T. Moreover, the classification rules propagated by graph CNN (GCN) may be distracted by unknown categories and lack generalization capability. To measure the domain discrepancy for asymmetric label space between S and T, we propose Semantic-Guided Matching Discrepancy (SGMD), which first employs instance matching between S and T, and then the discrepancy is measured by a weighted feature distance between matched instances. We further design a limited balance constraint to achieve a more balanced classification output on known and unknown categories. We develop Unsupervised Open Domain Transfer Network (UODTN), which learns both the backbone classification network and GCN jointly by reducing the SGMD, enforcing the limited balance constraint and minimizing the classification loss on S. UODTN better preserves the semantic structure and enforces the consistency between the learned domain invariant visual features and the semantic embeddings. Experimental results show superiority of our method on recognizing images of both known and unknown categories.
PRISM Privacy Preserving Internet of Things Security Management

Consumer healthcare applications are gaining increasing popularity in our homes and hospitals. These devices provide continuous monitoring at a low cost and can be used to augment high-precision medical devices. The majority of these devices aim topro-vide anomaly detection for the users while aiming to provide data privacy and security by design using edge computing. However, major challenges remain in applying pre-trained global models on smart health monitoring devices, for a diverse set of individuals that they provide care for. In this paper, we propose PRISM, an edge-based system for in-home smart healthcare anomaly detection. We develop and release a rigorous methodology that relies on automated IoT anomaly experimentation. We use a rich, highly granular real-world dataset from in-home patient monitoring from 44 homes of people living with dementia (PLWD) over two years. Our results indicate that the anomalies can be identiﬁed with accuracy up to 99% and mean training times as low as 0.88 seconds. While all models achieve high accuracy when trained on the same patient, their accuracy degrades when evaluated on diﬀerent patients.
HPointLoc: Point-based Indoor Place Recognition using Synthetic RGB-D Images

We present a novel dataset named as HPointLoc, specially designed for exploring capabilities of visual place recognition in indoor environment and loop detection in simultaneous localization and mapping. The loop detection sub-task is especially relevant when a robot with an on-board RGB-D camera can drive past the same place (``Point") at different angles. The dataset is based on the popular Habitat simulator, in which it is possible to generate photorealistic indoor scenes using both own sensor data and open datasets, such as Matterport3D. To study the main stages of solving the place recognition problem on the HPointLoc dataset, we proposed a new modular approach named as PNTR. It first performs an image retrieval with the Patch-NetVLAD method, then extracts keypoints and matches them using R2D2, LoFTR or SuperPoint with SuperGlue, and finally performs a camera pose optimization step with TEASER++. Such a solution to the place recognition problem has not been previously studied in existing publications. The PNTR approach has shown the best quality metrics on the HPointLoc dataset and has a high potential for real use in localization systems for unmanned vehicles. The proposed dataset and framework are publicly available: https://github.com/metra4ok/HPointLoc.
MAUVE Scores for Generative Models: Theory and Practice

Generative artificial intelligence has made significant strides, producing text indistinguishable from human prose and remarkably photorealistic images. Automatically measuring how close the generated data distribution is to the target distribution is central to diagnosing existing models and developing better ones. We present MAUVE, a family of comparison measures between pairs of distributions such as those encountered in the generative modeling of text or images. These scores are statistical summaries of divergence frontiers capturing two types of errors in generative modeling. We explore three approaches to statistically estimate these scores: vector quantization, non-parametric estimation, and classifier-based estimation. We provide statistical bounds for the vector quantization approach. Empirically, we find that the proposed scores paired with a range of $f$-divergences and statistical estimation methods can quantify the gaps between the distributions of human-written text and those of modern neural language models by correlating with human judgments and identifying known properties of the generated texts. We demonstrate in the vision domain that MAUVE can identify known properties of generated images on par with or better than existing metrics. In conclusion, we present practical recommendations for using MAUVE effectively with language and image modalities.
Join the Fold: Video Games, Science Fiction, and the Refolding of Citizen Science

Abstract This article explores the value of science fiction narratives in games for citizen science. Focusing on the protein-folding game Foldit, it describes the process of modifying and redesigning the game to feature a framing narrative and other alterations to the main tutorial campaign. The campaign narrative, Foldit: First Contact, situates the practices of citizen science in an expanded context of meanings and ethical implications, promoting critical self-reflection on the relations of science and civic values. A study of player responses to Foldit: First Contact suggests the significance of science fiction and critical game design for attuning citizen scientists to the collective responsibilities of experimentation and innovation, drawing attention to the intersecting social, technical, and environmental domains in which gamers may contribute to scientific research.