OpenRaiser/Intern-Atlas huggingface dataset:
Optimal Slicing of Virtualised Passive Optical Networks to Support Dense Deployment of Cloud-RAN and Multi-Access Edge Computing
Venue: arXiv cs.NI 2022
Year: 2022

The commercialization of Cloud-RAN, and Open-RAN in particular, is a key factor to enable 5G cell densification, by providing lower cost and more agile deployment of small cells. In addition, the adoption of MEC is important to support ultra-low latency and high reliability required by mission-critical applications, which constitute a milestone of the 5G and beyond vision of a fully connected society. However, connecting antenna site, C-RAN processing and MEC at low cost is challenging, as it requires high-capacity, low latency connectivity delivered through a highly inter-connected topology. While PON is being considered as a solution for providing low-cost connectivity to C-RAN, they only allow data transmission from the endpoints (for example hosting RU at the antenna site) towards a central node (e.g., the central office, hosting computing equipment), thus cannot support traffic from RU towards MEC end nodes that could host DU and possibly CU and network core. This led to research into the evolution of PON architectures with the ability to provide direct communications between endpoints, thus supporting mesh traffic patterns required by MEC installations. In this context, virtualization plays a key role in enabling efficient resource allocation (i.e. optical transmission capacity) to endpoints, according to their communication patterns. In this article, we address the challenge of dynamic allocation of virtual PON slices over mesh-PON architectures to support C-RAN and MEC nodes. We make use of a mixed analytical-iterative model to compute optimal virtual PON slice allocation, with the objective of minimizing the use of MEC node resources, while meeting a target latency threshold (100 $μs$ in our scenario). Our method is particularly effective in reducing computation time, enabling virtual PON slice allocation in timescales compatible with real-time or near real-time operations.
Bibliometric Profile of an Emerging Journal: Participatory Educational Research
Venue: arXiv cs.DL 2022
Year: 2022

Participatory Educational Research journal is one of the journals that contributes to the field of education and indexed in major international databases such as ERIC and Scopus.This study provides the bibliometric characteristic of the total 347 articles published in PER during the period of 2014-2021 using bibliometric analysis. Publish or Perish software to collect citation data from Google Scholar was used as an analysis instrument for the impact of the articles.
Focal Modulation Networks
Venue: arXiv cs.CV 2022
Year: 2022

We propose focal modulation networks (FocalNets in short), where self-attention (SA) is completely replaced by a focal modulation mechanism for modeling token interactions in vision. Focal modulation comprises three components: (i) hierarchical contextualization, implemented using a stack of depth-wise convolutional layers, to encode visual contexts from short to long ranges, (ii) gated aggregation to selectively gather contexts for each query token based on its content, and (iii) element-wise modulation or affine transformation to inject the aggregated context into the query. Extensive experiments show FocalNets outperform the state-of-the-art SA counterparts (e.g., Swin and Focal Transformers) with similar computational costs on the tasks of image classification, object detection, and segmentation. Specifically, FocalNets with tiny and base size achieve 82.3% and 83.9% top-1 accuracy on ImageNet-1K. After pretrained on ImageNet-22K in 224 resolution, it attains 86.5% and 87.3% top-1 accuracy when finetuned with resolution 224 and 384, respectively. When transferred to downstream tasks, FocalNets exhibit clear superiority. For object detection with Mask R-CNN, FocalNet base trained with 1\times outperforms the Swin counterpart by 2.1 points and already surpasses Swin trained with 3\times schedule (49.0 v.s. 48.5). For semantic segmentation with UPerNet, FocalNet base at single-scale outperforms Swin by 2.4, and beats Swin at multi-scale (50.5 v.s. 49.7). Using large FocalNet and Mask2former, we achieve 58.5 mIoU for ADE20K semantic segmentation, and 57.9 PQ for COCO Panoptic Segmentation. Using huge FocalNet and DINO, we achieved 64.3 and 64.4 mAP on COCO minival and test-dev, respectively, establishing new SoTA on top of much larger attention-based models like Swinv2-G and BEIT-3. Code and checkpoints are available at https://github.com/microsoft/FocalNet.
CM-GAN: Image Inpainting with Cascaded Modulation GAN and Object-Aware Training
Venue: arXiv cs.CV 2022
Year: 2022

Recent image inpainting methods have made great progress but often struggle to generate plausible image structures when dealing with large holes in complex images. This is partially due to the lack of effective network structures that can capture both the long-range dependency and high-level semantics of an image. We propose cascaded modulation GAN (CM-GAN), a new network design consisting of an encoder with Fourier convolution blocks that extract multi-scale feature representations from the input image with holes and a dual-stream decoder with a novel cascaded global-spatial modulation block at each scale level. In each decoder block, global modulation is first applied to perform coarse and semantic-aware structure synthesis, followed by spatial modulation to further adjust the feature map in a spatially adaptive fashion. In addition, we design an object-aware training scheme to prevent the network from hallucinating new objects inside holes, fulfilling the needs of object removal tasks in real-world scenarios. Extensive experiments are conducted to show that our method significantly outperforms existing methods in both quantitative and qualitative evaluation. Please refer to the project page: \url{https://github.com/htzheng/CM-GAN-Inpainting}.
Learning Geodesic-Aware Local Features from RGB-D Images
Venue: arXiv cs.CV 2022
Year: 2022

Most of the existing handcrafted and learning-based local descriptors are still at best approximately invariant to affine image transformations, often disregarding deformable surfaces. In this paper, we take one step further by proposing a new approach to compute descriptors from RGB-D images (where RGB refers to the pixel color brightness and D stands for depth information) that are invariant to isometric non-rigid deformations, as well as to scale changes and rotation. Our proposed description strategies are grounded on the key idea of learning feature representations on undistorted local image patches using surface geodesics. We design two complementary local descriptors strategies to compute geodesic-aware features efficiently: one efficient binary descriptor based on handcrafted binary tests (named GeoBit), and one learning-based descriptor (GeoPatch) with convolutional neural networks (CNNs) to compute features. In different experiments using real and publicly available RGB-D data benchmarks, they consistently outperforms state-of-the-art handcrafted and learning-based image and RGB-D descriptors in matching scores, as well as in object retrieval and non-rigid surface tracking experiments, with comparable processing times. We also provide to the community a new dataset with accurate matching annotations of RGB-D images of different objects (shirts, cloths, paintings, bags), subjected to strong non-rigid deformations, for evaluation benchmark of deformable surface correspondence algorithms.
MemComputing vs. Quantum Computing: some analogies and major differences
Venue: arXiv cs.ET 2022
Year: 2022

Quantum computing employs some quantum phenomena to process information. It has been hailed as the future of computing but it is plagued by serious hurdles when it comes to its practical realization. MemComputing is a new paradigm that instead employs non-quantum dynamical systems and exploits time non-locality (memory) to compute. It can be efficiently emulated in software and its path towards hardware is more straightforward. I will discuss some analogies between these two computing paradigms, and the major differences that set them apart.
Disentangling high-order mechanisms and high-order behaviours in complex systems
Venue: arXiv cs.IT 2022
Year: 2022

Battiston et al. (arXiv:2110.06023) provide a comprehensive overview of how investigations of complex systems should take into account interactions between more than two elements, which can be modelled by hypergraphs and studied via topological data analysis. Following a separate line of enquiry, a broad literature has developed information-theoretic tools to characterize high-order interdependencies from observed data. While these could seem to be competing approaches aiming to address the same question, in this correspondence we clarify that this is not the case, and that a complete account of higher-order phenomena needs to embrace both.
Mouse Sensitivity Effects in First-Person Targeting Tasks
Venue: arXiv cs.HC 2022
Year: 2022

Despite billions of hours of play and copious discussion online, mouse sensitivity recommendations for first-person targeting tasks vary by a factor of 10x or more and remain an active topic of debate in both competitive and recreational gaming communities. Inspired by previous academic literature in pointer-based gain optimization, we conduct the first user study of mouse sensitivity in first person targeting tasks, reporting a statistically significant range of optimal values in both task completion time and throughput. Due to inherent incompatibility (i.e., lack of convert-ability) between sensitivity metrics adopted for prior pointer-based gain literature and those describing first-person targeting, we provide the first analytically demonstrated, statistically significant optimal sensitivity range useful for first-person camera controls. Furthermore, we demonstrate that this optimal sensitivity range arises (at least in part) from a speed-precision trade-off impacted by spatial task difficulty, similar to results reported in pointer-based sensitivity literature previously.
On Last-Iterate Convergence Beyond Zero-Sum Games
Venue: arXiv cs.GT 2022
Year: 2022

Most existing results about \emph{last-iterate convergence} of learning dynamics are limited to two-player zero-sum games, and only apply under rigid assumptions about what dynamics the players follow. In this paper we provide new results and techniques that apply to broader families of games and learning dynamics. First, we use a regret-based analysis to show that in a class of games that includes constant-sum polymatrix and strategically zero-sum games, dynamics such as \emph{optimistic mirror descent (OMD)} have \emph{bounded second-order path lengths}, a property which holds even when players employ different algorithms and prediction mechanisms. This enables us to obtain $O(1/\sqrt{T})$ rates and optimal $O(1)$ regret bounds. Our analysis also reveals a surprising property: OMD either reaches arbitrarily close to a Nash equilibrium, or it outperforms the \emph{robust price of anarchy} in efficiency. Moreover, for potential games we establish convergence to an $ε$-equilibrium after $O(1/ε^2)$ iterations for mirror descent under a broad class of regularizers, as well as optimal $O(1)$ regret bounds for OMD variants. Our framework also extends to near-potential games, and unifies known analyses for distributed learning in Fisher's market model. Finally, we analyze the convergence, efficiency, and robustness of \emph{optimistic gradient descent (OGD)} in general-sum continuous games.
Risk-averse design of tall buildings for uncertain wind conditions
Venue: arXiv cs.CE 2022
Year: 2022

Reducing the intensity of wind excitation via aerodynamic shape modification is a major strategy to mitigate the reaction forces on supertall buildings, reduce construction and maintenance costs, and improve the comfort of future occupants. To this end, computational fluid dynamics (CFD) combined with state-of-the-art stochastic optimization algorithms is more promising than the trial and error approach adopted by the industry. The present study proposes and investigates a novel approach to risk-averse shape optimization of tall building structures that incorporates site-specific uncertainties in the wind velocity, terrain conditions, and wind flow direction. A body-fitted finite element approximation is used for the CFD with different wind directions incorporated by re-meshing the fluid domain. The bending moment at the base of the building is minimized, resulting in a building with reduced cost, material, and hence, a reduced carbon footprint. Both risk-neutral and risk-averse optimization of the twist and tapering of a representative building are presented under uncertain inflow wind conditions that have been calibrated to fit freely-available site-specific data from Basel, Switzerland. The risk-averse strategy uses the conditional value-at-risk to optimize for the low-probability high-consequence events appearing in the worst 10% of loading conditions. Adaptive sampling is used to accelerate the gradient-based stochastic optimization pipeline. The adaptive method is easy to implement and particularly helpful for compute-intensive simulations because the number of gradient samples grows only as the optimal design algorithm converges. The performance of the final risk-averse building geometry is exceptionally favorable when compared to the risk-neutral optimized geometry, thus, demonstrating the effectiveness of the risk-averse design approach in computational wind engineering.
WayFAST: Navigation with Predictive Traversability in the Field
Venue: arXiv cs.RO 2022
Year: 2022

We present a self-supervised approach for learning to predict traversable paths for wheeled mobile robots that require good traction to navigate. Our algorithm, termed WayFAST (Waypoint Free Autonomous Systems for Traversability), uses RGB and depth data, along with navigation experience, to autonomously generate traversable paths in outdoor unstructured environments. Our key inspiration is that traction can be estimated for rolling robots using kinodynamic models. Using traction estimates provided by an online receding horizon estimator, we are able to train a traversability prediction neural network in a self-supervised manner, without requiring heuristics utilized by previous methods. We demonstrate the effectiveness of WayFAST through extensive field testing in varying environments, ranging from sandy dry beaches to forest canopies and snow covered grass fields. Our results clearly demonstrate that WayFAST can learn to avoid geometric obstacles as well as untraversable terrain, such as snow, which would be difficult to avoid with sensors that provide only geometric data, such as LiDAR. Furthermore, we show that our training pipeline based on online traction estimates is more data-efficient than other heuristic-based methods.
FxP-QNet: A Post-Training Quantizer for the Design of Mixed Low-Precision DNNs with Dynamic Fixed-Point Representation
Venue: arXiv cs.NE 2022
Year: 2022

Deep neural networks (DNNs) have demonstrated their effectiveness in a wide range of computer vision tasks, with the state-of-the-art results obtained through complex and deep structures that require intensive computation and memory. Now-a-days, efficient model inference is crucial for consumer applications on resource-constrained platforms. As a result, there is much interest in the research and development of dedicated deep learning (DL) hardware to improve the throughput and energy efficiency of DNNs. Low-precision representation of DNN data-structures through quantization would bring great benefits to specialized DL hardware. However, the rigorous quantization leads to a severe accuracy drop. As such, quantization opens a large hyper-parameter space at bit-precision levels, the exploration of which is a major challenge. In this paper, we propose a novel framework referred to as the Fixed-Point Quantizer of deep neural Networks (FxP-QNet) that flexibly designs a mixed low-precision DNN for integer-arithmetic-only deployment. Specifically, the FxP-QNet gradually adapts the quantization level for each data-structure of each layer based on the trade-off between the network accuracy and the low-precision requirements. Additionally, it employs post-training self-distillation and network prediction error statistics to optimize the quantization of floating-point values into fixed-point numbers. Examining FxP-QNet on state-of-the-art architectures and the benchmark ImageNet dataset, we empirically demonstrate the effectiveness of FxP-QNet in achieving the accuracy-compression trade-off without the need for training. The results show that FxP-QNet-quantized AlexNet, VGG-16, and ResNet-18 reduce the overall memory requirements of their full-precision counterparts by 7.16x, 10.36x, and 6.44x with less than 0.95%, 0.95%, and 1.99% accuracy drop, respectively.
Hardware Watermarking for Finite State Machines, with Symmetric Circuit Encryption
Venue: arXiv cs.CR 2022
Year: 2022

Putting a watermark into digital circuitry has its own set of challenges. Creating a secure watermark in printed matter usually involves including graphics that are difficult to reproduce. In circuitry, including additional circuitry that is hard to produce, one must contend with the prospect of increasing power consumption of the circuit, decreasing the speed of the circuit, and introducing watermark circuitry that is easily reproduced. In this paper we present a watermark method for sequential circuitry. It allows for several degrees of calibration, allowing the user to tune the complexity of the watermark to requirements of speed, power, and efficacy. Our method uses an encryption technique to introduce secrets about the watermark circuit, at several levels. It also employs a boundary scan testing protocol as a means to protect the watermark circuitry. Our discussion starts by describing the different tools needed in our watermark scheme. We then discuss the difficulty of the problem associated with cracking our watermark circuit. This analysis shows that, with full implementation, our method can be made quite secure.
Music Generation Using an LSTM
Venue: arXiv cs.SD 2022
Year: 2022

Over the past several years, deep learning for sequence modeling has grown in popularity. To achieve this goal, LSTM network structures have proven to be very useful for making predictions for the next output in a series. For instance, a smartphone predicting the next word of a text message could use an LSTM. We sought to demonstrate an approach of music generation using Recurrent Neural Networks (RNN). More specifically, a Long Short-Term Memory (LSTM) neural network. Generating music is a notoriously complicated task, whether handmade or generated, as there are a myriad of components involved. Taking this into account, we provide a brief synopsis of the intuition, theory, and application of LSTMs in music generation, develop and present the network we found to best achieve this goal, identify and address issues and challenges faced, and include potential future improvements for our network.
Muscle Vision: Real Time Keypoint Based Pose Classification of Physical Exercises
Venue: arXiv cs.AI 2022
Year: 2022

Recent advances in machine learning technology have enabled highly portable and performant models for many common tasks, especially in image recognition. One emerging field, 3D human pose recognition extrapolated from video, has now advanced to the point of enabling real-time software applications with robust enough output to support downstream machine learning tasks. In this work we propose a new machine learning pipeline and web interface that performs human pose recognition on a live video feed to detect when common exercises are performed and classify them accordingly. We present a model interface capable of webcam input with live display of classification results. Our main contributions include a keypoint and time series based lightweight approach for classifying a selected set of fitness exercises and a web-based software application for obtaining and visualizing the results in real time.
NovGrid: A Flexible Grid World for Evaluating Agent Response to Novelty
Venue: arXiv cs.AI 2022
Year: 2022

A robust body of reinforcement learning techniques have been developed to solve complex sequential decision making problems. However, these methods assume that train and evaluation tasks come from similarly or identically distributed environments. This assumption does not hold in real life where small novel changes to the environment can make a previously learned policy fail or introduce simpler solutions that might never be found. To that end we explore the concept of {\em novelty}, defined in this work as the sudden change to the mechanics or properties of environment. We provide an ontology of for novelties most relevant to sequential decision making, which distinguishes between novelties that affect objects versus actions, unary properties versus non-unary relations, and the distribution of solutions to a task. We introduce NovGrid, a novelty generation framework built on MiniGrid, acting as a toolkit for rapidly developing and evaluating novelty-adaptation-enabled reinforcement learning techniques. Along with the core NovGrid we provide exemplar novelties aligned with our ontology and instantiate them as novelty templates that can be applied to many MiniGrid-compliant environments. Finally, we present a set of metrics built into our framework for the evaluation of novelty-adaptation-enabled machine-learning techniques, and show characteristics of a baseline RL model using these metrics.
Visual Prompt Tuning
Venue: arXiv cs.CV 2022
Year: 2022

The current modus operandi in adapting pre-trained models involves updating all the backbone parameters, ie, full fine-tuning. This paper introduces Visual Prompt Tuning (VPT) as an efficient and effective alternative to full fine-tuning for large-scale Transformer models in vision. Taking inspiration from recent advances in efficiently tuning large language models, VPT introduces only a small amount (less than 1% of model parameters) of trainable parameters in the input space while keeping the model backbone frozen. Via extensive experiments on a wide variety of downstream recognition tasks, we show that VPT achieves significant performance gains compared to other parameter efficient tuning protocols. Most importantly, VPT even outperforms full fine-tuning in many cases across model capacities and training data scales, while reducing per-task storage cost.