OpenRaiser/Intern-Atlas huggingface dataset:
Evaluating Privacy-Preserving Machine Learning in Critical Infrastructures: A Case Study on Time-Series Classification
Venue: arXiv cs.LG 2021
Year: 2021

With the advent of machine learning in applications of critical infrastructure such as healthcare and energy, privacy is a growing concern in the minds of stakeholders. It is pivotal to ensure that neither the model nor the data can be used to extract sensitive information used by attackers against individuals or to harm whole societies through the exploitation of critical infrastructure. The applicability of machine learning in these domains is mostly limited due to a lack of trust regarding the transparency and the privacy constraints. Various safety-critical use cases (mostly relying on time-series data) are currently underrepresented in privacy-related considerations. By evaluating several privacy-preserving methods regarding their applicability on time-series data, we validated the inefficacy of encryption for deep learning, the strong dataset dependence of differential privacy, and the broad applicability of federated methods.
Equitable modelling of brain imaging by counterfactual augmentation with morphologically constrained 3D deep generative models
Venue: arXiv cs.CV 2021
Year: 2021

We describe Countersynth, a conditional generative model of diffeomorphic deformations that induce label-driven, biologically plausible changes in volumetric brain images. The model is intended to synthesise counterfactual training data augmentations for downstream discriminative modelling tasks where fidelity is limited by data imbalance, distributional instability, confounding, or underspecification, and exhibits inequitable performance across distinct subpopulations. Focusing on demographic attributes, we evaluate the quality of synthesized counterfactuals with voxel-based morphometry, classification and regression of the conditioning attributes, and the Fréchet inception distance. Examining downstream discriminative performance in the context of engineered demographic imbalance and confounding, we use UK Biobank magnetic resonance imaging data to benchmark CounterSynth augmentation against current solutions to these problems. We achieve state-of-the-art improvements, both in overall fidelity and equity. The source code for CounterSynth is available online.
Design and Control of a Recovery System for Legged Robots
Venue: arXiv cs.RO 2021
Year: 2021

This paper describes the design and control of a support and recovery system for use with planar legged robots. The system operates in three modes. First, it can be operated in a fully transparent mode where no forces are applied to the robot. In this mode, the system follows the robot closely to be able to quickly catch the robot if needed. Second, it can provide a vertical supportive force to assist a robot during operation. Third, it can catch the robot and pull it away from the ground after a failure to avoid falls and the associated damages. In this mode, the system automatically resets the robot after a trial allowing for multiple consecutive trials to be run without manual intervention. The supportive forces are applied to the robot through an actuated cable and pulley system that uses series elastic actuation with a unidirectional spring to enable truly transparent operation. The nonlinear nature of this system necessitates careful design of controllers to ensure predictable, safe behaviors. In this paper we introduce the mechatronic design of the recovery system, develop suitable controllers, and evaluate the system's performance on the bipedal robot RAMone.
Adversarial Training for a Hybrid Approach to Aspect-Based Sentiment Analysis
Venue: arXiv cs.CL 2021
Year: 2021

The increasing popularity of the Web has subsequently increased the abundance of reviews on products and services. Mining these reviews for expressed sentiment is beneficial for both companies and consumers, as quality can be improved based on this information. In this paper, we consider the state-of-the-art HAABSA++ algorithm for aspect-based sentiment analysis tasked with identifying the sentiment expressed towards a given aspect in review sentences. Specifically, we train the neural network part of this algorithm using an adversarial network, a novel machine learning training method where a generator network tries to fool the classifier network by generating highly realistic new samples, as such increasing robustness. This method, as of yet never in its classical form applied to aspect-based sentiment analysis, is found to be able to considerably improve the out-of-sample accuracy of HAABSA++: for the SemEval 2015 dataset, accuracy was increased from 81.7% to 82.5%, and for the SemEval 2016 task, accuracy increased from 84.4% to 87.3%.
Hyperspectral Image Segmentation based on Graph Processing over Multilayer Networks
Venue: arXiv cs.CV 2021
Year: 2021

Hyperspectral imaging is an important sensing technology with broad applications and impact in areas including environmental science, weather, and geo/space exploration. One important task of hyperspectral image (HSI) processing is the extraction of spectral-spatial features. Leveraging on the recent-developed graph signal processing over multilayer networks (M-GSP), this work proposes several approaches to HSI segmentation based on M-GSP feature extraction. To capture joint spectral-spatial information, we first customize a tensor-based multilayer network (MLN) model for HSI, and define a MLN singular space for feature extraction. We then develop an unsupervised HSI segmentation method by utilizing MLN spectral clustering. Regrouping HSI pixels via MLN-based clustering, we further propose a semi-supervised HSI classification based on multi-resolution fusions of superpixels. Our experimental results demonstrate the strength of M-GSP in HSI processing and spectral-spatial information extraction.
Sequential Transmission Over Binary Asymmetric Channels With Feedback
Venue: arXiv cs.IT 2021
Year: 2021

In this paper, we consider the problem of variable-length coding over the class of memoryless binary asymmetric channels (BACs) with noiseless feedback, including the binary symmetric channel (BSC) as a special case. In 2012, Naghshvar et al. introduced an encoding scheme, which we refer to as the small-enough-difference (SED) encoder, which asymptotically achieves both capacity and Burnashev's optimal error exponent for symmetric binary-input channels. Building on the work of Naghshvar et al., this paper extends the SED encoding scheme to the class of BACs and develops a non-asymptotic upper bound on the average blocklength that is shown to achieve both capacity and the optimal error exponent. For the specific case of the BSC, we develop an additional non-asymptotic bound using a two-phase analysis that leverages both a submartingale synthesis and a Markov chain time of first passage analysis. For the BSC with capacity $1/2$, both new achievability bounds exceed the achievability bound of Polyanskiy et al. for a system limited to stop-feedback codes.
Hole-robust Wireframe Detection
Venue: arXiv cs.CV 2021
Year: 2021

"Wireframe" is a line segment based representation designed to well capture large-scale visual properties of regular, structural shaped man-made scenes surrounding us. Unlike the wireframes, conventional edges or line segments focus on all visible edges and lines without particularly distinguishing which of them are more salient to man-made structural information. Existing wireframe detection models rely on supervising the annotated data but do not explicitly pay attention to understand how to compose the structural shapes of the scene. In addition, we often face that many foreground objects occluding the background scene interfere with proper inference of the full scene structure behind them. To resolve these problems, we first time in the field, propose new conditional data generation and training that help the model understand how to ignore occlusion indicated by holes, such as foreground object regions masked out on the image. In addition, we first time combine GAN in the model to let the model better predict underlying scene structure even beyond large holes. We also introduce pseudo labeling to further enlarge the model capacity to overcome small-scale labeled data. We show qualitatively and quantitatively that our approach significantly outperforms previous works unable to handle holes, as well as improves ordinary detection without holes given.
Maximizing Social Welfare in Selfish Multi-Modal Routing using Strategic Information Design for Quantal Response Travelers
Venue: arXiv cs.GT 2021
Year: 2021

Traditional selfish routing literature quantifies inefficiency in transportation systems with single-attribute costs using price-of-anarchy (PoA), and provides various technical approaches (e.g. marginal cost pricing) to improve PoA of the overall network. Unfortunately, practical transportation systems have dynamic, multi-attribute costs and the state-of-the-art technical approaches proposed in the literature are infeasible for practical deployment. In this paper, we offer a paradigm shift to selfish routing via characterizing idiosyncratic, multi-attribute costs at boundedly-rational travelers, as well as improving network efficiency using strategic information design. Specifically, we model the interaction between the system and travelers as a Stackelberg game, where travelers adopt multi-attribute logit responses. We model the strategic information design as an optimization problem, and develop a novel approximate algorithm to steer Logit Response travelers towards social welfare using strategic Information design (in short, LoRI). We demonstrate the performance of LoRI on a Wheatstone network with multi-modal route choices at the travelers. In our simulation experiments, we find that LoRI outperforms SSSP in terms of system utility, especially when there is a motive mismatch between the two systems and improves social welfare. For instance, we find that LoRI persuades a traveler towards a socially optimal route for 66.66% of the time on average, when compared to SSSP, when the system has 0.3 weight on carbon emissions. However, we also present a tradeoff between system performance and runtime in our simulation results.
Metal Blossom: Laser Forming Complex and Freeform Metal Structures Imitating Flower Blooming
Venue: arXiv cs.RO 2021
Year: 2021

For centuries, human civilizations devised metal forming techniques to make tools and items; yet, customized metal forming remains costly and intricate. Laser-forming origami} (lasergami) is a metal forming process where a laser beam cuts and folds a planar metal sheet to form a three-dimensional (3D) shape. Designing foldable structures formable by lasers, however, has long been a trial-and-error practice that requires significant mental effort and hinders the possibility of creating practical structures. This work demonstrates for the first time that lasergami can form a freeform set of metallic structures previously believed to have been impossible to be laser-formed. This technological breakthrough is enabled by new computational origami methods that imitate flower blooming and optimize laser folding instructions. Combined with new ideas that address laser line of sight and minimize fabrication energy, we report a low-cost manufacturing framework that can be readily adopted by hobbyists and professionals alike.
The Geometric Occam's Razor Implicit in Deep Learning
Venue: arXiv cs.LG 2021
Year: 2021

In over-parameterized deep neural networks there can be many possible parameter configurations that fit the training data exactly. However, the properties of these interpolating solutions are poorly understood. We argue that over-parameterized neural networks trained with stochastic gradient descent are subject to a Geometric Occam's Razor; that is, these networks are implicitly regularized by the geometric model complexity. For one-dimensional regression, the geometric model complexity is simply given by the arc length of the function. For higher-dimensional settings, the geometric model complexity depends on the Dirichlet energy of the function. We explore the relationship between this Geometric Occam's Razor, the Dirichlet energy and other known forms of implicit regularization. Finally, for ResNets trained on CIFAR-10, we observe that Dirichlet energy measurements are consistent with the action of this implicit Geometric Occam's Razor.
A novel data-driven algorithm to predict anomalous prescription based on patient's feature set
Venue: arXiv cs.LG 2021
Year: 2021

Appropriate dosing of radiation is crucial to patient safety in radiotherapy. Current quality assurance depends heavily on a peer-review process, where the physicians' peer review on each patient's treatment plan, including dose and fractionation. However, such a process is manual and laborious. Physicians may not identify errors due to time constraints and caseload. We designed a novel prescription anomaly detection algorithm that utilizes historical data to predict anomalous cases. Such a tool can serve as an electronic peer who will assist the peer-review process providing extra safety to the patients. In our primary model, we created two dissimilarity metrics, R and F. R defining how far a new patient's prescription is from historical prescriptions. F represents how far away a patient's feature set is from the group with an identical or similar prescription. We flag prescription if either metric is greater than specific optimized cut-off values. We used thoracic cancer patients (n=2356) as an example and extracted seven features. Here, we report our testing f1 score, between 75%-94% for different treatment technique groups. We also independently validate our results by conducting a mock peer review with three thoracic specialists. Our model has a lower type 2 error rate compared to manual peer-review physicians. Our model has many advantages over traditional machine learning algorithms, particularly in that it does not suffer from class imbalance. It can also explain why it flags each case and separate prescription and non-prescription-related features without learning from the data.
Interval-valued q-Rung Orthopair Fuzzy Choquet Integral Operators and Its Application in Group Decision Making
Venue: arXiv cs.AI 2021
Year: 2021

It is more flexible for decision makers to evaluate by interval-valued q-rung orthopair fuzzy set (IVq-ROFS),which offers fuzzy decision-making more applicational space. Meanwhile, Choquet integralses non-additive set function (fuzzy measure) to describe the interaction between attributes directly.In particular, there are a large number of practical issues that have relevance between attributes.Therefore,this paper proposes the correlation operator and group decision-making method based on the interval-valued q-rung orthopair fuzzy set Choquet integral.First,interval-valued q-rung orthopair fuzzy Choquet integral average operator (IVq-ROFCA) and interval-valued q-rung orthopair fuzzy Choquet integral geometric operator (IVq-ROFCG) are inves-tigated,and their basic properties are proved.Furthermore, several operators based on IVq-ROFCA and IVq-ROFCG are developed. Then, a group decision-making method based on IVq-ROFCA is developed,which can solve the decision making problems with interaction between attributes.Finally,through the implementation of the warning management system for hypertension,it is shown that the operator and group decision-making method proposed in this paper can handle complex decision-making cases in reality, and the decision result is consistent with the doctor's diagnosis result.Moreover,the comparison with the results of other operators shows that the proposed operators and group decision-making method are correct and effective,and the decision result will not be affected by the change of q value.
Reconfigurable Intelligent Surface Optimization for Uplink Sparse Code Multiple Access
Venue: arXiv cs.IT 2021
Year: 2021

The reconfigurable intelligent surface (RIS)-assisted sparse code multiple access (RIS-SCMA) is an attractive scheme for future wireless networks. In this letter, for the first time, the RIS phase shifts of the uplink RIS-SCMA system are optimized based on the alternate optimization (AO) technique to improve the received signal-to-noise ratio (SNR) for a discrete set of RIS phase shifts. The system model of the uplink RIS-SCMA is formulated to utilize the AO algorithm. For further reduction in the computational complexity, a low-complexity AO (LC-AO) algorithm is proposed. The complexity analysis of the two proposed algorithms is performed. Monte Carlo simulations and complexity analysis show that the proposed algorithms significantly improve the received SNR compared to the non-optimized RIS-SCMA scenario. The LC-AO provides the same received SNR as the AO algorithm, with a significant reduction in complexity. Moreover, the deployment of RISs for the uplink RIS-SCMA is investigated.
SteelCore: An Extensible Concurrent Separation Logic for Effectful Dependently Typed Programs
Venue: arXiv cs.PL 2021
Year: 2021

Much recent research has been devoted to modeling effects within type theory. Building on this work, we observe that effectful type theories can provide a foundation on which to build semantics for more complex programming constructs and program logics, extending the reasoning principles that apply within the host effectful type theory itself. Concretely, our main contribution is a semantics for concurrent separation logic (CSL) within the F* proof assistant in a manner that enables dependently typed, effectful F* programs to make use of concurrency and to be specified and verified using a full-featured, extensible CSL. In contrast to prior approaches, we directly derive the partial-correctness Hoare rules for CSL from the denotation of computations in the effectful semantics of non-deterministically interleaved atomic actions. Demonstrating the flexibility of our semantics, we build generic, verified libraries that support various concurrency constructs, ranging from dynamically allocated, storable spin locks, to protocol-indexed channels. We conclude that our effectful semantics provides a simple yet expressive basis on which to layer domain-specific languages and logics for verified, concurrent programming.
Generative Convolution Layer for Image Generation
Venue: arXiv cs.CV 2021
Year: 2021

This paper introduces a novel convolution method, called generative convolution (GConv), which is simple yet effective for improving the generative adversarial network (GAN) performance. Unlike the standard convolution, GConv first selects useful kernels compatible with the given latent vector, and then linearly combines the selected kernels to make latent-specific kernels. Using the latent-specific kernels, the proposed method produces the latent-specific features which encourage the generator to produce high-quality images. This approach is simple but surprisingly effective. First, the GAN performance is significantly improved with a little additional hardware cost. Second, GConv can be employed to the existing state-of-the-art generators without modifying the network architecture. To reveal the superiority of GConv, this paper provides extensive experiments using various standard datasets including CIFAR-10, CIFAR-100, LSUN-Church, CelebA, and tiny-ImageNet. Quantitative evaluations prove that GConv significantly boosts the performances of the unconditional and conditional GANs in terms of Inception score (IS) and Frechet inception distance (FID). For example, the proposed method improves both FID and IS scores on the tiny-ImageNet dataset from 35.13 to 29.76 and 20.23 to 22.64, respectively.
Towards Automated Semantic Grouping in Workflows for Multi-Disciplinary Analysis
Venue: arXiv cs.SE 2021
Year: 2021

When designing multidisciplinary tool workflows in visual development environments, researchers and engineers often combine simulation tools which serve a functional purpose and helper tools that merely ensure technical compatibility by, e.g., converting between file formats. If the development environment does not offer native support for such groups of tools, maintainability of the developed workflow quickly deteriorates with an increase in complexity. We present an approach towards automatically identifying such groups of closely related tools in multidisciplinary workflows implemented in RCE by transforming the workflow into a graph and applying graph clustering algorithms to it. Further, we implement this approach and evaluate multiple clustering algorithms. Our results strongly indicate that this approach can yield groups of closely related tools in RCE workflows, but also that solutions to this problem will have to be tailor-made to each specific style of workflow design.
Challenges in Developing LRs for Non-Scheduled Languages: A Case of Magahi
Venue: arXiv cs.CL 2021
Year: 2021

Magahi is an Indo-Aryan Language, spoken mainly in the Eastern parts of India. Despite having a significant number of speakers, there has been virtually no language resource (LR) or language technology (LT) developed for the language, mainly because of its status as a non-scheduled language. The present paper describes an attempt to develop an annotated corpus of Magahi. The data is mainly taken from a couple of blogs in Magahi, some collection of stories in Magahi and the recordings of conversation in Magahi and it is annotated at the POS level using BIS tagset.
Adversarial Factor Models for the Generation of Improved Autism Diagnostic Biomarkers
Venue: arXiv cs.LG 2021
Year: 2021

Discovering reliable measures that inform on autism spectrum disorder (ASD) diagnosis is critical for providing appropriate and timely treatment for this neurodevelopmental disorder. In this work we present applications of adversarial linear factor models in the creation of improved biomarkers for ASD diagnosis. First, we demonstrate that an adversarial linear factor model can be used to remove confounding information from our biomarkers, ensuring that they contain only pertinent information on ASD. Second, we show this same model can be used to learn a disentangled representation of multimodal biomarkers that results in an increase in predictive performance. These results demonstrate that adversarial methods can address both biomarker confounds and improve biomarker predictive performance.
Overcoming limited battery data challenges: A coupled neural network approach
Venue: arXiv cs.LG 2021
Year: 2021

The Electric Vehicle (EV) Industry has seen extraordinary growth in the last few years. This is primarily due to an ever increasing awareness of the detrimental environmental effects of fossil fuel powered vehicles and availability of inexpensive Lithium-ion batteries (LIBs). In order to safely deploy these LIBs in Electric Vehicles, certain battery states need to be constantly monitored to ensure safe and healthy operation. The use of Machine Learning to estimate battery states such as State-of-Charge and State-of-Health have become an extremely active area of research. However, limited availability of open-source diverse datasets has stifled the growth of this field, and is a problem largely ignored in literature. In this work, we propose a novel method of time-series battery data augmentation using deep neural networks. We introduce and analyze the method of using two neural networks working together to alternatively produce synthetic charging and discharging battery profiles. One model produces battery charging profiles, and another produces battery discharging profiles. The proposed approach is evaluated using few public battery datasets to illustrate its effectiveness, and our results show the efficacy of this approach to solve the challenges of limited battery data. We also test this approach on dynamic Electric Vehicle drive cycles as well.